THIRD SEMESTER

Subject Code MA1201 Total Contact Hour 30

Semester 3rd Total Credit 3

Subject Name Mathematics–III

SYLLABUS
Module-I Random variables (Discrete and Continuous. Cumulative 6 Hrs
Distribution Function (CDF). Variance and standard deviation.
Moments. Functions of a random variable. Distributions: Binomial,
Poisson, normal, Gaussian, uniform (definitions and examples only).
Moment generating function.

Module-II Pairs of random variables. Joint probability density function. Joint 6 Hrs
probability mass function. Marginal distribution. Functions of two
random variables, PDF and expected values of the sum of two
random variables
Module-III Probability Models of n Random Variables. Vector notation. 6 Hrs
Independence of random variables and random vectors. Functions of
random vectors. Expected value vector and correlation matrix.
Module-IV Stochastic Processes. Definitions and examples. Types of stochastic 6 Hrs
processes. Random variables from random processes. The Poisson
process.
Module-V Markov Chains. Discrete-time Markov chain. Discrete-Time 6 Hrs
Markov chain dynamics. Limiting state probabilities for a finite
Markov chain. State classification.
Essential 1. Roy D. Yates, Rutgers and David J. Goodman, Stochastic Processes, 2d
Reading Edition, John Wiley and Sons, INC.
2. Gregory F Lawler, Introduction to Stochastic Processes, Chapman & Hall/
CRC Press (Taylor Francis Group).
Course The objective of this course is to familiarize the prospective engineers with
Outcomes techniques in Probability and Statistics. It aims to equip the students to deal
with advanced level of Statistics that would be essential for Engineering
disciplines.
CO1. To apply different distributions in real life problems of industries
CO2. To deal with problems that contains multivariable probability
distribution.
[Link] enrich knowledge Probability Models of multi-Random Variables.
CO4. To learn use of stochastic processes in daily life.
CO5. Application of eigen values in solving matrices.
Subject Code CS1201 Total Contact Hour 30

Semester 3rd Total Credit 3

Subject Name Digital Logic Design

Course 1. Provide students with basic idea of digital logic concepts.
Objective 2. Familiarize students with basic digital logic gates and their operations.
3. Expertise students with combinational logic circuits.
4. Analyze the operations of sequential logic circuits and designs.
5. Perform design of different Sequential Circuits.
SYLLABUS
Module-I Introduction to Digital Systems: Introduction to Digital electronics, 4 Hrs
Digital and Analog Signals and Systems, Binary Digits, Logic
Levels, Logic Systems Positive and negative, Combinational and
Sequential Logic Functions, Fixed-Function Logic Devices,
Programmable Logic Devices.
Number Systems and Codes: Introduction to Number Systems
(Decimal, Binary, Octal and Hexadecimal), Conversion from one
number system to other, Binary arithmetic operations,
Representation of Signed Binary Numbers, BCD code, EBCIDIC
code, Excess -3 code, Gray code, ASCII code.
Module-II Logic Gates: Logic variables, Logic Operators, Basic Logic Gates, 8 Hrs
Universal Gates and realization of Basic Gates using Universal
Gates, Gate Delay.
Boolean Algebra: Rules and laws of Boolean algebra, Demorgan’s
Theorems, Boolean expressions and Truth Tables, SOP and POS
forms, Minterm and Maxterms, Canonical forms of Boolean
expressions, Standard forms, Minimization Techniques for
simplification of Boolean expressions using Karnaugh Map, Design
of simple Logical Circuits.
Module-III Combinational Circuits: Introduction to combinational Circuits, Half 8 Hrs
Adder and Full Adder, Half Subtractor and Full Subtractor,
Ripple/Parallel adder, Adder-Subtractor, Look-Ahead Carry Adder.
BCD Adder, BCD Subtractor, BCD to Excess-3 and Excess-3 to
BCD Code Converter, Binary to Gray and Gray to Binary Code
Converter, Comparator, Parity Generator and Checker.
Multiplexer, De multiplexer, Decoder, BCD to Seven Segment
Display Decoder, Encoder, Priority Encoder.
Module-IV Sequential Circuits: Introduction to Sequential Circuits, Flip Flops- 6 Hrs
SR, D, JK, T, Triggering of Flip Flops, Master-Salve JK, Sequential
Circuit Design.
Shift Registers: Introduction to shift registers, Basic Shift Register
Operations, types of shift registers, Bidirectional Shift Registers,
Universal Shift Register.
 Module-V Counters: Introduction to counters, Synchronous and Asynchronous 4 Hrs
Counters, Decade Counter, Ripple Counter, Up/Down Counter,
Ring Counter and Twisted Ring Counter.

Essential 1. M. Morris Mano, Michael D. Ciletti, “Digital Design”, Prentice Hall of

Reading India Pvt. Ltd. / Pearson Education Pvt. Ltd.
2. Donald P. Leach and Albert [Link], “Digital Principles and
Applications”, TMH.
Supplementary 1. John [Link], “Digital Design”, Pearson/PHI.
Reading 2. Donald D. Givone, “Digital Principles and Design”, TMH.\
3. Charles [Link]. “Fundamentals of Logic Design”, Thomson Learning.
4. G. K. Kharate, “Digital Electronics”, OXFORD University Press.
5. Thomas L. Floyd, “Digital Fundamentals”, Pearson Education Inc.
Course CO1: Define and memorize concepts of digital circuit operation and
Outcomes principles,
CO2: Conceptualize and discuss different types of logic circuits, laws and
theorems.
CO3: Apply the knowledge of Boolean algebra, rules, theorems and concepts
to design and demonstrate various digital circuits.
CO4: Analyze, compare and differentiate the operations of various sequential
logic circuits.
CO5: Design various sequential circuits.
Subject Code CS1202 Total Contact Hour 30

Semester 3rd Total Credit 3

Subject Name Data Structures

Course 1. Introduce the basic idea of data structure, arrays, linked lists, stacks,
Objective queues, and algorithms.
2. Explore the linear data structures linked lists, Stacks, and Queues in more
detail.
3. Elaborate on non-linear data structures such as Graphs, Trees, BST,
Spanning trees, etc.
4. Discuss the Sorting and Searching algorithms and their operations.
5. Study the different hashing techniques in detail.

SYLLABUS
Module-I Introduction: Introduction to Data structures and Algorithms, 4 Hrs
Analysis of Algorithms, Asymptotic notations, Time and space
trade-off, Abstract Data Type. Arrays, Row/Column major
representation of Arrays, Sparse matrix.
Module-II Linked lists: Definition, types of linked list (Single, Double, 7 Hrs
Circular), operations on linked list, Application of linked list.
Stack: Representation, operations, and applications of Stack.
Queue: Representation, operations, and applications. Types of
Queues (Circular, Priority, Deque).
Module-III Tree: Introduction to tree, Binary tree - definitions and properties; 8 Hrs
binary tree traversal algorithms with and without recursion.
Binary Search Tree (BST): Operations on BST, AVL tree
balancing; B-tree; B+ tree, Heap.
Graph: Representation, Traversals (BFS and DFS).
Module-IV Sorting and Searching: Sorting: Internal vs. External sorting, Bubble, 6 Hrs
Insertion, Selection, Merge sort, Quick sort, Heap sort, Radix,
Searching: Linear, Binary Search.
Module-V Hashing: Introduction, Hashing techniques, Hash function, Address 5 Hrs
calculation techniques- common hashing functions. Collision
resolution techniques, Linear probing, quadratic probing, Double
hashing and Rehashing.
Essential 1. Introduction to Data Structures with Applications by J. Tremblay and P.
Reading G. Sorenson (TMH).
2. Classic Data Structures – Debasis Samanta (PHI).
Supplementary 1. Data Structures Using C – A.M. Tenenbaum (PHI).
Reading 2. Data structures with C-by Seymour Lipschutz (Schaum Outline Series).
3. Data Structures and Algorithm Analysis in C – M. A. Weiss (Pearson
Education).
4. Fundamentals of Data Structures in C -- by Horowitz, Sahni, and
Anderson-Freed (Silicon Press 2007).
5. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F.
Gilberg and B.A. Forouzan, Cengage Learning.
Course After completion of the course successfully, students will have:
Outcomes CO1: Ability to understand the data structure and its application.
CO2: Proficiency in selecting an efficient linear data structure and apply to
solve its problem.
CO3: Expertise in assessing efficiency trade-offs among different non-linear
data structures and implementations.
CO4: Ability to apply Sorting and Searching operations in real-world
problem solutions.
CO5: Ability to design the programs using different data structures and
hashing approaches.
Subject Code CS1203 Total Contact Hour 30

Semester 3rd Total Credit 3

Subject Name Database Engineering

Course 1. To know the basic concepts and architecture associated with DBMS and
Objective understand the data models.
2. To learn the various operations of relational algebra and know how to
create, maintain, and manipulate a relational database using SQL commands.
3. To understand the fundamentals of relational database design and apply
normalization steps on the database design for removal of data anomalies.
4. To learn the query processing steps and select the most efficient strategy
by applying query optimization algorithm.
5. To understand database transaction processing, concurrency control
schemes and recovery from database failure.
SYLLABUS
Module-I Introduction to Database and Data Models: Basics concepts of 6 Hrs
Databases and Database Management Systems, Database System
Architecture: Data Abstraction, Data Independence, Database
Schema, Three-Schema Architecture, Data models: Entity-
relationship model and Relational model.
Module-II Relational Query Languages: Relational Algebra, Relational 7 Hrs
Calculus, Introduction to Structured Query Language (SQL), Data
Definition Language (DDL), Data Query Language (DQL), Data
Manipulation Language (DML), Data Control Language (DCL),
Integrity Constraints.
Module-III Relational Database Design: Introduction to Relational database 8 Hrs
design, Functional dependencies, Armstrong’s Axioms, Dependency
Preservation, Lossless design, Introduction to Normalization,
Normal Forms: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF.
Module-IV Query Processing and Optimization: Basic Steps in Processing an 4 Hrs
SQL Query, Catalog Information for Cost Estimation, Measures of
Query Cost, Selection Operation, Join Operations, Equivalence
Rules, Query Optimization.
Module-V Transaction Processing: Transaction Concepts, Desirable 5 Hrs
Properties of Transactions, Schedules, Serializability of Schedules.
Concurrency Control and Recovery: Concurrency Control,
Concurrency Control Schemes: Lock-Based Schemes, Time
Stamping Methods, Database Recovery.
Essential 1. Elmasri & Navathe, “Fundamentals of Database systems”, Pearson
Reading Education.
2. A. Silberschatz, H. F. Korth, S. Sudarshan, “Database System Concepts”,
McGraw Hill International Edition.
Supplementary 1. BipinC. Desai, “An Introduction to Database Systems”, Galgotia
Reading Publication.
2. C. J Date, “An Introduction to Database Systems,” Pearson Education
India.
3. Ramakrishnan R &Gehrke, Database Management Systems (McGraw-
Hill)

Course CO1: Understand the basic concepts, database modeling and architecture
Outcomes associated with DBMS.
CO2: Use DDL and DML to query, update, and manage a database
CO3: Understand the need of normalization and the various normal forms for
a good relational database design
CO4: Gain knowledge on the basics of query evaluation techniques and query
optimization.
CO5: Understand the basic issues and concepts associated with transaction
processing and concurrency control.
Subject Code CS1204 Total Contact Hour 30

Semester 3rd Total Credit 2

Subject Name Object Oriented Programming

Pre-requisites C Programming
Course 1. To understand principles of object-oriented programming in a higher-level
Objective programming language.
2. Analyze a problem statement and develop program using class, object and
basic concept of object-oriented programming.
3. Utilize polymorphism and object-oriented concept to frame object-oriented
programming.
4. Gain skills in designing, and programming for reuse of code using
inheritance
5. Establish development methods in object-oriented programming for
exception handling and templates.
SYLLABUS
Module-I Principles of object-oriented programming: Object oriented 5 Hrs
programming (OOP) paradigm, basic concepts, Benefits of OOP,
Disadvantages of conventional programming, Beginning with C++.
Evolution of C++, Application of OOP.

Classes and Objects: Basic structure of OOP. Declaring classes and

objects. Class Access-specifier: public, private and protected.
Defining member functions, Characteristics of member functions,
classes, objects and memory, array of objects, local classes, new and
delete operator.
Module-II Functions In C++: The main function, function prototype, call by 7 Hrs
reference, return by reference, returning more values by reference,
default arguments, constant argument, inline functions, Rules for
inline functions. Static variable, function and object. Friend function.
Recursive member function. Object as argumentsConstructors And
Destructors: Introduction, Characteristics of constructors and
destructors, types of constructors, overloading constructors,
constructors with default arguments. Copy constructors, Dynamic
constructor. Dynamic initialization using constructors. Destructors.
Calling constructors and destructors, Anonymous objects.
Module-III Polymorphism: Introduction to polymorphism and types. Function 5 Hrs
overloading, operator overloading, overloading of unary operators,
overloading of binary operators, Overloading with friend function.
Rules for overloading operators. Type conversion.
 Module-IV Inheritance: Introduction, types of inheritance: single inheritance, 7 Hrs
multilevel inheritance, multiple inheritance, hierarchical inheritance,
hybrid inheritance, multipath inheritance, pointer to derived classes
and base classes, pointer to members, Accessing private members
with pointers. Constructors, Destructors and polymorphism in
inheritance, Object asa class member, Virtual class, function and
pure virtual function. Abstract Classes.
Module-V Exception handling: Introduction, Principles of Exception handling, 6 Hrs
the keyword try, throw and catch, Exception handling mechanism,
multiple catch statements, Catch multiple Exceptions, Re-throwing
Exception.
Generic programming with Templates: Introduction, need of
template, Definition of class template, Normal function template,
working of function templates, Class template with more parameters,
Function template with Arguments and multiple parameters.
Essential 1. E. Balagurusamy – Object Oriented Programming with C++, TMH
Reading publication.
2. Ashok N. Kamthane- Object oriented programming with ANSI & Turbo
C++,Pearson Education.
Supplementary 1. Programming with C++, ReemaThareja, Oxford University Press.
Reading 2. H. Schildt – C++, The Complete Reference, TMH.
Course CO1: Implement basics of object-oriented programming
Outcomes CO2: Apply object-oriented concept to implement programs using classes,
objects.
CO3: Demonstrate polymorphic behavior of objects and apply in real-life
problem statement.
CO4: Analyze and implement programs using Inheritance.
CO5: Apply object-oriented approach to develop software incorporated with
exception handling and templates.
Subject Code HS1201 Total Contact Hour 30

Semester 3rd Total Credit 2

Subject Name Engineering Economics

SYLLABUS
Module-I Basic Principles of Economics: Definition, Nature, Scope and 6 Hrs
significance of economics for Engineers. Demand & Supply and their
Determinants, Elasticity-Government policies and application. Basic
Macroeconomics concept: National income accounting
(GDP/GNP/NI/Disposable Income etc.) and identities for both closed and
open economies.
Module-II Utility Analysis: Cardinal and ordinal measurability of utility, 6 Hrs
Assumptions of cardinal utility analysis, law of diminishing marginal
utility, Consumer’s equilibrium: Principle of equi-marginal utility;
Indifference curve-Concepts, properties, Budget line, Equilibrium of the
consumer, Revealed preference hypothesis, Individual choice under Risk
and Uncertainty: St. Petersburg paradox and Bernoulli’s hypothesis,
Neumann-Morgenstern method of constructing utility index, Friedman-
Savage hypothesis
Module-III Production, Cost and Market Structure: Production function: short 6 Hrs
run production function and law of variable proportion; Long run
production function: Isoquants, isocost line, returns to scale, Optimum
factor combinations, Cost Analysis: Concepts, Classification- Short run
and Long run cost curves, Analytical and accounting cost concepts;
Market structure: Market classifications, Perfect competition:
Characteristics, price and output determination in Short run and long run,
Monopoly market: Price and output determination, price discrimination
Modern theories of firms: Baumol’s theory of sales revenue
maximisation, Bain’s limit pricing model.
Module-IV Money and Banking: Money-Function of Money, Demand for Money 6 Hrs
Theory. Quantity theory of money; Banking: Commercial Banks and
their Functions, Central bank’s Functions. Role of the Banks in Economic
Development, Monetary and Fiscal Policy Tools and their impact on the
economy.
Module-V Capital Budgeting and Investment Analysis: Time value of money: 6 Hrs
use of cash flow diagram, Annual economic worth, present worth, future
worth, Internal Rate of Return (IRR), Net Present Value (NPV), Payback
period method, Analysis of public projects: Cost-Benefit analysis, Cost
effectiveness.
Essential 1. Koutsoyiannis, A. (1979). Modern Microeconomics. The Macmillan Press
Reading Ltd., London
2. Pindyck, R. S., D. N. Rubinfeld and P. L. Meheta (2009). Microeconomics,
Pearson India, New Delhi.
3. Panneerselvam, R. (2007). Engineering Economics, Prentice-Hall of India,
New Delhi.
4. Mankiw Gregory N. (2002). Principles of Economics, Thomson Asia.
Course CO1- Utilise economics principles in consumption process
Outcomes CO2- Describe the utility measurement and measure the utility associated with
risk
CO3- Efficient use of resources in production and take decision regarding
optimum output
CO4- Describe market mechanism and analyse product market to take proper
decisions
CO5- Implement economic principles in company related decision making
 SESSIONALS

Subject Code CS1281 Total Contact Hour 20

Semester 3rd Total Credit 1.5

Subject Name Digital Logic Design Laboratory

Course 1. Provide students basic idea of realization of Logic Gates.
Objective 2. Familiarize students with Boolean algebra and different circuit
simplification techniques.
3. Analyze the operations of combinational logic circuits functions.
4. Expertise the students for implementation of logic circuits with minimum
Gates.
5. Test and verify the implementation knowledge of students by a small
project.

List of Experiments
1 (i) Realization of Logic Gates.
(ii) Realization of basic Logic Gates using Universal Logic Gates.
2 Design Logic Circuit of some given Boolean expressions after simplification
using Boolean Algebra.
3 Design Logic Circuit of some given Boolean expressions after simplification
using K-Map.
4 (i) Design Half and Full Adder.
(ii) Design Half and Full Subtractor.
5 (i) Design 3-bit Adder-Subtractor circuit using Logic Gates.
(ii) Design 3-bit Adder-Subtractor circuit using Adders.
6 Design 4-bit BCD Adder.

7 (i) Design BCD to Excess-3 code convertor.

(ii) Design Excess-3 to BCD code convertor.
8 (i) Design Binary to Gray code converter.
(ii) Design Gray to Binary code converter.
9 Design 2-bit/4-bit Comparator.
10 Small Hardware Project design.
 Course CO1: Realize the concepts of digital Logic Gate operations and principles,
Outcomes CO2: Conceptualize different types of Boolean Algebra laws, rules and
theorems for circuit simplification.
CO3: Apply the knowledge of Boolean algebra, rules, theorems and concepts
to design and demonstrate various digital circuits with minimum Logic Gates.
CO4: Analyze, compare and differentiate the operations of various
combinational circuits.
CO5: Design, implement and test various logic circuits.
Subject Code CS1282 Total Contact Hour 20

Semester 3rd Total Credit 1.5

Subject Name Data Structures Laboratory

Course 1. To implement data structures and analyze them for real-world problem-
Objective solving.
2. To implement and analyze the searching algorithms in the context of
specific engineering problems.
3. Study to choose the appropriate data structure and algorithm design method
for a specified application.
4. Understand the different data structures to apply in different application
problem scenarios.
List of Experiments
1 Write a C Program for Traversal, Insertion, and Deletion operations of
elements in an array.
2 Write a C Program to create a stack and perform stack operations (using
array).
3 Write a C Program to create a queue and perform Queue operations.(using
array)
4 (i) Write a C Program that uses Stack Operations to perform conversion of an
infix expression into a postfix expression.
(ii) Write a C Program that uses Stack Operations to perform evaluating of
the postfix expression
5 (i) Write a C Program that uses functions to perform the following operations
on a single linked list: i) Creation, ii) Traversal, iii) Insertion, iv) Deletion
(ii) Write a C Program that uses functions to perform the following operations
on a double-linked list: i) Creation, ii) Insertion, iii) Deletion.

