CS-31 PROGRAMMING IN C++

Maximum Marks: 50 External: 40

Note: Examiner will be required to set Nine Questions in all. First Question will be compulsory,
consisting of eight (objective type/short-answer type) questions covering the entire syllabus. In
addition to that eight more questions will be set, two questions from each Unit. A candidate will be
required to answer five questions in all, selecting one question from each unit in addition to
compulsory Question No. 1. All questions will carry equal marks.

Course Objectives:
 to understand the limitation of predefined data types and the idea of defining new data types
with functionality.
 to understand the new way of programming called object oriented programming.
 to understand various terms like class, object constructor, destructor, friend function,
Inheritance, polymorphism and exception handling.
Learning Outcomes: At the end of this course, the student will be able to:
 To understand the limitation of predefined data types and the idea of defining new data types
with functionality.
 To understand the new way of programming called object oriented programming.
 To understand various terms like class, object, constructor, destructor, friend function,
Inheritance, polymorphism and exception handling.
UNIT-I
Introduction to Programming in C++: Object-Oriented Features of C++, comparing structure and
Class, Data members and Member functions, concept of private and public section , Data Hiding &
Encapsulation, Static Data Members and Member Functions, Inline Functions, Friend Functions,
idea of Namespace, Comparing C with C++.
UNIT-II
Constructors & Destructors: default, parameterized and copy constructor Overloading: unary and
binary operator overloading (through member function and friend function), function overloading
I/O operations in C++: concept of streams, input stream and output stream, cin and cout objects,
formatted and unformatted I/O operations using manipulators and functions.
UNIT-III
Type Conversion: implicit and explicit conversion, type conversion in classes: basic to class, class
to basic and class to class. Polymorphism: compile-time and run time Polymorphism
Inheritance: Types of Derivations, Forms of Inheritance, Roles of Constructors and Destructors in
Inheritance.
UNIT-IV
Genericity in C++: Template Function, Template Class
Exception Handling: try, throw and catch constructs, rethrowing an exception, catch all Handlers.

Text Books:
 Herbert Scildt, C++, The Complete Reference, Tata McGraw-Hill
 Robert Lafore, Object Oriented Programming in C++, PHI
 Stephen Prata, C++ Primer Plus, Galgotia

Reference Books:
 Bjarne Stroustrup, The C++ Programming Language, Pearson.
 Balaguruswami, E., Object Oriented Programming In C++, Tata McGraw-Hill
 CS-32 DATA STRUCTURE
Maximum Marks : 50 External:40
Time: 3 hours Internal: 10
Note: Examiner will be required to set Nine Questions in all. First Question will be compulsory,
consisting of six (objective type/short-answer type) questions covering the entire syllabus. In
addition to that eight more questions will be set, two questions from each Unit. A candidate will be
required to answer five questions in all, selecting one question from each unit in addition to
compulsory Question No. 1. All questions will carry equal marks.

Course Objectives:
 The course is intended to get the students familiar with various types of data structure and
different techniques to implement the data structures and their real-life applications.

Learning Outcomes: At the end of this course, the student will be able to:
 define Abstract data types, algorithms, complexity of algorithms, linear data structures, non-
linear data structures, Searching, Sorting, Stack, Queues, Linked Lists, Trees, and Graphs.
 giveOriginal examples of data structures and its types
 explain Sorting techniques, Searching methods, various operations on Stacks, Queues and
Linked Lists. Traversal techniques in Trees.
 calculate (complexity of algorithm). Use array, stack, queue, linked list, tree, graph, linear
search, binary search, bubble sort, selection sort,
 differentiate Data Structures, searching techniques, sorting techniques, analyze: time and
space complexity.
UNIT-I
Data structure and Algorithm Preliminaries: Definitions, The concept of Data Structure, Basic
Terminology: Elementary Data Organization, Data Structure Operations, Algorithms: Algorithmic
Notations, Control Structures, Complexity of Algorithms-Big „O‟ Notation, Time-Space Tradeoff.
Arrays: Introduction, Linear Arrays, Representation of Linear Arrays in Memory, Traversing Linear
Arrays, Concatenating Two Arrays, Insertion into a Linear Array, Deletion from a Linear Array,
Largest/Smallest Element from an Array, Linear Search, Binary Search. Introduction to
Multidimensional Arrays, Address Calculation of Elements of Arrays, Multiplication of Two
Matrices.
UNIT-II
Sorting: Bubble Sort, Selection Sort.
Strings: Introduction to Strings, Basic Terminology, Storing Strings, String Operations,
Linked list: Introduction to Linked List, Representation of Linked List in Memory, Traversing a
Linked List, Searching a Linked List, Insertion into a Linked List, Deletion from a Linked List,
Header Linked Lists,
Two way Linked List (Doubly Linked List): Introduction, Inserting a node into Two way Linked
List, Deleting a node from Two way Linked List, Introduction to Circular Linked List.
UNIT-III
Stack: Introduction to Stacks, Array Representation of Stacks, Operations on stack,: PUSH and
POP, Representation of Stack as Linked List, Polish Notations and Reverse Polish Notation,
Evaluation of Postfix Expressions, Transforming Infix Expressions into Postfix Expressions,
Transforming Infix Expressions into Prefix Expressions, Introduction to Recursion.
Graphs: Introduction, Graph Theory Terminology, Sequential Representation of Graphs: Adjacency
Matrix: Path Matrix , Linked Representation of a Graph, Shortest Path Algorithms.
 UNIT-IV
Queues: Introduction to Queues, Operations on the Queues: Enqueue and Dequeue, Circular
Queue, Double Ended Queue(DEQUE), Representation of a Queue as an Array, Representation of a
Queue as Linked List,
Trees – Introduction, Basic Terminology, Binary Tree, Tree Representations using Array & Linked
List, Binary Trees Traversing by Recursive procedures: Preorder In-order, & Post-order Traversal
(NLR, LNR and LRN),
Introduction to Binary Search Tree (BST), Insertion and Deletion in BST (only illustrations)

Text Books:
1. Seymour Lipschutz, “Data Structures”, Tata McGraw- Hill Publishing Company Limited,
Schaum‟s Outlines, New Delhi.
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Pearson Education, 2002.

Reference Books:
1. Trembley, J.P. And Sorenson P.G., “An Introduction to Data Structures With Applications”,
Mcgrraw- Hill International Student Edition, New York.
2. Tanenbaum A.M., Langsam Y, Augenstien M.J., Data Structures using C & C++, Prentice Hall
of India, 2002.
3. SartajSahni, Data structures, Algorithms and Applications in C++, University Press (India)
Pvt.Ltd, 2e, Universities Press Orient Longman Pvt. Ltd.