B.Tech.

Computer Science and Engineering(CSE)

KURUKSHETRA UNIVERSITY, KURUKSHETRA
MODIFIED SCHEME OF EXAMS W.E.F THE SESSION 2024-25
SEMESTER-III
S. Course No./ L:T:P Hours/ Examination Schedule (Marks) Duration
Subject
No. Code Week Credits End Semester Internal Practical Total of
Exam assessment Exam Exam(H
ours)
1 B23-CSE-201 Data Structures and Algorithms 4:0:0 4 4 70 30 0 100 3

2 B23-CSE-203 Computer Organization & 3:0:0 3 3 70 30 0 100 3

Architecture
3 B23-CSE-205 Object Oriented Programming 4:0:0 4 4 70 30 0 100 3

4 B23-CSE-207 IT Workshop (Python) 3:0:0 3 3 70 30 0 100 3

5 B23-BSC-203 Probability and Statistics 3:0:0 3 3 70 30 0 100 3

6 B23-HSM-201 Organizational Behaviour 3:0:0 3 3 70 30 0 100 3

7 B23-CSE-209 Data Structures and Algorithms 0:0:3 3 1.5 0 40 60 100 3

Lab
8 B23-CSE-211 Object Oriented Programming Lab 0:0:3 3 1.5 0 40 60 100 3

9 B23-CSE-213 IT Workshop (Python) Lab 0:0:2 2 1 0 40 60 100 3

10 B23-MAC-202 Essence of Indian Traditional 2:0:0 2 1 -- 100 -- 100 3

Knowledge

TOTAL 30 25 420 400 180 1000

Note:
 NCC/NSS/Sports/Yoga/Technical/cultural club/society activities may also be joined by students in second year and will be evaluated in
7th semester by the institute based upon continuous evaluation model as per guidelines.
 B23-CSE- Data Structures and Algorithms
201
Tutorial Practical Credit End Internal Total Time
Lecture Semester assessment
Exam
4 0 0 4.0 70 30 100 3 Hour
To introduce the principles and paradigms of Data Structures for design and
Purpose implement the software systems logically and physically.
Course Outcomes (CO)
To introduce the basic concepts of Data structure, basic data types, searching and
CO 1 sorting based on array data types.
To introduce the structured data types like Stacks and Queue and its basic
CO 2 operations's implementation.
CO 3 To introduce dynamic implementation of linked list.
To introduce the concepts of Tree and graph and implementation of traversal
CO 4 algorithms.

UNIT-1
Introduction to Data Structures, Data Types, Built in and User Defined Data Structures,
Applications of Data Structure, Algorithm Analysis, Worst, Best and Average Case Analysis,
Notations of Space and Time Complexity, Basics of Recursion.
Arrays, One Dimensional Arrays, Two Dimensional Arrays and Multi-Dimensional Arrays,
Sparse Matrices, Searching from array using Linear and Binary Searching Algorithm, Sorting
of array using Selection, Insertion, Bubble sort.

UNIT-2
Stacks: Definition, Implementation of Stacks and Its Operations, Evaluation of Infix, prefix
and Postfix Expression, Inter-conversion of Infix, Prefix and Post-Fix Expression,
Implementation of Merge Sort and Quick Sort Algorithm.
Queues: Definition, Sequential Implementation of Linear Queues and Its Operations,
Circular Queue and its Implementation, Priority Queues and Its Implementation,
Applications of queues.

UNIT-3
Linked Lists: Need of Dynamic Data Structures, Single Link List and Its Dynamic
Implementation, Traversing, Insertion, Deletion Operations on Single Link Lists.
Comparison between Static and Dynamic, Implementation of Linked List.
Circular Link Lists and Doubly Link List, Dynamic Implementation of Primitive Operations
on Doubly Linked Lists and Circular Link List, Dynamic Implementation of Stacks and
Queues.

