LIET(A),B.

E,(CSE) AICTE Model Curriculum with effect from Academic Year 2022-23

Course Code Course Title Core/Elective

U21EC304 DIGITAL ELECTRONICS & COMPUTER ORGANIZATION Core

Contact Hours per Week

Prerequisite CIE SEE Credits
L T D P
Basic Physics 3 - - - 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.
 LIET(A),B.E,(CSE) AICTE Model Curriculum with effect from Academic Year 2022-23

Course Code Course Title Core/Elective

U21CS302 DATA STRUCTURES Core

Contact Hours Per Week
CIE SEE Credits
Prerequisite L T D P
Programming
for Problem 3 - - - 40 60 3
Solving
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. Gain programming skills to implement sorting and searching algorithms
3. Strengthen the ability to identify and apply the suitable data structures for the given real world
problem.
4. Gain knowledge in practical applications of data structures
5. Understand essential for future programming and software engineering courses.

Course Outcomes:
At the end of the course, student would be able to
1. Implement various data structures using arrays, linked lists
2. Develop ADT necessary for solving problems based on Stacks and Queues
3. Implement binary trees, general tree structures, advanced search trees, heaps, graphs.
4. Implement hash functions and handle collisions.
5. Implement various kinds of sorting techniques and apply appropriate techniques for solving a
given problem

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, applications of linear queue,
circular queue and double ended queue (deque).

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
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
UNIT – V
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.

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.
 LIET(A),B.E,(CSE) AICTE Model Curriculum with effect from Academic Year 2022-23

Course Code Course Title Core /Elective

U21CM301 PYTHON PROGRAMMING Core

Contact Hours Per Week
CIE SEE Credits
Prerequisite L T D P
Programming
for Problem 3 - - - 40 60 3
Solving
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:
At the end of the course, student would be able to
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.
 LIET(A),B.E,(CSE) AICTE Model Curriculum with effect from Academic Year 2022-23

Course Code Course Title Core/Elective

U21CS403 JAVA PROGRAMMING Core

Contact Hours per Week

Prerequisite CIE SEE Credits
L T D P
Programming of 3 - - - 40 60 3
Problem Solving
Course Objectives:
Develop ability to
1. Understand 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, exception handling,
multi-threading.
3. Understand fundamentals of object-oriented programming in Java.
4. Define classes, invoking methods, difference between applet and applicationprograms, using class libraries
5. Use Collection framework, AWT and event handling to solve real world problems.

Course Outcomes
At the end of the Course, Student would be:
1. Achieve proficiency in object-oriented concepts and also learns to incorporate the same into the Java programming
language.
2. Create Java application programs using sound OOP practices e.g., Inheritance, interfaces and proper program
structuring by using packages, access control specifiers.
3. Understand and implement the concepts of Exception Handling in JAVA.
4. Develop the ability to solve real-world problems through software development in high-level programming language
using Large APIs of Java as well as the Java standard class library.
5. Understand File, Streams, Input and Output Handling in java.

UNIT – I
Object Oriented Programming: 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, introducing access control, static, final, exploring string class.
Principles of OOPS: Data Abstraction, Data Encapsulation, Polymorphism, and Inheritance.

UNIT – II
Interfaces: Defining an interface, implementing interfaces, extending interface. Packages: Defining, Creating and Accessing
a Package, importing packages
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 subclasses

UNIT – III
Multithreading: Java Thread Model, The Main Thread, creating a Thread, creating multiple threads, using is Alive() and
join(), thread priorities, synchronization, inter thread communication, deadlockCollections: Overview of Java Collection
frame work, commonly used Collection classes.
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.
UNIT – IV
GUI Programming with java: The AWT class hierarchy, MVC architecture. Applet Revisited: Basics, architectureand
skeleton, simple applet program.
Event Handling: Delegation Event Model, Event Classes, Source of Events, Event Listener Interfaces. Handlingmouse and
keyboard events, Adapter classes.
Database Programming using JDBC: Introduction to JDBC, JDBC Drivers & Architecture, CURDoperation Using
JDBC.

UNIT – V
Exploring Swing: JLabel, Image Icon, JTextField, the Swing buttons, JTabbedpane, JScrollPane, JList,JComboBox.
Servlet: Life cycle, using tomcat, simple servlet, servlet API, javax. servlet package, reading servlet parameters,javax. servlet.
http package, handling HTTP requests and responses

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.
 LIET(A), B.E, (CSE) AICTE Model Curriculum with effect from Academic Year 2022-23

Course Code Course Title Core/Elective

U21CS401 SOFTWARE ENGINEERING Core

Contact Hours per Week

Prerequisite CIE SEE Credits
L T D P
Data Structures 3 - - - 40 60 3
Algorithm
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 analyze 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
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

Course Code Course Title Core/Elective

