DATA STRUCTURE

FIRST PAPER

[Total No. of Questions - 8]

[Total No. of Printed Pages - 2]

B.E. vth Semester Examination

BE-V/12(A)

238630

Computer Engineering

Course No. COM-502

Data structures

New Syllabus

Time Allowed - 3 Hours Maximum Marks - 100

Note: Attempt any five questions selecting at least two questions from each
section. All questions carry equal marks.

Section - A

Explain circular linked lists with example.

Write an algorithm for traversal of circular linked list.

Write an algorithm/function to insert and delete(specific element, if exist

otherwise no change in list) an element in sorted circular singly linked list.

Write an algorithm to reverse the entered sequence of an array without using

another array.

What do you mean by complexity of algorithm? Briefly explain the notations

of complexity of algorithms.
What are sparse matrices? Discuss some applications of sparse matrices.

Explain Abstract data types.

Explain the algorithm for conversion of infix expression to postfix expression.

Convert the following infix expression into postfix expression:

( A + ( B * C - ( D/E / F) * G ) + 3 * H - 2 )

Explain using stack how the expression is evaluted.

Write an algorithm to implement queues using linked lists.

Explain dynamic storage allocation and Garbage collection.

Section - B

Construct a binary tree which traveres as:

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

Construct a heap tree with following 7 data items:

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

Minimum cost spanning trees.

 ********************

SECOND PAPER

[Total No. of Questions - 8]

[Total No. of Printed Pages - 2]

B.E. vth Semester Examination

BE-V/12(A)

229331

Computer Engineering

Course No. COM-502

Data Structures

New Syllabus

Time Allowed - 3 Hours Maximum Marks - 100

Note: Attempt any five questions selecting at least two questions from each
section. All questions carry equal marks.

Section - A

Write an algorithm to reverse the entered sequence of an array without using

another array.

Write an algorithm/function to insert and delete(specific element, if exist

otherwise no change in list) an element in doubly linked list.

Write an algorithm to implement queues using linked lists.

 Convert the following infix expression into posfix expression:

( A + ( B * C - ( D/E * F) / G ) + 3 * H - 2 )

Explain using stack how the expression is evaluted.

What are sparse matrices? How are sparse matrices represented in memory?
Discuss some applications of sparse matrices.

Explain the algorithm for conversion of infix expression to postfix expression.

Explain Priority queues with example.

Explain Circular queues with example.

Write an algorithm to reverse single linked list.

Section - B

What are threaded binary trees? Explaint with algorithm the traversal of
Threaded binary trees.

Explain:

AVL trees

Shortest Path Algorithm

Explain with alogrithm and explain. Find the complexity of each alogrithm

Selection sort

Insertion sort

Explain the linked representation of binary trees.

Write a short note on Optimum search trees.

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 trees. Write an algorithm to count the
number of nodes in binary search trees.

Write a non-recursive function for pre-order traversal of a binary tree.

 ********************

THIRD PAPER

[Total No. of Questions - 8]

[Total No. of Printed Pages - 2]

B.E. vth Semester Examination

BE-V/6(B)

216331

Computer Engineering

Course No. COM-502

Data structures

New Syllabus

Time Allowed - 3 Hours Maximum Marks - 100

Note: Attempt any five questions selecting at least two questions from each
section. All questions carry equal marks.

Section - A

Write an algorithm to implement queues using linked lists.

Write an algorithm/function to insert and delete(specific element, if exist

otherwise no change in list) an element in sorted circular singly linked list.
Write an algorithm to reverse the entered sequence of an array without using
another array.

What do you mean by complexity of algorithm? Briefly explain the notations

of complexity of algorithms.

Convert the following infix expression into postfix expression:

(A + (B * C -(D / E % F) * G) + 3 * H - 2)

Explain using stack how the expression is evaluated.

What are sparse matrices? Discuss some of the applications of sparse

matrices.

Explain Abstract data types.

Explain the algorithm for evaluating postfix expression.

Explain Circular linked list with example.

Write an algorithm for traversal of circular linked list.

Write an algorithm for insertion and deletion in circular queue.

Section - B

Construct a binary tree which traveres as:

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

Construct a heap tree with following 9 data items:

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

Shortest path algorithm

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:

Linear search

Binary search

********************

FOURTH PAPER

[Total No. of Questions - 8]

[Total No. of Printed Pages - 2]

B.E. vth Semester Examination

BE-V/12(A)

228962

Computer Engineering

Course No. COM-502

Data Structures

New Syllabus

Time Allowed - 3 Hours Maximum Marks - 100

Note: Attempt any five questions selecting at least two questions from each
section. All questions carry equal marks.

Section - A

Explain the term algorithm with the factors Time and Space.

Write an algorithm to compute the nth number of Fibonacci Series using

recursion. Mention the advantages and disadvantages of recursion.

Write algorithms for following:

Delete nth node from doubly linked list.

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.

To concatenate two circular linked lists.

Evaluate the expression 123+*783/-. Show the contents of stack after every
step in a tabular form.

Distinguish between static and dynamic implementation of a Stack.

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.

Define the following:

Binary Search trees

Strictly Binary trees

AVL trees
 Complete Binary trees

Heterogeneous Binary trees

Discuss the applications of Binary trees in detail.

Describe the working of a Shell sort.

Explain with an example various techniques for a graph traversal.

Write a short note on the working principle of Merge sort.

Show each pass to sort the elements 2, 32, 45, 67, 89, 43, 8, 10 in ascending
order using Bubble sort.

********************