UNIT-4
Trees: Definition, Basic Terminology, Binary Tree, External and Internal Nodes, Static and
Dynamic Implementation of a Binary Tree, Primitive Operations on Binary Trees, Binary
Tree Traversals: Pre-Order, In-Order and Post-Order Traversals, Representation of Infix,
Post-Fix and Prefix Expressions using Trees.
Introduction to Binary Search Trees: B+ trees, AVL Trees, Threaded Binary trees, Balanced
Multi-way search trees, Implementation of Heap Sort Algorithm.
Graphs: Basic Terminology, Definition of Undirected and Directed Graphs, Memory
Representation of Graphs, Graph Traversals Algorithms: Breadth First and Depth First.
Suggested Books:
• Theory and Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline,
TMH.
• Data Structures and Algorithms by PAI, TMH.
• Fundamentals of Data structures by Ellis Horowitz and Sartaj Sahni, Pub, 1983, AW.
• Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman,
Original edition, Addison- Wesley, 1999, Low Priced Edition.
• Data Structures and Program Design in C by Robert Kruse, PHI,
• Shukla, Data Structures using C++, Wiley India
• Introduction to Computers Science -An Algorithms Approach , Jean Paul Tremblay,
Richard B. Bunt, 2002, T.M.H.
• Data Structure and the Standard Template library – Willam J. Collins, 2003, T.M.H.
 B23- Computer Organization & Architecture
CSE-203
Lecture Tutorial Practical Credit End Internal Total Time
Semester assessment
Exam
3 0 0 3 70 30 100 3Hrs.
Purpose Student will be able to understand the basic concepts of computer architecture and
organization, and understand the key skills of constructing cost-effective computer
systems.
Course Outcomes (CO)
CO1 Be familiar with the Computer arithematic and data representation
CO2 Be familiar with the basic computer organization and design
CO3 Be familiar with instruction set architecture and parallel processing.
CO4 Be acquainted with the basic knowledge of I/O organization.

UNIT- 1
Data representation and Computer arithmetic: Introduction to Computer Systems,
Organization and Architecture, Von Neumann Architecture, evolution and computer
generations; fixed point, Floating-point and Decimal arithmetic operations, Digital arithmetic
algorithms for Addition, Subtraction, Multiplication using Booth’s algorithm,
Multiprocessors and Multicomputer, MIPS, MFLOPS.
Memory Organization: Memory Hierarchy, Types of Memory, TLB

UNIT-2
Basic Computer organization and Design: General register organization, stack organization
and common bus system, computer instructions, timing and control, Input, output and
Interrupt: Interrupt cycle, Design drivers: common case, Amdahl's law.

Micro programmed Control organization, Control Memory, address sequencing, micro

instruction format, Horizontal Vs Vertical micro-programming, design of control Unit, micro
program sequencer, Hardwired v/s Micro-programmed. CISC and RISC: features and
comparison.

UNIT-3
Instruction set Architecture: Instruction codes, instruction formats (Zero, One, Two and
Three Address Instruction).Instruction cycle, reference instructions; Memory reference
instructions.Various addressing modes.
Pipeline and vector Processing, Parallel Processing, Flynn's Taxonomy, Pipelining,
Instruction Pipeline, Basics of vector processing and Array Processors.