6 Stack and Queue Operations using Linked List.

7 Write a C Program that uses functions to implement the Binary Tree
algorithm to perform the following operations: i) Traversal, ii) Creation, iii)
Insertion, iv) Deletion.
8 Write C Programs to implement code on: i) Bubble sort, ii) Selection sort, iii)
Insertion sort, iv) Heap sort
9 A ) Write C Programs to implement code on: i) Quick sort, ii) Merge Sort
B) Write C Programs to demonstrate operations on: i) Sequential
Search, ii) Binary Search.
10 Write a c program on the graph implementation and its DFS and BFS
methods.
 Course CO1: Ability to learn and implement operations performed on data structures.
Outcomes CO2: Improved skill in choosing and developing data structure applications
in real-world scenarios.
CO3: Potential to demonstrate and implement different linked list operations.
CO4: Ability to develop different tree structures such as a binary tree, BST
(Binary Search Tree), Heap tree, etc.
CO5: Expert in choosing and developing searching and sorting algorithms
suit for given scenarios.
Subject Code CS1283 Total Contact Hour 20

Semester 3rd Total Credit 1.5

Subject Name Database Engineering Laboratory

Course 1) To know the fundamentals of MySQL and be familiar with SQL syntax of
Objective various operations.
2) To know how to create, maintain, and manipulate a relational database
using SQL commands.
3) To know how to combine rows from two or more tables based on a related
column between them.
4) To be familiar with the usage of arithmetic operators, conditional
restrictions, logical operators and SQL aggregate functions.
5) To acquire knowledge on writing sub-queries and views.
List of Experiments
1 Introduction to MySQL and basic commands for creating a database using
CREATE DATABASE command and viewing it by SHOW DATABASES
command.
2 (i) Build a database by creating table structures using the various data types
and the CREATE TABLE command in MySQL.
(ii) Apply various SQL constraints (NOT NULL, UNIQUE, PRIMARY
KEY, DEFAULT, etc.) to the MySQL tables.
3 (i) Use of MySQL for deleting tables and displaying the structure of an
individual table,
(ii) Use of MySQL to list all the tables that have been created within a
database, altering a table structure by ALTER TABLE command.
4 (i) Use of MySQL to INSERT, UPDATE and DELETE data from within a
table.
(ii) Use of MySQL to retrieve data from a table using the SELECT statement.
5 Use of MySQL to apply arithmetic operators in SQL statements.
6 Use of MySQL to select rows from a table with conditional restrictions.
7 (i) Use of MySQL to apply logical operators to combine multiple conditions.
(ii) Write queries in MySQL on given exercises involving arithmetic
operators, conditional restrictions and logical operators.
8 (i) Use of MySQL to sort the data in the resulting query by applying ORDER
BY clause (ascending (ASC) or descending (DESC)).
(ii) Use of MySQL to perform mathematical summaries through the use of
aggregate (or group) functions.
9 Use of MySQL to perform join operations that merge rows from two or more
tables satisfying certain join condition.
 10 (i) Use of MySQL to create sub-queries in MySQL.
