MCA-06 MCA-7
June Examination 2016
MCA Ist Year Examination
Data Structure Through C Language
Paper MCA-06 MCA-7
Time 3 Hours Max. Marks 80
Note: The question paper is divided into three sections B and C with marking scheme.
Section A 8 × 2 16
(Very Short Answer Questions)
Note: Answer all questions. As per the nature of the question delimit your answer in one word, one sentence or maximum upto 30 words. Each question carries 2 marks.
Define Data Structure.
Define Graph.
What is the importance of LIFO?
What are the two types of complexity?
What is linked list?
What is "Self loop" in graph?
What is Binary Search Tree?
(viii) What is complexity of bubble sort in best case?
417
MCA-06 MCA-7 100 3 (P.T.O.)
MCA-06 MCA-7 100 3 (Contd.)
417
Section B 4 × 8 32
(Short Answer Questions)
Note: Answer any four questions. Each answer should not
exceed 200 words. Each question carries 8 marks.
What is doubly linked list? How it is more important than
singly link list?
Explain big Omega and theta notation in the
complexity with graph.
Write an algorithm to insert an element into a single linked list.
Define array as data structure and its operation. Write an
algorithm to read mxn matrix using row major mapping.
Convert infix expression x into postfix form showing stack
status after every step in tabular form:
x A C E H
What is queue? What are the different operations perform on
it? How the queue is implemented using linked list?
Suppose an array A contains 8 elements as follows:
77, 33, 44, 11, 88, 22, 66, 55
Sort this array using bubble sort.
Differentiate between:
BFS and DFS
Tree and Graph
MCA-06 MCA-7 100 3
417
Section C 2 × 16 32
(Long Answer Questions)
Note: Answer any two questions. You have to delimit your each
answer maximum upto 500 words. Each question carries
16 marks.
10) What is Binary search tree? Explain the process of searching
a key value in binary search tree with example.
11) Write algorithm for inorder, post order and pre order traversal
of a binary tree stored in an array. Test your result with given
array element values:
71, 27, 23, 29, 180, 143, 78, 28, 30
12) Explain any two algorithm with example:
Quick sort
Bubble sort
Insertion sort
13) Write short notes (any
Adjacency matrix
Graph Traversal
Stack representation using linked list