GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN

SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: TBC 201 Course Title: Introduction to Data Structure

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: II

7. Category of Course: DSC

8. Pre-requisite: Foundations of Computer Programming

9. Course Outcome: After completion of the course the students will be able to:
CO1: Understand the process of minimizing Boolean function
and obtaining the combinational logic circuits from
Boolean functions.
CO2: Analyse the basic storage elements in digital circuits and
develop sequential circuits by applying them.
CO3: Evaluate the design of different types of register, counter,
and programmable logic devices.
CO4: Apply the concept of digital logic circuits in computer
organization & architecture and evaluate the computer
performance.
CO5: Create the arithmetic logic used in computer and describe
the machine instruction execution.
CO6: Understand the memory hierarchy of computer and how
different I/O devices interact with the processing unit.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
1 Unit 1: 9
Introduction
Basic Terminology, Algorithm complexity, Pointers and
 Dynamic Memory Allocation, Arrays: Introduction, One
Dimensional Arrays, Multidimensional Arrays, Strings,
Functions: introduction, Parameter Passing Techniques,
Recursion: Definition, Types of Recursions, structures:
Introduction to Structures, Nested Structures, Array of
Structures, Pointers to Structures

Unit 2:
Linked Lists
Introduction, Arrays and Linked Lists, building a Linked List,
2 8
Traversing the Linked List, Insert and Delete Operations,
Searching in a Linked List, Circular Linked List, Doubly Linked
List
Unit 3:
Stacks and Queues
Stacks: Introduction, Applications of Stack, Array and Linked
list implementations of a Stack, Infix, Prefix and Postfix
Expressions, converting infix expressions to prefix and postfix
3 forms, Evaluation of postfix expression 9
Queues: Introduction, Applications of Queue, Array and
Linked List implementation of queues, Circular Queue, Doubly
Ended Queue, Priority Queue

Unit 4:
Searching and Sorting
Searching: Sequential Search, Binary Search, Hashing: Hash
4 Table, Hash Functions, Collision Resolution Strategies, Hash 9
Table Implementation
Sorting: Bubble Sort, Selection Sort and Insertion Sort.

Unit 5:
Trees: Basic Terminology, Binary Trees: Definition and properties
5 10
of Binary Trees, Binary Tree Representation, Algebraic
Expressions, Types of binary trees, Binary tree traversals.
Total 45

Text Books:

Authors Name Title Edition Publisher, Year

Country

A M Tenenbaum Data 2nd Edition PHI 2015

Structures
using C &
 C++

Reference Books:

Authors Name Title Edition Publisher, Country Year

R. Kruse Data 2nd Edition Pearson Education 2006

Structures
and Program
Design in C

Horowitz and Sahani Fundamental 2nd Edition Galgotia 2008

s of data
Structures
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

Introduction to Object Oriented
1. Subject Code: TBC 202 Course Title: Programming

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: II

7. Category of Course: DSC

8. Pre-requisite: Foundations of Computer Programming

9. Course Outcome: After completion of the course the students will be able to:
CO1: Discuss OOP features that are essential for building good
C++ programs.
CO2: Explain arrays, functions, classes, and objects to write C+
+ programs.
CO3: Implement C++ Programs using constructors, destructors,
and operator overloading.
CO4: Use public and private inheritance features in problem-
solving.
CO5: Use public and private inheritance features in problem-
solving.
CO6: Develop C++ programs using generic templates and
exception handling.
10. Details of the Course:
Sl. Contact
Contents
No. Hours
Unit 1:
OOP and Introduction to C++
OOP Concepts: Encapsulation, Abstraction, Inheritance, Data
Hiding, Message Passing, Benefits of OOP, Procedure-oriented
versus OOP, Structure of a C++ Program, Tokens, Identifiers,
1 9
Variables, and Constants.
Built-in data types, Operators, Precedence and Associativity
Operators, Control Structures: if, if-else, nested if, switch, while,
do-while, for, break, and continue

