Go to All Subject -

Department: Computer Sotware and Inormation Technology Engineering CSE IT

Data Structures - CS8391

Online Study Material, Lecturing Notes, Assignment, Reference, Wiki and important questions and answers

Data Structures

CS8391 Data Structures - Anna University 2017 Regulation Syllabus - Download Pdf
CS8391 Data Structures - Question Bank 2 - Download Pdf
CS8391 Data Structures - Question Bank - Download Pdf
CS8391 Data Structures - Important Questions 2 - Download Pdf
CS8391 Data Structures - Important Questions - Download Pdf
CS8391 Data Structures - Notes 2 - Download Pdf
CS8391 Data Structures - Notes - Download Pdf
Download Anna University Notes Android App
Data Structures - Start Reading Online

-:- C Programming Fundamentals - A Review Topics Covered
-:- Conditional Statements
-:- Control statements
-:- Functions
-:- Arrays
-:- C Preprocessor
-:- Pointers
-:- Function pointers
-:- Function with Variable number of arguments
-:- Important Short Questions and Answers: Programming Fundamentals
-:- Structures
-:- Union
-:- File handling concepts - read, write and Manipulations
-:- Important Short Questions and Answers: C Programming Advanced Features
-:- Abstract Data Types (ADTs)
-:- List ADT array-based implementation
-:- Array Implementation of Lists List
-:- Singly Linked List
-:- Circularly linked lists
-:- Doubly linked lists
-:- Applications of lists
-:- Important Short Questions and Answers: Linear Data structures- List
-:- Stacks ADT - Linear Data Structures
-:- Expression Evaluation and Syntax Parsing
-:- Queue ADT - Linear Data Structures
-:- Important Short Questions and Answers: Linear Data Structures - Stacks, Queues
-:- Tree Introduction
-:- Binary Tree ADT: Implementation, Types, Application, Comparison
-:- Binary search tree ADT
-:- AVL Trees
-:- B-trees
-:- Red–black tree
-:- Splay trees
-:- Binomial Heaps
-:- Fibonacci Heaps
-:- Disjoint Sets data structure
-:- Amortized analysis
-:- Accounting Method
-:- Potential Method
-:- Aggregate Analysis
-:- Representation of Graphs
-:- Breadth First Traversal
-:- Depth First Traversal
-:- Topological Sort
-:- Minimum Spanning Trees
-:- Kruskal's algorithm
-:- Prim’s Algorithm
-:- Shortest Path Algorithms
-:- Dijkstra’s Algorithm
-:- Bellman-Ford Algorithm
-:- Floyd - Warshall Algorithm
-:- Sorting
-:- Bubble sort
-:- Quick sort
-:- Selection sort
-:- Insertion sort
-:- Shell sort
-:- Merge sort
-:- Radix sort
-:- Search Algorithm: Linear search or sequential search and Binary search
-:- Hashing
-:- Separate Chaining (Open Hashing) (or) External Hashing
-:- Open Addressing (Closed Hashing)
-:- Re Hashing Collision
-:- Extendible Hashing
-:- Important Short Questions and Answers: Sorting and Searching