PTU B.Tech ECE 5th Semester May 2019 70544 DATA STRUCTURES Question Papers

FirstRanker.com

Roll No.

Total No. of Questions : 09

--- Content provided by​ FirstRanker.com ---

B.Tech.(ECE)/(ETE) (2011 Onwards)

B.Tech.(Electronics Engg.) (2012 Onwards)

(Sem.-5)

DATA STRUCTURES

Subject Code : BTCS-304

--- Content provided by‍ FirstRanker.com ---

M.Code : 70544

Time : 3 Hrs.

Max. Marks : 60

INSTRUCTION TO CANDIDATES :

1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.

--- Content provided by‌ FirstRanker.com ---

2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

SECTION-A

Q1 Answer briefly :

1. Dangling pointers

--- Content provided by‍ FirstRanker.com ---

2. Queue
3. Complexity of Linear Search
4. Heaps
5. Out degree in graphs
6. Linked Lists

--- Content provided by‌ FirstRanker.com ---

7. Sparse matrix
8. Rehashing
9. Big ‘O’ notation
10. AVL Trees

SECTION-B

--- Content provided by⁠ FirstRanker.com ---

Q2. Write a note on Arrays.

Q3. Write an algorithm to insert an item in the beginning of a circular queue.

Q4. Differentiate between BFS and DFS in graphs.

Q5. Discuss various operations on queue.

Q6. Write an algorithm for binary search.

--- Content provided by‍ FirstRanker.com ---

SECTION-C

Q7. Create a BST of 15 nodes. Write all 3 traversals.

Q8. What do you mean by infix, prefix and postfix expressions? How to evaluate postfix?

Q9. Discuss with example procedure of radix sort.

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.

--- Content provided by⁠ FirstRanker.com ---