Unit 2:
User-defined Functions, Arrays, Structures, Unions, Pointers
Functions – Library and User-define Functions, Function
Prototype, Definition and Call, Inline Functions, Function
Overloading
Array - Single-dimensional array and Multidimensional Array
2 Structures - Declaring and defining a structure, Accessing 9
structure members
Unions - Declaring and defining a union, Initialization, and access
of union variables
Pointers - Pointers and their characteristics, Pointer
declaration and assignment, Pointer arithmetic, Dynamic
memory allocation using new and delete operators
Unit 3:
Classes and Objects
Classes and Objects, Defining Classes, Instantiating Objects,
and Member Functions, Accessibility Labels: public, private,
protected, Inline and non-inline function, Scope resolution
operators
3 Function overloading (Polymorphism) 8
Constructors and Destructors, Default Constructors,
Parameterized Constructors, Copy Constructor, Purpose of the
Constructors, Destructors, Static Members (variables and
functions), An array of Objects, Class Pointers, Friend Functions
and Friend Class.

4 Unit 4: 9
 Inheritance, Operator Overloading, and Type Conversion
Concept of Reusability, Types of Inheritance: Single, Hierarchical,
Multilevel, Multiple Inheritance and Hybrid Inheritance
Operator Overloading: Overloading Unary and Binary Operators
by using member functions OR friend functions. Overloading
various operators [++/-- (used as pre and post operators),
arithmetic (+, -, *, /, ^), relational (<, <=, >, >=, !=, ==),
assignment (=), extraction (>>) and insertion (<<) operators)
Type conversion in C++: Primitive data type to class type
conversion, Class to Primitive data type conversion, Class to
Class conversion.
Unit 5:
Virtual Functions, File Handling, Exception Handling, and
Templates
Abstract Class, Function Overriding, Dynamic Binding, Pure
Virtual Functions, Data Ambiguity and Virtual Inheritance
File Classes (C++ stream classes), Opening, and Closing of a
File, File Modes, I/O operations in Files, I/O using primitive data
type: Formatted I/O in files, I/O using the class’s object
5 Generic programming approach using templates: Template 10
functions, Template class, Overloading template functions, using
different classes as a data type in the template class.
Inheritance of template class, STL: an overview, vectors,
containers, lists, and map.
Exception Handling in C++: Introduction to exceptions,
exceptions, and errors, types of exceptions, Using try, catch
blocks, throw various types of exceptions including class.

Total 45

Textbooks:

Authors Name Title Edition Publisher, Year

Country

E. Balagurusamy Object 4th Edition Tata McGraw 2011

Oriented Education Hill
Programming
with C++

Herbert Schildt The 4th Edition Tata McGraw 2003

 Complete Education Hill
Reference
C++

Reference Books:

Authors Name Title Edition Publisher, Country Year

Robert Lafore Object 4th Edition Pearson Education 2008

Oriented India
Programmin
g with C++

Stephen Prata C++ Primer 2nd Edition Waite Group 1995

Plus: teach
Yourself
Object
Oriented
Programmin
g
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: TBC 203 Course Title: Introduction to Operating Systems

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: II

7. Category of Course: DSC

8. Pre-requisite: Basics of computer architecture and logical problem solving.

9. Course Outcome: After completion of the course the students will be able to:
CO1: Define the role and function of operating systems in
computer systems
CO2: Describe different types of operating systems, services
provided by OS, and the components of OS.
CO3: Describe and execute process synchronization, including
synchronization hardware, mutex locks, semaphores, and
monitors
CO4: Compare different process scheduling algorithms.
CO5: Evaluate the efficiency of different memory management
techniques.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
1 Unit 1: Introduction to OS 9
Computer-System Organization, Operating-System Structure,
Operating-System Operations, Basics of Process Management,
Memory Management, Storage Management, Protection and
Security
Operating-System Structures Operating-System Services, User
and Operating-System Interface, System Calls, Types of System
 Calls, System Programs, Operating-System Structure

Unit 2: CPU Scheduling and Deadlocks