UNIT-4
Input-output organization: I/O interface. I/O Bus and interface modules, I/O versus
Memory Bus.
Asynchronous data transfer: Strobe control, Handshaking, Asynchronous serial transfer.
Modes of Transfer: Programmed I/O, Interrupt driven I/O, Priority interrupt; Daisy chaining,
Parallel Priority interrupt. Direct memory Access, DMA controller and transfer. Input output
Processor, CPU-IOP communication, Serial communication.
Suggested Books:
● William Stallings, “Computer Organization and Architecture – Designing for
Performance”, Sixth
Edition, Pearson Education, 2003.
● Morris Mano, M., “Computer System Architecture,” 3/e, Pearson Education, 2005.
● John P. Hayes, “Computer Architecture and Organization,” 3/e, TMH, 1998.
● David A. Patterson and John L. Hennessy, “Computer Organization and Design: The
Hardware/Software interface”, Third Edition, Elsevier, 2005.
● V.P. Heuring, H.F. Jordan, “Computer Systems Design and Architecture”, Second
Edition, Pearson
Education, 2004.
● Carl Hamacher, ZvonkoVranesic and SafwatZaky, “Computer Organization”, Fifth
Edition, Tata
McGraw Hill, 2002.
B23-CSE- Object Oriented Programming
205
Lecture Tutorial Practical Credit End Minor Total Time
Semester Test
Exam
4 0 0 4.0 70 30 100 3 Hour
Purpose To introduce the principles and paradigms of Object Oriented Programming
Language for design and implement the Object Oriented System.
Course Outcomes (CO)
CO1 To introduce the basic concepts of object oriented programming language and the its
representation.
CO2 To allocate dynamic memory, access private members of class and the behavior of
inheritance and its
implementation.
CO3 To introduce polymorphism, interface design and overloading of operator.
CO4 To handle backup system using file, general purpose template and handling of raised
exception
during programming.

UNIT–1
Introduction to C++, C++ Standard Library, Illustrative Simple C++ Programs. Header
Files, Namespaces, Application of object oriented programming. Control flow, variables
and assignments statements, conditional execution, looping, function calls including
recursion.

Object Oriented Concepts, Introduction to Objects and Object Oriented Programming,

Encapsulation, Polymorphism, Overloading, Inheritance, Abstract Classes, Accessifier
(public/ protected/ private), Class Scope and Accessing Class Members, Constant, Class
Member, Structure and Class.Macro vs Inline Functions.

UNIT-2
Friend Function and Friend Classes, This Pointer, Dynamic Memory Allocation and
Deallocation (New and Delete), Static Class Members, Constructors, parameter
Constructors and Copy Constructors, Deconstructors,
Introduction of inheritance, Types of Inheritance, Overriding Base Class Members in a
Derived Class, Public, Protected and Private Inheritance, Effect of Constructors and
Deconstructors of Base Class in Derived Classes.

UNIT-3
Polymorphism, Pointer to Derived class, Virtual Functions, Pure Virtual Function, Abstract
Base Classes, Static and Dynamic Binding, Virtual Deconstructors.

Fundamentals of Operator Overloading, Rules for Operators Overloading, Implementation

of Operator Overloading Like <<,>> Unary Operators, Binary Operators.

UNIT-4
Text Streams and binary stream, Sequential and Random Access File creation and updation,
Stream Input/ Output Classes, Stream Manipulators.

Basics of C++ Exception Handling, Try, Throw, Catch, multiple catch, Re-throwing an
Exception, Exception specifications.
Templates: Function Templates, Overloading Template Functions, Class Template, Class
Templates and Non- Type Template arguments.

Suggested Books:
• The complete reference C ++ by Herbert shieldt Tata McGraw Hill.
• Object Oriented Programming in Turbo C++ by Robert Lafore, 1994, The WAITE
Group Press.
• Shukla, Object Oriented Programming in c++, Wiley India.
• C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall.
• Programming with C++ By D Ravichandran, 2003, T.M.H.
B23-CSE-207 IT Workshop (Python)
L T P Credit End Internal Total Time
Semester assessment
Exam
3 0 0 3.0 70 30 100 3 Hours
Purpose To familiarize the students with the basics of Python Programming
Course Outcomes
CO1 To Study Fundamental concept of Python.
CO2 To Study and implement expression and Strings methods
CO3 To Study and implement tuples , list and dictionary operations.
CO4 To Study and implement exception handling and file operation.
Unit-1
Familiarization with the basics of Python programming: Introduction to Python, Features
of Python, Execution modes: interactive mode and script mode, Python character set, use of
indentation, Python tokens( keyword, identifier, literal, operator, punctuator), variables, use
of comments, Knowledge of data types: Number(Integer, Floating point, Complex).
Errors: syntax errors, logical errors, and run-time errors

