Institute of Computer Science

Database Course Content
=======================
1.Introduction to Database and its usage
2.Database System architecture
3.Data modeling using ER diagram
4.Relational Database constraints
5.Relational Database design
6.SQL-I - Schema definition, Constraints, Queries
7.SQL-II - Views, Indexes, Users
8.Normalization
9.Transaction processing - ACID properties
10.Concurrency control
11.Database backup and recovery
12.Database Security

Java Course Content
=====================

1. Introduction to the Java language.
2. Arrays and Strings
3. Exception Handling
4. Multithreaded Programming
5. Input/Output Programming
6. Networking
7. Event Handling
8. Wrapper classes
9. Packages and interfaces

Theory of Computation (Automata) | Course Content
===========================================

1) Fimite Automata (DFA and NFA)
2) Moore’s and Mealy machine
3) Context free Language and Grammar
4) Chomsky and Greibach Normal Form
5) Pumping Lemma
6) Push Down Automata
7) Context sensitive language and grammars
8) Matrix Grammar
9) Ackerman’s functions
10) Turing machine
11) P, NP and NP complete type of problems
12) Regular Language and Grammar

Operating Systems - Course Content
========================

1. Introduction
2. Operating-System Structures
3. Processes
4. Threads
5. CPU Scheduling
6. Process Synchronization
7. Deadlocks
8. Main Memory
9. Virtual Memory

Data Structure Course Contents
======================

1. Arrays: Representation of single and multidimensional arrays; sparse arrays - lower and upper triangular matrices and Tri-diagonal matrices

2. Stacks and Queues: Introduction and primitive operations on stack; Stack application: Infix, postfix, prefix expressions; Evaluation of postfix expression; Conversion from infix to postfix.Introduction and primitive operation on queues, D-queues and priority queues.

3. Sorting Techniques: Insertion sort, selection sort, merge sort, heap sort. Searching Techniques: linear search, binary search and hashing

4. Lists: Introduction to linked lists; Sequential and linked lists, operations such as traversal,
insertion, deletion, searching, Two way lists and Use of headers

5. Trees: Introduction and terminology; Traversal of binary trees; Recursive algorithms for tree operations such as traversal, insertion, deletion

6. Multilevel indexing and B-Trees: Introduction: The invention of the B-tree; Statement of the problem; Indexing with binary search trees; Multilevel indexing, a better approach to tree indexes; B-trees: working up from the bottom; Example for creating a B-tree.

C++ Course Content
===============

1. Introduction to the C++ language.
2. Variables Declaration, assignment.
3. Introduction to Class.
4.Abstract Classes.
5. Access Mode Of Class.
6. Function.
7. Friend Function.
8. Virtual Function.
9. Abstract Function.
10. Constructor.
11. Destructor.
12. Polymorphism.
13. Function Overloading.
14. Operator Overloading.
15. Inheritance.
16. Templates.

Course Content for C Language
=====================
Introduction: C keywords, Data Types, C character set, First C Program

The Decision Control Structure: If, If-Else, Switch-Case, Nested if-elses, The Conditional Operators

The Loop Control Structure: Loops, While, For, Nested Loops, break, do-while loops

The Case Control Structure: Decisions Using switch, switch Versus if-else Ladder , The goto Keyword

Functions: What is a Function, Passing Values between Functions, Calling Convention, Advanced Features of Functions, Return Type of Function, Call by Value and Call by Reference

Pointers: An Introduction to Pointers, Pointer Notation, Recursion, Recursion and Stack , Adding Functions to the Library

Data Types Revisited: Integers (long, short, signed, unsigned), Chars(signed and unsigned), Floats and Doubles, Storage Classes in C (Automatic, Register, Static, External), Which to use When?

The C Preprocessor: Features of C Preprocessor, Macro Expansion, Macros with Arguments, Macros versus Functions, File Inclusion, Conditional Compilation, and Directives, Miscellaneous Directives, Preprocessing, Compilation, Assembling, Linking, Loading

Arrays: What are Arrays, Array Initialization, Passing Array Elements to a Function, Pointers and Arrays, Passing an Entire Array to a Function, Two Dimensional Arrays, Pointers and 2-Dimensional Arrays

Strings: What are Strings, Pointers and Strings, Standard Library String Functions, Two-Dimensional Array of Characters, Array of Pointers to Strings

Structures: Declaring a Structure, Accessing Structure Elements, How Structure Elements are Stored, Array of Structures, Uses of Structures

Console Input/Output: Types of I/O, Formatted Console I/O Functions, sprintf( ) and sscanf( ) Functions, Unformatted Console I/O Functions

File Input/Output: Data Organization, File Operations, Opening a File , Reading/Writing from/to a File , Closing the File , File Opening Modes

Operations On Bits : Bitwise Operators (Left/Right Shift operators, AND, OR, XOR, HEXADECIMAL numbering system, Binary and Hex)

Advanced Features: Enumerated Data Type, Typecasting , Bit Fields , Pointers to Functions, Functions Returning Pointers, Functions with Variable Number of Arguments , Unions , The volatile Qualifier

Advanced Topics: Network Communication, Packets and Sockets, IP Addresses, Port Numbers, Byte Ordering, Client Server Communication, Communication using Signals, Registering a Common Handler, Event Driven Programming

ICS Advertisement