Syllabus Science Computer Science Sem-3
Syllabus Science Computer Science Sem-3
Unit – 1
1. Introduction
1.1. Introduction to Object Oriented Programming.
1.2. C++ fundamentals.
Unit – 2
5. Operator overloading
5.1. Creating a member Operator Function
5.2. Operator overloading using friend functions.
5.3. Overloading new and delete
5.4. Overloading some special Operators.
6. Inheritance
6.1. Base class Access control
6.2. Inheritance and protected members
6.3. Inheriting multiple base classes.
6.4. Constructor destructors and inheritance
6.5. Virtual base class
7. Virtual functions and polymorphism
8. I/O system
8.1. Streams and stream classes.
8.2. formatted I/O
8.3. File I/O
8.3.1. Opening and closing files.
8.3.2. Reading and writing text files.
8.3.3. Unformatted and binary I/O
-: DATA Structure:-
Unit – 3
9. Primitive Data Structures and Operations on them
10. Introduction to structure and pointer
11. Non- Primitive Data Structures
11.1. Arrays
11.1.1. Single and multiple array
11.1.2. Storage Representation.
11.1.3. Operations
Unit – 4
11.3. Stack
11.3.1. Operation on Stack
11.3.2. Application in Recursion, Polish notation etc.
11.4. Queues
11.4.1. Types of Queue
11.4.2. Operation on Queue & Applications.
Unit : 1
1. Overview of Microsoft.NET Framework
1.1 What is.NET Framework and it’s benefits
1.2 The Common Language Runtime (CLR), purpose of CLR
1.3 Managed/Unmanaged code, Compilation & Execution
1.4 Memory Management, Garbage Collection
1.5 The. NET Framework class Library
1.6 NET Web Services.
1.7 Introduction to Ms Visual Studio. NET
Unit : 2
3. Console Applications
3.1 Console Class
3.2 Handling Strings, Characters and Dates
6. Files IO Streams
6.1 Directory and Directory Info class
6.2 Path and File Info class
6.3 Path and Environment class
6.4 Sequential – Access File
6.5 Random – Access File
6.6 The File System Watcher Component
Unit : 4
7. Data Access
7.1 History of Microsoft Data Access Technologies.
7.2 Overview of ADO. NET
7.3 The Server Explorer and Query Builder
7.4 ADO.NET Object Model
7.5 Programming with ADO.NET
Reference Books:-
List of Practicals:
C++ Practical List
1. Create a class called Temperature. User can give temperature in either Celsius or Fahrenheit.
Output must be in both the form.
3. Define a class to represent a bank account having members A/c No, Name, A/c Type and
balance.
a. Design member function to open new account, deposit amount, Withdraw
amount and display the account detail.
(Minimum balance required is Rs. 500/-)
10. Define a class called Circle (radius, area). Derive it to cylinder (height, volume), further
derive the Cylinder into Colored Cylinder (color). Take an object of colored Cylinder and
display Area, Volume and Color of it.
11. Define two classes Person (name, address, email) and Stream (description). Derive Science
(subject) from Stream class. Derive Student (roll no, subject) from Person and science.
Stream
Person Science
Student
Write a program to enter data for 10 students and display the detail in tabular format.
12. Define class called list. Derive the classes stack and Queue from it. Define pure Virtual
functions insert () and delete () in the class list, and override them to all its successors and
implement dynamic polymorphism.
Student
MCA Student Non MCA Student Local Student Non Local Student
Write a program to enter 10 Local MCA Students, using constructor, and print the list of student.
14. Write a program which shows the use of various formatting ios functions and their equivalent
manipulators. Create at least two manipulators of your choice.
15. Write a program to copy one file to another file, using command line arguments.
16. Write a program to read a text and replace “this “with “that” and write the output to another
file.
17. Write a program to create binary file to store Employee details. Insert 10 records to that file
and display the specific record as per the employee code.
Array
Stack
5. Implement Stack by using static & dynamic storage representation.(Push, pop, peep, display,
isempty, isfull,….)
6. Write a program to solve the Tower of Hanoi problem.(Using recursion & without
Recursion).
7. Write a program to print n Fibonacci series (using recursion).
8. Write a program to find factorial of n number (using recursion).
9. Write a program to find GCD & LCD of two numbers (using recursion).
10. Convert decimal number into binary. (Using recursion).
11. Find X^N, i.e. power (x,n) (using recursion).
12. Write a program to convert infix expression into postfix expression.(Vice versa)
13. Write a program for evaluation of postfix expression.
14. Implement Double Stack, i.e. maintain two stacks in the same shared array.
QUEUE
15. Write a program for Single Queue operation (Insertion, Deletion, traversing (using static&
dynamic storage representation).
16. Write a program for Circular Queue operations (Insertion, Deletion, traversing (using static&
dynamic storage representation).
17. Write a program for Double Ended Queue operations (Insertion, Deletion, traversing (using
static& dynamic storage representation).
18. Write a program for Priority Queue operations (Insertion, Deletion, traversing (using static&
dynamic storage representation).
Link List
19. Write a menu driven program that implements singly linked list for the following operation:
Create, Display, Insert, Delete, Search, Count, Copy, Concat, Reserve, Sort, Merge, Union,
Insertion, etc.
20. Write a menu driven program that implements doubly linked list for the following operation:
Create, Display, Insert, Delete, Search, Count, Copy, Concat, Reserve, Sort, Merge, Union,
Insertion, etc.
21. Write a menu driven program that implements circular linked list for the following operation:
Create Display, Insert, Delete, Search, Count, Copy, Concat, Reserve, Sort, Merge, Union,
Insertion, etc.
SEARCHING & SORTING
22. WAP for linear Search (With Recursion & without Recursion)
23. WAP for binary Search (With Recursion &without Recursion)
24. WAP for implementation of Bubble Sort.
25. WAP for implementation of Insertion Sort.
26. WAP for implementation of Quick Sort.
27. WAP for implementation of Selection Sort.