U21CM501 AUTOMATA THEORY, LANGUAGES AND Core
COMPUTATION
Contact Hours per Week
Prerequisite CIE SEE Credits
L T D P
Discrete 3 - - - 40 60 3
Mathematics
Course Objectives
The Objective of this course is to:
1. Develop a formal notation for strings, languages and machines.
2. Understand Regular Expression and algebraic laws.
3. Design context free grammars and PDA, to generate strings from a context free language and
convert them into normal forms.
4. Identify the hierarchy of formal languages, grammars and machines.
5. Distinguish between computability and non-computability and Decidability and undecidability.
Course Outcomes
At the end of this course, the students are able to:
1. Gain knowledge of the various abstract machines
2. Use regular languages and regular expression for constructing different finite state machines
3. Understand and design different types of grammars
4. Construct Push down Automata
5. Construct Turing Machine.
UNIT-I
Introduction to Finite Automata, Structural Representations, Basic Concepts of Automata
Theory – Symbol, Alphabets, Strings, Languages, Kleene Closure, Positive Closure
Finite Automata without Output: Deterministic Finite Automata, Nondeterministic Finite
Automata, Finite Automata with Epsilon-Transitions, Conversion of NFA to DFA

UNIT-II
Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular
Expressions, Algebraic Laws for Regular Expressions, Properties of regular sets, Conversion
of Finite Automata to Regular Expressions.
Pumping Lemma for Regular Languages, Statement of the pumping lemma, Applications
of the Pumping Lemma.
Closure Properties of Regular Languages: Closure properties of Regular languages,
Decision Properties of Regular Languages, Minimization of Automata- Equivalence, Myhill -
Nerode Theorem

UNIT-III
Context-Free Grammars: Definition of Context-Free Grammars, Derivations Using a
Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar, Sentential
Forms, Parse Trees, Ambiguity in Grammars.
Push down Automata: Definition of the Pushdown Automaton, the Languages of a PDA,
Equivalence of PDA's and CFG's, Acceptance by final state & empty stack, Deterministic
PDA Conversion of CFG to PDA, Conversion of PDA to CFG
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

UNIT-IV
Normal Forms for Context- Free Grammars: Grammar Simplification, Chomsky
Normal form, Greibach Normal form.
Context-Free Languages: Statement of pumping lemma, Applications pumping lemma
Properties of Context-Free Languages: Closure properties of CFL’s, Decision
Properties of CFL's

UNIT-V
Turing Machines: Introduction, Techniques for construction of Turing machines,
Modifications of TM, TM as enumerator, Restricted TM.
Undecidability: Recursive and Recursively enumerable languages, Halting problem,
Rice Theorem, Post’s correspondence problem, P,NP,NP-Complete, NP-Hard Problems,
Chomsky’s Hierarchy–Regular grammars, Unrestricted grammar, CSL

Suggested Reading:
1. “Introduction to Automata Theory, languages, and Computation”, John E. Hopcroft,
Rajeev Motwani and Jeffrey D. Ullman, Pearson Education India, 3rd Edition,2008.
2. “Automata and Computability, Undergraduate Texts in Computer Science”, Dexter
C. Kozen, Springer, 2007.
3. “Introduction to the Theory of Computation”, Michael Sipser, PWS Publishing 3rd
Edition,2014.
4. “Introduction to Languages and the Theory of Computation”, John Martin, Tata Mc
Graw Hill, 3rd Edition,2002.
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

Course Code Course Title Core/Elective

U21CE509 DISASTER PREPAREDNESS AND MANAGEMENT OEC-1
Contact Hours per Week
Prerequisite L T D P CIE SEE Credits
Environmental 3 - - - 40 60 3
Engineering

Course Objectives:
1. Learn about the basic principles of disaster management and the types of disasters
2. Understand the disaster management cycle and framework.
3. Know about the disaster management systems in India and the applications of the latest
technologies in disaster management
4. Understand about the different types of disasters.
5. Know about the past disasters occurred across the globe.
Course Outcomes:
After completing this course, the student will be able to
1. Apply the concepts of disaster management to evaluate a disaster situation.
2. Classify the various categories of disasters and their specific characteristics.
3. Classify the areas under disaster management.
4. Select appropriate pre-disaster, during disaster and post-disaster measures and framework.
5. Apply the geo informatics technology in disaster situation.
6. Identify the disaster management acts and frameworks specific to India relevant to a
situation.

UNIT-I
Introduction: Understanding the Concepts and definitions of Disaster, Hazard, Vulnerability,
Risk and Capacity– Disaster and Development, and disaster management.

UNIT-II
Disasters: Geological Disasters (earthquakes, landslides ,tsunami, mining); Hydro-
Meteorological Disasters (floods, cyclones, lightning, thunder-storms, hail storms,
avalanches, droughts, cold and heat waves) Biological Disasters (epidemics, pest attacks,
forest fire); Technological Disasters (chemical, industrial, radiological, nuclear) and
Manmade Disasters (building collapse, rural and urban fire, road and rail accidents, nuclear,
radiological, chemicals and biological disasters) Global Disaster Trends – Emerging Risks of
Disasters –Climate Change and Urban Disasters.

