Annexure-IV LR 23 III & IV Semester Syllabus

LIET(A), B.E.
(CSE) AICTE Model Curriculum with effect from Academic Year 2024-25
ANNEXURE-IV
LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY

(An Autonomous Institution)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
SCHEME OF INSTRUCTIONS & EXAMINATIONS [LR-23]
(W.e.f Academic Year 2024-25)
B.E. III-Semester
Scheme of Scheme of
CREDITS
Instructions Examination
Maximum
Duration
Hours/Week
in Hours
Course Marks
Contact
S. No. Category Course Title
Code
L T P/D
CIE SEE
Theory Course
Digital Electronics &
1 U23EC304 ESC 3 0 0 3 40 60 3 3
Computer Organization
2 U23ME307 ESC Operations Research 3 0 0 3 40 60 3 3
3 U23CS301 PCC Discrete Mathematics 3 1 0 4 40 60 3 4
4 U23CS302 PCC Data Structures 3 0 0 3 40 60 3 3
5 U23CM301 PCC Python Programming 3 0 0 3 40 60 3 3
Practical/ Laboratory Course

Python Programming
6 U23CM3L1 PCC 0 0 3 3 25 50 3 1.5
Lab
7 U23CS3L1 PCC Data Structures Lab 0 0 3 3 25 50 3 1.5
8 U23EC3L4 ESC Data Visualization Lab 0 0 3 3 25 50 3 1.5
Bridge Course*
9 U23CS3L2 ESC C Programming Lab - - 2 2 50 - - 0

Effective
10 U23EN3L2 HSMC Communication Skills - - 2 2 50 - - 0
Lab
9 25 275 20.5
Total 15 1 450 --
(*13) (*29) (*375)
* : Bridge Course Only for Lateral Entry admitted Students.
L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical D: Drawing (Hrs/Wk/Sem)
CIE: Continuous Internal Evaluation SEE: Semester End Examination PCC: Program Core Course
ME: Mechanical Engineering. PROJ: Project ESC: Engineering Science Course
CM: CSE-AIML EC: Electronics Communication CS: Computer Science
EN: English
Note:
1. Each contact hour is a Clock Hour.
2. The duration of the practical class is three hours, however it can be extended wherever necessary, to
enable the student to complete the experiment.
LIET(A), B.E.(CSE) AICTE Model Curriculum with effect from Academic Year 2024-25

SCHEME OF INSTRUCTIONS & EXAMINATION [LR-23]
B.E. IV-Semester
Scheme of Scheme of
CREDITS
Duration in
Maximum
Hours/Week
Hours
Contact
S. No. Course Code Category Course Title Marks
L T P/D CIE SEE
Theory Course
Mathematics-III (Probability
1 U23MA401 BSC 3 1 - 4 40 60 3 4
and statistics)
2 U23CS401 PCC Software Engineering 3 - - 3 40 60 3 3
Design and Analysis of
3 U23CS402 PCC 3 - - 3 40 60 3 3
Algorithms
Database Management
4 U23IT402 PCC 3 - - 3 40 60 3 3
Systems
5 U23CS403 PCC JAVA Programming 3 - - 3 40 60 3 3

6 U23CS4L1 PCC Software Engineering Lab - - 3 3 25 50 3 1.5

Database Management
7 U23IT4L2 PCC - - 3 3 25 50 3 1.5
Systems Lab
8 U23CS4L2 PCC JAVA Programming Lab - - 3 3 25 50 3 1.5
Total 15 1 09 25 275 450 -- 20.5
CIE: Continuous Internal Evaluation SEE: Semester End Examination

BSC: Basic Science Course MA: Mathematics
HSMC: Humanities and Social Sciences including Management Course
PCC: Program Core Course
Note:
LIET(A),B.E.(CSE) AICTE Model Curriculum with effect from Academic Year 2025-26

B.E. V-Semester (Tentative)
Scheme of Scheme of
CREDITS
Hours/Week
Duration in
Maximum
Contact
Hours
L T P/D CIE SEE
Theory Course
Automata Theory,
1 U23CS501 PCC Languages and 3 1 0 4 40 60 3 4
Computation
2 U23CS502 PCC Computer Networks 3 1 0 4 40 60 3 4
3 U23CS503 PCC Operating Systems 3 0 0 3 40 60 3 3
4 --- PEC Professional Elective-I 3 0 0 3 40 60 3 3
5 --- OEC Open Elective-I 3 0 0 3 40 60 3 3

6 U23CS5L1 PCC Operating Systems Lab 0 0 3 3 25 50 3 1.5
7 U23CS5L2 PCC Computer Networks Lab 0 0 3 3 25 50 3 1.5
Internship
Internship
8 U23CS5P1 PROJ (During Vacation Period - - 2 2 50 - - 1
after IV Sem)
Total 15 2 8 25 300 400 -- 21

PCC: Program Core Course PEC: Professional Elective Course
OEC: Open Elective Course CS: Computer Science
PROJ: Project
Note:

B.E. VI-Semester (Tentative)
Scheme of Scheme of
CREDITS
Maximum
Hours/Week
Duration in
Contact
Hours
P/
L T CIE SEE
D
Theory Course
Business Economics and Financial
1 U23MB601 HSMC 3 0 0 3 40 60 3 3
Analysis
2 U23CS601 PCC Artificial Intelligence 3 0 0 3 40 60 3 3
3 U23CS602 PCC Compiler Design 2 1 0 3 40 60 3 3
4 -- PEC Professional Elective-II 3 0 0 3 40 60 3 3
5 -- OEC Open Elective II 3 0 0 3 40 60 3 3

6 U23CS6L1 PCC Artificial Intelligence Lab 0 0 3 3 25 50 3 1.5
7 U23CS6L2 PCC Compiler Design Lab 0 0 3 3 25 50 3 1.5
8 U23EN6L1 PCC Scripting Languages Lab - - 2 2 50 - - 1
Seminar
9 U23CS6P1 PROJ Technical Seminar-1 - - 2 2 50 - - 1
Skill Development Course
10 U23MA6L1 BSC Aptitude and Reasoning Lab - - 2 2 50 - - 1
Total 14 1 12 27 400 400 -- 21

OEC: Open Elective Course PCC: Program Core Courses
MB: Management Studies PROJ: Project
PEC: Professional Elective Courses CS: Computer Science
HSMC: Humanities and Social Sciences MA: Mathematics
including Management Course
Note:

B.E. VII-Semester (Tentative)
Scheme of Scheme of
CREDITS
Duration in
Hours/Week
Contact
Course
Hours
S. No.
Code
Category Course Title
L T P/D CIE SEE
Theory Course
Machine Learning
1 U23CS701 PCC 3 0 0 3 40 60 3 3
2 U23CS702 PCC Data Mining 3 0 0 3 40 60 3 3
3 --- PEC Professional Elective – III 3 0 0 3 40 60 3 3

4 --- PEC Professional Elective – IV 3 0 0 3 40 60 3 3
5 --- OEC Open Elective-III 3 0 0 3 40 60 3 3
6 U23CS7L1 PCC Machine Learning Lab - 0 3 3 25 50 3 1.5
7 U23CS7L2 PCC Data Mining Lab - 0 3 3 25 50 3 1.5

Project
8 U23CS7P1 PROJ Mini Project - - 6 6 50 50 -- 3
Total 15 0 12 27 300 450 -- 21

OEC: Open Elective Course PCC: Program Core Courses
PEC: Professional Elective Course CS: Computer Science
PROJ: Project
Note:

B.E. VIII-Semester (Tentative)
Scheme of Scheme of
CREDITS
Hours/Week
Duration in
Maximum
Contact
Course
Hours
S. No.
Code
Category Course Title Marks
L T P/D
CIE SEE
Theory Course
Distributed Systems and Cloud
1 U23CS801 PCC 3 0 0 3 40 60 3 3
Computing
2 --- PEC Professional Elective-V 3 0 0 3 40 60 3 3
3 --- OEC Open Elective-IV 3 0 0 3 40 60 3 3
Project
4 U23CS8P2 PROJ Major Project 0 0 16 16 50 150 -- 8
5 U23CS8P1 PROJ Technical Seminar-2 0 0 4 4 100 -- -- 2

Total 9 0 20 29 270 330 -- 19

PCC: Program Core Courses PEC: Professional Elective Course
OEC: Open Elective Course PROJ: Project
CS: Computer Science
Note:

SCHEME OF INSTRUCTIONS & EXAMINATIONS
(w.e.f Academic Year 2024-25)
PROFESSIONAL ELECTIVE COURSES(Tentative)
Scheme of Scheme of
CREDITS
Maximum
Duration in
Hours/Week
Hours
Course Marks
S. No.
Code
Category Course Title
CIE SEE
Contact
L T P/D
Theory Course
Software Testing
U23CS504 3 0 0 3 40 60 3 3
Methodologies
U23CS505 Advanced Computer
3 0 0 3 40 60 3 3
1 PEC-I Architecture
U23CS506 Neural Networks 3 0 0 3 40 60 3 3
U23CS507 Cyber Security, Ethics &
3 0 0 3 40 60 3 3
Laws
U23CS603 Software Project Management 3 0 0 3 40 60 3 3
U23CS604 3 0 0 3 40 60 3 3
Web and Internet Technologies
2 PEC-II
U23CS605 Deep Learning 3 0 0 3 40 60 3 3
U23CS606 Fundamentals of Cryptography 3 0 0 3 40 60 3 3
U23CS703 Software Project Management 3 0 0 3 40 60 3 3
U23CS704 Computer Graphics 3 0 0 3 40 60 3 3
3 PEC-III
U23CS705 Machine Learning 3 0 0 3 40 60 3 3
U23CS706 Network Security & Cryptography 3 0 0 3 40 60 3 3

