Scribd
Upload
15 views

Data Structure

This document outlines the Continuous Internal Assessment II for the Department of Computer Science at P.K.R. Arts College for Women, covering the subject of Data Structures. It includes various sections with multiple-choice questions, descriptive questions, and algorithm explanations related to graph theory, sorting algorithms, and traversal methods. The assessment is designed for II B.Sc CS, II BCA, II B.Sc IT, and I B.Sc AI & ML students, with a total of 50 marks and a time limit of 2 hours.

Uploaded by

divyabharathipkr90
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views

Data Structure

This document outlines the Continuous Internal Assessment II for the Department of Computer Science at P.K.R. Arts College for Women, covering the subject of Data Structures. It includes various sections with multiple-choice questions, descriptive questions, and algorithm explanations related to graph theory, sorting algorithms, and traversal methods. The assessment is designed for II B.Sc CS, II BCA, II B.Sc IT, and I B.Sc AI & ML students, with a total of 50 marks and a time limit of 2 hours.

Uploaded by

divyabharathipkr90
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

P.K.R.

ARTS COLLEGE FOR WOMEN


Accredited with ‘A’ Grade by NAAC
Autonomous Institution-Affiliated to Bharathiar University
Gobichettipalayam

DEPARTMENT OF COMPUTER SCIENCE


CONTINUOUS INTERNAL ASSESSMENT – II
September - 2024

Class : II B.Sc CS/II BCA/II B.Sc IT/I B.Sc Al&Ml Marks : 50


Subject: Data Structures (21CSU09/21CAU09/21ITU09) Time: 2 Hrs

Section –A

I. Answer all the questions 5*1=5

1. Which data structure is used to represent a graph with adjacency list representation?
A) Array B) Linked List C) Stack D) Queue
2. In a connected graph, every pair of vertices is connected by:
A) Exactly one edge B) At most one edge C) At least one path D) A cycle
3. The transitive closure of a graph can be represented using:
A) An adjacency list. B) An incidence matrix.
C) An adjacency matrix. D) A path matrix.
4. Which of the following sorting algorithms is not a comparison-based sorting algorithm?
A) Quick Sort B) Heap Sort C) Merge Sort D) Counting Sort
5. What is the best-case time complexity of Insertion Sort?
A) O(n^2) B) O(n log n) C) O(n) D) O(log n)
6. Heap Sort is based on which data structure:
A) Stack B) Queue C) Binary Tree D) Heap

Section B
II. Answer all the questions 4*5=20
7. A) Define a graph and explain its basic terminology with examples (K3 CO3)(Or)
B) Given the graph with vertices V={A,B,C,D} and edges E={(A,B),(A,C),(B,D),(C,D)},
construct both the adjacency list and adjacency matrix (K3 CO3)
8. A) Perform Depth-First Search (DFS) and Breadth-First Search (BFS) traversals on the
following graph starting from vertex A:
E={(A,B),(A,C),(B,D),(C,E),(D,F),(E,F)}
List the possible order of vertices visited using both traversals (K3 CO3) (Or)
B) What are connected components in an undirected graph? Describe an algorithm to find all
connected components (K3 CO3)
9. A) Explain the insertion sort algorithm and its time complexity. Provide a step-by-step
example of sorting the array [5, 2, 9, 1, 5, 6, 7, 3, 10, 11, 4,8] using insertion sort (K3 CO3) (Or)
B) Sort the array [30, 10, 50, 20, 40, 30, 50, 60, 70, 20] using the quick sort algorithm. Show the
array after each partitioning step and explain the process (K3 CO3)
10. A) Explain how sorting on multiple keys works using an example (K4 CO4) (Or)
B) Explain the merge sort algorithm. Describe the key steps involved in the sorting process and
how the algorithm achieves sorting (K4 CO4)

Section C
II. Answer all the questions 3*8=24

11. A) Create Dijkstra’s algorithm for finding the shortest path for single source and all
destinations. What are its limitations and discuss with examples? (K4 CO4) (Or)
B) Explain Depth-First Search (DFS) and Breadth-First Search algorithms. Provide an example
and mention their applications (K4 CO4)
12. A) Describe the three ways of representing a graph. Illustrate with necessary examples
(K4 CO4) (Or)
B) Design a quick sort algorithm with your own illustration (K4 CO4)
13. A) Write kruskal algorithm to construct minimum cost spanning tree. Evaluate the various
stages with a graph (K5 CO5) (Or)
B) Outline the steps involved in heap sort algorithm. How do you repeatedly extract the
maximum element to sort the array? (K5 CO5)

You might also like