DATA STRUCTURE

 DATA STRUCTURE (R203105F)

CLICK FOR  ➤➤ MID-2 IMP QUESTIONS : DS imp question

CLICK HERE TO FOLLOW MY BLOG 

 click for unit wise material

UNIT-1

CLICK FOR  ➤➤ UNIT-1 : INTRODUCTION TO DS 

CLICK FOR  ➤➤ UNIT-1 : ARRAYS

CLICK FOR  ➤➤ UNIT-1 : OPERATIONS ON ARRAYS

 CLICK FOR  ➤➤ UNIT-1 : STACK

CLICK FOR  ➤➤ UNIT-1 : LINKED LIST

• CLICK FOR  ➤➤ UNIT-1 : SINGLY LINKED LIST
• CLICK FOR  ➤➤ UNIT-1 : CIRCULAR SINGLY LINKED LIST
• CLICK FOR  ➤➤ UNIT-1 : DOUBLE LINKED LIST
• CLICK FOR  ➤➤ UNIT-1 : CIRCULAR DOUBLE LINKED LIST

 CLICK FOR  ➤➤ UNIT-1 : QUEUE

CLICK FOR  ➤➤ UNIT-1 : DS imp question

                            UNIT-2

CLICK FOR  ➤➤ UNIT-2 : SEARCHING (LINEAR,BINARY)

CLICK FOR  ➤➤ UNIT-2 : SORTING ( Selection Sort, Insertion Sort )

CLICK FOR  ➤➤ UNIT-2 : SORTING ( Quick Sort, Merge Sort, Heap sort )

CLICK FOR  ➤➤ UNIT-2 : HASHING( Hash Function, Separate Chaining,                                                                                         Collision Resolution-Separate Chaining )

                            UNIT-3

CLICK FOR  ➤➤ UNIT-3 :Tree,BINARY TREE

CLICK FOR  ➤➤ UNIT-3 :EXPRESSION TREE

CLICK FOR  ➤➤ UNIT-3 :Binary Search Trees

                               UNIT-4

CLICK FOR  ➤➤ UNIT-4 : AVL TREE

CLICK FOR  ➤➤ UNIT-4 : B-Tree

                               UNIT-5

CLICK FOR  ➤➤ UNIT-5 :Introduction to Red-Black

CLICK FOR  ➤➤  ASSIGNMENT - 2 & 1 

PREVIOUS QUESTION PAPER

CLICK FOR  ➤➤ DATA-STRUCTURES-JULY-2023

CLICK FOR  ➤➤ DATA-STRUCTURES-JAN-2023

CLICK FOR  ➤➤ DATA-STRUCTURES-DEC-2023

Syllabus

UNIT-1: Introduction to Data Structures: Abstract Data Types (ADTs), The List ADT: Simple Array Implementation of Lists, Simple Linked Lists, Doubly Linked Lists, Circularly Linked Lists. The Stack ADT: The Stack Model, Implementation of Stacks, Applications of Stack. The Queue ADT: Queue Model, Array Implementation of Queues, Application of Queues. Stacks and Queue implementation using linked list.

UNIT-II: Searching: List Searches, Linear and Binary Search Methods. Sorting: Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap sort.

Hashing: Hash Function, Separate Chaining, Collision Resolution-Separate Chaining.

UNIT III: Trees: Binary Trees Implementation, Expression Trees. Binary Search Trees- find, findMin and findMax, insert, delete operation.

UNIT-IV: Trees: AVL Trees- Single and Double Rotation, Operations. B-Tree: searching, insertion, deletion.

UNIT-V:Trees: Introduction to Red-Black, splay trees and Comparison of Search Trees

 Priority Queues: Priority Queue Models, Simple Implementations.