UNIT-III
Disaster Management Cycle and Framework: Disaster Management Cycle – Paradigm
Shift in Disaster Management Pre-Disaster – Risk Assessment and Analysis, Risk Mapping,
zonation Micro zonation, Prevention and Mitigation of Disasters, Early Warning System;
Preparedness, Capacity Development; Awareness. During Disaster–Evacuation–Disaster
Communication – Search and Rescue – Emergency Operation Centre – incident Command
System – Relief and Rehabilitation. Post-disaster–Damage and Needs Assessment,
Restoration of Critical Infrastructure–Early Recovery–Reconstruction and Redevelopment;
IDNDR.
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

UNIT-IV
Disaster Management in India: Disaster Profile of India – Mega Disasters of India and
Lessons Learnt Disaster Management Act 2005 – Institutional and Financial Mechanism
National Policy on Disaster Management, National Guidelines and Plans on Disaster
Management; Role of Government (local, state and national), Non-Government and Inter
Governmental Agencies.

UNIT-V
Applications of Science and Technology for Disaster Management: Geo-informatics in
Disaster Management (RS, GIS, GPS and RS) Disaster Communication System (Early
Warning and Its Dissemination) Land Use Planning and Development Regulations Disaster
Safe Designs and Constructions Structural and Non-Structural Mitigation of Disasters S&T
Institutions for Disaster Management in India.

Suggested Reading
1. Disaster Management Global Challenges and Local Solutions” Rajib, Sand Krishna
Murthy, R.R, CRC Press, 2009.
2. Earth and Atmospheric Disasters Management, Natural and Manmade. Navele, P &
Raja, C.K, B. S. Publications, 2009
3. Disaster Science and Management, Bhattacharya, Tata Mc GrawhillCompany,2017
4. Manual on natural disaster management in India, MC Gupta, NIDM, New Delhi
5. An overview on natural & man-made disasters and their reduction, RK Bhandani,
CSIR, New Delhi
6. Disaster Management Act 2005, Published by Govt. of India
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

Course Code Course Title Core/Elective

U21CS504 SOFTWARE TESTING METHODOLOGIES PE-II
Contact Hours per Week
Prerequisite CIE SEE Credits
L T D P
Software 3 - - - 40 60 3
Engineering
Course Objectives:
The objectives of this course are:
1. To understand and learn the basic concepts of Testing.
2. To follow the methodology of White Box Testing.
3. To Obtain knowledge of Integration and System Testing
4. To understand the concepts of Object-Oriented Testing.
5.To gain the knowledge of complex problems
Course Outcomes
At the end of the Course, Student will be:
1. Gain the basic knowledge of Testing.
2. Acquire the knowledge of White Box Testing methods
3.Test an application using Functional Testing.
4.Use Object Oriented Testing and Millennium Testing methods
5.Solve software complexities with best practices

UNIT - I
Basic definitions, Test cases, Insights from a Venn diagram, Identifying test cases, Error and
fault taxonomies, Verification, Validation and Testing, Levels of testing. Examples:
Generalized pseudo code, The triangle problem, The NextDate function, The commission
problem, The SATM (Simple Automatic Teller Machine) problem, The currency converter,
Saturn windshield wiper

UNIT – II
Water fall model– V–model– Spiral model– Agile model, Life cycle of testing, Static Testing
dynamic testing, Code coverage testing, Code complexity testing, White box testing Block
box testing, Regression testing, Integration Testing ,System and Performance Testing

UNIT - III
Paths, Path products and Regular expressions: Path products & path expression, reduction
procedure, applications, regular expressions & flow anomaly detection, Boundary Value
Analysis, Data Flow Testing, Slice based testing.

UNIT - IV
Test planning, cost–benefit analysis of testing, monitoring and control, test reporting, test
control Specialized testing, Object Oriented Testing.

UNIT – V
Automated tools for testing, Tool Selection & Implementation, Challenges in test automation,
GUI Testing, Software Technical Reviews, Software Testing Excellence- Best Practices.
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24
Suggested Readings:
1. “Software Testing: A Craftsman’s Approach”, Paul C. Jorgensen, CRC
Press, 4th Edition, 2007
2. “Software Testing Techniques”, Boris Biezer, Dreamtech Press, 2nd Edition, 2003
3. “Software Testing Tools”, Dr. K.V. K. K. Prasad, Dreamtech.
4. “Foundations of Software Testing”, Aditya P. Mathur, Pearson Education, 2013.
5. “Effective Methods for Software Testing”, William E. Perry, Wiley, 2nd Edition.
6. “Software Testing, Principles and Practices”, Srinivasan Desikan, Gopalaswamy Ramesh,
Pearson Education, 2006.
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

Course Code Course Title Core/Elective