(ii) Write query to create views in MySQL using CREATE VIEW command.
Course CO1: Be familiar with fundamentals of MySQL and SQL syntax of various
Outcomes operations.
CO2: Be able to create, maintain, and manipulate a relational database by
applying appropriate SQL commands.
CO3: Be able to combine rows from two or more tables using different join
operations.
CO4: Be familiar with the usage of usage of arithmetic operators, conditional
restrictions, logical operators and SQL aggregate functions.
CO5: Be able to create SQL sub-queries and views.
Subject Code CS1284 Total Contact Hour 20

Semester 3rd Total Credit 1.5

Subject Name Object Oriented Programming Laboratory

Course 1. To understand principles of object-oriented programming in a higher-level
Objective programming language.
2. Analyze a problem statement and develop program using class, object and
basic concept of object-oriented programming.
3. Utilize polymorphism and object-oriented concept to frame object-oriented
programming.
4. Gain skills in designing, and programming for reuse of code using
inheritance
5. Establish development methods in object-oriented programming for
exception handling and templates.
List of Experiments
1 (i) Study of C++ Standard library functions in object oriented programming
(OOP).
(ii) Write a program illustrating class declarations, definition, and accessing
class members.
2 (i) Write a program on static variable, static function and static object.
(ii) Program using inline functions in object oriented programming
3 (i) Program on function overloading.
(ii) Write a program to demonstrate friend function and friend class.
4 Write a program to demonstrate the use of Constructor and Destructor in
OOP.
5 Write a program to illustrate unary and binary operator overloading.
6 Write a program on type conversion.
7 Write a program to demonstrate types of inheritance.
8 Write a program on function overriding.
9 (i) Write a program using exception handling
(ii) Write a program to demonstrate the catching of all exceptions.
10 Write a program using function template and class template.
 Course CO1: Define and memorize basics implementation of object-oriented