Unit-2
Expressions: Statement, Type conversion, and input/output: Precedence of
Operators,Arithmetic operators, relational operators, logical operators, assignment operators,
augmented assignment operators, identity operators (is, is not),Expression, evaluation of an
expression, type-conversion, Flow of Control,Conditional statements, Iterative Statements
Strings: Introduction, string operations (concatenation, repetition, membership and slicing),
traversing a string using loops, built-in functions/methods–len(), capitalize(), title(), lower(),
upper(), count(), find(), index(), endswith(), startswith(), isalnum(), isalpha(), isdigit(),
islower(), isupper(), isspace(),lstrip(), rstrip(), strip(), replace(), join(), partition(), split()

Unit-3
Array: Access the Elements of an Array, Length of an Array, Adding Array Elements,
Removing Array Elements, Adds and remove the element at the specified position. Lists,
Tuples, Dictionary: introduction, indexing, list operations, traversing a list using loops,
built-in functions/methods–len(), list(), append(), extend(), insert(), count(), index(), remove(),
pop(), reverse(), sort(), sorted(), min(), max(), sum().
Introduction to Python modules: Importing module using ‘import ’ and using from
statement, importing math module (pi, e, sqrt(), ceil(), floor(), pow(), fabs(), sin(), cos(),
tan()); random module (random(), randint(), randrange()), statistics module (mean(), median(),
mode()).Functions and its types (Built-in Functions, Functions defined in Module, User
Defined Functions), arguments, default parameters, positional parameters, Function
Returning Value(s), Recursion, Scope of a Variable.

Unit-4
Files: Introduction to files, types of files (Text file, Binary file, CSV file),Text file: opening a
text file, file open modes (r, r+, w, w+, a, a+ etc), closing a text file, opening a file using with
clause, writing/appending data to a text file using write() and writelines(), reading from a text
file using read(), readline() and readlines

Reference Book:
1. The Complete Reference Python By Martin C Brown Publication by McGraw Hill.
2. Let us Python By Yashwant Kanetkar
B23-BSC- PROBABILITY AND STATISTICS
203
L T P Credit End Internal Total Time
Semester assessment
Exam
3 0 - 3.0 70 30 100 3 Hrs.
Purpose To familiarize the prospective students with the fundamentals of probability & statistics
and how to apply the principles to model and analyze various phenomena in fields like
finance, economics, and engineering, aiding in making informed decisions and
predicting outcomes.
Course Outcomes
CO1 introduce the fundamental concepts of probability to analyze and predict outcomes in real-life
situations.
CO 2 obability theory provides models of probability distributions (theoretical models of the
observable reality involving chance effects) to be tested by statistical methods which has
various engineering applications.
CO 3 make the students familiar about basic statistics to analyze data sets using various measures of
central tendency and dispersion
CO 4 on completion of Unit IV, students will proficiently apply correlation and regression
techniques, including calculating coefficients and determining lines of regression, to analyze
relationships between variables in datasets.

UNIT-I (10 Hrs)

Basic Probability: Introduction, additive law of probability, Conditional Probability,
Independent Events, Bayes’ Theorem.
Random Variables: Discrete random variables, probability distribution, Probability
mass function and distribution function, Expectation, Moments, Variance and standard
deviation of discrete random variables.
UNIT-II(12hrs)
Continuous Probability distribution:
Continuous random variables, probability distribution, Probability density function and
distribution function, Expectation, Moments, Variance and standard deviation of Continuous
random variables.
Probability distributions: Binomial, Poisson and Normal - evaluation of statistical parameters
for these three distributions.
UNIT-III(10hrs)
Basic Statistics:
Measures of Central tendency: Mean, median, quartiles, mode, Geometric mean, Harmonic
mean, Measures of dispersion: Range, Quartile deviation, mean deviation, standard deviation,
coefficient of variation, Moments, Skewness and Kurtosis.
UNIT-IV(08hrs)
Correlation & Regression:
Introduction,Correlation, Coefficient of correlation, methods of calculations, Lines of
regression, Rank correlation.

