Scribd
Upload
4 views

DS10 marks - updated

This document is a question bank for the Data Structures course at SRI Venkateswara College of Engineering, detailing 10-mark questions across five units. Each unit covers various topics such as algorithm efficiency, sorting techniques, linked lists, stacks, queues, binary trees, and graph algorithms. The questions are designed to assess students' understanding and implementation skills in these areas.

Uploaded by

P Manjunath reddy
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
4 views

DS10 marks - updated

This document is a question bank for the Data Structures course at SRI Venkateswara College of Engineering, detailing 10-mark questions across five units. Each unit covers various topics such as algorithm efficiency, sorting techniques, linked lists, stacks, queues, binary trees, and graph algorithms. The questions are designed to assess students' understanding and implementation skills in these areas.

Uploaded by

P Manjunath reddy
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/ 4

SRI VENKATESWARA COLLEGE OF

ENGINEERING
(Autonomous)
Karakambadi Road, TIRUPATI – 517507

Question bank -10 Marks Questions

Name of the subject Data Structures

Subject Code CS23APC201

Year & Sem I Year & II Sem

Bloom’s
Unit – 1 COs
Level
1 Discuss about the efficiency and analysis of the algorithms L1 CO1
and explain about time complexity and space complexity
with example?
2 Demonstrate Insertion sort with implementation Program L2 CO2

3 Illustrate Quick Sort with implementation Program L2 CO2

4 Explain about sorting and its types and sort the given L2 CO2
elements using selection sort
77,33,44,11,88,22,66,55
(or)
Explain about sorting and its types and sort the given
elements using Insertion sort
77,33,44,11,88,22,66,55
(or)
Explain about sorting and its types and sort the given
elements using Merge sort
77,33,44,11,88,22,66,55
(or)
Explain about sorting and its types and sort the given
elements using Quick sort
77,33,44,11,88,22,66,55
5 Define Linear Search Algorithm and write a C program to L4 CO2
perform Linear search?

6 Define Binary Search Algorithm and write a C program to L3 CO3


perform Binary search?

Unit – 2
1 Explain about Singly linked list and its operations L1 CO2

2 Explain about doubly linked list and its operations L1 CO3

3 Explain about circular linked list and its operations L1 CO2


4 Write a C function for implementing insertion and L2 CO2
search on Double linked list

5 Write a C program to implement single linked list. L2 CO2

Unit-3
1 Demonstrate the Implementation of Queue L2 CO2

Demonstrate the Implementation of Stack L2 CO3


2
3 Define Stack and its operations with example for L3 CO3
each operation.
4 Define queue and explain its operations with example for L3 CO3
each operation.
Write algorithm for converting infix expression to postfix and L3 CO3
5
evaluation of postfix expression.
Explain insertion and deletion operations on queues using L3 CO3
6
linked list.
Explain operations on stack using linked list. L3 CO3
7
Explain applications of queues with examples. L2 CO3
8
Convert "a+b*(c^d-e)^(f+g*h)-i" infix expression to a
9
postfix expression using stack.

L3 CO3

Unit-4
1 What is Binary Tree Implement various operations on Binary L2 CO4
Tree with neat example.
2 Construct a Binary Search Tree (BST) for the following L3 CO4
sequence of numbers-
50, 70, 60, 20, 90, 10, 40, 100
3 How balance factor is ensured using rotations in AVL Trees L2 CO4
Explain all possible cases with examples.
4 Construct a Min-Heap tree from the following elements L4 CO4
15,17,6,19,11,10,13,20,8,4,12
(or)
Construct a Max-Heap tree from the following elements
15,17,6,19,11,10,13,20,8,4,12
5 Construct AVL Tree with data items: “a,b,c,d,e,f,g,h,i,j,k”.

6 What is Deque? Explain operations on deque with example L3 CO4


for each operation.
Unit-5
1 Describe Graph Traversals and Perform DFS for the L3 CO5
following graph

(or)

Describe Graph Traversals and Perform BFS for the L3 CO5


following graph

2 Explain about Prim’s algorithm with a neat example? L1 CO5

3 Explain about the Dijkstra’s Shortest path algorithm and L1&L3 CO5
find the shortest path form the following graph

4. What is the data structure that is used to implement DFS and L3 CO5
demonstrate the algorithm.
5. Explain about the Adjacency Matrix and design a Adjacency L5 CO5
Matrix from the following graph

6 Illustrate with examples how memory issues can be resolved L2 CO5


by collision handling schemes?
7 Implement Collision Handling Schemes in detail L2 CO5

8 Explain about the kruskal’s algorithm with a neat example? L1 CO5

You might also like