Scribd
Upload
9 views3 pages

191CSC303T - DS

This document is a question paper for the B.E. degree end semester examination in Data Structures for Computer Science and Engineering, covering various topics such as linear and non-linear data structures, graph structures, and sorting algorithms. It includes multiple choice questions, short answer questions, and detailed problems requiring the application of data structure concepts. The paper is divided into three parts, with a total of 100 marks allocated for assessment.

Uploaded by

yogidhayogidha
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
9 views3 pages

191CSC303T - DS

This document is a question paper for the B.E. degree end semester examination in Data Structures for Computer Science and Engineering, covering various topics such as linear and non-linear data structures, graph structures, and sorting algorithms. It includes multiple choice questions, short answer questions, and detailed problems requiring the application of data structure concepts. The paper is divided into three parts, with a total of 100 marks allocated for assessment.

Uploaded by

yogidhayogidha
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/ 3

Reg. No.

Question Paper Code : 2298

B.E DEGREE END SEMESTER EXAMINATION, NOV/DEC 2021


Third Semester
Computer Science and Engineering
191CSC303T – Data Structures
(Regulation 2019)
Time: 180 Minutes Maximum: 100 Marks
Course Outcomes:
CO1 : Implement abstract data types for linear data structures.
CO2 : Apply the different linear data structures to problem solutions.
CO3 : Apply the different non-linear data structures to problem solutions
CO4 : Apply graph structures to solve real world problems.
CO5 : Critically analyze the various sorting algorithms.
K1 – Remember K2 – Understand K3 – Apply K4 – Analyse K5 – Evaluate K6 - Create

Answer all Questions.


PART A– (10 x 1 = 10 Marks)
1. Which among the following is a linear data structure? CO1 K1
a. Stack b. Queue c. Linked List d. All the above
2. The next field in a node contains __________ CO1 K1
a. Address of the next node b. data of next node
c. data of previous node d. data of current node
3. The data structure required to check whether an expression contains CO2 K1
balanced parenthesis is ___________

4. The result of evaluating the postfix expression 5 4 6 + * 4 9 3 / + * is CO2 K3


_____________
5. Height of the tree is equal to? CO3 K1
a. Height of root node b. Height of a leaf node
c. depth of the node d. Height of the node
6. In BST the left subtree contains values CO3 K3
a. Equal to the value in root b. greater than the value in root
c. less than the value in root d. not equal to the value in root
7. The directed graph which has no cycle is known as _______ CO4 K1
8. The weights in the graph points to ________ CO4 K2
a. Cost b. Distance c. Time d. All the above
9. Which of the following is the required condition for binary search? CO5 K3
a. The list must be sorted b. Elements should be only numbers
c. Elements can be any order d. None of the above
10. Open hashing is also known as ____________ CO5 K1

PART B – (10 x 2 = 20 Marks)


11. Define ADT. CO1 K1

12. State the difference between array and linked list. CO1 K2

13. List the applications of queue. CO2 K1

14. Find the postfix expression: a+b*(c-d)/(e-f) CO2 K1

15. Differentiate a binary tree from binary search tree. CO3 K4

16. What is tree traversal? List it types. CO3 K1

17. Find the adjacency matrix and adjacency list of the given graph? CO4 K3

18. What is strongly connected and weakly connected graph? Give example CO4 K1

19. Sort the given numbers using insertion sort: CO5 K3

5,3,2,9,8,7,6,1,4
20. Write the routine for simple hash function. CO5 K1

PART C – (5 x 14 = 70 Marks)

Compulsory Question
21. Develop routine to perform insertion, deletion of first and last node CO1 K5
from singly linked list.

Answer Any Four Questions


22. Write the procedure to convert the infix to postfix expression and steps CO2 K3
involved in evaluating the Postfix expression. Convert the expression
A-(B/C) + (D%E*F)/G*H to postfix form.
23. What is circular queue? Write the procedure to insert an element to CO2 K2
circular queue and delete an element from circular queue using array
implementation.

24. Illustrate with the all rotations and construct the AVL trees with the CO3 K3
following values 15, 20, 24, 10, 13, 7, 30, 36, 25.

25. Write the routine for Dijkstra’s algorithm and find the shortest path for CO4 K4
the given graph with start vertex A.

26. Construct minimum spanning tree for the given graph using Prim’s and CO4 K4
Kruskal’s algorithm. Start vertex 6.

27. Construct the quick sort with algorithm for the following set of CO5 K5
numbers 62, 22, 36, 6, 79, 26, 75, 13, 31, 76 and analyze the time
complexity of quick sort.

You might also like