1
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA Integrated SEMESTER- II- EXAMINATION WINTER 2018
Subject Code: 4420602 Date: 03-01-19
Subject Name: Advanced C Programming
Time: 02.30 pm to 5.00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1

Do as directed:
1. The number of pointers used in the structure of a doubly link list and doubly circular link list are
2. FIFO is used in whereas LIFO is used in
3. Preprocessor directives start with
4. The end-of-file is checked by function.
5. Array name can be used as pointer. [True/False]
6. A union can be a member of a structure. If yes, how?
7. A pointer is a memory location that stores
07

Define the following:
1. Out degree In degree
2. Adjacent node
3. Siblings
4. Tournament tree
5. Sink
6. Multigraph
7. Wild pointer, null pointer, void pointer
07
Q.2

What do you mean by a pointer? How to declare a pointer and how it helps in accessing other variables? Also explain pointer arithmetic. Give suitable example.
07

Write a program to create, insert, delete and display items from a linear/singly link list. Take suitable structure of your choice.
07
OR

Implement the stack or queue operations using a menu driven utility program. The program should quit only when the user selects the exit option.
07
Q.3

Discuss command line argument. How it differs from other programs? Write a command line argument program that imitates the file-copy operation.
07

Write a program to implement insertion display items from a circular link list.
07
OR
Q.3

What is dynamic memory allocation? Explain malloc(), calloc(), realloc() functions with suitable example.
07

Write a program to convert an infix expression to postfix expression.
07
Q.4

Discuss various representation of graph with suitable example.
07

Construct a Binary Tree of following in order and post order traversal.
In order D B E A F C G
Post Order: D E B F G C A
Write down the pre order traversal of constructed tree.
07
2
OR
Q.4

What is a file? What are the various file opening modes? Also explain binary files with suitable example.
07

Discuss macro with suitable example. How its helps in reducing the code?
07
Q.5

Discuss progma directives in detail with example.
07

Difference between BFS and DFS using following graph. Also give adjacency matrix of given graph.
07
OR
Q.5

Explain conditional pre-processor directives in detail.
07

Convert following expression into prefix using stack table. Also draw expression tree.
A B C D F G
07