U23CS707 Software Quality Management 3 0 0 3 40 60 3 3
U23CS708 Internet Of Things 3 0 0 3 40 60 3 3
4 PEC-IV
U23CS709 Data Science 3 0 0 3 40 60 3 3
U23CS710 Digital Forensics 3 0 0 3 40 60 3 3
U23CS802 Agile Methodologies 3 0 0 3 40 60 3 3
U23CS803 Human Computer Interaction 3 0 0 3 40 60 3 3
5 PEC-V
U23CS804 Natural Language Processing 3 0 0 3 40 60 3 3
U23CS805 Mobile Computing 3 0 0 3 40 60 3 3

SCHEME OF INSTRUCTIONS & EXAMINATIONS
(w.e.f Academic Year 2024-25)
PROFESSIONAL ELECTIVES – IV THREADS
S. No. PE-I PE-II PE-III PE-IV PE-V
Software Software
Software Testing Agile
Project Architecture and Software Quality
1 Methodologies Methodologies
Management Design Patterns Management
Advanced
Web and Human
Computer Information Internet of Things
Internet Computer
2 Architecture Retrieval Systems
Technologies Interaction
Natural
Neural Deep
3 Computer Vision Data Science Language
Networks Learning
Processing
Fundamentals
Cyber Security, Block Chain Digital Mobile
4 of
Ethics & Laws Technologies Forensics Computing
Cryptography

SCHEME OF INSTRUCTIONS & EXAMINATION [LR23]
OPEN ELECTIVE COURSES OFFERED
Course
Code
U23EE508 Non-Conventional Energy Systems

U23EE509 Energy Conservation and Management
U23CS508 Fundamentals of Data Base Management Systems*
U23IT506 Data Structures*
U23ME509 Basics of Mechanical Engineering
U23ME510 Modern Manufacturing Processes
1 OEC 1
U23CE510 Disaster Preparedness and Management
U23CE511 Civil Engineering Principles and Practices
U23EC507 Principles of Communication Theory
U23EC508 Basic Electronics
U23MB501 Managerial Communication
U23MB503 Managerial Science and Theory
Course
Code
U23EE608 Fundamental of Power Electronics

U23EE609 Electrical Installation and Safety
U23CS607 Introduction to Programming in JAVA*
U23IT606 Operating Systems*
U23ME608 Basics Of 3-D Printing
U23ME609 Optimization Methods for Engineers
2 OEC 2
U23CE607 Construction Materials
U23CE608 Engineering Geology
U23EC607 Principles of Data Communication and Network
U23EC608 Embedded Systems
U23MB602 Total Quality Management
U23MB603 Innovation Management
Course
Code
U23EE711 Introduction to Electrical Vehicles

Design estimation and Costing of Electrical
U23EE712
Systems
U23CS711 Data Sciences*
U23IT705 Basics of Artificial Intelligence*
U23ME711 Renewable Energy Resources
U23ME712 OEC 3 Cooling of Electronic Components
3
U23CE711 Environmental Systems
U23CE712 Urban Transportation System
U23EC703 IOT and its protocols
U23EC704 Television and Video Engineering
U23MB702 Logistics Management
U23MB703 Management of Start Up’s
Course
Code
U23EE804 Smart Building Systems

U23EE805 Industrial Automation
U23CS806 Basics of Machine Learning*
U23IT802 Cloud computing*
U23ME806 Hybrid Vehicle Technology
U23ME807 Power Plant Engineering
4 OEC 4
U23CE806 Green Building Technology
U23CE807 Environmental Impact Assessment
U23EC805 Fundamentals of Wireless Communication
U23EC806 Fundamental Digital Design using Verilog HDL
U23MB802 Entrepreneurship
U23MB803 E - Marketing
Note:
*Open Elective subjects are not offered to the students of CSE and Allied departments.
B.E. III-Semester
CREDITS
Scheme of Scheme of
Dura
Hours/W
S. No. Course Code Category Course Title Maximum
Contact
Hou
tion
eek
Marks
in
rs
L T P/D
CIE SEE
Theory Course
Digital Electronics &

1 U23EC304 ESC Computer 3 0 0 3 40 60 3 3
Organization
2 U23ME307 ESC Operations Research 3 0 0 3 40 60 3 3
3 U23CS301 PCC Discrete Mathematics 3 1 0 4 40 60 3 4
4 U23CS302 PCC Data Structures 3 0 0 3 40 60 3 3
5 U23CM301 PCC Python Programming 3 0 0 3 40 60 3 3

Python Programming
6 U23CM3L1 PCC 0 0 3 3 25 50 3 1.5
Lab
7 U23CS3L1 PCC Data Structures Lab 0 0 3 3 25 50 3 1.5
Data Visualization
8 U23CS3L3 ESC 0 0 3 3 25 50 3 1.5
Lab
Bridge Course*
9 U23CS3L2 ESC C Programming Lab - - 2 2 50 - - 0

Effective
10 U23EN3L2 HSMC Communication Skills - - 2 2 50 - - 0
Lab
9 25 275 20.5
Total 15 1 450 --
(*13) (*29) (*375)
* : Bridge Course Only for Lateral Entry admitted Students.

PCC: Program Core Course ME: Mechanical Engineering.
PROJ: Project ESC: Engineering Science Course
CM: CSE-AIML EC: Electronics Communication
CS: Computer Science EN: English
Note:
Course Code Course Title Core/Elective
U23EC304 DIGITAL ELECTRONICS & COMPUTER ORGANIZATION Core
Contact Hours per Week

Prerequisite CIE SEE Credits
L T D P
Basic Physics 3 0 0 0 40 60 3
Course Objectives:
The objectives of this course are
1. To understand the basic building blocks of digital hardware and various minimization techniques.
2. To analyze and design the Combinational and Sequential circuits.
3. Describe the basic structure and operation of digital computer and understand various memory types
Course Outcomes:
On Successful completion of this course, student will be able to
1. Demonstrate the number system conversions and simplify Boolean functions.
2. Analyze and simplify Boolean expressions using karnaugh-maps, tabulation method and design combinational
circuits.
3. Analyze and design various Sequential circuits.
4. To illustrate the operation of digital computer and to understand its organization.
5. Understand the various memory types.
UNIT – I
Number Systems: Number systems, Complements of Numbers, Codes- Weighted and Non-weighted codes and its
Properties, Parity check code and Hamming code. Boolean algebra: Basic Theorems and Properties, Switching Functions-
Canonical and Standard Form, Algebraic Simplification, Fundamentals of Digital Logic Gates.
UNIT – II
Combination Circuits: Implementation of logic functions using K-Map Quine- McCluskey Tabular method, Adders: half
adder, full adder, Subtractors, Comparators, Multiplexers, De-multiplexers, Encoders and Decoders.
UNIT-III
Sequential circuits: Basic Architectural Distinctions between Combinational and Sequential circuits, SR Latch, Flip
Flops: SR, JK, JK Master Slave, D and T Type Flip Flops. Excitation Table of all Flip Flops, Conversion from one type of
Flip-Flop to another.
UNIT-IV
Basic Structure of Computers: Computer Types, Block diagram of Digital computer, Basic Operational Concepts, Bus
Structures, Stored program organization and computer registers, Instruction formats, Input/output Organization: Block
diagram of I/O organization, Interrupts, direct memory access. Asynchronous data transfer: strobe control and hand
shaking.
UNIT -V
The Memory System: Basic concepts, Semiconductor RAM memories, Read-Only memories, Speed, Size and Cost,
Primary memory ,Auxiliary memory, Associative memory, Cache memories, Virtual Memories, Memory management
requirements.
Text Books:
1. Morris Mano M. and Michael D. Ciletti, “Digital Design, With an Introduction to Verilog HDL”, Pearson 5 th edition,
2013.
2. 2 RP Jain “ Modern Digital Electronics” , Fourth Edition Mcgraw hill education (India) Pvt Limited, 2003
3. Carl Hamacher, ZvonkoVranesic, SafwatZaky, Computer Organization, 5th Edition, McGraw Hill, 2002.
4. Suggested Reading:
5. Ronald J Tocci, Neal Widmer, Greg Moss, “Digital Systems: Principles and Applications”, Pearson 11th Edition, 2011.
6. Computer Architecture a quantitive approach, Jhon L. Hennessy and David A. Patterson, Fourth Edition Elsevier.
7. Computer Architecture: Fundamentals and principles of Computer Design, Joseph D. Dumas II, BS Publication.

