Scribd
Upload
79 views

Data Structure Question Paper 2017

This document is a 4 page exam paper on data structures using C from AKTU Online. It contains 3 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each on topics like time/space complexity, arrays, stacks, queues, trees, sorting, and binary search. Section B contains 5 long answer questions worth 10 marks each, including questions on recursion, expressions, queues, trees, sorting, and graphs. Section C contains 2 long answer questions worth 15 marks each on topics like circular linked lists, AVL trees, and minimum spanning trees.

Uploaded by

CW fan page
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
79 views

Data Structure Question Paper 2017

This document is a 4 page exam paper on data structures using C from AKTU Online. It contains 3 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each on topics like time/space complexity, arrays, stacks, queues, trees, sorting, and binary search. Section B contains 5 long answer questions worth 10 marks each, including questions on recursion, expressions, queues, trees, sorting, and graphs. Section C contains 2 long answer questions worth 15 marks each on topics like circular linked lists, AVL trees, and minimum spanning trees.

Uploaded by

CW fan page
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

www.aktuonline.

com

Printed Pages: 4 h[cs - 301


(Following Paper ID and Roll No. to be filted in your
Answer Books)

Roll No.

B.TECH
Regular Theory Exarnination (Odd Sem - III), 2016-17
T}AIh STRUCTURES USIhIG' C'
www.aktuonline.com

Time: 3 Hoars Musc, Marks : 100

Section - A

1. Attempt all parts. All parts carry equal marks. Write


answer of each part in short. (10x2:20)
a) Define time complexity and space complexity of
analgorithm.
b) What arsthe merits and demerits of array data
structures?
c) How do you push elements in a linked stack?
d) Differential linear and non linear datastructures.
e) What is the significance of priority queue?

0 Define complete binarytree. Give example.


g) When does a graph become tree?
h) Prove that the number of odd degree vertices in a
graph should be the even.
connectedwww.aktuonline.com
www.aktuonline.com

NCS ! 301
i) What is sorting? How is sorting essential for
database app Iic ati on s ?

j) Give the worst case and best case time complexity


of bin ary search.

Section - B
hlote : Attempt any 5 questions from this section.
(5* tr0:50)
www.aktuonline.com

2. What is recursion? Write arecursive program to find 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) I (E+ F)) [Infix to postfix]


b) (A + B) 1 *C - (D - E) ^ F [Infix to prefix]
c) 7 5 2 + I 4 1 5 - I * [Evaluate the given postfix
expression]

4. Write aC 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.

www.aktuonline.com
www.aktuonline.com

NCS I 301
7 . 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, J9,72

8. Illustr atethe importance ofvarious traversing techniques


in graph along with its application.

g. Comp arc and contrast the difference between B+ tree


index files and B tree index files with an exampte.
www.aktuonline.com

Section - C

Note : Attempt any 2 questions from this section.


(2x15=30)

10. What is meantby circular linked list? Write the functions


to perform the following operations in a doubly linked
' list.
a) Creation of list of nodes.
b) [nsertion after asPecified node.
c) Delete the node at a given position.
d) Sort the list according to descending order
e) Display from the beginning to end.
11. Define AVL Trees. Explain its rotation operations with
example. Construct anAVltree with the values 10 to 1

numbers into an initially emptytree.


www.aktuonline.com
1l rr--
www.aktuonline.com

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).
www.aktuonline.com

++++

www.aktuonline.com

You might also like