Outcomes programming (OOP).
CO2: Design and implement class and object to solve problem.
CO3: Demonstrate polymorphic behavior of objects and apply in real-life
problem statement.
CO4: Analyze and implement programs using Inheritance.
CO5: Able to establish development methods in object-oriented
programming for exception handling and templates.
 FOURTH SEMESTER

Subject Code MA1204 Total Contact Hour 30

Semester 4th Total Credit 3

Subject Name Discrete Mathematics

SYLLABUS
Module-I Logic: Proposition and logical operation, conditional statement, 6 Hrs
methods of proof, mathematical induction. Counting principle:
permutation and combination, principle of inclusion and exclusion,
pigeonhole principle.
Module-II Relations: Properties of relations, equivalence relations, closure 6 Hrs
properties of relations, transitive closure by Warshall's algorithm.
Module-III Recursive definition and structural induction, recurrence relations, 6 Hrs
solution to recurrence relations, generating functions, partially
ordered sets, Hass diagram, lattice, finite Boolean algebra.
Module-IV Graph Theory: Introduction to graph theory, Graph terminology, 6 Hrs
Representation of graphs, Isomorphism, Euler and Hamiltonian
paths, Planar graph, Graph coloring, Introduction to trees,
Application of trees.
Module-V Semi groups, monoids, groups, subgroups, cosets, Lagrange 6 Hrs
theorem, permuation groups,
isomorphism, homomorphisms, normal subgroups, definitions and
examples only for (Rings, integral domain and fields).