OPERATIONS RESEARCH
U23ME307 Core
(Common to CSE, CSD & CSM)
Hours Per Week
L T D P
Basic Maths 3 - - - 40 60 3
Course Objectives:
Develop ability to
1. Explain with examples, the basic terminology of functions, relations, and sets.
2. Perform the operations associated with sets, functions, and relations.
3. Relate practical examples to the appropriate set, function, or relation model, and interpret the associated
operations and terminology in context.
4. Describe the importance and limitations of predicate logic.
5. Use Graph Theory for solving problems.
Course Outcomes:
At the end of the course, student would be able to
1. Understand the ideas of mathematical induction to recursion and recursively defined structures.
2. Prepare the students to have the knowledge of Linear Programming Problem in Operations
3. Research at the end students would be able to understand the concept and develop the models for different
applications.
4. Make students understand the concept Replacement models at the end students would able to explain various
features and applications of replacement models in real time scenario.
5. Prepare the students to understand theory of Game in operations research at the end students would able to
explain application of Game theory in decision making for a conflict
UNIT – I
Introduction: Definition and Scope of Operations Research.
Linear Programming: Introduction, Formulation of linear programming problems, graphical method of solving LP
problem, simplex method, maximization and minimization, Degeneracy in LPP, Unbounded and, Infeasible solutions.
UNIT – II
Transportation Models: Finding an initial feasible solution - North West corner method, least cost method, Vogel‘s
Approximation method, Finding the optimal solution, optimal solution by stepping stone and MODI methods, Special cases
in Transportation problems - Unbalanced Transportation problem.
Assignment Problems: Hungarian method of Assignment problem, Maximization in Assignment Problem, unbalanced
problem, problems with restrictions, travelling salesman problems.
UNIT – III
Network Fundamentals- scheduling the activities -Fulkerson’s Rule –CPM- earliest and latest times -determination of ES
and EF in the Forward Pass - LS and LF in backward pass determination of Critical Path, Crashing, time cost trade off.
PERT-Beta Distribution, probabilistic models, Calculation of CP, resource analysis and allocation.
UNIT – IV
Replacement Models: Introduction, replacement of items that deteriorate ignoring change in money value, replacement of
items that deteriorate considering change in money value with time, replacement of items that fail suddenly - Individual
replacement policy, Group replacement policy.
Game Theory: Introduction, 2-person zero sum games, Maximin - Minimax principle, Principle of
Dominance, Solution for mixed strategy problems, Graphical method for 2 x n and m x 2 games.
UNIT – V
Sequencing Models: Introduction, General assumptions, processing n jobs through 2 machines, processing n jobs through m
machines, Processing 2 jobs through m machines
Queuing Theory: Introduction, single channel - Poisson arrivals - exponential service times with infinite population &
finite population, Multi-channel - poison arrivals - Exponential service times with infinite population.
Introduction to Optimization Techniques: Single objective & Multi objective optimization Techniques like G.A, NSGA,
P.Q.O & MPSO Techniques.
Suggested Readings:
1. Hamdy, A. Taha, ―Operations Research-An Introduction‖, Sixth Edition, Prentice Hall of India Pvt. Ltd.,1997
2. S.D. Sharma, Operations Research, Kedarnath, Ramnath & Co., Meerut,2009
3. J.B. Gupta, ―Utilization of Electric Power and Electric Traction‖ S.K. Kataria & Sons Publications, 2010 Hrvey M.
Wagner, Principles of Operations Research, Second Edition, Prentice Hall of India Ltd., 1980.
4. V.K. Kapoor, Operations Research, S. Chand Publishers, New Delhi,2004
5. R. Paneer Selvam, Operations Research, Second Edition, PHI Learning Pvt. Ltd., New Delhi,2008.
U23CS301 DISCRETE MATHEMATICS Core

Hours Per Week
CIE SEE Credits
Prerequisite L T D P
Basic Maths 3 1 _ _ 40 60 4
Course Objectives:
Develop ability to
1. Understand concepts of Mathematical Logic, mechanisms of inference rules for propositional and predicate
logic and their applications
2. Understand the concepts of Sets, Relations, Functions and their applications.
3. Learn the concepts of Algebraic Structures, basics of counting, Principles of inclusion/exclusion and the
pigeonhole methodology.
4. Understand Generating Functions, Recurrence Relations and various ways of solving them.
5. Understand basic definitions and properties of graphs and their applications in computer science and
engineering.
Course Outcomes:
1. Distinguish between Propositional Logic and Predicate Logic, deriving valid proofs of inference and checking
the validity of inferences.
2. Illustrate by examples the basic terminology of sets, relations, functions and algebraic structures along with
their associated operations.
3. Demonstrate basics of counting, principles of permutations, combinations, applying inclusion/exclusion
principle and the pigeonhole methodology in solving counting problems.
4. Demonstrate Generating functions, write recurrence relations and apply various techniques solving
recurrence relations.
5. Transform a problem in computer science and engineering as a graph to solve it efficiently using concepts of
graph theory.
UNIT-I
Mathematical Logic: Statements and notations, Connectives, Well-formed formulas, Truth Tables, tautology, equivalence
implication, Normal forms, Quantifiers, universal quantifiers. Predicates: Predicative logic, Free & Bound variables,
Rules of inference, Consistency, proof of contradiction, Automatic Theorem Proving.
UNIT-II
Relations: Properties of Binary Relations, equivalence, transitive closure, compatibility and partial ordering relations,
Lattices, Hasse diagram. Functions: Inverse Function Composition of functions, recursive Functions, Lattice and its
Properties.
UNIT-III
Elementary Combinatorics: Basis of counting, Combinations & Permutations, with repetitions, Constrained repetitions,
Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion – Exclusion. Pigeon hole principles and
its application.
UNIT-IV
Recurrence Relation: Generating Functions, Function of Sequences Calculating Coefficient of generating function,
Recurrence relations, Solving recurrence relation by substitution and Generating funds. Characteristics solution of
inhomogeneous Recurrence Relation.
UNIT-V
Graph Theory: Basic Concepts, Representation of Graph, Isomorphism, Sub graphs, Spanning Trees, Planar Graphs,
Multi graphs, Euler circuits, Hamiltonian graphs, Chromatic Numbers. Graph Theory andApplications.
Suggested Readings:
1. Discrete Mathematical Structures with Applications to Computer Science, J.P. Tremblay, R. Manohar, McGraw Hill
education (India) Private Limited. (UNITS - I , II )
2. Discrete Mathematics for Computer Scientists & Mathematicians, Joe L. Mott, Abraham Kandel, Theodore P. Baker,
Pearson, 2nd ed. (Units - III, IV, V )
3. Elements of Discrete Mathematics- A Computer Oriented Approach- C L Liu, D P Mohapatra. Third Edition, Tata Mc Graw
Hill.
4. Discrete Mathematics for Computer Scientists & Mathematicians, J.L. Mott, A. Kandel, T.P. Baker, PHI.
5. Discrete Mathematics and its Applications, Kenneth H. Rosen, Fifth Edition.TMH.
6. Discrete Mathematical Structures Theory and Application-Malik & Sen, Cengage.
Course
Course Title Core/Elective
Code
U23CS302 DATA STRUCTURES Core
Hours Per Week
CIE SEE Credits
PPS 3 _ _ _ 40 60 3
Course Objectives:
Develop ability to
1. Develop skills to design and analyze simple linear and nonlinear data structures, such as stacks,
queues and lists and their applications.
2. Strengthen the ability to identify and apply suitable data structures for the given real-world
problem.
3. Gain knowledge in practical applications of data structures
4. Choose the appropriate data structure and algorithm for a specified application.
5. Gain programming skills to implement sorting and searching algorithms.
Course Outcomes:
1. Classify data structure and can-do performance analysis.
2. Develop ADT necessary for solving problems based on Stacks and Queues.
3. Implement operations on singly linked list and doubly linked list efficiently.
4. Works with Trees and graphs traversal techniques.
5. Implement various searching, and sorting techniques and define the hashing function.
UNIT – I
Introduction Data Structures and Algorithms:
Introduction to data structures, classification of data structures, operations on data structures; Algorithm Specification,
Recursive algorithms, Data Abstraction, Performance analysis- Time Complexity and Space Complexity, Asymptotic
Notation-Big O, Omega, and Theta notations.
UNIT – II
Stacks and Queues:
Stacks: Stack ADT, definition and operations, Implementations of stacks using array, applications of stacks, Arithmetic
expression conversion and evaluation.
Queues: Queue ADT, definition and operations, Implementation of queues using Arrays, circular queue and applications of
queue.
UNIT – III
Linked Lists: Introduction, Singly linked list, representation of a linked list in memory, operations on a Singly Linked List,
Implementation of Singly Linked List.
Doubly Linked Lists; Operations on Doubly Linked List, Implementation of Doubly Linked List , Circular linked list,
Implementation of Stack and Queue using linked list.
UNIT – IV
Trees: Introduction, Binary Trees, Tree Traversals, Threaded Binary Trees, Binary Search Tree, Heap Tree, AVL Tree.
Graphs: Graph Abstract Data Type, Representation of Graph, Graph Traversals -DFS and BFS, Spanning Tree, Prim‘s
and Kruskal‘s Algorithms.
UNIT – V
Searching Techniques: Linear search and Binary Search algorithms.
Sorting Techniques: Bubble Sort, Insertion sort, Selection Sort, Merge Sort, and Quick Sort. Comparison among sorting
techniques.
Hashing: Static Hashing, Hash Tables, Hash Functions, Overflow Handling, Theoretical Evaluation of Overflow Techniques
Suggested Readings:
1. “Fundamentals of Data Structures in C”, Ellis Horowitz, Sartaj Sahani, Susan Anderson Freed, Computer Science
Press, 2004
2. S. Lipschutz, “Data Structures”, Tata McGraw Hill Education, 1st Edition, 2008.
3. D. Samanta, “Classic Data Structures”, PHI Learning, 2nd Edition, 2004.
4. Mark A Weiss, “Data Structures and Algorithm Analysis In C”, Second Edition (2002), Pearson
5. “Data Structures and Algorithms in C++”, second Edition by Michael T. Goodrich and Roberto Tamassia.
Course Code Course Title Core /Elective
U23CM301 PYTHON PROGRAMMING Core

