Download AKTU B-Tech 3rd Sem 2016-2017 NCS 301 Data Structures Using C Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 3rd Semester (Third Semester) 2016-2017 NCS 301 Data Structures Using C Question Paper

Printed Pages: 4 NCS - 301
(Following Paper ID and Roll No. to be ?lled in your
Paper ll): 2012267 Roll No.
Answer Books)
B.TECH
Regular Theory Examination (Odd Sem - 111), 2016-17
DATA STRUCTURES USING ?C?
T ime : 3 Hours Max. Marks : 100
Section - A
1. Attempt all parts. All parts carry equal marks. Write
answer of each part in short. (10X2=20)
a) De?ne time complexity and space complexity of
an algorithm.
b) What are the merits and demerits of array data
structures?
0) How do you push elements in a linked stack?
(1) ~ Differential linear and non linear data structures.
e) What is the signi?cance of priority queue?
f) De?ne complete binary tree. Give example.
g) When does a graph become tree?
h) Prove that the number of odd degree vertices in a
connected graph should be the even.
301/12/2016/15480 (1) [P.T.O.

NCS - 301
i) What is sorting? How is sorting essential for
database applications?
j) Give the worst case and best case time complexity
of binary search.
Section - B
Note : Attempt any 5 questions from this section.
? (5X 10:50)
2. What is recursion? Write a recursive program to ?nd sum
of digits of the given number. Also calculate the time
complexity. [Ex: 259 = 16 = 7(Answer)].
3. Solve the following : .
a) ((A ? (B + C) * D) / (E + F )) [In?x to post?x]
b) (A + B) +.*C - (D ? E) A F [In?x to pre?x]
c) 7 5 2 + * 4 l 5 ? / ? [Evaluate the given post?x
expression]
4. Write a C program to implement the array representation
, of circular queue.
' 5. Write a C program to implement binary tree insertion,
deletion with example.
6. Write the C program for various traversing techniques of
binary tree with neat example.
301/12/2016/15480 (2)
NCS - 301
What is quick sort? Sort the given values using quick sort;
present all steps/iterations :
38, 81, 22, 48, 13, 69, 93, 14, 45, 58, 79, 72
Illustrate the importance of various traversing techniques
in graph along with its application.
Compare and contrast the difference between B+ tree
index ?les and B tree index ?les with an example.
Section - C
Note : Attempt any 2 questions from this section.
10.
11.
(2x15=30)
What is meant by eircular linked list? Write the functions
to perform the following operations in a doubly linked
list.
a) Creation of list of nodes.
b) Insertion after a speci?ed node.
c) Delete the node at a given position.
d) Sort the list according to descending order
e) Display from the beginning to end.
De?ne AVL Trees. Explain its rotation operations with
example. Construct an AVL tree with the values 10 to 1
numbers into an initially empty tree.
301/12/2016/15480 (3) [P.T.O.

NCS - 301
12. Discuss Prim?s and Kruskal ?s algorithm. Construct
? minimum spanning tree for the below given graph using
Prim?s algorithm (Source node = a).
301/12/2016/15480 (4)