Scribd
Upload
31 views

Spring 22

The document contains instructions for a final exam in a data structures and algorithms course. It includes 4 questions covering topics like binary trees, queues, heaps, graphs, and binary search trees. Students are asked to draw and traverse various data structures, implement algorithms like topological sorting, and determine which data structures are suitable for given scenarios. The exam tests understanding of fundamental data structures and algorithms.

Uploaded by

Partho Protim
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
31 views

Spring 22

The document contains instructions for a final exam in a data structures and algorithms course. It includes 4 questions covering topics like binary trees, queues, heaps, graphs, and binary search trees. Students are asked to draw and traverse various data structures, implement algorithms like topological sorting, and determine which data structures are suitable for given scenarios. The exam tests understanding of fundamental data structures and algorithms.

Uploaded by

Partho Protim
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/ 2

United International University (UIU)

Dept. of Computer Science and Engineering (CSE)


Final Exam Year: 2022 Trimester: Spring
Course: CSE 2215 Data Structure and Algorithms I
Total Marks: 40, Time: 2 hours

There are FOUR questions. Answer all of them. Figures in the right-hand margin
indicate full marks.

1. a) Draw a binary tree using the data given below, where x, y, z, p, r, t, u and v are nodes of the [1]
tree.
y p z x r t u v
Here, x=last two digits of your student id+7, y=x+3, z=x+y, p=y+z, r=x+2, t=p+r, u=800, v=900

b) Traverse the binary tree of Ques. 1(a) using the inorder, postorder and level order techniques. [4]
Level each of the nodes of the tree. Also find the height of the tree using level.

c) Draw a binary tree from the following Inorder and Postorder sequences [2]
Inorder: v p y r x t z u
Postorder: v p r y t u z x
Here, x=last two digits of your student id+7, y=x+3, z=x+y, p=y+z, r=x+2, t=p+r, u=800, v=900

d)Write an algorithm for the preorder technique. Show the simulation for the tree in Ques. 1(a). [3]

2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for the [3]
following operations, where both QUEUEs are implemented by an array of size, m=3. Here,
Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your student
id+7, y=x+3, z=x+y and p=y+z.
Enqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Enqueue(z)

b) Draw a complete binary tree and then build the max-heap tree from the following [5]
data, where x= last two digits of your student id+100, y=x+30, and z=x+y. Finally, sort the data
in ascending order using the heapsort algorithm.
10 x 20 z y 8

c) Two disjoint sets {y, p, z, x} and {r, t} are given, where minimum one of a set is the [2]
representative of that set. Determine UNION(Find(x), Find(t)). How can you check x and y are
in the same set using Find operation? Here, x=last two digits of your student id+7, y=x+3,
z=x+y, p=y+z, r=x+2, t=900.

3. a) Draw a directed acyclic graph using the vertices y, p, z, x, r and u, where x=last two digits of [1]
your student id+7, y=x+3, z=x+y, p=y+z, r=x+2, u=p+r

b) Construct an Adjacency Marix and an Adjacency List for the graph in Ques. 3(a). [3]

c) Write an algorithm for Topological Sorting. Show the simulation of your algorithm using the [4]
graph in Ques. 3(a).

d) Draw a sparse and a dense graph using the vertices y, p, z, x, and r, where x=last two digits of [2]
your student id+7, y=x+3, z=x+y, p=y+z, r=x+2

4. a) Draw an undirected graph using the vertices y, p, z, x and r, where x=last two digits of your [2]
student id+7, y=x+3, z=x+y, p=y+z, r=x+2. Also find the Breadth First Search (BFS) sequence
from the graph considering x is the starting vertex.

1
b) Construct a binary search tree (BST) using the nodes y, p, z, x, r and t, where x=last two [3]
digits of your student id+7, y=x+3, z=x+y, p=y+z, r=x+2, t=900. Show the insertion and
deletion of p+r and p, respectively in/from the BST.

c) What are the merits of implementing a QUEUE in a circular fashion? How do you check the [2]
underflow and overflow in the QUEUE implemented circularly?

d) Which Data Structures are appropriate to implement the following and why? [3]

i) Different areas of Dhaka City with distances


ii) Bus Ticket Counter
iii) Arithmetic Expression Evaluation

You might also like