Hours Per Week CIE SEE Credits
Prerequisite
L T D P
PPS 3 - - - 40 60 3
Course Objectives:
Develop ability to
1. Learn about Python programming language syntax, semantics, and the runtime environment
2. Familiarized with universal computer programming concepts like data types, containers
3. Acquire general computer programming concepts like conditional execution, loops & functions
4. Grasp the general coding techniques and object-oriented programming
5. Analyze about basic library modules.
Course Outcomes:
1. Develop essential programming skills in computer programming concepts like data types, containers.
2. Apply the basics of programming in the Python language.
3. Solve coding tasks related conditional execution, loops.
4. Acquire coding tasks related to the fundamental notions and techniques used in object-oriented programming
5. Write basic programs related to basic library modules.
UNIT- I
Introduction to Python: Data Types: Declaring and using Numeric data types: int, float, bool, complex, string data type
and string operations, standard input and output functions, type conversion
Python Program Flow Control: Conditional blocks using if, else and elif, Control blocks using for loop, while loop. Loop
manipulation using pass, continue, break and else.
UNIT- II
Functions: Creating, parameters and return values, Using Keyword Arguments and Default Parameter Values, Using Global
Variables and Constants, recursive functions, lambda functions.
Python Data Structures: Lists- basic list operators, replacing, inserting, removing an element; searching and sorting lists;
tuples.
UNIT-III
Dictionaries- literals, adding and removing keys, accessing and replacing values; traversing dictionaries. Sets and Strings
operations.
Introduction to Object Oriented Programming: Class, object, attributes and methods; defining classes, inheritance,
polymorphism, abstract classes, Exception handling.
UNIT-IV
Using Databases in Python:
Python MySQL Database Access, Create Database Connection, CREATE, INSERT, READ, UPDATE and DELETE
Operation, DML and DDL Operation with Databases, Performing Transactions Handling, Database Errors.
UNIT- V
Python for Data Analysis:
Numpy: Introduction to NumPy, creating arrays, using arrays and Scalars, Indexing Arrays, Array Transposition, Universal
Array Function, Array Processing, Array Input and Output.
Pandas: What is pandas? Where it is used? Series in pandas, Index objects, Reindex, Drop Entry, Selecting
Entries, Data Alignment, Rank and Sort Summary, Statics Missing Data, Index Hierarchy.
Suggested Readings:
1. Reema Thareja, “Python Programming using Problem Solving Approach”, ISBN-13:978-0-19- 948017-3,
Oxford University Press, 2017
2. Vamsi kurama, “Python Programming: A modern approach”, ISBN-978-93-325-8752- 6, Pearson,2018.
3. Mark Lutz, “Learning python”, ISBN: 1-56592-464-9, Orielly, 4th edition, 1999.
4. W.Chun, “Core python programming”, ISBN-13: 978-0132269933, Pearson, 2nd edition, 2016.
5. Kenneth Lambert, ” Fundamentals of Python: First Programs”, ISBN-13: 978-
1337560092, Cengage Learning publishers, First Edition,2012.
6. Allen B. Downey, “Think Python: How To Think Like A Computer Scientist”, ISBN-13: 978- 1491939369,
O’Reilly, 2nd Edition, 2016.
7. R Nageswara Rao, “Core Python Programming”, Dreamtech press, 2017 Edition.
8. Mike Mc Grath "Python in easy steps: Makes Programming Fun", Kindle Edition, 2017.
U23CM3L1 PYTHON PROGRAMMING LAB Core
Hours Per Week

CIE SEE Credits
Prerequisite
L T D P
PPS - - - 3 25 50 1.5
Course Objectives:
Develop ability to
1. Elucidate problem solving through python programming.
2. Learn the use of functions in python programming.
3. Analyze solutions using Object Oriented concepts.
4. Design programs using File Handling Functions.
5. Create Mini-projects using various libraries.
Course Outcomes:
1. Summarize the fundamental concepts of python programming.
2. Outline the control statements and functions by writing python program.
3. Demonstrate file handling operations and packages.
4. Interpret object-oriented programming in python.
5. Apply the suitable libraries to solve simple problems.
List of Programming Exercises:

1 a) Write a python program for Python Variables, Executing Python from the Command Line, Editing Python Files,
Python Reserved Words.
b) Write a python program to add two numbers.
c) Write a program to demonstrate different number data types in python.
d) Write a program to perform different arithmetic operations on numbers in python.
2) a) Write a python program to print a number is positive/negative using if-else.
b). Write a python program to find largest number among three numbers.
c). Write a Python program to swap two variables
d) Python Program to print all Prime Numbers in an Interval
3) a) Write a python program to check whether the given string is palindrome or not.
b). Write a program to create, concatenate and print a string and accessing substring from a given string.
c) Functions: Passing parameters to a Function, Variable Number of Arguments, Scope, and Passing Functions to a
Function.
4) a) Create a list and perform the following methods

1) insert () 2) remove () 3) append () 4) len() 5) pop() 6)clear()
b) Create a dictionary and apply the following methods
1) Print the dictionary items 2) access items 3) useget () 4) change values 5) use len()
c) Create a tuple and perform the following methods
1) Add items 2) len() 3) check for item in tuple 4)Access items
5) a). OOP concepts: Classes, File Organization, Special Methods, Inheritance, Polymorphism, Special Characters,
Character
Classes, Quantifiers, Dot Character, Greedy Matches, Matching at Beginning or End, Match Objects, Compiling
Regular
Expressions.
b) Write a python Program to call data member and function using classes and objects
6) a). Write a program to double a given number and add two numbers using lambda ()
b) Write a program for filter () to filter only even numbers from a given list.
c) Write a Python Program to Make a Simple Calculator.
7) a). Demonstrate a python code to print try, except and finally block statements
b) Write a python program to open and write “hello world” into a file and check the access permissions to that file?
c) Python program to sort the elements of an array in ascending order and Descending order
8) a) Write a python program to open a file and check what are the access permissions acquired by that file using os
module.
b) Write a program to perform basic operations on random module.
9) Write a python program to practice some basic library modules

a) Numpy
b) SciPy
10) Introduction to basic concept of GUI Programming and Develop desktop based application with python basic Tkinter()
Module?
11) Write a python program to create a package (college), subpackage (alldept), modules(it,cse) and create admin
function to module?
12). Write a python program to create a package (Engg), sub package(years), modules (sem) and create staff and
student function to module?
Suggested Readings:
1. Gerald J. Kowalski, Mark T. Maybury: Information Storage and Retrieval Systems: Theory and Implementation,
Second
Edition Kluwer Academic Publishers
2 Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms, Prentice Hall, 1992.
3. Modern Information Retrival By Yates Pearson Education.
4. Information Storage & Retieval By Robert Korfhage – John Wiley & Sons
Course Code Course Title Core
U23CS3L1 DATA STRUCTURES LAB Core

Hours Per Week
CIE SEE Credits
PPS Lab - - - 3 25 50 1.5
Course Objectives:
Develop ability to
1. Understand essential concepts of simple linear and nonlinear data structures.
2. Apply the suitable data structures for the given real-world problems.
3. Acquire knowledge in practical applications of data structures.
4. Provide solutions for various graphical concepts.
5. Analyze and implement programming skills to implement sorting and searching algorithms.
Course Outcomes:
1. Build programs in various data structures using arrays and linked lists.
2. Develop ADT necessary for solving problems based on Stacks and Queues
3. Evaluate binary trees, general tree structures, advanced search trees, heaps, graphs.
4. Apply hash functions and handle collisions.
5. Implement various kinds of sorting techniques and apply appropriate techniques for solving a given
Problem.
List of Experiments:
1. Implementation of Stacks and Queues using Arrays.
2. Implementation of Infix to Postfix Conversion, Postfix ExpressionEvaluation.
3. Implementation of Circular Queue using Arrays.
4. Implementation of Singly Linked List
5. Implementation of Doubly Linked List.
6. Implementation of Circular Linked List.
7. Implementation of Stacks, Queues using Linked Lists.
8. Implementation of Binary Search Tree. (Insertion, Deletion, and Search operations)
9. Implementation of Tree Traversals on Binary Trees.
10. Implementation of AVL Trees.
11. Implementation of Traversal on Graphs.
12. Implementation of Prims and Kruskals Algorithm.
13. Implementation of Binary Search and Hashing.
14. Implementation of Selection, Merge, Quick, and InsertionSort.
Suggested Readings:
1. S. Lipschutz, “Data Structures”, Tata McGraw Hill Education, 1st Edition, 2008.
2. D. Samanta, “Classic Data Structures”, PHI Learning, 2nd Edition, 2004.
3. Mark A Weiss, Data Structures and Algorithm Analysis In C, Second Edition (2002), Pearson
Core/Elective
Course Code Course Title
U23CS3L3 DATA VISUALIZATION LAB --

Hours Per Week
CIE SEE Credits
DE - - - 3 25 50 1.5
Course Objectives:
The objectives of this course are :
1. Effective use of Business Intelligence (BI) technology (Tableau) to apply data visualization.
2. To discern patterns and relationships in the data.
3. To build Dashboard applications.
4. To communicate the results clearly and concisely.
5. To be able to work with different formats of data sets
Course Outcomes:
On Successful completion of this course, students will be able to:
1. Understand how to import data into Tableau.
2. Understand Tableau concepts of Dimensions and Measures.
3. Develop Programs and understand how to map Visual Layouts and Graphical Properties.
4. Create a Dashboard that links multiple visualizations.
Use graphical user interfaces to create Frames for providing solutions to real-world problems
1. Understanding Data, what is data, where to find data, and Creating Your First Visualization in Python.
2. Getting started with Tableau Software using Data file formats, connecting your Data to Tableau, creating basic
charts (line, bar charts, Tree maps), Using the Show me panel.
3. Tableau Calculations, Overview of SUM, AVR, and Aggregate features, Creating custom calculations and fields.
4. Applying new data calculations to your visualizations, Formatting Visualizations, Formatting Tools and Menus,
and Formatting specific parts of the view.
5. Editing and Formatting Axes, Manipulating Data in Tableau data, Pivoting Tableau data.
6. Structuring your data, Sorting and filtering Tableau data, and Pivoting Tableau data.
7. Creating Dashboards & Storytelling, creating your first dashboard and Story, and Design for different
displays, and publish your visualization.
8. Creating custom charts, cyclical data, circular area charts, and Dual Axis charts.
9. Advanced Visualization Tool Power BI: Using Filters, Using the Detail panel, using the Size panels, customizing
filters, and customizing tooltips, and Formatting your data with colors.
10. Visualization data supported chart types in Power BI, Map Visualizations, Color palettes in Charts, Loading
Shapes, text boxes, and images.
11. Explore the Google Data Studio Dashboard and connect to your first source.
12. Create a Report on Google Data Studio and share the report.
Suggested Reading:
1. Data Visualization in Python by Daniel Nelson, 2020 StackAbuse.
2. Tableau Your Data: Fast and Easy Visual Analysis with Tableau Software by Daniel G Murray, WILEY
3. Microsoft Power BI cookbook, Brett Powell, 2nd edition.
Core / Elective
Course Code Course Title
Core
U23CS3L2 C PROGRAMMING LAB
Prerequisite Contact Hours Per Week Credits