Essential 1. Kenneth H Rosen, "Discrete mathematics and its applications", McGraw

Reading hill international.
2. C.L Liu, "Elements of Discrete mathematics" McGraw hill international
3. B. Kolman, R C Bosby. S Ross, " Discrete mathematical structure", PHI
Course The objective of this course is to familiarize the prospective engineers with
Outcomes techniques in Discrete Mathematics. It aims to equip the students to deal with
advanced level of Discrete Mathematics that would be essential for
Engineering disciplines, especially for Computer Science, IT, Electronics,
Electrical Engineering.
THE STUDENTS WILL LEARN:
CO1. To enrich knowledge of inference and logic
CO2. To deal with problems that involves Warshall's algorithm.
CO3. To apply Boolean algebra in engineering fields.
[Link] learn applications of graph theory in daily life
[Link] be familiar with groups, rings and fields in industry.
Subject Code CS1206 Total Contact Hour 30

Semester 4th Total Credit 3

Subject Name Computer Organization and Architecture

Pre-requisites Concept of Digital Logic Design

Course 1. Provide students with basic idea of Different components of the Computer
Objective System and Computer arithmetic.
2. Familiarize students with the Instruction set Architecture and CPU
organization.
3. Expertise students with Memory Design and Memory Operations, Memory
characteristics.
4. Analyze the I/O operations, Compare different data transfer techniques and
modes of data transfer.
5. Perform performance analysis of the system.
SYLLABUS
Module-I Introduction: Basic Organization of Computers, Basic Operational 6 Hrs
concepts, Registers, Data bus, Address bus, Control bus, Types of
Bus, Concept of Harvard Architecture and Von-Neumann
Architecture, IAS Computer.
Computer Arithmetic: Binary Arithmetic operation, Decimal
Arithmetic Operation, Floating Point Representation and Arithmetic
operation, General Multiplication, Booth Multiplication
Algorithms, Array Multipliers and Division Algorithms
Module-II Instruction Set Architecture: General Instruction Format, Three 8 Hrs
Address, Two Address, One Address and Zero Address Instruction,
Addressing Modes, Types of Instruction, Instruction Cycle.
CPU Organization: Data Path, Single bus Data Path, Register
transfers, Fetching and storing a word in Memory, Control sequences
for operation of an Instruction, Multi bus Data Path, Simple ALU
Design, Control Unit Operation: Hardwired Control Unit and Micro
Programmed Control Unit, Control Word, Stack Organization, RPN,
Evaluation of Arithmetic expression using RPN, Subroutine, Nested
Subroutine.
Module-III Memory Organization: Computers Memory System Overview, 8 Hrs
Characteristics of Memory System, Memory Hierarchy, Memory
Classification, Semi-Conductor Memory Organization, Memory
Cell Operation. Cache Memory: Cache Principles, Levels of Cache,
Cache Hit and Miss, Write Policies, Cache Mapping functions,
Cache Page Replacement Algorithms. Virtual Memory, Virtual
Memory Page replacement Algorithms, Associative Memory,
Memory Interleaving.
 Module-IV Input/Output Organization and Communication: Peripheral Devices, 4 Hrs
Accessing I/O Devices, I/O Interface, Interrupt.
Types of Data Transfer: Parallel and Serial Data Transfer,
Synchronous Data Transfer, Asynchronous Data Transfer, Strobe
Control, Handshaking, Asynchronous Serial Transfer.
Modes of Transfer: Programmed I/O, Interrupt Initiated I/O, Direct
Memory Access (DMA), DMA Controller, I/O Channel &
Processor.
Module-V Parallel Processing: Introduction to Pipelining, Instruction Pipeline, 4 Hrs
Arithmetic Pipeline, Speedup, Efficiency, Throughput, Pipeline
Hazards.
RISC and CISC Architecture.
Essential 1. V. Carl Hamacher, Z. G. Vranesic, and S. G. Zaky, “Computer
Reading Organization”, TMH.
2. M. Mano, “Computer System Architecture”, Prentice Hall of India Pvt.
Ltd. / Pearson Education Pvt. Ltd.
Supplementary 1. William Stallings, “Computer Organization & Architecture”, Prentice Hall
Reading of India Pvt. Ltd. / Pearson Education Pvt. Ltd.
2. John P. Hayes, “Computer Architecture and Organization”, TMH.
3. D. A. Patterson and J. L. Hennessy, “Computer Organization and Design”,
Morgan Kaufmann Publishers (Elsevier).
4. Kai Hwang and Faye A. Briggs, “Computer Architecture Parallel
Processing”, TMH.
Course CO1: Define and memorize different functional units and components of
Outcomes Computer.
CO2: Conceptualize and discuss different types of Instruction, Instruction
format, Instruction Cycle, Addressing Modes and CPU organization.
CO3: Design different types of Memory and CU.
CO4: Analyze, compare and differentiate Data transfer techniques.
CO5: Solve different Pipeline and Pipeline Hazard problems.
Subject Code CS1207 Total Contact Hour 30

Semester 4th Total Credit 3

Subject Name Design and Analysis of Algorithms

