Scribd
Upload
29 views

Cs Syllabus MSC 2

The document outlines the syllabus for CPGET-2020 and covers several topics in C++ and data structures including exceptions, templates, recursion, linked lists, trees, graphs, hashing, searching and sorting algorithms. It also covers the basics of database management systems such as the relational model, SQL queries, data types, integrity constraints and creating databases and tables.

Uploaded by

Durgarao Vasa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

Cs Syllabus MSC 2

The document outlines the syllabus for CPGET-2020 and covers several topics in C++ and data structures including exceptions, templates, recursion, linked lists, trees, graphs, hashing, searching and sorting algorithms. It also covers the basics of database management systems such as the relational model, SQL queries, data types, integrity constraints and creating databases and tables.

Uploaded by

Durgarao Vasa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CPGET-2020 Syllabus

Exceptions: Introduction, Throwing an Exception, Handling an Exception, Object-Oriented Exception Handling with
Classes, Multiple Exceptions, Extracting Data from the Exception Class, Re-throwing an Exception, Handling the
bad_alloc Exception. Templates: Function Templates–Introduction, Function Templates with Multiple Type,
Overloading with Function Templates, Class Templates – Introduction, Defining Objects of the Class Template,
Class Templates and Inheritance, Introduction to the STL.

Text : 2. Tony Gaddis, Starting out with C++: from control structures through objects (7e)

Data Structures: (17 Marks)


Fundamental Concepts: Introduction to Data Structures, Types of Data Structures, Introduction to Algorithm,
Pseudo-code, Flow Chart, Analysis of Algorithms. Linear Data Structure Using Arrays: 1-D Arrays, 2-D Arrays, N-D
Arrays, Memory Representation and Address Calculation of 1-D, 2-D, N-D Arrays, Concept of Ordered List, String
Manipulation, Pros and Cons of Arrays. Stacks: Concept, Primitive Operations, Abstract Data Type, Representation
Stacks Using Arrays, Prefix, Infix, Postfix Notations for Arithmetic Expression, Applications of Stacks– Converting
Infix Expression to Postfix Expression, Evaluating the Postfix Expression, Checking Well-formed (Nested)
Parenthesis, Processing of Function Calls, Reversing a String.

Recursion: Introduction, Recurrence, Use of Stack in Recursion, Variants of Recursion, Execution of Recursive
Calls, Recursive Functions, Iteration versus Recursion. Queues: Concept, Primitive Operations, Abstract Data Type,
Representation Queues Using Arrays, Circular Queue, Double-Ended Queue, Applications of Queues. Linked Lists:
Introduction, Concept, Terminology, Primitive Operations-creating, inserting, deleting, traversing, Representation
of Linked Lists, Linked List Abstract Data Type, Linked List Variants – Singly Linked List, Doubly Linked List, Linear
and Circular Linked List, Representation Stacks and Queues Using Linked Singly Lists, Application of Linked List–
Garbage Collection.

Trees: Introduction, Representation of a General Tree, Binary Tree Introduction, Binary Tree Abstract Data Type,
Implementation of Binary Trees, Binary Tree Traversals – Preorder, Inorder, Postorder Traversals, Applications of
Binary Trees Briefly. Graphs: Introduction, Graph Abstract Data Type, Representation of Graphs, Graph Traversal –
Depth-First Search, Breadth-First Search, Spanning Tree – Prim’s Algorithm, Kruskal’s Algorithm. Hashing:
Introduction, Hash Functions, Collision Resolution Strategies.

Searching and Sorting: Sequential (Linear) Search, Binary Search, Bubble Sort, Insertion Sort, Selection Sort, Quick
Sort, Merge Sort, and Comparison of Sorting Techniques. Heaps: Concept, Implementation, Abstract Data Type,
Heap Sort.

Text : 3. Varsha H. Patil, Data Structures Using C++

Database Management Systems: (20 Marks)


Introduction to Databases: Introduction, Traditional File-Based Systems, Database Approach, Roles in the
Database Environment, Advantages and Disadvantages of DBMSs, The Three-Level ANSI-SPARC Architecture,
Database Languages, Data Models, Functions of a DBMS, Components of a DBMS. Relational Model: Introduction,
Terminology, Integrity Constraints, Views. The Relational Algebra: Unary Operations, Set Operations, Join
Operations, Division Operation, Aggregation and Grouping Operations.

SQL: Introduction, Data Manipulation–Simple Queries, Sorting Results, Using the SQL Aggregate Functions,
Grouping Results, Sub-queries, ANY and ALL, Multi-table Queries, EXISTS and NOT EXIST, Combining Result Tables,
Database Updates. SQL: The ISO SQL Data Types, Integrity Enhancement Feature–Domain Constraints, Entity
Integrity, Referential Integrity, General Constraints, Data Definition–Creating a Database, Creating a Table,

You might also like