Punjabi University, Patiala

CPE-202

Four Year B.Tech (Batch 2011)

BOS: 2012

OBJECT ORIENTED PROGRAMMING

L
3

T
1

P
0

Cr
3.5

Section-A
Introduction to Object Oriented Programming: What is object oriented programming. Why
do we need object-oriented, Programming characteristics of object-oriented languages. C and
C++, Object oriented paradigm, elements of object oriented programming, Merits and demerits
of OO Methodology.
C++ fundamentals: Data types, Tokens, Operators and Expressions, Control Flow, Arrays,
Strings.
Section-B
Functions & Structures: Prototyping, referencing the variables in functions, types of function
call, Structures, memory allocation in structures
Classes and Objects: Memory allocation for objects, Arrays of objects, Classes, constructors
and destructors, operator overloading, inheritance, virtual functions and polymorphism.
Section-C
Inheritance: Extending classes, Derived classes, Types of Inheritance, overloading and
overriding.
Addresses and pointers: The address-of operator & pointer and arrays. C-types string. Memory
management: New and Delete, pointers to objects, debugging pointers.
Section-D
Polymorphism: Virtual functions and polymorphism, abstract classes, virtual base class.
I/O operations and files: Classes for files, operations on a file, file pointers. Function templates,
Class templates Exceptions.
Recommended Books:
1. Object Oriented Programming with C + + by Bala Guruswamy; TATA McGraw Hill
Publishing Co. Ltd.
2. Turbo C + + Robert and Lafore: Galgolia Publications.
3. Satzinger, Object Oriented Analysis and Design with the unified process, Cengage
Learning (Thomson)
4. C++ Primer Plus by Stephan & PRAT: Galgotia Publications

Page 5 of 77

Batch: 2011 (CE)

Punjabi University, Patiala

CPE -208

Four Year B.Tech (Batch 2011)

BOS: 2012

DATA STRUCTURES
L
3

T
1

P
0

Cr
3.5

Section-A
Basic Data Structures and Operations on them: Arrays, Stacks and Queues and Their
Applications, Linked and Sequential Representation. Linked List, Representation of Linked List,
Multi-Linked Structures
Section-B
Trees: Definitions and Basic Concepts, Linked Tree Representation, Representations in
Contiguous Storage, Binary Trees, Binary Tree Traversal, Searching, Insertion and Deletion in
Binary Trees, Binary Search Tree, Heap and Heap Sort Algorithm, AVL Trees.
Section-C
Graphs and Their Application, Sequential and Linked Representation of Graph-Adjacency
Matrix, Operations on Graph, Traversing a Graph, Dijkstra's Algorithm for Shortest Distance,
DFS and BFS, Minimal Spanning Tree.
File Organization: Sequential, Relative, Index Sequential, B-Tree, Multi-Key, Inverted File.
Section-D
Searching and Sorting, use of Various Data Structures for Searching and Sorting, Linear and
Binary Search, Bubble Sort, Insertion Sort, Shell Sort, Selection Sort. Merge Sort, Radix Sort,
Quick Sort.
Hashing: Introduction to hash table, hash function, resolving collision by chaining and open
addressing, deleting items from a hash table.
Recommended Books:
1. Data
structures:
a
Pseudocode
Approach
with-C,
IInd Edition,'
Cengage Learning (Thomson).
2. Fundamentals of Data Structures, CBS Publishers and Distributors, Delhi, Ellis HorwitZ
and Sartaj Sahni.
3. An introduction to data structures with applications, Mc-Graw Hill Inc., J.P. Trembley
and P.G, Sorensen.
4. Data Structures and Program Design in C Prentice Hall of India, 1992, Robort L. Kruse,
Bruce P. Leung, Cluvis L. Tundo.
5. Data Structure using (C & C++, Sanjeev Kumar, Khanna Publishers.

Page 17 of 77

Batch: 2011 (CE)

Punjabi University, Patiala

CPE-303

Four Year B.Tech (Batch 2011)

BOS: 2012

ALGORITHM ANALYSIS & DESIGN

L
3

T
1

P
0

Cr
3.5

Section-A
Introduction: Algorithm, analyzing algorithms, stacks, queues, trees, heaps, graphs, hashing.
Divide and Conquer: General method, binary search, finding the maximum and minimum,
Merge sort, Quick sort, Strassens matrix multiplication.
Section-B
Greedy Method: General Method, Knapsack problem, minimum spanning trees, single source
shortest paths.
Section-C
Dynamic Programming: General Method multistage graphs, All pairs shortest path, traveling
salesman problem.
Branch & Bound: Branch & bound Method, 0/1 Knapsack problem, Traveling salesman
problem.
Section-D
Lower Bound Theory: Lower bound technique, Comparison trees for sorting and searching,
some lower bound on parallel computation

Recommended Books:
1. Fundamentals of Computer Algorithm, Latest edition, By Horowitz Sahni, Galgotia
Publication.
2. Algorithms, Latest Edition, By knuth.
3. Design & Analysis of Algorithm, Latest Edition, By Goodman, McGraw hill Publication.

Page 28 of 77

Batch: 2011 (CE)