|
🛑NOTE: Sharing content in any form is not allowed, if found then it will lead permanent deletion of ur account.
|
|
|
PAPER SETS
|
|
|
|
DS MODEL PAPER SET 1
(3 pages)
|
|
|
|
DS MODEL PAPER SET 2
(2 pages)
|
|
|
SOLUTIONS
|
|
|
|
UNIT 2: STACK & QUEUES
|
|
|
|
Write a program in ' C ' to check for balanced parenthesis in an expression using stack
(1 pages)
|
|
|
|
Write a C program to convert infix expression to postifix expression
(2 pages)
|
|
|
|
Write a program to evaluate postfix expression using stack data structure.
(1 pages)
|
|
|
|
Write a c program to implement stack using array.
(2 pages)
|
|
|
|
Write a program in ' C ' to implement Queue using array.
(2 pages)
|
|
|
|
Write a program in ' C ' to implement Circular queue using arrays.
(2 pages)
|
|
|
|
Write a C program to implement priority queue using arrays.
(2 pages)
|
|
|
|
Write a C program to implement priority queue using linked list
(2 pages)
|
|
|
|
Write a C program to implement¯Double Ended Queue.
(3 pages)
|
|
|
|
UNIT 3: LINKED LIST
|
|
|
|
Write a program in ' C ' to implement QUEUE ADT using Linked-List.
(2 pages)
|
|
|
|
Write a program in ' C ' to implement Stack using Linked-List
(2 pages)
|
|
|
|
Write a program to implement Circular Linked List
(3 pages)
|
|
|
|
Write a program to implement Doubly Linked List.
(4 pages)
|
|
|
|
Write a C program for polynomial addition using a Linked-list.
(3 pages)
|
|
|
|
Write a program to implement Singly Linked List
(4 pages)
|
|
|
|
UNIT 4: TREE
|
|
|
|
Tree Theory Notes
(42 pages)
|
|
|
|
UNIT 5: GRAPHS
|
|
|
|
GRAPH THEORY DFS BFS PART 1
(7 pages)
|
|
|
|
Graph Part 2
(4 pages)
|
|
|
|
UNIT 6: SEARCHING TECHNIQUES
|
|
|
|
Hashing 5 OR 10 marks CS
(12 pages)
|
|
|
|
Linear & Binary Search 5 or 10 Marks
(11 pages)
|
|
|
DS PYQ's
|
|
|
|
CHAPTER 1: INTRODUCTION TO DATA STRUCTURES
(1 pages)
|
|
|
|
CHAPTER 2: STACK & QUEUES
(2 pages)
|
|
|
|
CHAPTER 3: LINKED LIST
(2 pages)
|
|
|
|
CHAPTER 4: TREES
(2 pages)
|
|
|
|
CHAPTER 5: GRAPHS
(1 pages)
|
|
|
|
CHAPTER 6: SEARCHING TECHNIQUES
(1 pages)
|
|