Course 1. To understand asymptotic notations to analyze the performance of
Objective algorithms
2. To identify the differences in design techniques and apply to solve
optimization problems,
3. To apply algorithms for performing operations on graphs and trees, solve
novel problems by choosing the appropriate algorithm design technique for
their solution.
4. To justify the selection of algorithms
5. To analyze deterministic and nondeterministic algorithms to solve complex
problems.
SYLLABUS
Module-I Introduction to Design and analysis of algorithms, Asymptotic 5 Hrs
analysis, Growth of Functions, Asymptotic notations, Recurrences,
Solution of Recurrences by substitution, Recursion tree method,
Master Method, Brute Force Technique, Divide and Conquer
Algorithms, Quicksort, Merge Sort, Binary Search, Strassen’s
Matrix multiplication, Decrease and Conquer, Heap Sort.
Module-II Dynamic Programming: Elements of Dynamic Programming, 7 Hrs
Matrix Chain Multiplication, Longest Common Subsequence, 0/1
Knapsack, Travelling Salesman Problem.
Greedy Algorithms: Elements of Greedy Strategy, Activity Selection
Problem, Fractional Knapsack Problem, Huffman Codes.
Module-III Data Structure for Disjoint Sets, Disjoint Set Operations, Minimum 7 Hrs
Spanning Trees: Kruskal algorithm, Prim's Algorithm, Single Source
Shortest paths: Bellmen Ford Algorithm, Dijkstra's Algorithm, All
Pair Shortest Path: Floyd-Warsall Algorithm,
Module-IV String matching: Introduction, Naive string matching algorithm, 6 Hrs
Rabin-Karp Algorithm, KMP Algorithms, Boyer- Moore Algorithm.
Backtracking and Branch and Bound: Introduction, Eight queens
problem , Knapsack problem
Module-V Introduction to NP completeness: The class P and NP, NP- Complete 5 Hrs
Problems, NP-Hard Problems, Reduction, Satisfiability and Cook’s
Theorem, Travelling Salesman problem, Hamiltonian problem,
Clique Problem, Approximation algorithms.
Essential 1.T.H. Coremen, C. E. Leiserson, R.L. Rivest, C. Stein “Introduction to
Reading Algorithms”3rd Edition, The MIT Press
2. S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, Algorithms,
McGraw Hill Education
Supplementary 1.M.R. Kabat “Design and Analysis of Algorithms”, PHI Learning (p) Ltd
Reading 2. S. Sridhar “Design and Analysis of Algorithms”, Oxford University Press
3. A.V. Aho, J.E. Hopcroft, J.D. Ullman “The Design and Analysis of
Algorithms” Pearson Education, NewDelhi
4. K, Louden “ Mastering Algorithms”, O’ Reily Media Inc
Course After completion of the course successfully, students will have:
Outcomes CO1: Ability of analyzing the performance of algorithms and of finding
solution of divide and conquer algorithm.
CO2: Proficiency in finding optimal solutions to various problem
CO3: Expertise to find MST and shortest path problem.
CO4: Ability to apply pattern matching algorithms to find particular pattern.
CO5: Ability to differentiate polynomial and non-polynomial problems.
Subject Code CS1208 Total Contact Hour 30

Semester 4th Total Credit 3

Subject Name Computer Networks

Pre-requisites Basic Electronics, Computer Architecture.

Course 1. Introduce the foundational principles and terminology of computer
Objective networks, including protocols, architectures, and topologies.
2. Understand how data is transmitted across networks, including concepts
like packet-switching, error detection/correction, and analyzes data collision
with various protocols
3. Examine multiple accesses, network addressing, and routing in computer
network.
4. Apply various routing algorithms over a network to provide optimal path,
and examine the addressing entities of a network, study and implementation
of transport layer protocols like TCP, UDP.
5. Understand how networks support various applications and services, such
as web browsing, email, file sharing, through different protocols

SYLLABUS
Module-I Introduction: Overview of Data Communications and Networking. 6 Hrs
Goals of networking, well-known applications such as web, e-mail,
need for a layered architecture, OSI and Internet. The physical layer:
Basics of communications; Physical media types and their important
bandwidth and bit-error-rate characteristics; Wired and Wireless
media including copper cables, optical fiber and wireless, Switching
Networks.

Module-II Data Link Layer: Error Detection and correction, Types of Errors, 6 Hrs
Detection, Error Correction, Data Link Control and Protocols, Flow
and Error Control, Stop-and-wait ARQ. Go-Back-N ARQ, Selective
Repeat ARQ, HDLC, Point–to-Point Protocol.

Module-III Multiple Access, Random Access, Controlled Access, 6 Hrs

Channelization. Local area Network: Ethernet, Traditional Ethernet,
Fast Ethernet. Network Layer: Host to Host Delivery,
Internetworking, addressing, Routing.
Module-IV Network Layer Protocols: ARP, RARP, NAT, BOOTP, DHCP, 8 Hrs
IPV4, ICMP, IPV6, ICMPV6. Transport Layer: Process to Process
Delivery: UDP, TCP, congestion control and Quality of service.
 Module-V Application Layer: Client Server Model, Peer to peer network, 4 Hrs
Domain Name System (DNS): Electronic Mail (SMTP) and file
transfer (FTP) HTTP and WWW.

Essential 1. Data Communications and Networking: Behrouz A. Forouzan, Tata

Reading McGraw-Hill, 5th Ed
2. Computer Networks: A. S. Tannenbum, D. Wetherall, Prentice Hall,
Imprint of Pearson 5th Ed.
Supplementary 1. Computer Networks: A system Approach: Larry L, Peterson and Bruce S.
Reading Davie, Elsevier, 4th Ed
2. Computer Networks: Natalia Olifer, Victor Olifer, Willey India
3. Data and Computer Communications: William Stallings, Prentice Hall,
Imprint of Pearson, 9th Ed.
4. Data communication & Computer Networks: Gupta, Prentice Hall of India
5. Network for Computer Scientists & Engineers: Zheng, Oxford University
Press
6. Data Communications and Networking: White, Cengage Learning

Course CO1: Analyze the concepts of networks, types and architectures.

Outcomes CO2: Identify error free transmission of data and analyze data collision with
various protocols.
CO3: Apply various routing algorithms over a network to provide optimal
path.
CO4: Examine the addressing entities of a network with implementation of
TCP, UDP protocols.
CO5: Illustrate the real time applications of networks Protocols.
Subject Code CS1205 Total Contact Hour 30

Semester 4th Total Credit 2

Subject Name Programming in Python

Course 1: Introduction to Python Language and its features.
Objective 2: To understand the concept of Python Program using sequence data and
Control statements.
3: To be able to understand and create User Defined Function.
4: To understand the concept of OOPs and its implementation.
5: To understand the concept of strings and file handling

