University Of Pune Question Paper
B. C. A. ( Semester - III ) Examination - 2013
DATA STRUCTURE USING ‘C’
(New 2008 Pattern)
Time : 3 Hours] [Max. Marks : 80
Q.1) Attempt any eight of the following : [8x2=16]
(a) What is Stack ? State the operations of Stack.
(b) What is Space and Time Complexity ?
(c) What is Sorting ? State the techniques of Sorting.
(d) What are the advantages of Linked List over an Array ?
(e) What is Spanning Tree ?
(f) What is Self-referential Structure ?
(g) What is Algorithm ? State its characteristics.
(h) What Non-primitive Data Structure ?
(j) What is Polynomial ? How it is represented ?
(k) What is Adjacency Matrix ?
Q.2) Attempt any four of the following : [4x4=16]
(a) Write a function to create Doubly Linked List.
(b) Explain Linear Search Method with an example.
(c) Write a ‘C’ program to sort given elements by using Bubble
Sort Techniques.
(d) Explain DFS with an example.
(e) What is Queue ? Explain its types in details.
Q.3) Attempt any four of the following : [4x4=16]
(a) Write a function to add Node at the specified position in Singly
Linked List.
(b) Explain Heap Sort with an example.
(c) Explain Binary Search Method with an example.
(d) Explain in brief the functions of Dynamic Memory Allocation.
(e) Write a ‘C’ program for Dynamic Implementation of Queue.
Q.4) Attempt any four of the following : [4x4=16]
(a) Explain Overflow Handling with an example.
(b) Write a function to delete first node from Singly Linked List.
(c) Explain different types of Asymptotic Notations in details.
(d) Sort the following elements by using Quick Sort :
48, 29, 8, 59, 72, 88
(e) Write a ‘C’ program to check whether given string is palindrome
or not. (Use Stack)
Q.5) Attempt any four of the following : [4x4=16]
(a) Define the following terms :
(i) Balance Factor
(ii) Pendant Node
(iii) Degree of Node
(iv) Cyclic Graph
(b) Explain BFS with an example.
(c) Write a ‘C’ program for addition of two polynomials.
(d) Explain different types of Recursive Tree Traversing Techniques.
(e) Write an algorithm for evaluation of postfix expression
B. C. A. ( Semester - III ) Examination - 2013
DATA STRUCTURE USING ‘C’
(New 2008 Pattern)
Time : 3 Hours] [Max. Marks : 80
Q.1) Attempt any eight of the following : [8x2=16]
(a) What is Stack ? State the operations of Stack.
(b) What is Space and Time Complexity ?
(c) What is Sorting ? State the techniques of Sorting.
(d) What are the advantages of Linked List over an Array ?
(e) What is Spanning Tree ?
(f) What is Self-referential Structure ?
(g) What is Algorithm ? State its characteristics.
(h) What Non-primitive Data Structure ?
(j) What is Polynomial ? How it is represented ?
(k) What is Adjacency Matrix ?
Q.2) Attempt any four of the following : [4x4=16]
(a) Write a function to create Doubly Linked List.
(b) Explain Linear Search Method with an example.
(c) Write a ‘C’ program to sort given elements by using Bubble
Sort Techniques.
(d) Explain DFS with an example.
(e) What is Queue ? Explain its types in details.
Q.3) Attempt any four of the following : [4x4=16]
(a) Write a function to add Node at the specified position in Singly
Linked List.
(b) Explain Heap Sort with an example.
(c) Explain Binary Search Method with an example.
(d) Explain in brief the functions of Dynamic Memory Allocation.
(e) Write a ‘C’ program for Dynamic Implementation of Queue.
Q.4) Attempt any four of the following : [4x4=16]
(a) Explain Overflow Handling with an example.
(b) Write a function to delete first node from Singly Linked List.
(c) Explain different types of Asymptotic Notations in details.
(d) Sort the following elements by using Quick Sort :
48, 29, 8, 59, 72, 88
(e) Write a ‘C’ program to check whether given string is palindrome
or not. (Use Stack)
Q.5) Attempt any four of the following : [4x4=16]
(a) Define the following terms :
(i) Balance Factor
(ii) Pendant Node
(iii) Degree of Node
(iv) Cyclic Graph
(b) Explain BFS with an example.
(c) Write a ‘C’ program for addition of two polynomials.
(d) Explain different types of Recursive Tree Traversing Techniques.
(e) Write an algorithm for evaluation of postfix expression
0 comments:
Pen down your valuable important comments below