B.Sc. (Computer Science) Computer Science Practical 2 Syllabus - Mumbai University
This is the FY BSc Computer Science syllabus under NEP 2020, in force from the academic year 2024-25. The University still sets the earlier Choice Based papers alongside it — her Summer 2026 third-year timetables name that scheme — so check which scheme your exam form names before you revise.
Loading syllabus...
Syllabus for Computer Science Practical 2
Module I
- Design & Analysis of Algorithms – Practical
- Array Operations:
- Implement programs for 1-d arrays, Implement programs for 2-d arrays.
- List-Based Stack Operations:
- Create a list-based stack and perform stack operations.
- Linear and Binary Search:
- Implement linear and binary search algorithms on a list.
- Sorting Algorithms:
- Implement sorting algorithms (e.g., bubble, selection, insertion).
- Nth Max/Min Element:
- Implement algorithms to find Nth Max/Min element in a list.
- String Pattern Matching:
- Implement algorithms to find a pattern in a given string.
- Recursion:
- Implement recursive algorithms (e.g., factorial, Fibonacci, Tower of Hanoi).
- Greedy Algorithm:
- Solve problems like file merging and coin change using the Greedy Algorithm.
- Divide and Conquer:
- Implement algorithms like merge sort and Strassen's Matrix Multiplication.
- Dynamic Programming:
- Implement algorithms for Fibonacci series and Longest Common Subsequence using dynamic programming.
Module II
- OOPs using C++ – Practical
- Introduction to Classes:
- Create a simple class with data members and member functions.
- Demonstrate the use of class instances to access data and invoke member functions.
- Branching and Looping with Classes:
- Implement programs utilizing branching and looping statements within class methods.
- Arrays and Classes: Develop a program that employs one and two-dimensional arrays within a class.
- Illustrate how classes can handle array-based data structures.
- Scope Resolution Operator:
- Use the scope resolution operator to declare variables at different scope levels.
- Display and compare the values of variables with different scopes.
- Constructors and Destructors:
- Implement programs showcasing various types of constructors and destructors.
- Explore default, parameterized, copy constructors, and destructor functionalities.
- Access Specifiers:
- Demonstrate the use of public, protected, and private scope specifiers within a class.
- Understand the impact of different access specifiers on class members.
- Inheritance:
- Implement classes to demonstrate single and multilevel inheritance scenarios.
- Showcase how derived classes inherit properties from the base class.
- Develop programs illustrating multiple and hierarchical inheritance.
- Create programs that demonstrate the interaction between inheritance and derived class constructors.
- Understand the order of constructor invocation in the inheritance hierarchy.
- Advanced Concepts:
- Implement programs showcasing friend functions, inline functions, and the use of the this pointer within classes.
- Function Overloading and Overriding:
- Develop programs to demonstrate function overloading and overriding within classes.
- Pointers and File Handling:
- Explore the use of pointers within classes, emphasizing dynamic memory allocation.
- Develop programs for both text and binary file handling within a class context.
Text Books
- 1 Data Structure and Algorithm Using Python, Rance D. Necaise, Wiley India Edition, 2016.
- 2 Object Oriented Programming with C++, Balagurusamy E., 8th Edition, McGraw Hill Education India.
- 1 Data Structures and Algorithms Made Easy, Narasimha Karumanchi, CareerMonk Publications, 2016.
- 2 Let Us C++ by KanetkarYashwant, Publisher: BPB Publications, 2020
Reproduced from the University of Mumbai syllabus for B.Sc. (Computer Science) under NEP 2020, in force from the academic year 2024-25. Wording is as printed in that syllabus. Module numbering is as printed there too.