CIE SEE
L T D P
Computer Basics
- - - 2 50 - 0
Course Objectives:
1. To understand the fundamentals of programming in C Language.
2. To write, compile and debug programs in C.
3. To formulate solution to problems and implement in C.
4. To effectively choose programming components to solve computing problems
Course Outcomes:
On completion of this course, students are able to:
1. Choose appropriate data type for implementing programs in C language.
2. Design and implement modular programs involving input output operations, decision making and looping
constructs.
3. Implement search and sort operations on arrays.
4. To decompose a problem into functions and to develop modular reusable code
5. Apply the concept of pointers for implementing programs on dynamic memory management and string
handling. Design and implement programs to store data in structures and files.
List of experiments:
1. Finding maximum and minimum of given set of numbers, finding roots of quadratic equation.
2. Sinx and Cosx values using series expansion.
3. Conversion of binary to decimal, octal, hexadecimal and vice-versa.
4. Generating Pascal triangle, pyramid of numbers.
5. Recursion:factorial,Fibonacci,GCD.
6. Matrix addition and multiplication using arrays.
7. Programs on pointers: pointer to arrays, pointer to functions.
8. Functions for string manipulations.
9. Programs on structures and unions.
10. File handling programs
Suggested Reading:
1. Byron Gottfried, “Programming with C”, Schaum’s outlines, 2nd Edition, TATA McGraw-Hill.
2. A.K.Sharma, “Computer Fundamentals and Programming in C”, 2nd Edition, University Press.
3. E Balaguruswamy, “Programming in ANSI C”, Tata McGraw-Hill Education, 2008.
4. Brian W. Kernighan and Dennis M. Ritchie, “the C Programming Language”, Prentice Hall of India, 1988.
Course code Course Title Core/Elective
EFFECTIVE COMMUNICATION SKILLS LAB

U23EN3L2 Core
(Common to all Branches)
Pre-requisites Contact Hours Per Week
CIE SEE Credits
L T D P
Basic English
- - - 3 25 50 0
Course Objectives:
To enhance the listening and speaking skills of students by:
1. Giving them sufficient practice in listening with comprehension
2. Providing them ample opportunities to improve their public speaking skills and soft skills
3. Training them in the use of correct pronunciation, stress and intonation
4. Sensitizing them to the use of verbal and non-verbal communication appropriate to the context
5. Encouraging them to learn the art of conversation to suit formal and informal situation
6. Preparing them to make formal presentations and face interviews
Course Outcomes:
After completing this course, the student will be able to:
1.Listen, understand and interpret formal and informal spoken language
2.Speak English with acceptable pronunciation, stress and intonation
3.Present themselves with confidence in formal situations
4.Participate in individual and group activities with relative ease
5.Use verbal and nonverbal communication while using soft skills
6.Make formal presentations and face interviews
List of Activities
1. Listening for comprehension
2. Pronunciation, Intonation, Stress and Rhythm
3. Conversation Skills
4. Introducing Oneself and Others
5. Asking for and Giving information
6. Making Request and Responding to them Appropriately
7. Giving Instructions and Responding to them Appropriately
8. Making Formal Announcement and Emceeing
9. Group Discussion
10. Just A Minute (JAM)
11. Role Play
12. Debate
13. Public Speaking Skills and Body Language
14. Interviews
15. Formal Presentations
Suggested Readings:
1. Board of Editors. Language and Life Skills Approach. Orient Black Swan,2018
2. BalaSubramaniam, T.A. Text book of English Phonetics for Indian Students, Macmillan, 1981.
3. CIEFL, Exercises in Spoken English. PART-III, Oxford University Press.
4. Pillai, Radhakrishna G. Spoken English for You – Level II. Emerald Publisher, 8th Edition.2014.
5. Sethi, J. and PV Dhamija. A Course in Phonetics and Spoken English. Prentice, India Learning Private
Limited, 2nd Edition.1999
6. Robert. M. Sherfield& et al. Developing Soft Skills. Pearson Education.4 th Edition. 2009.
SCHEME OF INSTRUCTIONS & EXAMINATION
B.E. IV-Semester
Scheme of Scheme of
CREDITS
Duration
in Hours
Maximum
Hours/W
Contact
eek
L T P/D CIE SEE
Theory Course
Mathematics-III
1 U23MA401 BSC 3 1 - 4 40 60 3 4
(Probability and statistics)
2 U23CS401 PCC Software Engineering 2 - - 2 40 60 3 2
Design and Analysis of
3 U23CS402 PCC 3 - - 3 40 60 3 3
Algorithms
Database Management
4 U23IT402 PCC 3 - - 3 40 60 3 3
Systems
5 U23CS403 PCC JAVA Programming 3 - - 3 40 60 3 3

6 U23CS4L1 PCC - - 3 3 25 50 3 1.5

Software Engineering Lab
Database Management
7 U23IT4L2 PCC - - 3 3 25 50 3 1.5
Systems Lab
8 U23CS4L2 PCC JAVA Programming Lab - - 3 3 25 50 3 1.5
Total 14 01 09 24 275 450 -- 19.5
L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical

BSC: Basic Science Course IT: Information Technology
HSMC: Humanities and Social Sciences including Management Course
PCC: Program Core Course CS: Computer Science
MA: Mathematics EN: English
Note:
Course Code Course Title Core / Elective

MATHEMATICS – III
U23MA401 (PROBABILITY AND STATISTICS)
Core
Branch -CSE(AIML), IT, AIML, ECE & CSE
Prerequisite Contact Hours Per Week Credits

CIE SEE
Basic Maths L T D P
3 1 - - 40 60 4
Course Objectives
The objective of the course is to:
1. Introduce the basic concepts of probability and statistics in engineering
2. Provide an overview of concepts of probability and statistics to engineers
3. Provide the knowledge of probability distributions, tests of significance
4. Acquire the concepts of curve fitting, correlation and regression.
5. Familiar with the concept of tests of hypothesis for decision making
Course Outcomes
1. Determine Probability, Random variables, distributions and its application
2. Apply the knowledge of some standard discrete probability distributions and moments
3. Calculate parameters of standard continuous probability distributions.
4. Find the parameters and concepts of correlation, regression and obtain the knowledge of sampling Theory with
context to test of hypothesis.
5. Analyze and check the validity of statement using testing of hypothesis for various parameters and goodness of
fit.
Unit-I
Introduction of Probability, Conditional probability, Baye’s Theorem and its applications, Random variables, Types
of random variables, Probability mass function and Probability density function, Mathematical expectations.
Unit-II
Discrete probability distributions: Binomial and Poisson distributions, Mean, variance, moment generating function
and evaluation of statistical parameters for these distributions.
Unit-III
Continuous probability distributions, Uniform, Exponential and Normal distributions, Mean,
varianceandevaluationofstatisticalparametersforthesedistributions.
Unit-IV
Curve fitting by the method of least squares: fitting of straight lines, second degree parabolas and more general
curves, Correlation, regression and Rank correlation. Test of significance: Large sample test for single proportion,
difference of proportions, single mean, difference of means.
Unit-V
Small Sample test for single mean, difference of means, test for ratio of variances, Chi-square test for goodness off it
and independence of attributes, Low Rank Matrix, Singular Valued Decomposition (SVD).
Suggested Reading:
1. Advanced Engineering Mathematics, R.K.Jain & Iyengar, Narosa Publications.
2. B.S. Grewal, “Higher Engineering Mathematics”, Khanna Publishers,2000.
3. Engineering Mathematics,P.Sivaramakrishna Das &C. Vijaya Kumar, Pearson India
a. Education Services Pvt.Ltd.
4. Engineering Mathematics, SS Sastry, PHI Learning, Private Limited
5. . Fundamentals of Mathematical Statistics, S.C.Gupta & V.K.Kapoor, S.ChandPub.
6. P.G.Hoel, S.C.Portand C.J.Stone, “Introduction to Probability
Theory”, Universal BookStall, 2003.
7. W.Feller,“An Introduction to Probability Theory anditsApplications”,Vol.1,
Wiley, 1968.
8.N.P. Bali and M.Goyal, “A textbook of Engineering Mathematics”, Laxmi Publications
U23CS401 SOFTWARE ENGINEERING Core

L T D P
DSA 3 - - - 40 60 3
Course Objectives:
Develop ability to
1. Impart knowledge on various phases, methodologies and practices of software development.
2. Understand the importance of testing in software development.
3. Study various testing strategies along with its relationship with software quality and metrics.
4. Learn how to utilize and exhibit strong communication and interpersonal skills, as well as professional
and ethical principles when functioning as members and leaders of multi-disciplinary teams
5. Introduce the basic concepts of software development processes from defining a
product to shipping and maintaining
Course Outcomes
At the end of the Course, Student would be:
1. Acquired working knowledge of alternative approaches and techniques for each phase of software development
2. Judge an appropriate process model(s) assessing software project attributes and analyse necessary requirements
for project development eventually composing SRS
3. Creation of visual models to describe (non-) algorithmic solutions for projects using various design principles.
4. Acquire skills necessary as an independent or as part of a team for architecting a complete software
project by identifying solutions for recurring problems exerting knowledge on patterns.
5. Concede product quality through testing techniques employing appropriate metrics by understanding the
practical challenges associated with the development of a significant software system.
UNIT-I
Introduction to Software Engineering: A generic view of Process: Software Engineering, Process
Framework, CMM Process Patterns, and Process Assessment.
Process Models: Prescriptive Models, Waterfall Model, Incremental Process Models, Evolutionary Process
Models, Specialized Process Models, the Unified Models,
An Agile view of Process: Introduction to Agility and Agile Process, Agile Process Models.
UNIT-II
Software Engineering Principles: SE Principles, Communication Principles, Planning Principles, Modeling
Principles, Construction Principles, Deployment.
Requirements Engineering: A Bridge to Design and Construction, Requirements Engineering Tasks,
Initiating Requirements Engineering Process, Eliciting Requirements,
Developing Use-Cases, Building the Analysis Model, Negotiating Requirements, Validating Requirements.
UNIT-III
Building the Analysis Model: Requirements Analysis Modeling Approaches, Data Modeling Concepts,
Object-Oriented Analysis.
Design Engineering: Design within the context of SE, Design Process and Design Quality, Design Concepts, The
Design Model, Pattern-based Software Design.
UNIT-IV
Creating an Architectural Design: Software Architecture, Data Design, Architectural Styles and Patterns,
Architectural Design.
Performing User Interface Design: The Golden Rules, User Interface Analysis and Design, Interface Analysis,
Interface Design Steps, Design Evaluation.
UNIT-V
Testing: Strategies: A Strategic Approach to Conventional Software Testing, Software Testing Fundamentals,
Black-box and White-box Testing, Basis Path Testing, Control Structure Testing.
Software Quality: Definition, Quality Assurance, Basic Elements, Formal Approaches, Statistical Software Quality
Assurance, Software Reliability.
Suggested Readings:
1. Roger S. Pressman, Bruce R Maxim “Software Engineering: A Practitioner 's Approach” , 9th Edition, McGraw
Hill,
2. Ali Behforooz and Frederick J. Hudson, Software Engineering Fundamentals, Oxford University Press,1996
3. Pankaj Jalote, An Integrated Approach to Software Engineering, 3rd Edition, Narosa Publishing House,
2008

