Andhra Pradesh Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus II YEAR IV SEMESTER Paper-IV : DATA STRUCTURES Course Objectives To introduce the fundamental concept of data structures and to emphasize the importance of data structures in developing and implementing efficient algorithms.. Course Outcomes Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are represented in memory and used by algorithms Describe common applications for arrays, records, linked structures, stacks, queues, and graphs. programs that use arrays, records, linked structures, stacks, queues, trees, and graphs Demonstrate different methods for traversing trees Compare alternative implementations of data structures with respect to performance Compare and contrast the benefits of dynamic and static data structures implementations Describe the concept of recursion, give examples of its use, describe how it can be implemented a stack . Discuss the computational efficiency of the principal algorithms for sorting, searching, and hashing. UNIT I Concept of Abstract Data Types (ADTs)- Data Types, Data Structures, Storage Structures, and File Structures, Primitive and Non-primitive Data Structures, Linear and Non-linear Data Structures. ADT, Array and Linked representations, Pointers. Linear Lists – Arrays ADT, Mappings, Representations, Sparse Matrices, Sets ADT, Operations – – Linked Lists: Single Linked List, Double Linked List, Circular Linked List , applications UNIT II Stacks: Definition, ADT, and Linked representations, Implementations and Applications Queues: Definition, ADT, Array and Linked representations, Circular Queues, Dequeues, Priority Queues, Implementations and Applications. UNIT III Trees: Binary Tree, Definition, Properties, ADT, Array and Linked representations, Implementations and Applications. Binary Search Trees (BST) Definition, ADT, – Operations and Implementations, BST Applications. Threaded Binary Trees, Heap trees. Page 10 of 50
Andhra Pradesh Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus II YEAR IV SEMESTER Paper-IV : DATA STRUCTURES Course Objectives To introduce the fundamental concept of data structures and to emphasize the importance of data structures in developing and implementing efficient algorithms.. Course Outcomes Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are represented in memory and used by algorithms Describe common applications for arrays, records, linked structures, stacks, queues, and graphs. programs that use arrays, records, linked structures, stacks, queues, trees, and graphs Demonstrate different methods for traversing trees Compare alternative implementations of data structures with respect to performance Compare and contrast the benefits of dynamic and static data structures implementations Describe the concept of recursion, give examples of its use, describe how it can be implemented a stack . Discuss the computational efficiency of the principal algorithms for sorting, searching, and hashing. UNIT I Concept of Abstract Data Types (ADTs)- Data Types, Data Structures, Storage Structures, and File Structures, Primitive and Non-primitive Data Structures, Linear and Non-linear Data Structures. Linear Lists – ADT, Array and Linked representations, Pointers. Arrays – ADT, Mappings, Representations, Sparse Matrices, Sets – ADT, Operations Linked Lists: Single Linked List, Double Linked List, Circular Linked List , applications UNIT II Stacks: Definition, ADT, and Linked representations, Implementations and Applications Queues: Definition, ADT, Array and Linked representations, Circular Queues, Dequeues, Priority Queues, Implementations and Applications. UNIT III Trees: Binary Tree, Definition, Properties, ADT, Array and Linked representations, Implementations and Applications. Binary Search Trees (BST) – Definition, ADT, Operations and Implementations, BST Applications. Threaded Binary Trees, Heap trees. Page 10 of 50
BSc-CS-IT-Syllabus-04112017.docx