Professional Documents
Culture Documents
Data Structure
Data Structure
FIRST PAPER
BE-V/12(A)
238630
Computer Engineering
Data structures
New Syllabus
Note: Attempt any five questions selecting at least two questions from each
section. All questions carry equal marks.
Section - A
( A + ( B * C - ( D/E / F) * G ) + 3 * H - 2 )
Section - B
Pre Order: S E W Y F R L Q G P M T V K X
Post Order: Y R F L W E P M G Q X K V T S
25 35 18 9 46 70 48
Explain with algorithm and example. Find the complexity of each algorithm:
Quicksort
Insertion sort
What are graphs? Explain how graphs are represented in memory. Discuss
depth first and breadth first traversal methods in graphs.
Discuss the properties of Binary Search tree. Write an algorithm to count the
number of nodes in binary search trees.
Explain:
AVL trees
SECOND PAPER
BE-V/12(A)
229331
Computer Engineering
Data Structures
New Syllabus
Note: Attempt any five questions selecting at least two questions from each
section. All questions carry equal marks.
Section - A
( A + ( B * C - ( D/E * F) / G ) + 3 * H - 2 )
What are sparse matrices? How are sparse matrices represented in memory?
Discuss some applications of sparse matrices.
Section - B
What are threaded binary trees? Explaint with algorithm the traversal of
Threaded binary trees.
Explain:
AVL trees
Explain with alogrithm and explain. Find the complexity of each alogrithm
Selection sort
Insertion sort
Discuss the properties of Binary Search trees. Write an algorithm to count the
number of nodes in binary search trees.
THIRD PAPER
BE-V/6(B)
216331
Computer Engineering
Data structures
New Syllabus
Note: Attempt any five questions selecting at least two questions from each
section. All questions carry equal marks.
Section - A
(A + (B * C -(D / E % F) * G) + 3 * H - 2)
Section - B
Pre Order: S E W Y F R L Q G P M T V K X
Post Order: Y R F L W E P M G Q X K V T S
25 35 18 9 46 70 48 33 45
Explain with algorithm and example. Find the complexity of each algorithm:
Radix sort
Insertion sort
Explain:
AVL trees
Discuss the properties of Binary Search tree. Write an algorithm to count the
number of nodes in binary search trees.
Explain:
Linear search
Binary search
********************
FOURTH PAPER
BE-V/12(A)
228962
Computer Engineering
Data Structures
New Syllabus
Section - A
Explain the term algorithm with the factors Time and Space.
Insert a new node at its correct position in an ordered doubly linked list.
To reverse a linear linked list so that the first node becomes last and vice-
versa.
Evaluate the expression 123+*783/-. Show the contents of stack after every
step in a tabular form.
Explain the terms FRONT and REAR with relevance to a Queue. Which
operations are to be performed at these ends and how.
What are the limitations of a linear queue? Also explain the counter measures
for that.
Section - B
What are threaded binary trees? Write algorithms required for the
construction of right-in threaded binary tree.
AVL trees
Complete Binary trees
Show each pass to sort the elements 2, 32, 45, 67, 89, 43, 8, 10 in ascending
order using Bubble sort.
********************