Suggested Books:
1. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley &
Sons,2006.
2. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book
Stall, 2003 (Reprint).
3. S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.
4. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd
Ed.,Wiley, 1968.
5. N.P. Bali and and Manish Goyal, A text book of Engineering Mathematics, Laxmi
Publications, Reprint, 2010.
6. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th
Reprint, 2010.
7. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010.
8. Veerarajan T., Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi,
2010.
 B23- Organizational Behavior
HSM-
201
Lecture Tutorial Practical Credit End Internal Total Time
Semester assessment
Exam
3 0 - 3.0 70 30 100 3 Hours
Course Outcomes
Purpose The objective of this Course is to make students conversant with the basic concepts of
organization behaviour for nurturing managerial skills.
CO1 An overview about organizational behavior as a discipline and understanding the
concept of individual behavior.
CO2 Understand the concept and importance of personality, emotions and its importance in
decision making and effective leadership.
CO3 Enabling the students to know about the importance of effective motivation and its
contribution in group dynamics and resolving conflicts.

CO4 Understand how to overcome organizational stress by maintaining proper

organizational culture and effective communication.

UNIT- 1

Introduction to organizational behavior: Concept and importance of organizational

behavior, role of Managers in OB, challenges and opportunities for OB.

Foundation of individual behavior: Biographical characteristics, concept and types of

abilities , concept of values and attitude, types of attitude, attitude and workforce diversity.

UNIT- 2

Introduction to personality and emotions: Definition and Meaning of Personality,

Determinants of Personality, Personality Traits Influencing OB, Nature and Meaning of
Emotions, Emotions dimensions, concept of Emotional intelligence.

Perception and individual decision making: meaning of perception, factors influencing

perception, rational decision making process, concept of bounded rationality. Leadership-trait
approaches, behavioural approaches, situational approaches, and emerging approaches to
leadership.

UNIT-3

Motivation: Concept and theories of motivation, theories of motivation-Maslow, two factor

theory, theory X and Y, ERG Theory, McClelland’s theory of needs, goal setting theory,
application of theories in organizational scenario, linkage between MBO and goal setting
theory.
 Foundations of group behaviour and conflict management: Defining and classifying of
groups, stages of group development, Informal and formal groups- group dynamics,
managing conflict and negotiation , causes of group conflicts, managing intergroup conflict
through resolution.

UNIT-4

Introduction to Organizational Communication: Meaning and importance of

communication process, importance of effective communication, organizational stress:
definition and meaning sources and types of stress, impact of stress on organizations, stress
management techniques.

Introduction to Organization Culture: Meaning and nature of organization culture, types

of culture, managing cultural diversity, managing change and innovation-change at work,
resistance to change, a model for managing organizational change.

Text Books:

1. Colquitt, Jason A., Jeffery A. LePine, and Michael Wesson. Organizational Behavior:
Improving Performance and Commitment in the Workplace. 5th ed. New York: McGrawHill
Education, 2017.

2. Hitt, Michael A., C. Chet Miller, and Adrienne Colella. Organizational Behavior. 4th ed.
Hoboken, NJ: John Wiley, 2015.

3. Robbins, Stephen P., and Timothy Judge. Organizational Behavior. 17th ed. Harlow, UK:
Pearson Education, 2017. Stephen P. Robins, Organisational Behavior, PHI Learning /
Pearson Education, 11th edition, 2008.

Reference Books:

