2023 2024 MBA - Madras University Syllabus for Bsc Computer Science

Here I am providing syllabus of 3rd Semester of B.SC Computer Science Course of Madras University for your reference:

Madras University B.SC Computer Science 3rd Semester Syllabus
PART I LANG. PAPER III
PART II ENGLISH PAPER III
PART III Paper – V - Programming in
C++ and Data Structures
PART III Paper – VI Practical – III :
Data Structures using C++

PROGRAMMING IN C++ AND DATA STRUCTURES
Unit 1: Introduction to C++; Tokens, Keywords, Identifiers, Variables, Operators, Manipulators, Expressions and Control Structures in C++; Pointers - Functions in C++ Main Function Function Prototyping Parameters Passing in Functions - Values Return by Functions - Inline Functions - Friend and Virtual Functions

Unit-2: Classes and Objects; Constructors and Destructors; and Operator Overloading and Type Conversions - Type of Constructors - Function overloading. Inheritance : Single Inheritance Multilevel Inheritance Multiple Inheritance Hierarchical Inheritance Hybrid Inheritance. Pointers, Virtual Functions and Polymorphism; Managing Console I/O operations.

Unit 3: Working with Files: Classes for File Stream Operations Opening and Closing a File End of File Deduction File Pointers Updating a File Error Handling during File Operations Command line Arguments. Data Structures: Definition of a Data structure primitive and composite Data Types, Asymptotic notations, Arrays, Operations on Arrays, Order lists.

Unit-4: Stacks - Applications of Stack Infix to Postfix Conversion, Recursion, Maze Problems - Queues Operations on Queues, Queue Applications, Circular Queue. Singly Linked List Operations, Application Representation of a Polynomial, Polynomial Addition; Doubly Linked List Operations, Applications.

Unit-5 : Trees and Graphs: Binary Trees Conversion of Forest to Binary Tree, Operations Tree Traversals; Graph Definition, Types of Graphs, Hashing Tables and Hashing Functions, Traversal Shortest Path; Dijkstra's Algorithm.

PRACTICAL – III DATA STRUCTURES USING C++
1. Implement PUSH, POP operations of stack using Arrays.
2. Implement PUSH, POP operations of stack using Pointers.
3. Implement add, delete operations of a queue using Arrays.
4. Implement add, delete operations of a queue using Pointers.
5. Conversion of infix to postfix using stack operations
6. Postfix Expression Evaluation.
7. Addition of two polynomials using Arrays and Pointers.
8. Creation, insertion, and deletion in doubly linked list.
9. Binary tree traversals (in-order, pre-order, and post-order) using linked list.
10.Depth First Search and Breadth first Search for Graphs using Recursion.

https://mba.ind.in/img/c/Madras-Univ...-Science-1.jpg
https://mba.ind.in/img/c/Madras-Univ...-Science-2.jpg

Madras University B.SC Computer Science 3rd Semester Syllabus
.unom.ac.in/uploads/admissions/cbcs/2008-2009/bsccbcsrs36.doc