U21IT602 COMPUTER NETWORKS CORE
Prerequisite Contact Hours Per Week
CIE SEE Credits
Operating L T D P
Systems 3 - - - 40 60 3
Course Objectives:
Develop ability to
1. Become familiar with layered communication architectures (OSI and TCP/IP).
2. Familiarize with flow control and error control mechanisms in data link layer
3. Study the design issues in network layer and various routing algorithms
4. Learn sockets programming and how to implement client/server programs.
5. Understand the concepts of reliable data transfer and how TCP implements these concepts
Course Outcomes:
At the end of the course, student would be able to
1. Explain the function of each layer of OSI and trace the flow of information from one
Node to another node in the network
2. Familiarize with the Transmission Media, Flow Control and Error Detection and
Correction
3. Understand the principles of IP addressing and internet routing
4. Describe the working of various networked applications such as DNS, mail, file transfer
and www
5. Implement client-server socket-based networked applications

Unit-I
Introduction: Network Uses, Topologies, Transmission Modes, Types of computer
networks,Examples of Networks, Network Technology-from local to global, Reference
Models- OSI, TCP/IP.
The Physical Layer: Transmission Media, Guided transmission media, Twisted
Pair,Coaxial Cable, Fiber Optics , Wireless transmission- Electromagnetic
Spectrum,Frequency Hopping Spread Spectrum, Direct Sequence Spread Spectrum,Ultra
Wide Band Connection,Cellular Networks-Common Concepts, Technology, Analog
Voice, Digital Voice, GSM, Digital Voice and Data,Packet Switching and 5G
technology.

Unit-II
The Data Link Layer: Design Issues, Error Detection and Correction-Error Detecting
Codes, Error Correcting Codes, Elementary Data Link Protocols-Initial Simplifying
Assumptions,Basic Transmission and receipts,Simplex Link Layer Protocols.
The Medium Access Sub layer: Channel allocations problem- Static Channel
Allocation,Assumptions for Dynamic Channel Allocation, multiple access protocols-
CSMA,Collision Free Protocols,Wireless LAN Protocols, Ethernet, Wireless LAN.

Unit-III
The Network Layer: Network layer design issues, Routing Algorithms- Distance Vector
Routing, Link State Routing, Hierarchical Routing,Broadcast Routing,Multicast Routing.
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24
Inter-networking:Concatenated virtual circuits, Connection-less internet working,
Tunneling, The network layer in the internet-IP protocol, IP addresses, OSPF, BGP,
(IPv4 and IPv6), Internet Control Protocols- ARP,RARP,ICMP,DHCP.

UNIT-IV
Network Programming: Socket Interface- Sockets, Socket Address, Elementary
Sockets, Advanced Sockets.(Book 2: Chapter 2)
The Transport Layer: Transport service, elements of transport protocol-
Addressing,Connection Establishment, Connection Release,Multiplexing, UDP-
Introduction, RPC, TCP- Introduction, TCP Service Model,TCP Protocol,Segment
Header, Connection Establishment and Connection release.

UNIT-V
The Application Layer: Domain Name System, Electronic Mail-Architecture and
Services, World Wide Web-architectural overview, dynamic web document, http,
HTTPS, Web Privacy, Content Delivery-Content and Internet Traffic, Server Farms and
Web Proxies, Peer –to- Peer Networks, Evolution of the Internet.

Suggested Readings:
1 “Computer Networks”, Andrew S.Tanenbaurn, Pearson Education, Sixth Edition, 2021.
2.”Unix Network Programming”, W. Richard stevens, Prentice Hall/PearsonEducation,
2009.
3.”Computer Networking: A Top-Down Approach Featuring the Internet”,
JamesF.Kurose, KeithW,Ross, PearsonEducation, Third Edition, 2005.
4.”Data Communications and Networking with TCP/IP Protocol Suite”, Behrouz A.
Forouzan, McGraw Hill LLC, Sixth Edition, 2021.
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

Course Code Course Title Core/Elective

U21CS601 COMPILER DESIGN Core
Contact Hours per Week
Prerequisite L T D P CIE SEE Credits
Automata Theory, 2 1 - - 40 60 3
Language &
Computation

Course Objectives:
The objectives of this course is to
1. To understand and list the different stages in the process of compilation.
2. Identify different methods of lexical analysis
3. Design top-down and bottom-up parsers
4. Identify synthesized and inherited attributes
5. Develop syntax directed translation schemes
Course Outcomes
At the end of this course, the student will be able to:
1. For a given grammar specification, develop the lexical analyzer.
2. For a given parser specification, design top-down and bottom-up parsers.
3. Develop syntax directed translation schemes.
4. Develop algorithms to generate code for target machine.
5. Develop the different analysis of Code generation

UNIT - I
Introduction: The Structure of a Compiler, Phases of Compilation, The Translation Process,
Major Data Structures in a Compiler, Bootstrapping and Porting.
Lexical Analysis (Scanner): The Role of the Lexical Analyzer, Input Buffering,
Specification of Tokens, Recognition of Tokens, The Lexical Analyzer Generator Lex.