1. Schermerhorn, Hunt and Osborn, Organisational behavior, John Wiley.

2. Udai Pareek, Understanding OrganisationalBehaviour, Oxford Higher Education.

3. Mc Shane & Von Glinov, OrganisationalBehaviour, Tata Mc Graw Hill.

4. Aswathappa, K., OrganisationalBehaviour– Text and Problem, Himalaya Publication.

B23-CSE- Data Structures and Algorithms Lab
209
Lecture Tutorial Practical Credit End Practical Total Time
Semester Exam
Exam
0 0 3 1.5 40 60 100 3
Purpose To introduce the principles and paradigms of Data Structures for design and
implement the software systems logically and physically.
Course Outcomes (CO)
CO1 To introduce the basic concepts of Data structure, basic data types, searching and
sorting based on array data types.
CO2 To introduce the structured data types like Stacks and Queue and its basic
operation’s implementation.
CO3 To introduce dynamic implementation of linked list.
CO4 To introduce the concepts of Tree and graph and implementation of traversal
algorithms.

1. Write a program for Binary search methods.

2. Write a program for insertion sort, selection sort and bubble sort.
3. Write a program to implement Stack and its operation.
4. Write a program for quick sort.
5. Write a program for merge sort.
6. Write a program to implement Queue and its operation.
7. Write a program to implement Circular Queue and its operation.
8. Write a program to implement singly linked list for the following
operations: Create, Display, searching, traversing and deletion.
9. Write a program to implement doubly linked list for the following
operations: Create, Display, inserting, counting, searching, traversing and
deletion.
10 Write a program to implement circular linked list for the following
operations: Create, Display, inserting, counting, searching, traversing and
deletion.
11. Write a program to implement insertion, deletion and traversing in B tree
 B23-CSE- Object Oriented Programming Lab
211
Lecture Tutorial Practical Credit End Practical Total Time
Semester Exam
Exam
0 0 3 1.5 40 60 100 3 Hour
Purpose To introduce the principles and paradigms of Object Oriented Programming
Language for design and implement the Object Oriented System.
Course Outcomes (CO)
CO1 To introduce the basic concepts of object oriented programming language and the
its representation.
CO2 To allocate dynamic memory, access private members of class and
inheritance,Constructors.
CO3 To introduce polymorphism, interface design and overloading of operator.
CO4 To handle backup system using file, general purpose template and handling of
raised exception during programming.

Q1. Raising a number n to a power p is the same as multiplying n by itself p times. Write a
function called power
( ) that takes a double value for n and an int value for p, and returns the result as double
value. Use a default argument of 2 for p, so that if this argument is omitted, the number will
be squared. Write a main ( ) function that gets values from the user to test this function.
Q2. Write a C++ program that illustrates the order of execution of constructors and
destructors when new class is derived from more than one base class. b) Write a Program to
Invoking Derived Class Member Through Base Class Pointer.
Q3. Create the equivalent of a four function calculator. The program should request the user
to enter a number, an operator, and another number. It should then carry out the specified
arithmetical operation: adding, subtracting, multiplying, or dividing the two numbers. (It
should use a switch statement to select the operation). Finally it should display the result.
When it finishes the calculation, the program should ask if the user wants to do another
calculation. The response can be ‘Y’ or ‘N’. Some sample interaction with the program might
look like this.
Enter first number, operator, and second number: 10/ 3 Answer = 3.333333
Do another (Y/ N)? Y
Enter first number, operator, second number 12 + 100 Answer = 112
Do another (Y/ N) ? N
Q4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the
area code (212), the exchange (767) and the number (8900). Write a program that uses a
structure to store these three parts of a phone number separately. Call the structure phone.
Create two structure variables of type phone. Initialize one, and have the user input a number
for the other one. Then display both numbers. The interchange might look like this:
• Enter your area code, exchange, and number: 415 555 1212
• My number is (212) 767-8900
• Your number is (415) 555-1212
Q5. Create two classes DM and DB which store the value of distances. DM stores distances
in metres and centimeters and DB in feet and inches. Write a program that can read values
for the class objects and add one object of DM with another object of DB. Use a friend
function to carry out the addition operation. The object that stores the results maybe a DM
object or DB objects, depending on the units in which the results are required. The display
should be in the format of feet and inches or metres and cenitmetres depending on the object
on display.
 Q6. Create a class rational which represents a numerical value by two double values-