U23CS402 DESIGN AND ANALYSIS OF ALGORITHMS Core

Prerequisite CI SEE Credits
L T D P E
Data Structures 3 1 - - 40 60 4
Course Objectives:
The objectives of this course are:
1. Acquire the knowledge of Algorithm and problem-solving technique, limitations of algorithms.
2. Understand different techniques like divide and conquer, transfer and conquer etc., to solve problems.
3. Understand different techniques like greedy method and dynamic programming
4. Understand the concepts of Np-Hard And Np-Complete.
5. Illustrating the methods of backtracking and branch bound techniques to solve the problems like N-queens problem,
graph coloring
Course Outcomes
At the end of the course, the students will be able to:
1. Identify asymptotic notations and basic efficiency classes.
2. Solve problems using various techniques like divide-and-conquer and transfer-and-conquer.
3. Use different algorithms like TSP, Floyd’s etc. to solve real world problems.
4. Introduce the P and NP classes.
5. Develop solutions for n - Queens problem, Subset – Sum Problem, Assignment problem, Knapsack problem etc.
UNIT - I
Introduction: Algorithm, Fundamentals of algorithmic problem solving, Fundamentals of the analysis of algorithm
efficiency, Asymptotic Notations and basic efficiency classes, Mathematical Analysis of Non-Recursive and
Recursive Algorithms, The substitute method, Recursion tree method, Master method.
UNIT - II
Divide and conquer: Divide and Conquer: General Method, Binary Search, finding minimum and maximum Merge
Sort analysis, Quick Sort analysis, Strassen’s matrix multiplication.
Transfer and conquer: Introduction, Balanced search trees, Heap and Heap sort.
UNIT - III
The greedy method: The General Method, Knapsack problem, Job Sequencing with Deadlines, Minimum- Cost
Spanning Trees: Prim’s Algorithm, Kruskal’s Algorithm, Single Source Shortest Paths.
Dynamic programming: The General Method, multistage graph, Warshall’s Algorithm, Floyd’s Algorithm for the
All-Pairs Shortest Paths Problem, single source shortest path, The Travelling Salesperson problem, optimal binary
search,0/1 knapsack.
UNIT – IV
Pattern Matching: The naïve string-matching algorithm, Brute Force String Matching, KMP algorithm.
Np-Hard and Np-Complete Problems: Basic concepts: non-deterministic algorithms, the classes NP - Hard and
NP, NP Hard problems, clique decision problem, chromatic number decision problem, Cook's theorem.
UNIT V
Backtracking: n - Queens Problem, Subset – Sum of Subsets Problem, graph coloring.
Branch and bound: Assignment problem, Knapsack problem, 15 puzzle problem, travelling salesman problem
Tries: Standard Tries, Compressed Tries, Suffix Tries, Search Engine Indexing.
Suggested Readings:
1. “Introduction to The Design and Analysis of Algorithms”, Anany Levitin (Chapters 1-5,7,9,11), Pearson
Education, Delhi, 2nd Edition, 2007, ISBN: 9780321358288.
2. “Fundamentals of Computer Algorithms”, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: (Chapters
1,3-8,10-12), Universities Press, Hyderabad, 2nd Edition, 2007, ISBN: 10: 8173716129.
3. “Introduction to Algorithms”, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: PHI,
London, England, 3rd Edition, 2010, ISBN: 9780262033848.
4. “Introduction to the Design and Analysis of Algorithms A Strategic Approach”, R.C.T. Lee, S.S. Tseng, R.C.
Chang and Y.T. Tsai: McGraw-Hill Higher Education, USA, International Edition, 2005, ISBN-13: 978-
0071243469.

U23IT402 DATABASE MANAGEMENT SYSTEMS Core

L T D P
PPS 3 - - - 40 60 3
Course Objectives:
The objectives of this course is to impart knowledge
1. Understand the role of database management system in an organization and learn the database concepts.
2. Design databases using data modelling and Logical database design techniques.
3. Construct database queries using relational algebra and calculus and SQL.
4. Understand the concept of a database transaction and related concurrent, recovery facilities.
5. Understand the concepts of Triggers and Stored Procedures.
Course Outcomes
1. Design ER-models to represent simple database application scenarios and Construct database queries using SQL.
2. Construct database queries using relational algebra and calculus.
3. Recognize and identify the use of normalization and functional dependency in database design.
4. Apply the concept of a database transaction and related concurrent, recovery facilities.
5. Apply and relate how to evaluate a set of queries in query processing.
UNIT - I
Conceptual Modeling Introduction: Introduction to Data bases: Purpose of Database systems, view of data, data
models, Database languages, Database users, various components of overall DBS architecture, various concepts of
ER model, basics of Relational Model.
SQL Query – Basics:
SQL – Data Definition commands, Queries with various options, Data manipulation commands, Views, Joins,
views, integrity and security.
UNIT – II
Relational Approach
Relational algebra and calculus: Relational algebra, selection and projection, set operations, renaming, joins,
division, examples of algebra queries, relational calculus: Tuple relational calculus, Domain relational calculus,
expressive power of algebra and calculus.
UNIT - III
Introduction to NoSQL: Introduction, Overview and History of NoSQL Databases – The Definition of the Four
Types of No SQL Databases, differences between SQL and No SQL.
Normalization: Pitfalls of RDBD, Lossless join decomposition, functional dependencies, Armstrong axioms,
normalization for relational databases 1st, 2nd and 3rd normal forms, BCNF, Basic definitions of MVDs and JDs,
4th and 5th normal forms.
UNIT - IV
Transaction Management: Transaction processing: Transaction concept, transaction State, implementation of
atomicity and durability, concurrent executions, serializability, recoverability. Concurrency Control: Lock-based
protocols, timestamp-based protocols, validation-based protocols, multiple granularities, multi-version schemes,
deadlock handling.
UNIT – V
Data Storage: Overview of physical storage media, magnetic disks, storage access, file organization, organization
of records in files.
Indexing and Hashing: Basic concepts, types of indexing, difference between B and B+ Indexing, static hashing,
Dynamic Hashing.
Suggested Readings:
1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, "Database System Concepts", McGraw-Hill, 6th Edition,
2017.
2. Ramez Elmasri, Shamkant B. Navathe, "Fundamental Database Systems", Pearson Education, 6th Edition, 2014.
3. Raghu Ramakrishnan, "Database Management System", Tata McGraw-Hill Publishing Company, 3rd Edition,
2007.
4. Hector Garcia Molina, Jeffrey D. Ullman, Jennifer Widom, "Database System Implementation", Pearson
Education, United States, 1st Edition, 2000.
5. Peter Rob, Corlos Coronel, "Database System, Design, Implementation and Management", Thompson Learning
Course Technology, 5th Edition, 2003.
LIET(A), B. E. (CSE) AICTE Model Curriculum with effect from Academic Year 2024-25

U23CS403 JAVA PROGRAMMING Core

L T D P
PPS 3 - - - 40 60 3
Course Objectives:
Develop ability to
1. Learn fundamentals of object-oriented programming in Java which includes defining classes, invoking
methods, difference between applet and application programs, using class libraries
2. Create Java application programs using sound OOP practices such as interfaces and inheritance
3. Analyze the concepts of packages, exceptions.
4. Use Knowledge of Collection framework, AWT and event handling to solve real-world problems.
5. Apply the concepts of JDBC to organize data efficiently.
Course Outcomes
1.Familiarization of OOP concepts and basics of java programming.
2.Describe the concept of interfaces and inheritance, how to solve real world problems.
3.Choose a suitable package to develop the inter process communication using multithreading.
4.Build GUI applications using AWT and Swings.
5.Describe the connectivity to database and java programming using JDBC Connectivity.
UNIT – I
Object Oriented Programming and principles: definition of OOP, Benefits of Object-Oriented Programming.
Introduction to Java: Java buzzwords, byte code. Java Programming Fundamentals, data types, variables, arrays,
operators, expressions, control statements, concepts of classes, objects, constructors, methods, access control,
overloading methods, and constructors, static, final, exploring string class.
UNIT – II
Inheritance: Inheritance concept, types of inheritance, Member access rules, use of super and final.
Polymorphism - dynamic binding, method overriding, abstract classes and methods.
Interfaces: Defining an interface, implementing interfaces, extending interfaces.
Packages: Defining, Creating and Accessing a Package, importing packages
UNIT – III
Exception handling: Benefits of exception handling, classification, checked exceptions and unchecked exceptions,
usage of try, catch, throw, throws and finally, rethrowing exceptions, built-in exceptions, creating own exception sub
classes.
Multithreading: Java Thread Model-life cycle, The Main Thread, creating a Thread, creating multiple threads,
using is Alive() and join(), thread priorities, synchronization, inter-thread communication, deadlock.
Collections: Overview of Java Collection frame work, commonly used Collection classes- ArrayList, LinkedList,
HashSet, TreeSet. Iterator, Working with Maps. Legacy classes and interface.
UNIT –IV
Other Utility classes: String Tokenizes, Scanner Java Input/output: exploring java.io, Java I/O classes and
interfaces, File, Stream classes, byte stream, character stream, serialization.
GUI Programming with Java: The AWT class hierarchy, MVC architecture. AWT classes and Interfaces, Applet
Revisited: Basics, architectureand skeleton, simple applet program.
Event Handling: Delegation Event Model, Event Classes, Source of Events, Event Listener Interfaces. Handling
mouse and keyboard events and adapter classes.
UNIT – V
Exploring Swings: JLabel, JTextField, JcomboBox. Servlet : Life of Servlet, Simple servlet programs, JSP:
Introduction, advantages and JSP vs servlet.
Database Programming using JDBC: Introduction to JDBC, JDBC Drivers & Architecture, CURD operation
Using JDBC.
Suggested Readings:
1. Herbert Scheldt, “The Complete Reference Java, 7th Edition, Tata McGraw Hill,2006.
2. James M Slack, Programming and Problem Solving with JAVA, Thomson Learning,2002.
3. C Thomas Wu, An Introduction to Object Oriented Programming with Java 5th Edition, McGraw Hill
Publishing,2010.
4. H. M. Dietel and P. J. Dietel, Java How to Program, Sixth Edition, Pearson Education PHI.
Course code Course Title Core/Elective