UNIT – II
Syntax Analysis
The Role of the Parser, Syntax Error Handling and Recovery, Top-Down Parsing:
Backtracking , Recursive-descent Parsing, Predictive Parsers, LL (1) grammars, Bottom-Up
Parsing: Simple LR Parsing, More Powerful LR Parsing, Using Ambiguous Grammars,
Parser Generator YACC

UNIT - III
Syntax-Directed Translation: Syntax-Directed Definitions, S-attributed and L- attributed
Definitions, Evaluation Orders for SDD’s, Applications of Syntax-Directed Translation.
Symbol Table: Structure, Operations, Implementation and Management.

UNIT - IV
Intermediate Code Generation: Variants of Syntax Trees, Three-Address Code, Types and
Declarations, Translation of Expressions, Type Checking, Control Flow, Back patching,
Switch-statements, Intermediate Code for Procedures.
Run-time environment: Storage Organization, Stack Allocation of Space, Access to Non-
local Data on the Stack, Parameter passing, Heap Management and Garbage Collection
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

UNIT – V
Code Generation: Issues in the Design of a Code Generator, The Target Language, addresses
in the Target Code, Basic Blocks and Flow graphs, Optimization of Basic Blocks, Peephole
Optimization, Register Allocation and Assignment.
Machine-Independent Optimizations: The Principal Sources of Optimizations, Introduction
to Data-Flow Analysis

Suggested Readings:

1. “Compilers–Principles, Techniques and Tools”, Alfred V.Aho, Ravi Sethi, Jeffrey D,

Ullman, Pearson Education, 2nd Edition, 2006.
2. “Compiler Construction–Principles and Practice”, Kenneth C. Louden, Thomson,
PWS Publishing, 1st Edition, 1997.
3. “Modern Compiler Implementation C”, Andrew W. Appel, Cambridge University Press,
Revised Edition, 2004.
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24

Course Code Course Title Core/Elective

U21CE609 ROAD SAFETY ENGINEERING OEC-2
Contact Hours per Week
Prerequisite L T D P CIE SEE Credits
- 3 - - - 40 60 3
Course Objectives
1. Introduction to various factors considered for road safety and management
2. Explain the road safety appurtenances and design elements
3. Know the Cause of accidents and accident data
4. Learn crash reduction techniques
5. Discuss the various traffic management techniques
Course Outcomes
After completing this course, the student will be able to:
1. Understand the fundamentals of traffic safety analysis
2. Analyze Accident data
3. Remember the concepts of road safety in urban transport
4. Apply crash reduction techniques
5. Design of urban Infrastructure considering safety aspects.

UNIT I
Introduction: Road Safety scenario in India and World, Road Accident Characteristics.
Traffic Safety Analysis: Fundamentals of Traffic Engineering - Basic Characteristics of
Motor-Vehicle Traffic, Highway Capacity, Applications of Traffic Control Devices, Design
of Parking Facilities, Traffic Engineering Studies; Statistical Methods in Traffic Safety
Analysis Regression Methods, Poisson Distribution, Chi- Squared Distribution, Statistical
Comparisons.

UNIT II
Accident Analysis: Accident Investigations and Risk Management, Collection and Analysis
of Accident Data, Condition and Collision Diagram, Causes and Remedies, Traffic
Management Measures and Their Influence on Accident Prevention, Assessment of Road
Safety, Methods to Identify and Prioritize Hazardous Locations and Elements, Determine
Possible Causes of Crashes, Crash Reduction Capabilities and Countermeasures,
Effectiveness of Safety Design Features, Accident Reconstruction. Application of computer
analysis of accident data.

UNIT III
Road Safety in planning and Geometric Design: Vehicle And Human Characteristics,
Road Design and Road Equipment’s, Redesigning Junctions, Cross Section Improvements,
Reconstruction and Rehabilitation of Roads, Road Maintenance, Traffic Control, Vehicle
Design and Protective Devices, Post Accident Care.

UNIT IV
Traffic Signals & Road signs: Traffic Signals, Factors affecting signal design, street
lighting, Provisions for NMT Vehicles in India, Safety Provisions for Pedestrians & Cyclists,
 LIET (A), B.E. (CSE) AICTE Model Curriculum with effect from Academic Year 2023-24
Road Signs and Pavement Markings. Safety at Construction Site: Safety provisions for
workers at construction site, Construction Zone markings, signs.

UNIT V
Traffic Management safety audit: Traffic Management Systems for Safety, Road Safety
Audits and Tools for Safety Management Systems, Road Safety Audit Process, Approach to
Safety, Road Safety Improvement Strategies, ITS and Safety.

Suggested Readings:
1. Kadiyali L.R,. Traffic Engineering and Transport planning, 9th Edition, Khanna Tech
Publishers, 2013.
2. C.E.G. Justo, A. Veeraragavan and S. K. Khanna, Highway Engineering, 10th Edition,
Nem Chand Publishers, 2017.
3. Donald Drew, Traffic Flow Theory Chapter 14 in Differential Equation Models,
Springer, 1983
4. C. Jotinkhisty and B. Kent Lall, Transportation Engineering An Introduction, 3rd
Edition, Pearson publications, 2017
5. Elvik, Alena Hoye, TrulsVaa, Michael Sorenson, Handbook of Road Safety measures,
second Edition, Emerald Publishing, 2009.
6. Highway Research Programme (NCHRP) Synthesis 336.A synthesis of Highway
Research Board, Washington D.C, 2016.
 LIET(A), B.E.(CSE) AICTE Model Curriculum with effect from Academic Year 2024-25