NUMERATOR and DENOMINATOR. Include the following public member Functions:
• constructor with no arguments (default).
• constructor with two arguments.
• void reduce( ) that reduces the rational number by eliminating the highest common factor
between the numerator and denominator.
• Overload + operator to add two rational number.
• Overload >> operator to enable input through cin.
• Overload << operator to enable output through cout. Write a main ( ) to test all the
functions in the class.
Q7. Consider the following class definition class father
{ protected : int age; public;
father (int x) {age = x;} virtual void iam( )
{ cout<< “I AM THE FATHER, my age is : ”<< age<< end1:}
};
Derive the two classes son and daughter from the above class and for each, define iam( ) to
write our similar but appropriate messages. You should also define suitable constructors for
these classes. Now, write a main ( ) that creates objects of the three classes and then calls iam
( ) for them. Declare pointer to father. Successively, assign addresses of objects of the two
derived classes to this pointer and in each case, call iam( ) through the pointer to demonstrate
polymorphism in action.
Q8. Write a program that creates a binary file by reading the data for the students from the
terminal. The data of each student consist of roll no., name ( a string of 30 or lesser no. of
characters) and marks.
Q9. A hospital wants to create a database regarding its indoor patients. The information to
store include
a) Name of the patient
b) Date of admission
c)Disease
d)Date of discharge
Create a structure to store the date (year, month and date as its members). Create a base class
to store the above information. The member function should include functions to enter
information and display a list of all the patients in the database. Create a derived class to
store the age of the patients. List the information about all the to store the age of the patients.
List the information about all the pediatric patients (less than twelve years in age).
Q10. Create a class Employee with a name and salary. Create a class Manager inherit from
Employee. Add an instance variable, named department, of type string. Supply a method to
to String that prints the manager’s name, department and salary. Create a class Executive
inherits from Manager. Supply a method to String that prints the string “Executive”
followed by the information stored in the Manager superclass object. Supply a test program
that tests these classes and methods.
Q11. Imagine a tollbooth with a class called toll Booth. The two data items are a type
unsigned int to hold the total number of cars, and a type double to hold the total amount of
money collected. A constructor initializes both these to 0. A member function called
payingCar( ) increments the car total and adds 0.50 to the cash total. Another function, called
nopayCar( ), increments the car total but adds nothing to the cash total. Finally, a member
function called displays the two totals. Include a program to test this class. This program
should allow the user to push one key to count a paying car, and another to count a
nonpaying car. Pushing the ESC kay should cause the program to print out the total cars and
total cash and then exit.
 Q12. Write a function called reversit( ) that reverses a string (an array of char). Use a for
loop that swaps the first and last characters, then the second and next to last characters and so
on. The string should be passed to reversit( ) as an argument. Write a program to exercise
reversit( ). The program should get a string from the user, call reversit( ), and print out the
result. Use an input method that allows embedded blanks. Test the program with Napoleon’s
famous phrase, “Able was I ere I saw Elba)”.

