Scribd
Upload
309 views2 pages

Data Structure Final Question

This document contains instructions for a Data Structure exam consisting of 4 questions worth a total of 20 marks. Students must answer any 2 out of the 4 questions. Each question has 3 subparts. The first question covers data structures, algorithm complexity, and bubble sort. The second question covers two-way linked lists, postfix notation, and evaluating a postfix expression. The third question covers recursion, binary search trees, and binary search tree operations. The fourth question covers min and max heaps, spanning trees, and applying Kruskal's algorithm. Students must show working for questions involving algorithms and data structures.

Uploaded by

Atiqur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
309 views2 pages

Data Structure Final Question

This document contains instructions for a Data Structure exam consisting of 4 questions worth a total of 20 marks. Students must answer any 2 out of the 4 questions. Each question has 3 subparts. The first question covers data structures, algorithm complexity, and bubble sort. The second question covers two-way linked lists, postfix notation, and evaluating a postfix expression. The third question covers recursion, binary search trees, and binary search tree operations. The fourth question covers min and max heaps, spanning trees, and applying Kruskal's algorithm. Students must show working for questions involving algorithms and data structures.

Uploaded by

Atiqur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

Department of Computer Science & Engineering

Begum Rokeya University, Rangpur


B.Sc. (Engg.)2nd Year 1st Semester Final Examination – 2020 (Session: 2018–19)
Course Code: CSE 2103 Course Title: Data Structure
Time: 01:30 hrs Full Marks: 20

Answer any Two (02) from the following questions. It is strongly


recommended to answer of a particular question in a sequential
manner.
Draw the following figure in the middle of each page of your answer
script, otherwise your page may not be considered.

Data Structure Exam

1. (a) What is data structure? What are the difference between linear and non-liner 1+2
data structure?
(b) What do you mean by complexity of an algorithm? What are meant by best 3
case, worst case and average case complexity? What are the complexity of
binary search algorithm?
(c) Explain Bubble sort algorithm with suitable example. 4
2. (a) What is Two-way Linked List? Write down benefits of using a Two-way 1+1
Linked List.
(b) What is Postfix Notion? Consider you have an equation Q: = 5 – 12 / 4 + (6 1+2
+ 2) written in Infix Notation, what should be its equivalent Postfix Notion.
(c) Considering the earlier Postfix Notion of the equation, write an Algorithm 5
that can evaluate the equation.
3. (a) What is recursive procedure? How to implement Towers of Hanoi using 1+3
recursion.
(b) What is a Binary Search Tree (BST)? 2

(c) Consider the following Binary Search Tree 2+2

60

25 75

15 50 66

33

44
(i) Delete a node with value 44
(ii) After performing (i) insert a node with value 35.
4. (a) What is min and max heap? Draw the min heap that results from inserting: 1+3
2 8 6 1 10 15 3 12 11 in that order into an initially empty min heap. You are
required to show the final min heap along with intermediate heaps.

(b) Define spanning tree and minimum cost spanning tree. 2


(c) Using Kruskal’s algorithm build a minimum cost spanning tree for the 4
following graph:

You are required to show the final minimum cost spanning tree along with
intermediate stages.

You might also like