CPU Scheduling Basic Concepts, Scheduling Criteria, Scheduling
2 Algorithms, FCFS, SJF, Round Robin, Multi-level Feedback 9
queue, Algorithm used in SVR3 UNIX, Real-Time CPU
Scheduling.
Unit 3: Processes management and Synchronization
Process Concept, Process Scheduling, Operations on processes,
Inter-process Communication, Examples of IPC Systems.
3 9
Threads. The Critical-Section Problem, Peterson’s Solution,
Mutex Locks, Semaphores, Classic Problems of Synchronization.

Unit 4:
Deadlock -System Model, Deadlock Characterization, Methods for
4 Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, 9
Deadlock Detection, Recovery from Deadlock.

Unit 5: Memory management

Main Memory, Swapping, Contiguous Memory Allocation,
Segmentation, Paging, Structure of the Page Table, Virtual
5 9
memory, Demand Paging, Page Replacement, Allocation of
Frames, Thrashing.

Total 45

Textbooks:

Authors Name Title Edition Publisher, Country Year

Abraham Silberschatz, Operating 9th Edition Wiley India Pvt. 2018

Peter B Galvin, Greg System Ltd
Gagne Concepts

Reference Books:

Authors Name Title Edition Publisher, Country Year

William Stallings Operating 9th Edition Pearson 2018

Systems
 Internals
and
Design
Principles

Andrew S. Modern 4th Edition Pearson 2014

Tanenbaum, Herbert Operating
Bos Systems
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: TBC 204 Course Title: Probability and Statistics for Data Science

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: II

7. Category of Course: DSC

8. Pre-requisite: Understanding of basic mathematics, programming and data

analysis and visualization

9.Course After completion of the course the students will be able to:
Outcome: CO1: Describe between various types of data and explain their
relevance in understanding business problems.
CO2: Demonstrate the process of data collection and
preparation and perform exploratory data analysis (EDA)
to summarize main characteristics of the data.
CO3: Calculate probabilities and apply probability distributions
to solve real-world problems.
CO4: Compute and interpret measures of central tendency,
dispersion, shape and visualize data.
CO5: Conduct hypothesis testing and interpret the results in the
context of business problems.
CO6: Develop Regression models, perform correlation and
residual analysis to validate assumptions.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
1 Unit 1: Data Types and Business Understanding 8
Introduction to Data Types, Qualitative vs. Quantitative Data
Continuous vs. Discrete Data, Understanding the Business
Problem Data Collection and Preparation, Exploratory Data
 Analysis (EDA)

Unit 2: Probability Concepts and Distributions

Introduction and Definition of Probability, Event, Sample Space,
Laws of addition and multiplication of Probabilities and
Conditional Probability, Independent and Dependent events,
2 Bayes theorem, Mathematical Expectations and Moment 9
generating functions, Probability Distributions: Discrete
Distribution, Binomial Distribution, Poisson Distribution,
Continuous Distribution: Rectangular and Normal Distribution

Unit 3: Descriptive Statistics

Measures of Central Tendency: Mean, Median, Mode, Geometric
mean, Harmonic mean and Partition values. Measures of
Dispersion: Dispersions, Range, Quartile, Deviation, Mean
3 Deviation, Standard Deviation, Variance and Coefficient of 9
Dispersions. Measures of Shape: Skewness, Kurtosis, Moments,
Measure of Skewness and Kurtosis. Graphs and Charts:
Histograms,
Bar Charts, Box Plots, Pie Charts

Unit 4: Inferential Statistics

Estimation: Point Estimation, Confidence Intervals, Hypothesis
Testing: Null Hypothesis, Alternative Hypothesis, p-value,
4 Significance Level, t-Distribution and t-Tests, F-Distribution and 10
F-Tests, Z-Distribution and Z-Tests, Goodness of Fit Tests: Chi-
Square Tests, ANOVA (Analysis of Variance)

Unit 5: Regression and Correlation

Regression Analysis: Simple Linear Regression, Multiple Linear
Regression, Correlation Analysis: Pearson and Spearman
correlation coefficients, Residual analysis: Definition of
5 9
Residuals, Assumptions Validated by Residual Analysis
Techniques for Residual Analysis, Multivariate Analysis: Principal
component analysis (PCA)

Total 45

Textbooks:

Authors Name Title Edition Publisher, Year

 Country

Ronald E. Walpole, Probability 9th Pearson 2011

