Scribd
Upload
22 views3 pages

1616149724CSE_2yr_2018-22_Data Structure and Programming

Uploaded by

arpit.tripathi0610
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views3 pages

1616149724CSE_2yr_2018-22_Data Structure and Programming

Uploaded by

arpit.tripathi0610
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

END SEMESTER EXAMINATION

Odd Semester 2019-20

Subject Code & Name: CS3301 Data Structure & Programming


Program/Branch/Year: B.Tech CSE, CSE-AIML,CSE-CSCQ /SEM III DEC 2019
Time: 3 Hrs Max Marks: 100

General Instructions. Read all instructions carefully.


1. Do not write anything on the question paper except your Roll No.
2. Answers should be written in clear and legible handwriting. Neatly labeled diagrams will fetch better marks.
3. Students must clearly write the question number & sub-part of question that they are attempting.
4. This question paper consists of 5 questions and all questions are compulsory. All questions carry
20 marks each.
5. Students are expected to take about 30 minutes each for Questions 1 to 5 and Remaining 30 minutes
are for reading the question paper and revision

Parts i) and ii) of each question are compulsory and each part carries 2 marks. Parts iii), iv) and
v) carry 8 marks each and the student may attempt any 2 parts.
Q1.
i) Which data structure is used to perform recursion?
a) Stack b) Linked list c) Array d) Queue
(2 marks)
ii) A procedure that calls itself is called
a) Illegal call b) Reverse polish c) Recursive d) None of the above
(2 marks)
iii)Describe data structure? What are the various operations of Data Structures?
(8 marks)
iv)Write short note on:
a) Dynamic memory allocation b) Abstract data types c) Recursion in C d) Two - d array in C
(8 marks)
v)Differentiate between Union and Structure.
(8 marks)
Q2.

i) What data structure would you mostly likely see in a non-recursive implementation of a recursive
algorithm?
a) Stack b) Linked list c) Queue d) Trees
(2 marks)
ii) Stack data structure cannot be used for
a) Implementation of Recursive Function b) Allocation resources and scheduling
c) Reversing string d) Evaluation of string in Postfix form
(2 marks)
iii) Explain steps to convert infix notation into reverse polish notation (postfix) ?Explain with the
help of an example.
(8 marks)
Page 1 of 3
iv) Explain Stack ADT. Implement Stack using array.
(8 marks)
v) Differentiate queue and stack. Show implementation of Queue ADT using array.
(8 marks)
Q3.

i) To represent hierarchical relationship between elements, which data structure is suitable?


a) Graph b) Tree c) Dequeue d) Priority
(2 marks)
ii) Which of the following traversal outputs the data in sorted order in a BST?
a) Preorder b) Postorder c) Inorder d) Level order
(2 marks)
iii) Describe tree traversals with the help of example.
(8 marks)
iv)Consider the given traversal:
In-order sequence: D B E A F C
Preorder sequence: A B D E C F
Construct a tree using above traversal. Also mention each step with explanation.
(8 marks)
v)Explain expression tree. Evaluate the following expression tree.

(8 marks)
Q4.
i) Which of the following algorithm is not stable?
a) Bubble sort b) Quick sort c) Merge sort d) Insertion sort
(2 marks)
ii) -------- is the method used by card sorter.
a) Radix sort b) Insertion c) Heap d) Quick
(2 marks)
iii) Explain an algorithm for searching an element using binary search.
(8 marks)
iv) Define Binary heap? Discuss Property of binary heap with the help of example.
(8 marks)
v) Write linear search algorithm to search an element in a list of N numbers.
(8 marks)

Page 2 of 3
Q5.
i) Which data structure is used for depth first traversal of a graph?
a) queue b) stack c) list d) none of the above
(2 marks)
ii) All Graphs have unique representation on paper.
a) True b) False
(2 marks)
iii) Explain BFS graphs traversal algorithms with suitable example.
(8 marks)
iv)Discuss following with reference to graphs.
a) Directed graph b) Undirected graph
(8 marks)
v)Explain Kruskal algorithm with example.
(8 marks)

Page 3 of 3

You might also like