MANGALORE UNIVERSITY Choice Based Credit System Semester Scheme with Multiple Entry and Exit Options in the UG Programmes under NEP 2020 Bachelor of Computer Applications (BCA) Degree Programme 2021-2022 Onwards II SEMESTER BCA BLOWN UP SYLLABUS & PRACTICAL LISTS ‘Course Code: CACO4 Course Title: Data Structures using C ‘Course Credits: 03 Hours/Week: 03 ‘Total Contact Hours: 42 Formative Assessment Marks: 40 Exam Marks: 60 Exam Duration: 02 Hours Topics Chapter] Page No/Section No UNIT 1 [12 HOURS] Introduction to data _ structures: [Chapter -1 ] 11 to 14 Inoduction, Basic terminology; Elementary Data Organization, Data Structures, Data Structure Operations Introduction to Algorithms, Chapter 2. | 2.1,23,24 Preliminaries: Inuoduction, Algorithmic notations, Control structure. Chapter 6 | 6.8,6.9(complexity excluded) Recursion: Definition; Recursion Technique Examples —Factorial, Fibonacci sequence, Towels of Hanoi, 41,4.2,44,45,464.104.17 Arrays: Basic Concepts — Definition, | Chapter4 | 4.7, Declaration, Initialization, Operations on amays, Types of arrays, Representation of Linear Airays in memory, Traversing linear arrays, Inserting and deleting elements, mensional arrays- Two Dimensional Arrays Representation of two- dimensional 67,9.1,93,94,9.6 arrays, Sparse matrices. (complexity excluded) Sorting: Selection sort, Bubble sort, Quick | Chapter 9 sort, Insertion sort, Merge sort UNIT 2 [10 HOURS] ‘Searching : Definition, Sequential Search, | Chapter 4] 4.8(complexity excluded in Binary search both 4.8 & 4.9 )4.9.4.13Dynamic memory management: Memory allocation and de-allocation functions ~ malloc, calloc, realloc and free. Linked list: Basic Concepts — Definition and Representation of linked list, Types of linked lists - Singly linked list, Doubly liked list, Header linked list, Circular linked list, Representation of Linked in Memory; Operations on Singly linked is- Traversing, Searching, Insertion, DeletionMemory allocation, Garbage collection ‘Chapter 5 5.1,to 5.11, UNIT 3 [10 HOURS] Stacks: Basic Concepis Definition and Representation of stacks--— Array representation of stacks, Linked representation of stacks, Operations ‘on stacks, Applications of stacks, Infix, postfix and prefix notations, Conversion from infix to postfix using stack, Evaluation of postfix expression using stack, Appl of stack in function calls. Queues: Basic Concepts - Definition and Representation of | queues- Array representation of Queues, Linked representation of Queues, Types of queues - Simple queues, Circular queues, Double ended | queues, Priority queues, Operations on queues Chapter 6 6.1,6.2,6.3,6.4,6.5,6.6,6.7,6.10 6.11,6.12,6.13,6.14,6.15,6.16 (6.79,6.80,6.87 only), UNIT IV [10 HOURS] ‘Trees: Definition, Tree terminologies ~node, root node, parent node, ancestors of a node, ings, terminal & non-terminal nodes, degree of a node, level, edge, path, depth Binary tree: Type of binary trees - strict binary tree, complete binary tree, binary search tree,; Array representation of binary tree, Traversal of binary tree- preorder, inorder and postorder traversal ‘Chapter 7 Chapter 8 T1I2,13,14,75,18,19 8.1,8.2,83,85,87 Graphs: Terminologies, Matrix representation of graphs; Traversal: Breadth First Search and Depth first search, ‘Text Book: 1. Seymour Lipschutz, Data Structures with C, Schaum’s Outlines Series, Tata McGraw Hill, 2011