Course Course Title Core

Code /Elective
U21CS705 MACHINE LEARNING PEC-III
Hours Per Week CIE SEE Credits
Pre- L T D P
requisite
--- 3 - - - 40 60 3
Course Objectives:
Develop ability to
1. This course explains machine learning techniques such as decision tree learning, Bayesian
learning etc.
2. To understand computational learning theory.
3. To study the pattern comparison techniques.

Course Outcomes:
At the end of the course, student would be able to
1. Understand the concepts of computational intelligence like machine learning
2. Ability to get the skill to apply machine learning techniques to address the real time
problems in different areas
3. Understand the Neural Networks and its usage in machine learning application.
4. Identify different genetic algorithms and apply learning set of rules
5. Apply Inductive and Analytical Learning to initialize the hypothesis

UNIT- I
Introduction - Well-posed learning problems, designing a learning system, Perspectives and issues in
machine learning. Concept learning and the general to specific ordering – introduction, a concept learning
task, concept learning as search, find-S: finding a maximally specific hypothesis, version spaces and the
candidate elimination algorithm, remarks on version spaces and candidate elimination, inductive bias.
Decision Tree Learning – Introduction, decision tree representation, appropriate problems for decision tree
learning, the basic decision tree learning algorithm, hypothesis space search in decision tree learning,
inductive bias in decision tree learning, issues in decision tree learning.

UNIT- II
Artificial Neural Networks-1– Introduction, neural network representation, appropriate problems for neural
network learning, perceptions, multilayer networks and the back-propagation algorithm.
Artificial Neural Networks-2- Remarks on the Back-Propagation algorithm, An illustrative example: face
recognition, advanced topics in artificial neural networks.
Evaluation Hypotheses – Motivation, estimation hypothesis accuracy, basics of sampling theory, a general
approach for deriving confidence intervals, difference in error of two hypotheses, comparing learning
algorithms

UNIT-III
Bayesian learning – Introduction, Bayes theorem, Bayes theorem and concept learning, Maximum
Likelihood and least squared error hypotheses, maximum likelihood hypotheses for predicting probabilities,
minimum description length principle, Bayes optimal classifier, Gibs algorithm, Naïve Bayes classifier, an
example: learning to classify text, Bayesian belief networks, the EM algorithm.

33
Computational learning theory – Introduction, probably learning an approximately correct hypothesis,
sample complexity for finite hypothesis space, sample complexity for infinite hypothesis spaces, the mistake
bound model of learning.
Instance-Based Learning- Introduction, k-nearest neighbour algorithm, locally weighted regression, radial
basis functions, case-based reasoning, remarks on lazy and eager learning.

UNIT-IV
Genetic Algorithms – Motivation, Genetic algorithms, an illustrative example, hypothesis space search,
genetic programming, models of evolution and learning, parallelizing genetic algorithms.

Learning Sets of Rules – Introduction, sequential covering algorithms, learning rule sets: summary, learning
First-Order rules, learning sets of First-Order rules: FOIL, Induction as inverted deduction, inverting
resolution.
Reinforcement Learning – Introduction, the learning task, Q–learning, non-deterministic, rewards and
actions, temporal difference learning, generalizing from examples, relationship to dynamic programming.

UNIT- V
Analytical Learning-1- Introduction, learning with perfect domain theories: PROLOG-EBG, remarkson
explanation-based learning, explanation-based learning of search control knowledge.
Analytical Learning-2-Using prior knowledge to alter the search objective, using prior knowledge to
augment search operators.
Combining Inductive and Analytical Learning – Motivation, inductive-analytical approaches to
learning, using prior knowledge to initialize the hypothesis.

Suggested Readings:

1. “Machine Learning” – Tom M. Mitchell, - MGH

2. “Machine Learning: An Algorithmic Perspective”, Stephen Marshland, Taylor & Francis.

34
 LIET(A), B.E.(CSE) AICTE Model Curriculum with effect from Academic Year 2024-25

Course Code Course Title Core / Elective

U21CS709 DEEP LEARNING PEC-IV

Prerequisite Contact Hours Per Week Credits
CIE SEE
Basics of python L T D P
3 - - - 40 60 3
Course Objectives:
The objectives of this course is to impart knowledge
1. Understand the concept of neural networks, convolutional neural networks, and recurrent neural
networks.
2.Implement deep learning algorithms, and learn how to train deep networks
3. Gain in-depth knowledge of TensorFlow along with its functions, operations, and the
execution pipeline
4. Understanding the major Architectures of Neural Networks and getting into the
Convolutional neural Networks
5.Understand the applications of implementing deep learning such as image processing, natural
language processing, speech recognition, deep face - facial recognition
System.
Course Outcomes
At the end of the Course, Student would be:
1. To understand the fundamentals of deep learning.
2. To be able to understand deep learning algorithms and design neural network
3. To be able to train and implement a neural network.
4. To be able to have knowledge about convolutional neural networks.
5. To be able to apply neural networks in various fields.

