MCA-201 Data Structure Using C
Note:Examiner will be required to set NINE questions in all. Question Number 1 will consist of total 8 parts (objective type/short-answer type questions) covering the entire syllabus and will carry 24 marks. In addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set two questions from each Unit of the syllabus and each question will carry 14 marks. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting One question from each Unit.
Total Marks : 100 Theory Paper : 80 Internal Assessment: 20
Time : 3 Hours
Unit-I
Introduction to Data Structures: Primitive and Composite, Arrays, Matrices, Sparse Matrices, Linear Search, Binary Search, Insertion Sort, Selection Sort, Bubble Sort, String, Representation and Manipulation, Complexity of Algorithms, Records and Pointers.
Unit-II
Linked Lists: Searching, Insertion, Deletion, Sorted Linked List, Circular List, Header List, Two – Way List; Stacks, Queues , Recursion, Quick Sort, Linked and Array representation of Stackks, Queues, and Deques, Polish Notation, Priority Queues,
Unit-III
Trees: Binary Trees, Threaded Binary Trees, Balanced Tree, Different tree traversal algorithms, Binary Search Tree , Huffman Tree, Heap Sort, AVL Search Trees, B Trees, m-way Search Trees.
Unit-IV
Representation of Graphs and Applications: Adjacency Matrix, Path Matrix, Warshall’s Algorithm, Linked Representation of a Graph, Traversing a Graph ; Sorting and Searching: Radix Sort, Merge Sort, Hashing.
Text Books:
References :