Welcome to @NagpurCoders family
Data Structure - Subject Tutorials
Nagpur University – BCA SEMESTER 2, BSc IT SEMESTER 3, BSc CS SEMESTER 3, BSc DS SEMESTER 2, BSc CA SEMESTER 2
Our tutorials are based on the nagpur university syllabus to help students clearly understand every subject and score better in exams. Join our guided sessions to learn concepts in a simple and practical way that will also help you build a strong foundation for future studies and career opportunities.
Data Structure Syllabus - Nagpur University
UNIT I
- Linked List : Linked List, Representation of Single, Double, Header, Circular Single and Double Linked list, All possible operations on Single and Double linked List using Dynamic representation, Polynomial Representation and its Manipulation.
UNIT II
- Stacks : Stacks terminology, Representation of Stacks in Memory, Operation on Stacks, Polish Notations, Translation of infix to postfix & prefix expression, Infix to Postfix Conversion, Evaluation of Postfix Expression, Recursion, Problems on Recursion, Quick Sort and Tower of Hanoi Problem.
UNIT III
- Queue : Representation of Queues in Memory, Circular Queue, Dequeue and Priority Queue. Operations of above Structure using Array and Linked Representation.
- Sorting and Searching : Selection Sort, Insertion Sort, Merge Sort, Efficiency of Sorting Methods, Big-O Notations. Hash Tables, Hashing Technique, Collision Resolution Technique.
UNIT IV
- Trees : Basic Terminologies, Representation of Binary Trees in Memory, Traversing of Binary tree, Binary Search Tree, Operation on Binary Search Tree, Heap Tree, Operation on Heap Tree, Heap Sort Method.
- Graphs : Basic Terminologies, Definition and Representation of Graphs in Memory: Linked List and Matrix Representation. Traversing graphs : BSF, DFS Method.