UNIT - I
What is deep learning? Artificial intelligence, Machine learning, and Deep learning - Artificial
intelligence -Machine learning – Learning representations from data - The “deep” in deep
learning -Understanding how deep learning works, in three figures -What deep learning has
achieved so far- The promise of AI
UNIT – II
Getting started with neural networks - Anatomy of a neural network - Layers: the building
blocks of deep learning - Models: networks of layers - Loss functions and optimizers: keysto
configuring the learning process The Neural Network-Building Intelligent Machines, The Limits
of Traditional Computer Programs, The Mechanics of Machine Learning, The Neuron,

48
Expressing Linear Perceptron’s as Neurons, Feed-Forward Neural Networks, Linear Neurons
and Their Limitations, Sigmoid,
Tanh
UNIT - III
Training Feed-Forward Neural Networks - The Fast-Food Problem - Gradient Descent - The
Delta Rule and Learning Rates - Gradient Descent with Sigmoidal Neurons – The
Backpropagation Algorithm - Stochastic and Minibatch Gradient Descent - Test Sets, Validation
Sets, and Overfitting - Preventing Overfitting in Deep Neural

UNIT - IV
Convolutional Neural Networks -Neurons in Human Vision - The Shortcomings of Feature
Selection - Vanilla Deep Neural Networks Don’t Scale - Filters and Feature Maps – Full
Description of the Convolutional Layer - Max Pooling - Full Architectural Description of
Convolution Networks - Closing the Loop on MNIST with Convolutional Networks -
Accelerating Training with Batch Normalization

UNIT – V
Deep Learning Applications - Large Scale Deep Learning - Computer Vision – Speech
Recognition - Natural Language Processing - Other Applications

Suggested Readings:

1. “Fundamentals of Deep Learning: Designing Next-Generation Machine Intelligence

Algorithms” Nikhil Buduma and Nicholas Locascio -– First Edition - O’Reilly, 2017
2. “Deep Learning with Python” Francois Chollet- -Second Edition,Manning Publications,
2017.
3. “Deep Learning: A Practitioner's Approach” Josh Patterson and Adam Gibson-– First Edition
- O’Reilly, 2017.
4.” Deep Learning” Ian Goodfellow, Yoshua Bengio, Aaron Courville -– Second Edition- MIT
Press, 2016

49
 LIET(A), B.E.(CSE) AICTE Model Curriculum with effect from Academic Year 2024-25

Course Code Course Title Core/Elective

U21CS702 DATA MINING Core
Hours Per Week
Prerequisite CIE SEE Credits
L T D P
DBMS 3 - - - 40 60 3
Course Objectives:
Develop ability to

1. To introduce the basic concepts of data Mining and its applications

2. To understand different data mining like classification, clustering and Frequent Pattern
mining
3. To introduce current trends in data mining
4. To understand, pre-process and analyze the basic concepts of Data Attributes
5. To explore the various data mining techniques (Association Analysis, Classification,
Clustering) adapted on data as per the requirement
Course Outcomes:
At the end of the course, student would be able to

1. Organize and Prepare the data needed for data mining using preprocessing techniques
2. Implement the appropriate data mining methods like classification, clustering or Frequent
Pattern mining
on a given data set
3. Define and apply metrics to measure the performance of various data miningalgorithms
4. Understanding the importance of data mining application and using the most appropriate
approach or trend for the realistic strategy.
5. Able to know data mining methodologies and trends

UNIT-I
Introduction: What is Data Mining? The process of knowledge discovery indatabases, predictive and
descriptive data mining techniques, supervised and unsupervised learning techniques. Major issues in Data
Mining. Getting to know your data: Data objects and attributed types. Basic statistical descriptions of data.
Data visualization, Measuring data similarity and dissimilarity.
UNIT-II
MINING FREQUENT PATTERNS, ASSOCIATIONS AND CORRELATIONS: Basic concepts and
methods, Frequent Item set Mining Methods, Sequential Pattern Mining concepts and Pattern evaluation
methods
UNIT-III
CLASSIFICATION: Basic concepts, Decision tree, Decision rules, Bayes classification methods, Advance
methods, Bayesian Belief Network, K-Nearest Neighbour (KNN) classifier, Classification by back
propagation, Support vector machine..

27
UNIT-IV
CLUSTER ANALYSIS: Concepts and Methods: Type of data in Cluster Analysis,Partitioning Methods,
Hierarchical Methods, Density-Based Methods, Grid-based methods, Evaluation of clustering.
UNIT-V

DATA MINING TRENDS AND RESEARCH FRONTIERS: Mining Complex Data

