CS3301 Data Structure (DS)

Prepared by

S.Santhosh (Admin)

Important questions

share it a link alone

Unit 1

1. Polynomial ADT ,linked list implementation

2. List ADT , app list

3. array based implementation

Unit 2

1. Stack ADT , Evaluarting arithematic operations

2. Queue ADT

3. apps of queue

Don't share as screenshot

UNit 3

1.Tree Traversals, Binary Tree ADT – Expression trees

3. Binary Search Tree ADT

2.priority queue b8narry heap

Unit 4

1.Types of graph and apps

2.Representation of Graphs
3.Breadth-first search ,Depth-first search

4. Dijkstra's algorithm ,prims alogrithm

Unit 5

1. Binary search

2. merge ,quick sort

3. hashing ,rehashing , extendible harsing

**Very important questions are bolded and may be asked based on this topic

PART-C

1.Compulsory Questions {a case study where the student will have to read and analyse the subject }

mostly asked from unit 3&5(OR) a situation given and you have to answer on your own

don't waste my hardwork and valuable time

As Engineer i think you know how to respect another

Share it as link alone . don't share it as screenshot or any text material if u found this anywhere kindly report me . #Admin WhatsApp