SYLLABUS
Module-I Python Basics: 6 Hrs
Introduction to Python Features of Python, Application of Python
Data Types, Keywords, Identifiers, Literals, Constants. Python
Indentation. Operators and expressions. Naming Conventions with
examples, Managing Input and Output, Concept of Indentation.
Conditional statement, Looping statements, break and continue, pass
& return statements, Nesting of loops.
Module-II Modules: Built-in Modules, Import statement, Packages, Date and 8 Hrs
Time Modules.
Array and its operations, Handling Strings and Characters, List:
slicing, bound, cloning, nested list, list and methods, Adding
Element: append, extend, count, index and insert). Mutability: Sort,
reverse, remove, clear and pop. Map, Filter
Module-III Tuple and methods, Sets and methods, Dictionary: Basic operation, 6 Hrs
iterator and methods.
Function: Introduction to Functions, passing arguments, Anonymous
functions (Lambda Function), Recursive Functions.
Module-IV Object Oriented Programming: Classes and Objects, Class methods. 6 Hrs
Encapsulation, Data Abstraction, Constructor, Destructor and
Inheritance.
Exception Handling: Handling Exceptions: try-except, try-finally
Module-V Strings and Regular Expressions: Methods of String Objects, Escape 4 Hrs
Sequence, Iterating Strings, String Module, String Formatting,
Regular Expressions: Re-Module
File Handling: Introduction to File Handling, File Operations,
Directories.
Essential 1. Python Programming Python Programming for Beginners by Adam
Reading Stewart.
2. Python Cookbook By David Beazley and Brian K. Jones.
Supplementary 1. Introduction to Python Programming by Gowrishankar S. Veena A.
Reading 2. Python Programming: Using Problem Solving Approach, Oxford
University Press by Reema Thareja.
3. Python Programming University Press by Ch Satyanarayan, M Radhika, B
N Jagadesh.
Course CO1: Understand the Python Language and its features.
Outcomes CO2: Apply sequence data and control statements to solve problem
CO3: Able to create user defined functions to solve problems.
CO4: Analyze the concept of OOPs and its implementation.
CO5: Create the python program using strings and files.
Subject Code HS1202 Total Contact Hour 30

Semester 4th Total Credit 2

Subject Name Organizational Behaviour

Course 1: To understand the relevance of organizational behavior concepts and
Objective theories in real-life organizational settings & to develop skills in critical
thinking, decision –making, problem-solving in applying organizational
behavior concepts to practical situations.
2: To provide an understanding of individual behavior in the workplace,
including personality, motivation, perception, learning, and attitudes.
3: To understand the impact of team composition, diversity, and
communication on team performance & to understand the role of motivation
and leadership in managing organization.
4: To explore how organizational culture affects behavior, communication
and decision making by enhancing creativity and innovation and give an
episteme how to cope with change and stress.
5: To Develop intercultural competence, including awareness, knowledge,
and skills for effective communication, negotiation, and collaboration across
culture
SYLLABUS
Module-I Fundamentals of OB & Understanding the Basic Framework of 6 Hrs
OB: Evolution of OB through Quality Management movement,
Definitions, Scope & Importance of OB, Challenges (Diversity,
Globalization & Ethical Perspective) and opportunities for OB,
models of OB, applying OB to solving problems.
Module-II Understanding the Determinants of Individual Behavior: 6 Hrs
Personality: Determinants of personality, Theories of Personality
(Type &Psychoanalytic theory), MBTI, Big five personality traits
and other major traits influence workplace behavior.
Perception: Meaning, Perceptual Process, Application of Perception
at Workplace.
Motivation: Motivation Framework, Content theory (Maslow’s
need hierarchy & Hertzberg’s two factors theory), Process theory
(Adam’s Equity & Vroom’s Expectancy theory), Job Design and
motivation, Importance of motivation at Workplace.
Learning: Theories of learning (Classical Conditioning, Operant
Conditioning, & Cognitive Theory), Principles of Learning.
Bhavioral modification through learning.
 Module-III Understanding Group and Team Behavior at Workplace: 6 Hrs
Group & Team: Defining and classifying groups, the five-stage
model of group development Group properties: Roles, norms, status,
size and cohesiveness, Group decision making.
Leadership: Meaning, Definition & types of leadership, Traditional
theories of leadership: Trait theories, Behavioral theories,
Contingency theories, Contemporary approaches to leadership,
importance of leader in organizations.
Module-IV Understanding Group and Team Behavior at Workplace: 6 Hrs
Organizational Culture: Meaning, Definition, Cultural
dimensions, effect of Organizational culture.
Organizational Change & Development: Nature, Levels & types
of Change, Change Agents: Resistance to Change, Force field
theory of Change, Managing the Change.
Module-V Conflict & International Organizational Behavior: 6 Hrs
Managing Conflict and Negotiations: Meaning, views, & levels of
Conflict, Process of conflict, Conflict resolution techniques.
Transactional Analysis: Meaning, Importance of TA, Life position,
Ego states and their encounters.
IOB: Internationalization of Business, Cultural differences and
similarities, Understanding Interpersonal behavior across culture
through Hofstede’s Cultural Dimensions.
Essential 1. "Organizational Behavior: Text, Cases, & Games" by K. Aswathappa.
Reading Publisher: Himalaya Publishing House
2. "Essentials of Organizational Behavior" by Stephen P. Robbins and
Timothy A. Judge. Publisher: Pearson Education.

Supplementary 1. "Organizational Behavior: Improving Performance and Commitment in the

Reading Workplace" by Jason A. Colquitt, Jeffery A. LePine, and Michael J. Wesson.
Publisher: McGraw-Hill Education.
2. "Organizational Behavior: Human Behavior at Work" by John W.
Newstrom and Keith Davis. Publisher: McGraw-Hill Education.
3. "Organizational Behavior: An Evidence-Based Approach" by Fred
Luthans. Publisher: McGraw-Hill Education.
4. "Organizational Behavior: Emerging Knowledge, Global Reality" by
Steven L. McShane and Mary Ann Von Glinow. Publisher: McGraw-Hill
Education.
5. "Organizational Behavior and Management" by Ivancevich, Konopaske,
and Matteson. Publisher: McGraw-Hill Education.
6. "Organizational Behavior: Theory, Research, and Practice" by John R.
Schermerhorn Jr., James G. Hunt, and Richard N. Osborn. Publisher: Wiley
 Course CO1. Explain the importance of organizational behavior in improving