Soft Skills Development Lab
U23EN4L1 [CSE, CSD, CIVIL & EEE] Core
Pre-requisites Contact Hours Per Week

CIE SEE Credits
L T D P
Basic English
- - - 3 25 50 1.5
Course Objectives:
To expose the students to:
1. Improve the students’ fluency in English, through Interpersonal Communication skills.
2. Read the given text at normal speed and analyze and evaluate critically.
3. Exhibit their ability and skills relevantly and coherently through resume writing and cover letter
writing.
4. Develop oral presentation skills to meet the global competition.
5. Boost confidence through the dynamics of Group Discussion.
6. Prepare all the students for their placements through Mock Interviews.
Course Outcomes:
On successful completion of the course the students would be able to:
1. Organize ideas relevantly and coherently in their communication
2. Analyze and Comprehend the text inferentially
3. Write Resume/CV and Cover letter effectively
4. Practice oral presentation confidently
5. Participate in group discussions dynamically and face interviews optimistically
List of Activities:
1. Activities on Fundamentals of Inter-personal Communication: Starting a conversation, responding

appropriately and relevantly – using the right body language and Role Play in different situations.
2. Activities on Reading Comprehension: General Vs. Local comprehension, reading for facts, guessing
meanings from context, scanning, skimming, inferring meaning, critical reading.
3. Activities on Writing Skills: Structure and presentation of different types of Resume/CV writing, cover
letter writing, improving one’s writing of Resume and Cover letter.
4. Activities on Presentation Skills: Oral presentations through JAM, Extempore, Seminars and Poster
Presentations.
5. Activities on Group Discussion and Interview Skills: a). Dynamics of group discussion, intervention,
summarizing, modulation of voice, body language, relevance, fluency and organization of ideas and rubrics
for evaluation. b). Concept and Process, Pre-interview planning, opening strategies, answering strategies,
interview (Types) and Mock Interviews.
Reference Books:
1. Koneru Aruna. (2016). Professional Communication. Tata McGraw-Hill Publishing Company. Ltd, New Delhi
2. Raman, Meenakshi& Sharma, Sangeeta. (2015). Technical Communication: Principle sand Practice (3rd Ed.).
New Delhi.
3. Anderson Paul V. (2007). Technical Communication. Wadsworth Cengage Learning Pvt. Ltd.
4. Sen Leena. (2009). Communication Skills.PHI Learning Pvt Ltd., New Delhi,
5. Downes Colm. (2008). Job Hunting. Cambridge University Press.
U23IT4L2 DATABASE MANAGEMENT SYSTEMS LAB Core

L T D P
PPS - - - 3 25 50 1.5
Course Objectives:
1. Introduce ER data model, database design and normalization
2. Learn SQL basics for data definition and data manipulation
3. To understand the basic concepts and the applications of database systems.
4. Be acquainted with the basics of transaction processing and concurrency control.
5. Learn the concepts of Views, Stored Procedure and Triggers.
Course Outcomes
1. Design database schema for a given application and apply normalization
2. Gather skills in using SQL commands for data definition and data manipulation.
3. Demonstrate creation and usage of Views and Stored Procedures using SQL.
4. Develop solutions for database applications using procedures, cursors and triggers
5. To design and build a simple database system and demonstrate competence with the fundamental tasks involved
with modelling, designing, and implementing a DBMS.
Scenario: Product-Sales database: South wind database is a sample database used by Organization. The database
contains the sales data for South wind Traders; it is foods export-import Company. Using this schema to
demonstrate the how customer can choose and order products, how orders are placed and how those products get
delivered to the customer. Products: This Entity will have all the products details where suppliers will supply
products based on customers demand. Supplies: This Entity will supply the products demanded by the customers.
Shippers: This Entity will take the orders from suppliers and deliver to customers. Employees: Employees will
monitor the orders placed by customers. Invoices: This Entity will take care of billing process based on customer
order. Etc... Identify some more entities and find out relationship between them. Product-sales the above process
involves many steps like
1. Analyzing the problem and identifying the Entities and Relationships,
2. E-R Model
3. Relational Model
4. Normalization
5. Creating the database
6. Querying.
Experiment 1: E-R Model
Analyze and come up with the entities in it. Identify what data has to be persisted in the database. This contains the
entities, attributes etc. Identify the primary keys for all the entities. Identify the other keys like Foreign Key and
constraints like NULL, NOT NULL, CHECK etc. Example to create for products, customers, suppliers, orders, ,
employees, order details, categories, among others. Students should submit E-R diagrams using the above tables.
Experiment 2: DDL
How to create tables, altering the database or tables, dropping tables if not required. You will also try truncate,
rename commands etc. Data Definition Language (DDL) : create , alter, drop.
Experiment 3: DML
Data Manipulation Language Commands (DML) commands are used to for managing data within schema objects.
Exercising the commands using DML: insert, delete, update on the following tables: products, customers, suppliers,
orders, , employees, order details, categories.
● INSERT – insert data into a table.
● UPDATE – updates existing
Experiment 4: Querying
data within a table.
● DELETE – deletes single or all records from a table.
Data Query Language – Select Populate all the tables designed in experiment: 2 with appropriate data.
Practice queries on Aggregate functions like count, max, min, avg, sum Practice queries like nested queries/co-
related queries using ANY, ALL, IN, Exists, NOT EXISTS, UNION, INTERSECT, group by, having etc.
Joins: Join , Left Outer Join, Right Outer Join, Self Join
Experiment 5 : Querying(continued…)
Some example to practice the queries:
1. Display all the order details of given a customer.
2. Display all the products.
3. Get the highest sold product from given supplier ID
4. List all products grouped by category
5. List the products, whose products unit price is greater then all the products of average.
6. List Details of order and customer of each order
7. List the products which were sold in year 1997
8. Display the total amount for each order
9. Display Order Details for given an order ID
10. Order Details: product name and unit price for given order ID Exercising Simple to complex
11. Queries using joins, nested and co-related queries.
Experiment 6 : Programs on pl/sql

1. Write aPL/SQL program to swap two numbers.
2. Write aPL/SQL program to find the largest of three numbers
3. Write aPL/SQLprogramtofindthetotalandaverageof6subjectsanddisplaythegrade.
4. Write aPL/SQL program to find the sum of digits in a given number.
5. Write aPL/SQL program to display the number in reverse order.
6. Write a PL/ SQL program to check whether the given number is prime or not.
7. Write aPL/SQL program to find the factorial of a given number.
Experiment 7 : Stored Procedures :

1. Create a stored procedure, Alter and Drop a procedure, IN, OUT, IN & OUT parameters
2. Create a Procedure to display order details of given customer ID like ordered, order Date ,
Required Date, Shipped Date
3. Create a procedure to accept a customer ID and display the customer order history (product name and how much
quantity ordered for that particular product)
Ex: product name, Total quantity he/she ordered.
4. Create a procedure to display Ten Most Expensive Products Columns should be displayed
Product name & Unit price
Experiment 8: Views
1. Create a view to display the current product list which is available (not discontinued)
2. Create a view to display the products by category
3. Display product name, quantity Per Unit, units In Stock, Discontinued
4. Create a view as ―Invoices‖ to display all the information from order, customer, and shipper for each Order
Details
Experiment 9: Triggers
Demonstrate Create Trigger, Alter Trigger, Drop Trigger, Row Level, Table Level triggers, Before Insert, After
Insert, Before Update, After Update, Before Delete, After Delete
Experiment 10: Case study: Book Publishing Company

A publishing company produces scientific books on various subjects. The books are written by authors
who specialize in one particular subject. The company employs editors who, not necessarily being
specialists in a particular area, each take sole responsibility for editing one or more publications.
A publication covers essentially one of the specialist subjects and is normally written by a single author.
When writing a particular book, each author works with on editor, but may submit another work for
publication to be supervised by other editors. To improve their competitiveness, the company tries to
employ a variety of authors, more than one author being a specialist in a particular subject for the above
case study, do the following:
a. Analyze the data required.
b. Normalize the attributes.
Create the logical data model using E-R diagrams.
Experiment 11: Case Study: General Hospital