Q13. Create a class Student with a name and roll no. as data member. Create a Class
Template for student class. The program should also implement template overloading.
Q14. Assume that a bank maintains two kinds of accounts for customers, one called as
savings account and the other as current account. The savings account provides compound
interest and withdrawal facilities but no cheque book facility. The current account provides
cheque book facility but no interest. Current account holders should also maintain a
minimum balance and if the balance falls below this level, a service charge is imposed.
Create a class account that stores customer name, account number and type of account. From
this derive the classes
cur_acct and sav_acct to make them more specific to their requirements. Include necessary
member functions in order to achieve the following tasks:
a) Accept deposit from a customer and update the balance.
b) Display the balance.
c) Compute and deposit interest.
d) Permit withdrawal and update the balance.
e) Check for the minimum balance, impose penalty, necessary and update the balance.
f) Do not use any constructors. Use member functions to initialize the class members.
B23-CSE- IT Workshop (Python) Lab
213
L T P Credit Internal Practical Total Time
assessment Exam
0 0 2 1 40 60 100 3 Hours
Purpose The course is designed to provide Basic knowledge of Python.
Course Outcomes
CO1 To study fundamentals of python programming and implement basic
programs.
CO2 To implement the searching technique using python.
CO3 To implement sorting techniques using python.
CO4 To implement matrix multiplication using python.

LIST OF PROGRAMS

1. Write a program to compute the GCD of two numbers.

2. Write a program to find the square root of a number
3. Write a program to find the Exponentiation (power of a number)
4. Write a program to find the maximum of a list of numbers
5. Write a program for Linear search and Binary search
6. Write a program for Selection sort
7. Write a program for Insertion sort
8. Write a program to find first n prime numbers
9. Write a program to multiply matrices
10. Write a program that take command line arguments (word count)
11. Write a program to find the most frequent words in a text read from a file
 B23- Essence of Indian Traditional Knowledge
MAC-202
Lecture Tutorial Practical Credit Internal Practical Total Time
Assessment Exam
2 - - 1.0 100 - 100 3
Purpose To facilitate the students with the concepts of Indian traditional knowledge and to
make them understand the importance of roots of knowledge system, analyse and
apply to their day to day life.
Course Outcomes
CO 1 The students will be able to understand, connect up and explain basics of Indian
traditional knowledge in modern scientific perspective

CO2 The students will be able to understand Holistic Health using Indian Knowledge
System
CO3 The students will be able to manage thoughts and emotions, will learn positivity, self
regulation and control
CO4 The students will be able to achieve Consciousness through Indian Knowledge System

UNIT-1
Introduction to Indian Traditional knowledge: Define traditional knowledge, importance,
kinds of traditional knowledge. Philosophical systems, Basics of Rajyoga and Karamyoga,
Benefits of Rajyogaand Karamyoga.

UNIT-2
Holistic Health using Indian Knowledge System:
Basic principles of natural life style, Benefits through five elements. Healing through food,
Chakras and Mudras.
Physical, Mental, Emotional and Spiritual health using traditional knowledge .

UNIT-3
Positivity: Traditional approaches. Happiness: objective and subjective measures of
wellbeing, life satisfaction. Resilience, Self-regulation and self-control, optimism, self-
esteem. Managing thoughts and Emotions with the help of Rajyoga. Achieving Powers for
Self Mastery.

UNIT-4
Achieving Consciousness through Indian Knowledge System: Emotional intelligence,
Indian approach to Psychology. Consciousness; levels, body-mind relationship, self
motivation, Self and Identity in modern Psychology and Indian thought., Spirituality and well
being.

Reference and Text Books:

Mahadevan, M., Bhat, V.R. & Pavana N. (2022). Introduction to Indian Knowledge System:
Concepts and Applications. PHI Learning
● Baumgardner, SR & Crothers, MK (2009). Positive Psychology. Prentice
Hall/Pearson Education.
● Cornelissen, R.M., Misra G. & Varma S. (2014). Foundations & Applications of
Indian Psychology. Pearson Education.
Rajyoga Education and Consciousness Improvement Programme for Educators, Rajyoga
Education and Research Foundation.
Rajyoga Meditation Course, Thoughkart, Jaipur(Rajasthan), India.
PrakartikSwasthya Shastra, Publisher Natural Lifestyle