Outcomes individual and organizational effectiveness with Ethical practices.
CO2. Evaluate the effectiveness of different leadership styles and their
application in different situations.
[Link] critical thinking, Creativity& Innovation, problem-solving,
and communication skills necessary for success in organizational settings.
CO4. Develop strategies for managing organizational change effectively and
maintaining sustainability.
CO5. Apply organizational behavior concepts and theories to practical
organizational situations.
 SESSIONALS

Subject Code CS1286 Total Contact Hour 20

Semester 4th Total Credit 1.5

Subject Name Computer Organization and Architecture Laboratory

Course 1. Provide students with basic idea of different Combinational and Sequential
Objective circuits.
2. Enhance circuit implementation capabilities of students.
3. Familiarize students with the different functional units of the computer.
4. Expertise students with Memory Design and Memory Operations
5. Design of a small project

List of Experiments
1 (i) Design 8-to-1 Multiplexer.
(ii) Design 1-to-8 DeMultiplexer.
(iii) Design 3-to-8 Decoder.
2 Design BCD to Seven Segment display Decoder.
3 (i) Design 8-to-3 Binary Encoder.
(ii) Design 4-to-2 Priority Encoder.
4 Design 4×3 Array Multiplier.
5 Design a Universal Shift Register.
6 (i) Design Decade Counter.
(ii) Design Up/Down Counter.
7 Study of PC Trainer and familiarize with different functional units.
8 Study and test of the ALU Trainer.
9 Study and test of the Read/Write operation of the Memory unit.
10 Small Hardware Project design.
Course CO1: Define and memorize different functional units and components of
Outcomes Computer.
CO2: Design and implement different combinational and sequential circuits.
CO3: Test and verify Memory and ALU operations.
CO4: Analyze the functionality of different logic circuits.
CO5: Solve small problem with circuit design.
Subject Code CS1287 Total Contact Hour 20

Semester 4th Total Credit 1.5

Subject Name Design and Analysis of Algorithms Laboratory

Course  To implement and compare different sorting and searching algorithms.
Objective  To demonstrate the implementation of various divide and conquer
algorithms.
 To find optimal solution using dynamic and greedy algorithm.
 To implement spanning tree and shortest path algorithm
 To Solve string matching problem
List of Experiments
1 Illustration of Analysis of Algorithms:
Comparison of sorting algorithms like Bubble, Insertion and Selection.
Heap sort using a max heap.
2 Divide and Conquer Algorithm:
i. Quick Sort,
ii. Merge Sort
iii. Binary Search.
3 Application: i. Quick sort ii. Merge Sort iii. Binary Search.
4 Dynamic Programming: i. Longest Common Subsequence Problem ii.
Matrix Chain Multiplication Problem iii. knapsack Problem iv. Travelling
Salesman Problem
5 Greedy Algorithm:
i. Fractional knapsack problem
ii. Huffman Coding
6 Minimum Spanning Tree:
i. Kruskal’s algorithm
ii. Prim’s algorithm
7 Shortest Path Problem:
i. Dijkstra algorithm
ii. Bellman ford algorithm
8 Backtracking and Branch & Bound: Queen Problem
9 String Marching Algorithm:
i. Naive string matching algorithm
ii. Rabin karp algorithm
10 Approximation Algorithm: Travelling Salesman Problem
 Course CO1: Ability to compare and implement various divide and conquer
Outcomes algorithms.
CO2: Improved skill in choosing and developing algorithms for optimization
problems.
CO3: Potential to demonstrate and implement graph algorithms like spanning
tree and shortest path.
CO4: Ability to implement different string matching algorithms.
CO5: Using approximation algorithm for NP complete problems.
Subject Code CS1288 Total Contact Hour 20

Semester 4th Total Credit 1.5

Subject Name Computer Networks Laboratory

Course The objective of this lab course is to:
Objective 1. To understand the working principle of various communication protocols.
2. To know the concept of data transfer between nodes.
3. To analyze the various routing algorithms.
4. Analyze structure and formats of TCP/IP layer protocols using network
tools.
5. Implementing various network algorithms such as error control, error
detection, routing, and security related algorithms.

List of Experiments
1 Introduction to Packet Tracer and Implementation of different Network
Topology using Packet Tracer.
2 (i) Limited broadcast and directed broadcast.
(ii) IP addressing with class full and class less addressing scheme.
(iii) Sub netting and super netting.
(iv) Concept of CIDR.
3 Assigning static IP address to PC and implement basic command of
Computer network like PING, traceroute etc.
4 Implementing VLSM network using Packet Tracer.
5 Understanding Router concept, types of router, different type of ports on
router and how to configure a Router.
6 Configure network topology and implement static routing using Packet
Tracer.
7 Configure network topology and implement dynamic routing protocol such
as RIP, EIGRP etc. using Packet Tracer.
8 (i) Configure DHCP Server in the Network using packet tracer.
(ii) Configure HTTP Server in the Network using packet tracer.
(iii) Configure DNS Server in the Network using packet tracer.
9 Implementation of VLANS using packet tracer.
10 Troubleshooting existing network.
Course CO1. Identify and use various networking components, transmission media
Outcomes for establishing a network
CO2. Implement n/w topology using network devices through packet tracer.
CO3. Analyze performance of various communication protocols.
CO4. Understand and configure routing algorithms through packet tracer.
CO5. Implement device sharing and troubleshooting in the network.
Subject Code CS1289 Total Contact Hour 20

Semester 4th Total Credit 1.5

Subject Name Programming in Python Laboratory

Course 1: Introduction to Python Language and its features.
Objectives 2: To understand the concept of Python Program using sequence data and
Control statements.
3: To be able to understand and create User Defined Function.
4: To understand the concept of OOPs and its implementation.
5: To understand the concept of strings and file handling

List of Experiments
1 Program on basics of python Programming Language.
2 Program on basic Data Structures in Python.
3 Program on Conversion from on data type to another.
4 Program on Functions in Python.
5 Program using Object Oriented Programming in Python.
6 Program using Inheritance in Python.
7 Program using String in Python.
8 Program using Regular expression in Python.
9 Program using File Handling in Python.
10 Program using basics of Pandas and Matplotlib module in Python.
Course CO1: Understand the Python Language and its features.
Outcomes CO2: Apply sequence data and control statements to solve problem.
CO3: Able to create user defined functions to solve problems.
CO4: Analyze the concept of OOPs and its implementation.
CO5: Create the python program using strings and files.