Types, Other Methodologies of Data Mining, Data Mining Applications, Data Mining and Society, Data
Mining trends
Suggested Readings:
1. “Data Mining: Concepts & Techniques” Jiawei Han, Micheline Kamber, Jin Pei,3rd Edition., Morgon
Koffman,2011,
2. “Data Mining”, Vikram Pudi, P. Radha Krishna, Oxford University Press, 1stEdition,2009
3. “Introductionto Data Mining” Pang-Ning Tan, Michael Steinbach, A Karpatne, and Vipin Kumar, 2nd Ed.,
Pearson Education, 2018.
4. “Data Mining and Analysis: FundamentalConcepts and Algorithms”, J Zaki Mohammed and Wagner
Meira, Cambridge University Press.

28
 LIET(A),B.E.(CSE) AICTE Model Curriculum with effect from Academic Year 2024-25

Course Course Title Core/Elective

Code
U21CS701 DISTRIBUTED SYSTEMS Core
Contact Hours per Week
Prerequisite CIE SEE Credits
L T D P
--- 3 - - - 40 60 3
Course Objectives:
The objectives of this course are
1. To acquire an understanding of the issues in distributed systems.
2. To learn about Naming and synchronization with different algorithms.
3. To study architectures and working of Distributed file systems, Distributed web-based system
4. To expose the students to distributed transaction management, security issues and replication.
5. To introduce Emerging trends in distributed computing
Course Outcomes:
On Successful completion of this course, student will be able to
1. List the principles of distributed systems and describe the problems and challenges
associated with these principles
2. To know about interposes communication and remote communication.
3. Understand Distributed Computing techniques, Synchronous and Processes.
4. Understand Distributed File Systems Apply Distributed web-based system. Understand
theimportance of security in distributed systems
5. Student will be able to know distributed service-oriented architecture.
6. To know about emerging trends in distributed computing.

UNIT – I
Introduction: Characteristics & Properties of Distributes Systems – Taxonomy - Types of
Distributed Systems Design goals – Transparency Issues.
Architectures: Architectural Styles, System Architectures, Architectures versus
Middleware, and Self- Management in Distributed Systems.
Processes: Threads, Virtualization, Software Agents, Clients, Servers, and Code
Migration. Communication: Inter process communication Mechanisms, Remote
Procedure Call, Remote Method Invocation, Message-Oriented Communication,
Stream- Oriented Communication, and Multicast Communication.
UNIT – II
Naming: Names, Identifiers and Addresses, Flat Naming, Structured Naming and
Attribute-Based Naming. Synchronization: Clock Synchronization, Logical Clocks,
Mutual Exclusion, Global Positioning of Nodes, and Election Algorithms.
Consistency and Replication: Introduction, Data-Centric Consistency Models,
Client-CentricConsistency Models, Replica Management, and Consistency Protocols.
 UNIT-III
Fault Tolerance: Introduction to Fault Tolerance, Process Resilience, Reliable Client-
Server Communication, Reliable Group Communication, Distributed Commit, and Recovery.
Distributed Object-Based Systems: CORBA, DCOM, GLOBE -Architecture, Processes,
Communication, Naming, Synchronization, Consistency and Replication, Fault Tolerance, and
Security

UNIT-IV
Distributed File Systems: File system, DFS- definition, Characteristics, Goals, SUN NFS-
NFS Architecture, NFS Implementation, Protocols, The CODA file system-Design Overview,
An Example, Design Rational, Implementation, The GOOGLE file system-Definition,
Architectures, GFS Architecture
Distributed Web-Based Systems: Traditional Web-Based Systems, Web Services
Fundamentals, The Apache Web Server, Web Server Clusters, Communication, HTTP
Fundamentals, Simple Object Access Protocol SOAP, Web Proxy Caching, Replication
for Web Hosting Systems-CDN‟S, Service-Oriented Architectures, REST and Web
Services
UNIT -V
Distributed Coordination-Based Systems -- Architecture, Naming and Security
Emerging Trends in Distributed Systems - Emerging Trends Introduction, Grid
Computing, Cloud Computing and its roots in distributed systems mechanisms and self-
management of distributed systems, Virtualization, Service Oriented Architecture, The
Future of Emerging Trends. Map-Reduce: Example, Scaling, Programming Model, Apache
Hadoop, Amazon Elastic Map Reduce, Mapreduce.net, Pig and Hive.

Suggested Readings:
1. “Distributed Systems” Andrew S. Tanenbaum and Maarten Van Steen, PHI 2nd Edition, 2009.
2. “Distributed Computing”, Sunita Mahajan and Seema Shah, Oxford University
3. “Guide to Cloud Computing” R. Hill, L. Hirsch, P. Lake, S. Moshiri,
Principles and Practice‖, Springer, 2013.
4. “Cloud Computing-Principles and Paradigms” R. Buyya, J. Borberg, A. Goscinski, Wiley,
2013.
5. “Distributed Operating Systems” by P. K. Sinha, PHI