Raymond H. Myers, and Edition
Sharon L. Myers, Keying Statistics for
E. Ye Engineers
and
Scientists

Trevor Hastie, Robert The 2nd Springer 2009

Tibshirani, Jerome Elements of Edition
Friedman Statistical
Learning

Reference Books:

Authors Name Title Edition Publisher, Country Year

Marc Peter Mathematic 1st Edition Cambridge 2020

Deisenroth, A. Aldo s for University Press
Faisal, Christopher Machine
Bishop Learning

Richard A. Johnson, Applied 6th Edition Pearson 2007

Dean W. Wichern Multivariate
Statistical
Analysis
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: TBC 211 Course Title: Fundamentals of Python Programming

2. Contact Hours: L: 2 T: 1 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: II

7. Category of Course: DSE

8. Pre-requisite: Basics of programming logic, algorithm and mathematics.

9. Course Outcome: After completion of the course the students will be able to:
CO1: Understand and apply the basic programming
constructs of Python suitably.
CO2: Explain the concepts of string processing, file I/O, lists
and dictionary.
CO3: Explore re-usability and the object-oriented principles
for modelling and developing.
CO4: Construct applications with graphical user interface.
CO5: Develop software solutions using multi-threading,
networking and client-server concepts.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
Unit 1:
Python Overview, Data Types, and Expressions: Assignment
1 and Comments. Numeric Data Types and Character Sets. 9
Expressions. Using Functions and Modules. The For Loop.
Formatting text for output. if and if-else statements. While loop.
Unit 2:
2 Strings, Text Files, Lists and Dictionaries: Binary. Octal. 9
Decimal. Hexadecimal. Interconversion. Accessing characters
 and substrings in strings. Data Encryption. Strings and Number
System. String methods. Text Files. Lists. Defining simple
functions. Dictionaries.
Unit 3:
Functions and Classes: Functions as abstraction mechanisms.
Problem solving with Top-Down design. Design with Recursive
functions. Managing a program’s namespace. Higher order
3 functions. Objects and classes. Data modelling Rational 9
numbers. Arithmetic and operator overloading. Comparison
methods. Using pickle for permanent storage of objects. Input of
objects and try-except statement. Structuring classes with
Inheritance and Polymorphism.
Unit 4:
Graphical User Interfaces: GUI-Based Programs. Terminal-
Based Version. GUI-Based Version and Event-Driven
4 Programming. Windows and Labels. Displaying Images. 9
Command Buttons and Responding to Events and Viewing the
Images. Entry Fields for the Input and Output of Text. Using Pop-
up Dialog Boxes and Other Useful GUI Resources.
Unit 5:
Multi-threading, Networks, And Client/Server Programming:
Threads and Processes. Threads. Sleeping Threads. Producer,
5 Consumer and Synchronization. Networks. Clients and Servers. 9
IP Addresses. Ports. Servers and Clients. Sockets and a
Day/Time Client Script. A Day/Time Server Script. A Two-Way
Chat Script, Handling Multiple Clients Concurrently.
Total 45

Text Books:

Authors Name Title Edition Publisher, Country Year

Kenneth A. Lambert, Fundamental 2nd Edition CENGAGE 2018

Martin Osborne s of Python: Learning
First
Programs

Michal Jaworski, Expert Python 2nd Edition Packt Publishing 2016

TarekZiade Programming
Reference Books:

Authors Name Title Edition Publisher, Country Year

Rick van Hattem Mastering 2nd Edition Packt Publishing 2016

Python

Zed A. Shaw Learn 3rd Edition Pearson 2009

Python
the Hard
Way
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: TBC 212 Course Title: Discrete Mathematics

2. Contact Hours: L: 2 T: 1 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: II

7. Category of Course: DSE

8. Pre-requisite: Basic knowledge of logic gates and Graphs

9.Course A student who successfully fulfils the course requirements will

Outcome: be able to-

CO 1: After Understand the theory and techniques of logic,

graphs and trees, and algebraic systems.

CO 2: Apply the knowledge and skills obtained to investigate

and solve a variety of discrete mathematical problems.

