- Experienced faculty
- Simplified explanations
- Theoretical Concept / Practicals
- Practice Questions and Regular tests
- Doubt clearing, Discussion & Mock Viva
- Practical and Project Files
- For BCA, B.Tech, BSc. (IT), O-Level, MCA students.
For BCA, B.Tech, BSc. (IT), O-Level, MCA students.
UNIT I
Linear Data Structures : Introduction to Algorithm, Attributes, Design Techniques, Time Space Complexity, Data Structures, Classification and Operation of Data Structures.
Arrays: one dimension, two-dimensions and introduction to multi dimensions, memory representation, address calculation, sparse matrices : types, representation.
Searching and Sorting : Linear and Binary Search, Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Elementary comparison of Searching and Sorting Algorithm.
Hashing : Hash Table, Hash Functions, and Collision Resolution.
UNIT II
Linear Data Structure, Dynamic Memory vs Static Memory allocation.
Linked List Types : Singly Linked List, Doubly Linked List, Header Linked List, Circular Linked List.
Operations on Linked List : Creation, Insertion, Deletion, Modification, Searching, Sorting, Reversing and Merging.
UNIT III
Stacks : Introduction, Static and Dynamic Implementation, Operations, Applications, Evaluation and Conversion between Polish and Reverse Polish Notations.
Queue : Introduction, Static and Dynamic Implementation, Operations, Applications, Types : Linear Queue, Circular Queue, Doubly Ended Queue, Priority Queue.
UNIT IV
Introduction to Graphs : Notations & Terminologies, Representation of Graphs, Adjacency Matrix, Linked Representation.
Trees : Notations and Terminologies, Memory Representation, Binary Tree Types – Complete, Full, Strict, Expression Binary Tree, Tree Traversal, Binary Search Tree and Basic Operations.
Introduction and Creation of AVL Tree, Heap Tree, M-Way Tree and B Tree
Along with 200+ Programs and a project.
