Course Duration : 40 hours
Module-1
Algorithm, flowchart, Structured Programming Approach, structure of C program (header files, C preprocessor, standard library functions, etc.),identifiers, basic data types and sizes, Constants, variables, arithmetic, relational and logical operators, increment and decrement operators, conditional operator, bitwise operators, assignment operators, expressions, type conversions, conditional expressions, precedence and order of evaluation.
Input-output statements, statements and blocks, if and switch statements, loops:-while, do-while and for statements, break, continue, goto, programming examples.
Module-2
Designing structured programs: - Functions, parameter passing, storage classes- extern, auto, register, static, scope rules, user defined functions, recursive functions. Arrays- concepts, declaration, definition, accessing elements, and functions, two-dimensional and multi-dimensional arrays, applications of arrays. pointers- concepts, initialization of pointer variables, pointers and function arguments, address arithmetic, Character pointers and functions, pointers to pointers, pointers and multidimensional arrays, dynamic memory management functions, command line arguments
Module-3
Derived types- structures- declaration, definition and initialization of structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to structures, self referential structures, unions, typedef, bit fields, C program examples. Input and output – concept of a file, text files and binary files, streams, standard I/O, Formatted I/O, file I/O operations, error handling

Course Duration : 40 hours
Module-1
Introduction to data structures: storage structure for arrays, sparse matrices, Stacks and Queues: representation and application. Linked lists: Single linked lists, linked list representation of stacks and Queues. Operations on polynomials, Double linked list, circular list.
Module-2
Dynamic storage management-garbage collection and compaction, infix to post fix conversion, postfix expression evaluation. Trees: Tree terminology, Binary tree, Binary search tree, General tree, B+ tree, AVL Tree, Complete Binary Tree representation, Tree traversals, operation on Binary tree-expression Manipulation.
Module-3
Graphs: Graph terminology, Representation of graphs, path matrix, BFS (breadth first search), DFS (depth first search), topological sorting, Warshall's algorithm (shortest path algorithm.) Sorting and Searching techniques – Bubble sort, selection sort, Insertion sort, Quick sort, merge sort, Heap sort, Radix sort. Linear and binary search methods, Hashing techniques and hash functions.

Course Duration : 40 hours
Module-1
Introduction to object oriented programming, user defined types, structures, unions, polymorphism, encapsulation. Getting started with C++ syntax, data-type, variables, strings, functions, default values in functions, recursion, namespaces, operators, flow control, arrays and pointers.
Module-2
Abstraction mechanism: Classes, private, public, constructors, destructors, member data, member functions, inline function, friend functions, static members, and references. Inheritance: Class hierarchy, derived classes, single inheritance, multiple, multilevel, hybrid inheritance, role of virtual base class, constructor and destructor execution, base initialization using derived class constructors. Polymorphism: Binding, Static binding, Dynamic binding, Static polymorphism: Function Overloading, Ambiguity in function overloading, Dynamic polymorphism: Base class pointer, object slicing, late binding, method overriding with virtual functions, pure virtual functions, abstract classes. Operator Overloading: This pointer, applications of this pointer, Operator function, member and non member operator function, operator overloading, I/O operators. Exception handling: Try, throw, and catch, exceptions and derived classes, function exception declaration, unexpected exceptions, exception when handling exceptions, resource capture and release.
Module-3
Dynamic memory management, new and delete operators, object copying, copy constructor, assignment operator, virtual destructor. Template: template classes, template functions. Standard Template Library: Fundamental idea about string, iterators, hashes, iostreams and other types. Namespaces: user defined namespaces, namespaces provided by library. Object Oriented Design, design and programming, role of classes.

Course Duration : 40 hours
Module-1
Introduction to database Systems, Basic concepts &Definitions, Data Dictionary, DBA, Fileoriented system vs. Database System, Database Language. Database System Architecture-Schemas, Sub Schemas & Instances, 3-level database architecture, Data Abstraction, Data Independence, Mappings, Structure, Components & functions of DBMS, Data models, Mapping E-R model to Relational, Network and Object Oriented Data models, types of Database systems Storage Strategies: Detailed Storage Architecture, Storing Data, Magnetic Disk, RAID, Other Disks, Magnetic Tape, Storage Access, File & Record Organization, File Organizations & Indexes, Order Indices, B+ Tree Index Files, Hashing
Module-2
Relational Algebra, Tuple & Domain Relational Calculus, Relational Query Languages: SQL and QBE. Database Design :-Database development life cycle(DDLC),Automated design tools, Functional dependency and Decomposition, Dependency Preservation & lossless Design, Normalization, Normal forms:1NF, 2NF,3NF,and BCNF, Multi-valued Dependencies, 4NF & 5NF. Query processing and optimization: Evaluation of Relational Algebra Expressions, Query optimization.
Module-3
Transaction processing and concurrency control: Transaction concepts, concurrency control, locking and Timestamp methods for concurrency control. Database Recovery System: Types of Data Base failure & Types of Database Recovery, Recovery techniques Advanced topics: Object-Oriented & Object – Relational Database, Parallel & Distributed Database, Introduction to Data warehousing & Data Mining