CO 3: Communicate mathematical ideas.

CO 4: Make effective use of appropriate technology.

CO 5: Understand the concept of Paths, Cycles, cut vertex, cut

set and bridges.

10. Details of the Course:

Sl. CONTENT CONTACT
No. HOURS
1 Unit 1: 10
Matrices: Notation and Definition, Types of Matrices, Algebra of
Matrices, Transpose of a Matrix, Solution of linear Equations by
Matrix method, Rank of matrix, Eigen values and Eigen vectors,
Cayley Hamilton theorem.
2 Unit 2: 10
 Boolean algebra: Basic operations, Boolean functions,
Boolean expression, De-Morgan’s theorem, Logic gates, SOP
and POS forms, Normal forms, Simplification of Boolean
expression, Logic and switching networks, Karnaugh map
method for simplification of Boolean expression
3 Unit 3: 10
Graph theory: Definition and application of graphs, Konigsberg
bridge problem, Simple graph, multi graph and pseudo graph,
directed and undirected graphs, degree of a vertex,
handshaking theorem, Types of graphs, sub graphs and
isomorphic graphs, bipartite graphs, operations of graphs,
representation of graphs.
4 Unit 4: 7
Paths, Cycles, cut vertex, cut set and bridge, Connectedness in
directed and undirected graphs, Connectivity, Eulerian graph,
Hamiltonian graph, Dijkstra’s algorithm for shortest path, planar
graphs, Euler’s formula, Graph coloring, Wetch Powell
algorithm, Chromatic polynomial, Decomposition theorem.
5 Unit 5: 8
TREES: Trees and their properties, Rooted tree, Spanning tree,
minimal spanning tree, fundamental circuits, rank and nullity,
Kruskal’s algorithm, Binary tree.
TOTAL 45

Textbooks:

Authors Name Title Edition Publisher, Country Year

J. K. Sharma Discrete 2nd Edition Macmillan 2006

Mathematics

Liptschutz, Seymour, Discrete 3rd Edition TMH 2007

Mathematics

Reference Books:

Authors Name Title Edition Publisher, Country Year

Doerr Alan & Applied 2nd Edition Galgotia Pub. Pvt. 2001
Levasseur Kenneth Discrete Ltd
Structures
for Computer
 Science

Gersting, Mathematical 6th Edition WH Freeman & 1998

Structure for Macmillan
Computer
Science
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: TBC 213 Course Title: Cyber Security Essentials

2. Contact Hours: L: 2 T: 1 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: II

7. Category of Course: DSE

8. Pre-requisite: Knowledge of Computer Networks.

9.Course After completion of the course the students will be able to:
Outcome: CO1: Explain key concepts in cyber security, including the CIA
Triad, types of cybercriminals, and relevant cyber laws.
CO2: Identify and classify different types of cyber-attacks and
their corresponding defense mechanisms.
CO3: Demonstrate the ability to perform both passive and active
reconnaissance.
CO4: Analyze and compare different types of intrusion detection
systems (IDS).
CO5: Evaluate and assess various intrusion prevention systems
(IPS) and firewalls.
CO6: Develop a comprehensive security strategy by
incorporating best practices in defense mechanisms,
reconnaissance, IDS and IPS.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
1 Unit 1: Introduction 8
Overview of Cyber Security, History of the Internet, The CIA
Triad (Confidentiality, Integrity, Availability), Reasons for Cyber
 Crime, Importance of Cyber Security, Types and Characteristics
of Cybercriminals
Classification of Cyber Crimes, Overview of Cyber Laws, The
Indian IT Act Cybercrime and Its Punishments

Unit 2: Cyber Attacks and Defence Mechanisms

Open Web Application Security Project (OWASP), Threats and
Vulnerabilities in Cyber Attacks, Types of Malicious Attacks,
2 9
Common Attack Vectors, Social Engineering Attacks, Wireless
Network Attacks, Web Application Attacks, Tools Used in Cyber
Attacks, Defensive Countermeasures.
Unit 3: Cyber Reconnaissance Techniques
Introduction to Reconnaissance, Definition and Importance,
Reconnaissance in the Cyber Attack Lifecycle, Passive
Reconnaissance: Overview, Harvester Tool, Whois Lookup,
3 Netcraft Tool, Active Reconnaissance: Overview, Nmap (Network 10
Mapper), Ping Sweeps, Traceroute, Extracting Information from
DNS, Extracting Information from Email Servers, Social
Engineering Reconnaissance, Scanning Techniques: Port
Scanning, Network Scanning, Vulnerability Scanning