A General Hospital consists of a number of specialized wards (such as Maternity, Pediatric, Oncology, etc). Each
ward hosts a number of patients, who were admitted on the recommendation of their own GP and confirmed by a
consultant employed by the Hospital. On admission, the personal details of every patient are recorded. A separate
register is to be held to store the information of the tests undertaken and the results of a prescribed treatment. A
number of tests may be conducted for each patient. Each patient is assigned to one leading consultant but may be
examined by another doctor, if required. Doctors are specialists in some branch of medicine and may be leading
consultants for a number of patients, not necessarily from the same ward. For the above case study
For the above case study, do the following.
a. Analyze the data required.
b. Normalize the attributes.
Create the logical data model using E-R diagrams.
Suggested Readings
1. Raghurama Krishnan, Johannes Gehrke, ―Database Management Systems‖, Tata McGraw Hill, 3rd
Edition, 2008.
2. Silberschatz, Korth, ―Database System Concepts‖, McGraw Hill, V edition, 2005.
3. Rick F. Vander Lans, ―Introduction to SQL‖, Pearson education, 2007.
4. B. Rosenzweig and E. Silvestrova, ―Oracle PL/SQL‖, Pearson education, 2004.
5. Dr. P. S. Deshpande, ―SQL & PL/SQL for Oracle 10g‖, Black Book, Dream Tech, 2006.
6. M. Mc Laughlin, ―Oracle Database 11g PL/SQL Programming‖, TMH, 2017.
LIET(A), CSE AICTE Model Curriculum with effect from Academic Year 2024-25
U23CS4L2 JAVA PROGRAMMING LAB Core

L T D P
PPS - - - 3 25 50 1.5
Course Objectives:
Develop ability to
1. Build software development skills using java programming for real world applications.
2. Implement frontend and backend of an application
3. Create Java application programs using sound OOP practices such as interfaces,exception handling
multi-threading.
4. Understand fundamentals of object-oriented programming in Java.
5. Implement classical problems using java programming.
Course Outcomes
1. Develop Java applications using the concepts of Inheritance, interfaces, packages,access control specifies.
2. Implement the concepts of Exception Handling in java Applications.
3. Read and write data using different Java I/O streams.
4. Create graphical user interfaces and Applets by applying the knowledge of EventHandling.
5. Create robust applications using Java standard class libraries and retrieve data from a database with JDBC.
1. a) Write a Java sample program to implement class and object concepts.
b) Write a Java program to illustrate types of constructors.
2. a) Write a Java program to illustrate the concept of Single level and Multi level Inheritance.
b) Write a Java program to illustrate the concept of class with method overloading and method overriding
3. a) Write a Java program to demonstrate the Interfaces & Abstract Classes.

b) Write a Java program to implement the concept of exception handling.
c) Write a Java program to illustrate the concept of threading using Thread Classand runnable Interface.
4. Write a Java program to illustrate the concept of Thread synchronization.
5. Write a Java Program that reads a line of integers, and then displays each integer, and the sum of all the
integers (Use String Tokenizer class of java.util)
6. a) Write a Java program that reads a file name from the user, and then displays inform action about
whether the file exists, whether the file is readable, whether the file is writable, the type of file and the
length of the file in bytes.
b) Write a Java program to illustrate the concept of I/O Streams.
7. a) Write a Java applet program to implement Color and Graphics class

b) Write a Java program to implement AWT class
8. Write a Java applet program for handling mouse & key events
9. Write a Java applet program to implement Adapter classes
10. Write a JDBC program to implement CURD operation
11. Write a Java program that works as a simple calculator. Use a grid layout to arrange buttons for the digits
and for the +, -, *, % operations. Add a text field todisplay the result.
12. Write Servlet application for following

i. Html & Servlet Communication
ii. Select record from database
iii. Application for login page
iv. Insert record into database
Suggested Readings:
1. Herbert Scheldt, “The Complete Reference Java, 7th Edition, Tata McGraw Hill,2006.
2. James M Slack, Programming and Problem Solving with JAVA, Thomson Learning,2002.
3. C Thomas Wu, An Introduction to Object Oriented Programming with Java 5th Edition, McGraw Hill
Publishing,2010.
4. H. M. Dietel and P. J. Dietel, Java How to Program, Sixth Edition, Pearson Education.
LIET(A), CSE AICTE Model Curriculum with effect from Academic Year 2024-25
U23CS4L1 SOFTWARE ENGINEERING LAB Core

L T D P
PPS - - - 3 25 50 1.5
Course Objectives:
Develop ability to
1. To have hands on experience in developing a software project by using various software engineering
principles and methods in each of the phases of software development.
2. To understand the software engineering methodologies involved in the phases for project
development.
3. To gain knowledge about open source tools used for implementing software engineering methods.
4. To exercise developing product-startups implementing software engineering methods
5. Open source Tools: Star UML / UML Graph / Top cased
Course Outcomes
1. Ability to translate end-user requirements into system and software requirements
2. Ability to generate a high-level design of the system from the software requirements
3. Will have experience and/or awareness of testing problems and will be able to develop a simple
testing report
4. Compare the process of requirements development and requirements management
5. Determine the importance of requirements classification
List of Experiments
Do the following 8 exercises for any two projects given in the list of sample projects or any
other projects:
1. Development of problem statement.
2. Preparation of Software Requirement Specification Document, Design Documents and
Testing Phase related documents.
3. Preparation of Software Configuration Management and Risk Management related
documents.
4. Study and usage of any Design phase CASE tool
5. Performing the Design by using any Design phase CASE tools.
6. Develop test cases for unit testing and integration testing
7. Develop test cases for various white box and black box testing techniques.
Sample Projects:
1. Passport automation System
2. Book Bank
3. Online Exam Registration
4. Stock Maintenance System
5. Online course reservation system

6. E-ticketing
7. Software Personnel Management System
8. Credit Card Processing
9. E-book management System.
10. Recruitment system
Suggested Readings:
1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition, Mc Graw
Hill International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.
3. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson,
Pearson Education.

Annexure-IV LR 23 III & IV Semester Syllabus

Uploaded by

Copyright:

Available Formats

Annexure-IV LR 23 III & IV Semester Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Annexure-IV LR 23 III & IV Semester Syllabus

Uploaded by

Copyright:

Available Formats

LIET(A), B.E.

LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY

2 U23ME307 ESC Operations Research 3 0 0 3 40 60 3 3

3 U23CS301 PCC Discrete Mathematics 3 1 0 4 40 60 3 4

4 U23CS302 PCC Data Structures 3 0 0 3 40 60 3 3

5 U23CM301 PCC Python Programming 3 0 0 3 40 60 3 3

Practical/ Laboratory Course

7 U23CS3L1 PCC Data Structures Lab 0 0 3 3 25 50 3 1.5

8 U23EC3L4 ESC Data Visualization Lab 0 0 3 3 25 50 3 1.5

9 U23CS3L2 ESC C Programming Lab - - 2 2 50 - - 0

L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical D: Drawing (Hrs/Wk/Sem)

LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY

L T P/D CIE SEE

5 U23CS403 PCC JAVA Programming 3 - - 3 40 60 3 3

6 U23CS4L1 PCC Software Engineering Lab - - 3 3 25 50 3 1.5

8 U23CS4L2 PCC JAVA Programming Lab - - 3 3 25 50 3 1.5

Total 15 1 09 25 275 450 -- 20.5

L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical D: Drawing (Hrs/Wk/Sem)

CIE: Continuous Internal Evaluation SEE: Semester End Examination

LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY

L T P/D CIE SEE

3 U23CS503 PCC Operating Systems 3 0 0 3 40 60 3 3

4 --- PEC Professional Elective-I 3 0 0 3 40 60 3 3

5 --- OEC Open Elective-I 3 0 0 3 40 60 3 3

Practical/ Laboratory Course

7 U23CS5L2 PCC Computer Networks Lab 0 0 3 3 25 50 3 1.5

Total 15 2 8 25 300 400 -- 21

L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical D: Drawing (Hrs/Wk/Sem)

CIE: Continuous Internal Evaluation SEE: Semester End Examination

LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY

2 U23CS601 PCC Artificial Intelligence 3 0 0 3 40 60 3 3

3 U23CS602 PCC Compiler Design 2 1 0 3 40 60 3 3

4 -- PEC Professional Elective-II 3 0 0 3 40 60 3 3

5 -- OEC Open Elective II 3 0 0 3 40 60 3 3

7 U23CS6L2 PCC Compiler Design Lab 0 0 3 3 25 50 3 1.5

8 U23EN6L1 PCC Scripting Languages Lab - - 2 2 50 - - 1

9 U23CS6P1 PROJ Technical Seminar-1 - - 2 2 50 - - 1

Skill Development Course

10 U23MA6L1 BSC Aptitude and Reasoning Lab - - 2 2 50 - - 1

Total 14 1 12 27 400 400 -- 21

L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical D: Drawing (Hrs/Wk/Sem)

CIE: Continuous Internal Evaluation SEE: Semester End Examination

LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY

2 U23CS702 PCC Data Mining 3 0 0 3 40 60 3 3

3 --- PEC Professional Elective – III 3 0 0 3 40 60 3 3

5 --- OEC Open Elective-III 3 0 0 3 40 60 3 3

Practical/ Laboratory Course

6 U23CS7L1 PCC Machine Learning Lab - 0 3 3 25 50 3 1.5

7 U23CS7L2 PCC Data Mining Lab - 0 3 3 25 50 3 1.5

8 U23CS7P1 PROJ Mini Project - - 6 6 50 50 -- 3

Total 15 0 12 27 300 450 -- 21

L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical D: Drawing (Hrs/Wk/Sem)

CIE: Continuous Internal Evaluation SEE: Semester End Examination

LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY

4 U23CS8P2 PROJ Major Project 0 0 16 16 50 150 -- 8

5 U23CS8P1 PROJ Technical Seminar-2 0 0 4 4 100 -- -- 2

L: Lecture (Hrs/Wk/Sem) T: Tutorial (Hrs/Wk/Sem) P: Practical D: Drawing (Hrs/Wk/Sem)

CIE: Continuous Internal Evaluation SEE: Semester End Examination

LORDS INSTITUTE OF ENGINEERING AND TECHNOLOGY