Scribd
Upload
2K views1 page

AD3251 Data Structures Design Question Bank 1

This document contains a course planner for a Data Structures Design course. It lists 6 units covering different data structures topics like trees, graphs, sorting/searching algorithms, linear data structures, abstract data types, and part A questions. Each unit has multiple concepts that are mapped to course outcomes and assigned a grade. The planner provides details of the topics, number of questions, and distribution of marks for each concept.

Uploaded by

bbook6930
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
2K views1 page

AD3251 Data Structures Design Question Bank 1

This document contains a course planner for a Data Structures Design course. It lists 6 units covering different data structures topics like trees, graphs, sorting/searching algorithms, linear data structures, abstract data types, and part A questions. Each unit has multiple concepts that are mapped to course outcomes and assigned a grade. The planner provides details of the topics, number of questions, and distribution of marks for each concept.

Uploaded by

bbook6930
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/ 1

EnggTree.

com

Course Code/Name : AD3251-Data structures Design


Regulation : 2021
UPC – Student Planner

Unit Name of the CO Grade


Slot Questions
.No Unit Mapping A B
1.Tree Traversal Algorithms with example (16) 1
2. AVL Trees(16) 2
Tree 3.Binary Search Tree(12) C113.4 3
1 IV
Structures 4.Heaps(12) 4
5.Binary Trees(6) 5

1. Shortest Path-DijkstrasAlgorithm.(12) 1
2. Minimum Spanning Tree -Prims algorithm(12) 2
3. Shortest path unweighted graph.(12) C113.5 3
Graph
2 V 4.Graph traversal (12) 4
Structures
5.Topological ordering (8) 5
6. Minimum Spanning Tree -Kruskal algorithm(8) 6
1.Collision Handling Techniques.(16) 1
2.Insertion Sort(8) 2
3.Selection Sort.(8) 3
Sorting and 4.Quick Sort(8) 4
3 III C113.3
Searching 5.Searching Techniques.(12) 5
6. Rehashing Technique (8) 6
7.Bubble Sort(8) 7
8.Merge Sort(8) 8
1.Applications of Stack .(8) 1
2. Doubly Ended Queue(12) 2
C113.2
Linear 3. Doubly Linked List (12) 3
4 II
Structures 4. Circular Linked List (12) 4
5. Singly Linked List(16) - 5
6.Queue (8) 6
1. Asymptotic Notation. (16) 1
2. Recursive implementations(8+8+8+8) 2
C113.1
3. Inheritance(12) 3
Abstract
5 I 4. Operator Overloading.(8) 4
Data Types
5. Class programs.(8) 5
6.Functions used to analyze the algorithm. (8) 6

6 Part-A Questions 2 Marks

Prepared By Verified By IQAC Approved By

Downloaded from EnggTree.com

You might also like