Unit 4: Intrusion Detection Systems (IDS)

Host-Based Intrusion Detection, Network-Based Intrusion
4 Detection, Distributed or Hybrid Intrusion Detection, Intrusion 9
Detection Exchange Format, Honeypots

Unit 5: Intrusion Prevention Systems (IPS)

Definition and Importance of IPS, Need for Firewalls, Types of
Firewalls: Packet Filtering Firewalls, Stateful Inspection Firewalls,
5 Proxy Firewalls, Firewall Placement and Configuration, Common 9
IPS Techniques: Signature-Based Detection, Anomaly-Based
Detection, Policy-Based Detection, Heuristic Detection.

Total 45

Textbooks:

Authors Name Title Edition Publisher, Year

Country

Anand Shinde Introduction to 1st Edition Notion Press 2021

Cyber Security
 Guide to the
World of Cyber
Security

Nina Godbole, Sunit Cyber Security: 1st Edition Wiley Publishers 2011
Belapure Understanding
Cyber Crimes,
Computer
Forensics and
Legal
Perspectives

Reference Books:

Authors Name Title Edition Publisher, Year

Country

Patrick Engebretson The Basics of 1st Edition Elsevier 2011

Hacking and
Penetration
Testing: Ethical
Hacking and
Penetration
Testing Made
easy

Kimberly Graves CEH Official 1st Edition Wiley Publishers 2007

Certified Ethical
Hacker Review
Guide
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: PBC 201 Course Title: Data Structures Laboratory

2. Contact Hours: L: 0 T: 0 P: 4
3. Examination Duration (Hrs): Theory 0 Practical 3
4. Relative Weight: CIE 25 MSE 25 ESE 50
5. Credits: 2

6. Semester: II

7. Category of Course: DSC

8. Pre-requisite: Basics of Computer Programming.

9. Course Outcome: After completion of the course, the students will be able to:
CO1: Define fundamental data structure concepts, compare
and choose appropriate data structures to represent
data items in the real world.
CO2: Compare and analyze the merits and demerits of
various data structures in terms of complexity.
CO3: Design algorithms and develop programs using a
variety of data structures such as arrays, stacks,
queues, linked lists, graphs, and trees.
CO4: Implement and evaluate operations like searching,
insertion, deletion, traversing, and similar on various
data structures.
CO5: Understand, analyze and implement the concept of file
structures and file organizations in data structures.
10. Details of the Course:
Sl. List of problems for which students should develop Contact
No. programs and execute in the Laboratory Hours
1. Write a C Program to read n elements in an array and find 2
the average.
 Use static memory allocation to allocate memory for the
array.
 Use dynamic memory allocation to allocate memory for
 the array.
Write a C program using recursive functions to
a) Find the nPr.
2. 2
b) Implement towers of Hanoi.

3. Write a C program to demonstrate the stack operations. Use 2

array to represent the stack.
4. Write a C program to evaluate the postfix expression. 2

5. Write a C program to convert an infix expression to its postfix 2

equivalent.
Write C programs to demonstrate the following data structures
6. using arrays. 2
 Queue
 Circular queue
Write C programs to demonstrate the following
operations on a linked list Creation of a list
 Adding an element at the beginning of the list.
7.  Adding an element at the end of the list. 2
 Deleting the first element.
 Deleting the last element.

Write C program to create Binary Search Tree and perform the

following
8.  Inorder traversal 2
 Preorder traversal
 Postorder traversal
Write C program to implement the following
9.  Linear search 2
 Binary search
Write C program to implement the following.
10.  Bubble sort 2
 Quick sort
Write C program to perform the following operations on a
11. graph. 2
 Depth First Search
 Breadth First Search
Total 22

Textbooks:
 Authors Name Title Edition Publisher, Country Year

Kruse, R. et al. Data 2nd Edition Pearson India 2006

structures
and
program
design in
C

Reference Books:

Authors Name Title Edition Publisher, Country Year

Lipschutz Data 1st Edition Tata McGraw-Hill 2014

structures

Tenenbaum , A. M. et Data 2nd Edition Pearson Education 2006

al. structures
using C

Link to Virtual Labs: (In addition, Departments to explore the Virtual Labs, Simulations, Case Studies
offered by Renowned Institutions/Organizations)

Virtual Labs

 https://ds2-iiith.vlabs.ac.in/exp/selection-sort/index.html
GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN
SEMESTER II

Name of Department: - Department of Computer Applications

1. Subject Code: PBC 202 Course Title: Object-Oriented Programming Laboratory

2. Contact Hours: L: 0 T: 0 P: 4
3. Examination Duration (Hrs): Theory 0 Practical 3
4. Relative Weight: CIE 25 MSE 25 ESE 50
5. Credits: 2

6. Semester: II

7. Category of Course: DSC

8. Pre-requisite: Basics of Computer Programming.

9. Course Outcome: After completion of the course, the students will be able to:
CO1: Describe the fundamentals of object-oriented
programming.
CO2: Explain different arithmetic and logical operations on
different data types using control structures.
CO3: Demonstrate the usage of classes, objects,
constructors, destructors, and operator overloading.
CO4: Experiment with a bottom-up approach using suitable
C++ programs for different applications.
CO5: Recommend file-manipulating operations for large data
using C++ programs.
CO6: Design and develop C++ programs using generic class
and function templates and handle exceptions.
10. Details of the Course:
Sl. List of problems for which students should develop Contact
No. programs and execute in the Laboratory Hours

1 Write a C++ Program to display the employee’s name, ID, and 2

salary details.
2 Write a C++ program to read a number and display each digit 2
of a number in words.
3 Write a C++ program to sort a list of numbers in ascending 2
order.
 Create a structure STUDENT with fields ROLLNO, NAME, and
4 MARKS. Display the student with the highest marks out of ‘n’ 2
records.
Print the address and data for an integer, float number, and
5 character using pointers. 2
Determine the size of each data type.
Write a C++ program using functions to
a) Find the largest of three numbers
6 2
b) And for counting characters, white and spaces, and
digits in a given string.
Design EMPLOYEE class contains the following members:
7 data members: Employee number, Employee name, Basic, 2
DA, IT, Net Salary. Write member function read () and
print () to enter the data and display the employee records.
Create a class TEACHER with data members’ salary and
experience. Implement the following:
8 a) Initialize using parametrized constructors 2
b) Illustrate the use of the default
constructor
Create two objects for a class timer. Assume three data
members’ hours, minutes, and seconds. Use two constructors
9 for initializing the objects. Add two-time objects using 2
operator overloading. Display appropriate values of hours,
minutes, and seconds after addition.
Consider a base class EMPLOYEE and MANAGER as derived
10 classes. Use name and ID as base class members. Inherit the 2
members of the base class and display the MANAGER class
with the salary as an additional data member.
11 Write a C++ program to demonstrate the use of new and 2
delete operators for memory allocation and deallocation.
Store a list of integers in a file. Check whether the number is
12 ODD or EVEN. Send the odd to the ODD.dat file and even 2
numbers to the EVEN.dat file.
13 Create a vector for storing a list of integers using the STL. 2
Total 26

Text Books:

Authors Name Title Edition Publisher, Country Year

 E. Balagurusamy Object 4th Edition Tata McGraw 2011
Oriented Education Hill
Programming
with C++

Herbert Schildt The 4th Edition Tata McGraw 2003

Complete Education Hill
Reference
C++

Reference Books:

Authors Name Title Edition Publisher, Country Year

Robert Lafore Object 4th Edition Pearson Education 2008

Oriented India
Programmin
g with C++

Stephen Prata C++ Primer 2nd Edition Waite Group 1995

Plus: teach
Yourself
Object
Oriented
Programmin
g