24MA3054 DISCRETE MATHEMATICS L T P C

3 1 0 4

COURSE OBJECTIVES:
1. To extend student’s logical and mathematical maturity and ability to deal with abstraction.
2. To introduce most of the basic terminologies used in computer science courses and
application of ideas to solve practical problems.
3. To understand the basic concepts of combinatorics and graph theory.
4. To familiarize the applications of algebraic structures.
5. To understand the concepts and significance of lattices and boolean algebra which are
widely used in computer science and engineering

UNIT I LOGIC AND PROOFS 9+3

Propositional logic – Propositional equivalences - Predicates and quantifiers – Nested quantifiers
– Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT – II COMBINATORICS 9+3

Mathematical induction – Strong induction and well ordering – The basics of counting – The
pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear
recurrence relations – Generating functions – Inclusion and exclusion principle and its
applications.

UNIT – III GRAPHS 9+3

Graphs and graph models – Graph terminology and special types of graphs – Matrix
representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths

UNIT – IV ALGEBRAIC STRUCTURES 9+3

Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s –
Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and
Fields.

UNIT – V LATTICES AND BOOLEAN ALGEBRA 9+3

Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic
systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean
algebra – Sub Boolean Algebra.
TOTAL: 45+15 PERIODS

COURSE OUTCOMES:
At the end of the course the students would be able to
CO1 Understand program logic testing concepts.
CO2 Identify structures at multiple levels
CO3 Recognize functions mapping finite sets in computer science
CO4 Apply counting principles
CO5 Understand algebraic structures like groups, rings, and fields

TEXT BOOKS:
1. Rosen. K.H., "Discrete Mathematics and its Applications", 7 th Edition, Tata McGraw Hill
Pub. Co. Ltd., New Delhi, Special Indian Edition, 2017.Benny Joseph, ‘Environmental
Science and Engineering’, Tata McGraw-Hill, New Delhi, 2016.
2. Tremblay. J.P. and Manohar. R, "Discrete Mathematical Structures with Applications to
Computer Science", Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30 th Reprint, 2011.Allen,
D. T. and Shonnard, D. R., Sustainability Engineering: Concepts, Design and Case Studies,
Prentice Hall.

REFERENCES:
1. Grimaldi. R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction", 5th
Edition, Pearson Education Asia, Delhi, 2013.
2. Koshy. T. "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Lipschutz. S. and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata
McGraw Hill Pub. Co. Ltd., New Delhi, 3 rd Edition, 2010

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 3 3 2 2
2 3 3
3 3 2 2 3
4 2 2 2
5 2 2 2 2
Low (1) ; Medium (2) ; High (3)

24CS3351 DIGITAL PRINCIPLES AND SYSTEM DESIGN L T P C

3 0 2 4

COURSE OBJECTIVES:
1. To analyze and design combinational circuits.
2. To analyze and design sequential circuits
3. To develop the design, construction and operation of fluid power circuits.
4. To learn the working principles of pneumatic power system and its components.
5. To provide the knowledge of trouble shooting methods in fluid power systems.

UNIT – I COMBINATIONAL LOGIC 9

Combinational Circuits – Karnaugh Map - Analysis and Design Procedures – Binary Adder –
Subtractor – Decimal Adder - Magnitude Comparator – Decoder – Encoder – Multiplexers –
Demultiplexers.

UNIT – II SYNCHRONOUS SEQUENTIAL LOGIC 9

Introduction to Sequential Circuits – Flip-Flops – operation and excitation tables, Triggering of
FF, Analysis and design of clocked sequential circuits – Design – Moore/Mealy models, state
minimization, state assignment, circuit implementation - Registers – Counters

UNIT – III COMPUTER FUNDAMENTALS 9

Functional Units of a Digital Computer: Von Neumann Architecture – Operation and Operands of
Computer Hardware Instruction – Instruction Set Architecture (ISA): Memory Location, Address
and Operation – Instruction and Instruction Sequencing – Addressing Modes, Encoding of
Machine Instruction – Interaction between Assembly and High-Level Language

UNIT – IV PROCESSOR 9
Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control,
Microprogrammed Control – Pipelining – Data Hazard – Control Hazards.

UNIT – V MEMORY AND I/O 9

Memory Concepts and Hierarchy – Memory Management – Cache Memories: Mapping and
Replacement Techniques – Virtual Memory – DMA – I/O – Accessing I/O: Parallel and Serial
Interface – Interrupt I/O – Interconnection Standards: USB, SATA
TOTAL: 45 PERIODS
PRACTICAL EXERCISES:

1. Verification of Boolean theorems using logic gates.

2. Design and implementation of combinational circuits using gates for arbitrary functions.
3. Implementation of 4-bit binary adder/subtractor circuits.
4. Implementation of code converters.
5. Implementation of BCD adder, encoder and decoder circuits
6. Implementation of functions using Multiplexers.
7. Implementation of the synchronous counters
8. Implementation of a Universal Shift register.
9. Simulator based study of Computer Architecture.

PRACTICALS: 30 PERIODS
TOTAL: 45+30 =75 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Design various combinational digital circuits using logic gates.
CO2 Design sequential circuits and analyze the design procedures
CO3 State the fundamentals of computer systems and analyze the execution of an instruction
CO4 Analyze different types of control design and identify hazards
CO5 Identify the characteristics of various memory systems and I/O communication

TEXT BOOKS:
1. M. Morris Mano, Michael D. Ciletti, “Digital Design : With an Introduction to the
VerilogHDL, VHDL, and System Verilog”, Sixth Edition, Pearson Education, 2018.

REFERENCES:
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Naraig Manjikian, “Computer
Organization and Embedded Systems”, Sixth Edition, Tata McGraw-Hill, 2012.
2. William Stallings, “Computer Organization and Architecture – Designing for
Performance”,Tenth Edition, Pearson Education, 2016.
3. M. Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 2016.

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 2 2 2 2 2 1
 2 2 2 2 2 2 2 1
3 2 2 2 2 2 2 1
4 2 2 2 2 2 2 1
5 2 2 2 2 2 2 1
Low (1) ; Medium (2) ; High (3)

24CS3352 COMPUTER ARCHITECTURE L T P C

3 0 0 3

COURSE OBJECTIVES:
1. To learn the basic structure and operations of a computer.
2. To learn the arithmetic and logic unit and implementation of fixed-point and floating point
3. To learn the basics of pipelined execution.
4. To understand the memory hierarchies, cache memories and virtual memories
5. To learn the different ways of communication with I/O devices.

UNIT – I BASIC STRUCTURE OF A COMPUTER SYSTEM 9

Functional Units – Basic Operational Concepts – Performance – Instructions: Language of the
Computer – Operations, Operands – Instruction representation – Logical operations – decision
making – MIPS Addressing.

UNIT – II ARITHMETIC FOR COMPUTERS 9

Addition and Subtraction – Multiplication – Division – Floating Point Representation – Floating
Point Operations – Subword Parallelism..

UNIT – III PROCESSOR AND CONTROL UNIT 9

A Basic MIPS implementation – Building a Datapath – Control Implementation Scheme –
Pipelining – Pipelined datapath and control – Handling Data Hazards & Control Hazards –
Exceptions.

UNIT – IV PARALLELISIM 9
Parallel processing challenges – Flynn’s classification – SISD, MIMD, SIMD, SPMD, and Vector
Architectures - Hardware multithreading – Multi-core processors and other Shared Memory
Multiprocessors - Introduction to Graphics Processing Units, Clusters, Warehouse Scale
Computers and other Message-Passing Multiprocessors

UNIT – V MEMOERY &I/O SYSTEMS 9

Memory Hierarchy - memory technologies – cache memory – measuring and improving cache
performance – virtual memory, TLB’s – Accessing I/O Devices – Interrupts – Direct Memory
Access – Bus structure – Bus operation – Arbitration – Interface circuits - USB.
TOTAL: 45 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Understand the basics structure of computers, operations and instructions
CO2 Design arithmetic and logic unit
CO3 Understand pipelined execution and design control unit
CO4 Understand parallel processing architectures
CO5 Understand the various memory systems and I/O communication

TEXT BOOKS:
1. David A. Patterson and John L. Hennessy, Computer Organization and Design: The
Hardware/Software Interface, Fifth Edition, Morgan Kaufmann / Elsevier, 2014.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, Computer
Organization and Embedded Systems, Sixth Edition, Tata McGraw Hill, 2012

REFERENCES:

1. William Stallings, Computer Organization and Architecture – Designing for Performance,

Eighth Edition, Pearson Education, 2010.
2. John P. Hayes, Computer Architecture and Organization, Third Edition, Tata McGraw
Hill, 2012.
3. John L. Hennessey and David A. Patterson, Computer Architecture – A Quantitative
Approachǁ, Morgan Kaufmann / Elsevier Publishers, Fifth Edition, 2012

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 1 1 2
2 2 1 1 2
3 3 2 2 2 2
4 2 1 1 2
5 2 1 1 2
Low (1) ; Medium (2) ; High (3)

24CS3301 DATA STRUCTURES L T P C

3 0 0 3

COURSE OBJECTIVES:
1. To understand the concepts of ADTs.
2. To learn linear data structures – lists, stacks, and queues.
3. To understand non-linear data structures – trees and graphs.
4. To understand sorting, searching and hashing algorithms.
5. To apply Tree and Graph structures.

UNIT – I LISTS 9
Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list
implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications
of lists – Polynomial ADT – Radix Sort – Multilists.

UNIT – II STACKS AND QUEUES 9

Stack ADT – Operations – Applications – Balancing Symbols – Evaluating arithmetic
expressions- Infix to Postfix conversion – Function Calls – Queue ADT – Operations – Circular
Queue – DeQueue – Applications of Queues
UNIT – III TREES 9
Tree ADT – Tree Traversals - Binary Tree ADT – Expression trees – Binary Search Tree ADT –
AVL Trees – Priority Queue (Heaps) – Binary Heap.

UNIT – IV MULTIWAY SEARCH TREES AND GRAPHS 9

B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph - Breadth-
first traversal – Depth-first traversal –– Bi-connectivity – Euler circuits – Topological Sort –
Dijkstra's algorithm – Minimum Spanning Tree – Prim's algorithm – Kruskal's algorithm.

UNIT – V SEARCHING, SORTING AND HASHING TECHNIQUES 9

Searching – Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort
– Shell sort –. Merge Sort – Hashing – Hash Functions – Separate Chaining – Open Addressing –
Rehashing – Extendible Hashing.
TOTAL: 45 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Define linear and non-linear data structures.
CO2 Implement linear and non–linear data structure operations.
CO3 Use appropriate linear/non–linear data structure operations for solving a given problem.
CO4 Apply appropriate graph algorithms for graph applications.
CO5 Analyze the various searching and sorting algorithms.

TEXT BOOKS:
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson
Education, 2005.
2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2000.

REFERENCES:
1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition,
Pearson Education, 2015.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to
Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st
edition, Pearson, 2002.
4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 3 1 2 2 1 1 2 1 3 2 1
2 1 2 1 2 2 1 1 1 2 2 2
3 2 3 1 2 3 1 1 1 2 2 1
4 2 1 1 1 2 1 1 2 2 3
 5 1 2 1 2 2 1 1 2 1 3 2 2
Low (1) ; Medium (2) ; High (3)

24CS3391 OBJECT ORIENTED PROGRAMMING L T P C

3 0 0 3
COURSE OBJECTIVES:
1. To understand Object Oriented Programming concepts and basics of Java programming
language.
2. To know the principles of packages, inheritance and interfaces.
3. To develop a java application with threads and generics classes.
4. To define exceptions and use I/O streams.
5. To design and build Graphical User Interface Application using JAVAFX.

UNIT – I INTRODUCTION TO OOP AND JAVA 9

Overview of OOP – Object oriented programming paradigms – Features of Object Oriented
Programming – Java Buzzwords – Overview of Java – Data Types, Variables and Arrays –
Operators – Control Statements – Programming Structures in Java – Defining classes in Java –
Constructors-Methods -Access specifiers - Static members- Java Doc comments.

UNIT – II INHERITANCE, PACKAGES AND INTERFACES 9

Overloading Methods – Objects as Parameters – Returning Objects –Static, Nested and Inner
Classes. Inheritance: Basics– Types of Inheritance -Super keyword -Method Overriding –
Dynamic Method Dispatch –Abstract Classes – final with Inheritance. Packages and Interfaces:
Packages – Packages and Member Access –Importing Packages – Interfaces.

UNIT – III EXCEPTION HANDLING AND MULTITHREADING 9

Exception Handling basics – Multiple catch Clauses – Nested try Statements – Java’s Built-in
Exceptions – User defined Exception. Multithreaded Programming: Java Thread Model– Creating
a Thread and Multiple Threads – Priorities – Synchronization – Inter Thread Communication-
Suspending –Resuming, and Stopping Threads –Multithreading. Wrappers – Auto boxing.

UNIT – IV I/O, GENERICS, STRING HANDLING 9

I/O Basics – Reading and Writing Console I/O – Reading and Writing Files. Generics: Generic
Programming – Generic classes – Generic Methods – Bounded Types – Restrictions and
Limitations. Strings: Basic String class, methods and String Buffer Class.

UNIT – V JAVAFX EVENT HANDLING, CONTROLS AND COMPONENTS 9

JAVAFX Events and Controls: Event Basics – Handling Key and Mouse Events. Controls:
Checkbox, ToggleButton – RadioButtons – ListView – ComboBox – ChoiceBox – Text Controls
– ScrollPane. Layouts – FlowPane – HBox and VBox – BorderPane – StackPane – GridPane.
Menus – Basics – Menu – Menu bars – MenuItem.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Apply the concepts of classes and objects to solve simple problems.
CO2 Develop programs using inheritance, packages and interfaces
CO3 Make use of exception handling mechanisms and multithreaded model to solve real world
problems.
CO4 Build Java applications with I/O packages, string classes, Collections and generics
concepts.
CO5 Integrate the concepts of event handling and JavaFX components and controls for
developing GUI based applications.

TEXT BOOKS:
1. Herbert Schildt, “Java: The Complete Reference”, 11 th Edition, McGraw Hill Education, New
Delhi, 2019.
2. Herbert Schildt, “Introducing JavaFX 8 Programming”, 1 st Edition, McGraw Hill
Education, New Delhi, 2015.

REFERENCES:
1. Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11 th Edition, Prentice Hall,2018.

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 1 1 3 1 3 3 2 2 2 3 1
2 2 1 3 2 1 2 1 1 3 3 3
3 3 3 1 2 2 3 2 1 2 3 1
4 3 1 2 2 2 1 2 1 3 3 1
5 1 1 2 3 2 3 2 1 2 3 3
Low (1) ; Medium (2) ; High (3)

24CS3352 SOFTWARE ENGINEERING L T P C

3 0 0 3

COURSE OBJECTIVES:
1. To understand the phases in a software project.
2. To understand fundamental concepts of requirements engineering and Analysis Modeling.
3. To understand the various software design methodologies.
4. To learn various testing and maintenance measures.
5. To develop project schedule, estimate project cost and effort required

UNIT – I SOFTWARE PROCESS AND AGILE DEVELOPMENT 9

Introduction to Software Engineering, Software Process, Perspective and Specialized Process Models
–Introduction to Agility-Agile process-Extreme programming-XP Process.

UNIT – II REQUIREMENTS ANALYSIS AND SPECIFICATION 9

Software Requirements: Functional and Non-Functional, User requirements, System requirements,
Software Requirements Document – Requirement Engineering Process: Feasibility Studies,
Requirements elicitation and analysis, requirements validation, requirements management Classical
analysis: Structured system Analysis, Petri Nets- Data Dictionary.

UNIT – III SOFTWARE DESIGN 9

Design process – Design Concepts-Design Model– Design Heuristic – Architectural Design
Architectural styles, Architectural Design, Architectural Mapping using Data Flow- User Interface
Design: Interface analysis, Interface Design –Component level Design: Designing Class based
components, traditional Components.

UNIT – IV TESTING AND MAINTENANCE 9

Software testing fundamentals-Internal and external views of Testing-white box testing - basis path
testing-control structure testing-black box testing- Regression Testing – Unit Testing – Integration
Testing – Validation Testing – System Testing And Debugging –Software Implementation Techniques:
Coding practices-Refactoring-Maintenance and Reengineering- BPR model-Reengineering process
model-Reverse and Forward Engineering.

UNIT – V PROJECT MANAGEMENT 9

Software Project Management: Estimation – LOC, FP Based Estimation, Make/Buy Decision
COCOMO I & II Model – Project Scheduling – Scheduling, Earned Value Analysis Planning –
Project Plan, Planning Process, RFP Risk Management – Identification, Projection - Risk
Management-Risk Identification-RMMM Plan-CASE TOOLS.

TOTAL:45 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Identify the key activities in managing a software project.
CO2 Concepts of requirements engineering and Analysis Modeling.
CO3 Apply systematic procedure for software design and deployment.
CO4 Compare and contrast the various testing and maintenance
CO5 Manage project schedule, estimate project cost and effort required

TEXT BOOKS:
1. Roger S. Pressman, “Software Engineering – A Practitioner‟s Approach”, Seventh Edition,
Mc Graw-Hill International Edition, 2010.
2. Ian Sommerville, “Software Engineering”, 9th Edition, Pearson Education Asia, 2011.

REFERENCES:
1. Rajib Mall, “Fundamentals of Software Engineering”, Third Edition, PHI Learning
PrivateLimited, 2009.
2. Pankaj Jalote, “Software Engineering, A Precise Approach”, Wiley India, 2010.
3. Kelkar S.A., “Software Engineering”, Prentice Hall of India Pvt Ltd, 2007
4. Stephen R.Schach, “Software Engineering”, Tata McGraw-Hill Publishing Company
Limited,2007.
CO’s-PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 1 1 2 2
2 2 1 1 2 2
3 3 2 2 2 2
4 3 2 2 2 2
5 3 2 2 2 2
Low (1) ; Medium (2) ; High (3)

24CS3381 OBJECT ORIENTED PROGRAMMING

LABORATORY L T P C

0 0 3 1.5
COURSE OBJECTIVES:
1. To build software development skills using java programming for real-world applications.
2. To understand and apply the concepts of classes, packages, interfaces, inheritance, exception
handling and file processing.
3. To develop applications using generic programming and event handling.

LIST OF EXPERIMENTS
1. Solve problems by using sequential search, binary search, and quadratic sorting algorithms
(selection, insertion)
2. Develop stack and queue data structures using classes and objects.
3. Develop a java application with an Employee class with Emp_name, Emp_id, Address,
Mail_id, Mobile_no as members. Inherit the classes, Programmer, Assistant Professor,
Associate Professor and Professor from employee class. Add Basic Pay (BP) as the member
of all the inherited classes with 97% of BP as DA, 10 % of BP as HRA, 12% of BP as PF,
0.1% of BP for staff club funds. Generate pay slips for the employees with their gross and
net salary.
4. Write a Java Program to create an abstract class named Shape that contains two integers and
an empty method named printArea(). Provide three classes named Rectangle, Triangle and
Circle such that each one of the classes extends the class Shape. Each one of the classes
contains only the method printArea( ) that prints the area of the given shape.
5. Solve the above problem using an interface.
6. Implement exception handling and creation of user defined exceptions.
7. Write a java program that implements a multi-threaded application that has three threads.
First thread generates a random integer every 1 second and if the value is even, the second
thread computes the square of the number and prints. If the value is odd, the third thread will
print the value of the cube of the number.
8. Write a program to perform file operations.
 9. Develop applications to demonstrate the features of generics classes.
10. Develop applications using JavaFX controls, layouts and menus
11. Develop a mini project for any application using Java concepts.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Design and develop java programs using object oriented programming concepts.
CO2 Develop simple applications using object oriented concepts such as package, exception.
CO3 Implement multithreading, and generics concepts.
CO4 Create GUIs and event driven programming applications for real world problems.
CO5 Implement and deploy web applications using Java.

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 1 2 1 1 2 2 2 1 2
2 2 1 3 1 2 3 3 2 1 3
3 2 2 1 2 1 1 2 1 3 2 3
4 2 2 1 3 3 1 1 1 2 1
5 1 3 3 1 3 1 1 1 1 2 1
Low (1) ; Medium (2) ; High (3)

24CS3311 DATA STRUCTURES LABORATORY L T P C

0 0 3 1.5
COURSE OBJECTIVES:
1. To demonstrate array implementation of linear data structure algorithms.
2. To implement the applications using stack.
3. To implement the applications using Linked list
4. To implement Binary search tree and AVL tree algorithms.
5. To implement the Heap algorithm.
6. To implement Dijkstra’s algorithm.
7. To implement Prim’s algorithm
8. To implement Sorting, Searching and Hashing algorithms.

LIST OF EXPERIMENTS
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
 5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)

TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Implement Linear data structure algorithms.
CO2 Implement applications using Stacks and Linked lists
CO3 Implement Binary Search tree and AVL tree operations. .
CO4 Implement graph algorithms.
CO5 Analyse the various searching and sorting algorithms

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 2 2 2 2 2 1 2 2 2 2
2 2 2 2 2 2 1 1 1 3 1 2
3 2 2 2 2 2 1 1 2 3 3 3
4 2 2 2 2 2 1 2 3 3 2 1
5 2 2 2 2 2 3 3 3 1 3 1
Low (1) ; Medium (2) ; High (3)

24GE3361 ADVANCED LOGICAL THINKING L T P C

0 0 2 1

COURSE DESCRIPTION:
This course aims to develop student's logical thinking skills to an advanced level. Students will explore
various techniques and strategies to analyse, evaluate, and synthesize information effectively. Analyzing
situation or problem using a logical approach involves gathering all available information, assessing the
facts and efficiently deciding the best course of action. Students strive to understand various topics
deeply, enhance their memory skills and build greater understanding. They also apply their ideas
effectively and thoroughly analyze any arising issues.
COURSE OBJECTIVES:
1. Enhance Critical thinking skills by solving programming logic problems involving
permutations and combinations.
2. Enhance the Decision making skills using different Possibilities through Probability
3. To develop the skills to analyze complex problems in Simple Solutions through Time Speed
 distance Concept.
4. Enhance the strategic thinking for Solving Real life problems using Mathematical Concepts.
5. Reinforce the Logical skills through Reasoning Puzzles.

INDUCTIVE REASONING THROUGH PERMUTATIONS &

UNIT – I COMBINATION 6
Fundamental Principles of Counting: Permutations & Combination, Number Generation
Fundamentals; Digit repeater concepts: All possible ways; Recursion and Backtracking: N step
Problems, Chess oriented problems and Case Studies.

UNIT – II DECISION MAKING BASED ON PROBABILITY 6

Introduction to Probabilities, Application of Probability; Power of Compounding: Case Studies.

UNIT – III STRATEGICAL TECHNIQUES IN TIME, SPEED AND DISTANCE 6

Definition and Basics of Time, Speed and Distance; Relative speed: Problems based on T rains;
Effective Speed: Problems based on Boats and Streams; Problems based on Races, Escalator
problems; Case Studies.

UNIT – IV THE LOGICAL APPROACH TO MIXTURE AND ALLEGATION 6

Introduction to Mixtures: Multi variable mixing, Profit and Loss concept based on mixing; Liquid
mixing concepts: Replacement problems and Repetitive iteration problems.

UNIT – V LOGICAL REASONING 6

Introduction to design of clocks; Formula creation: Speed clock and Slow clock problems; Angle
calculation; Calendars design: Concept of odd days, Day of a date and Calendar repetition logic; Data
Arrangements; Data Sufficiency; Directions; Number series and Puzzles.
TOTAL:30 PERIODS

REFERENCES:
1. Dr. R S Aggarwal, Quantitative Aptitude, Revised Edition, S.Chand Publishing Company
Ltd(s), 2022
2. Arun Sharma, How to prepare for Quantitative Aptitude for the CAT, 10th Edition, Tata
McGraw-Hill Publishing Company Ltd, 2022.
WEB REFERENCES:
1. https://www.hackerearth.com/
2. https://www.geeksforgeeks.org/
3. https://www.in
4. diabix.com/

24CS3401 DESIGN AND ANALYSIS OF ALGORITHMS L T P C

3 0 2 4

COURSE OBJECTIVES:
1. To understand and apply the algorithm analysis techniques on searching and sorting
algorithms
2. To critically analyze the efficiency of graph algorithms.
3. To understand different algorithm design techniques.
4. To solve programming problems using state space tree.
5. To understand the concepts behind NP Completeness, Approximation algorithms and
randomized algorithms.

UNIT – I INTRODUCTION 9
Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best
case, Worst case and average case analysis – Recurrence relation: substitution method - Lower
bounds – Searching: linear search, binary search and Interpolation Search, Pattern search: The
naïve string- matching algorithm - Rabin-Karp algorithm - Knuth-Morris-Pratt algorithm.
Sorting: Insertion sort – heap sort

UNIT – II GRAPH ALGORITHMS 9

Graph algorithms: Representations of graphs - Graph traversal: DFS – BFS - applications -
Connectivity, strong connectivity, bi-connectivity - Minimum spanning tree: Kruskal’s and Prim’s
algorithm- Shortest path: Bellman-Ford algorithm - Dijkstra’s algorithm - Floyd-Warshall
algorithm Network flow: Flow networks - Ford-Fulkerson method – Matching: Maximum
bipartite matching

UNIT – III ALGORITHM DESIGN TECHNIQUES 9

Divide and Conquer methodology: Finding maximum and minimum - Merge sort - Quick sort
Dynamic programming: Elements of dynamic programming — Matrix-chain multiplication -
Multi stage graph — Optimal Binary Search Trees. Greedy Technique: Elements of the greedy
strategy - Activity-selection problem –- Optimal Merge pattern — Huffman Trees.

UNIT – IV STATE SPACE SEARCH ALGORITHMS 9

Backtracking: n-Queens problem - Hamiltonian Circuit Problem - Subset Sum Problem – Graph
colouring problem Branch and Bound: Solving 15-Puzzle problem - Assignment problem -
Knapsack Problem - Travelling Salesman Problem.

UNIT – V NP-COMPLETE AND APPROXIMATION ALGORITHM 9

Tractable and intractable problems: Polynomial time algorithms – Venn diagram representation -
NP- algorithms - NP-hardness and NP-completeness – Bin Packing Problem - Problem reduction:
TSP – 3-CNF problem. Approximation Algorithms: TSP - Randomized Algorithms: concept and
application - primality testing - randomized quick sort - Finding kth smallest number.
TOTAL: 45 PERIODS

PRACTICAL EXERCISES:
Searching and Sorting Algorithms:
1. Implement Linear Search. Determine the time required to search for an element. Repeat the
experiment for different values of n, the number of elements in the list to be searched and
plot a graph of the time taken versus n.
2. Implement recursive Binary Search. Determine the time required to search an element.
Repeat the experiment for different values of n, the number of elements in the list to be
searched and plot a graph of the time taken versus n.
3. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search (char pat [ ],
char txt [ ]) that prints all occurrences of pat [ ] in txt [ ]. You may assume that n > m.
4. Sort a given set of elements using the Insertion sort and Heap sort methods and determine
 the time required to sort the elements. Repeat the experiment for different values of n, the
number of elements in the list to be sorted and plot a graph of the time taken versus n.
Graph Algorithms:
1. Develop a program to implement graph traversal using Breadth First Search
2. Develop a program to implement graph traversal using Depth First Search
3. From a given vertex in a weighted connected graph, develop a program to find the shortest
paths to other vertices using Dijkstra’s algorithm.
4. Find the minimum cost spanning tree of a given undirected graph using Prim’s algorithm.
5. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.
6. Compute the transitive closure of a given directed graph using Warshall's algorithm.

Algorithm Design Techniques:

1. Develop a program to find out the maximum and minimum numbers in a given list of n
numbers using the divide and conquer technique.
2. Implement Merge sort and Quick sort methods to sort an arrayof elements and determine the
time required to sort. Repeat the experiment for different values of n, the number of
elements in the list to be sorted and plot a graph of the time taken versus n.

State Space Search Algorithms

1. Implement N Queens problem using Backtracking.
Approximation Algorithms Randomized Algorithms
1. Implement any scheme to find the optimal solution for the Traveling Salesperson problem
and then solve the same problem instance using any approximation algorithm and
determine the error in the approximation.
2. Implement randomized algorithms for finding the kth smallest number. The programs can
be implemented in C/C++/JAVA/ Python.

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Analyze the efficiency of algorithms using various frameworks
CO2 Apply graph algorithms to solve problems and analyze their efficiency.
CO3 Make use of algorithm design techniques like divide and conquer, dynamic programming
and greedy techniques to solve problems.
CO4 Use the state space tree method for solving problems.
CO5 Solve problems using approximation algorithms and randomized algorithms
PRACTICALS: 30 PERIODS
TOTAL: 45+30 =75 PERIODS

TEXT BOOKS:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction
to Algorithms", 3rd Edition, Prentice Hall of India, 2009.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran “Computer
Algorithms / C++” Orient Blackswan, 2nd Edition, 2019.
 REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition,
Pearson Education, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "Data Structures and
Algorithms", Reprint Edition, Pearson Education, 2006.
3. S.Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 3 2 1 1 1
2 2 3 1 1 1
3 1 2 3 1 2 1
4 1 1
5 1 1
Low (1) ; Medium (2) ; High (3)

24CS3451 OPERATING SYSTEMS L T P C

3 0 0 3

COURSE OBJECTIVES:
 1. To understand the function of operating systems, Processes and threads.
2. To study scheduling algorithms and deadlocks.
3. To understand various memory management schemes, I/o Management and file system.

UNIT – I OPERATING SYSTEM OVERVIEW 9

Computer system Overview –Memory Hierarchy –Cache Memory-Interrupts-Operating System
overview-Objectives and functions-System calls-System programs-System Boot.

UNIT – II PROCESS MANAGEMENT 9

Software Requirements: Functional and Non-Functional, User requirements, System requirements,
Software Requirements Document – Requirement Engineering Process: Feasibility Studies,
Requirements elicitation and analysis, requirements validation, requirements management Classical
analysis: Structured system Analysis, Petri Nets- Data Dictionary.
UNIT – III DEAD LOCK MANAGEMENT 9
Principles of Deadlock-Necessary Conditions-Deadlock Detection-Resource allocation Graph-
Deadlock Avoidance-Banker’s algorithm- Deadlock prevention- Deadlock Recovery.

UNIT – IV MEMORY MANAGEMENT 9

Main Memory-contiguous allocation –fixed partitioning –virtual Memory-paging-Segmentation –
Swapping –Demand Paging-Page Replacement Algorithms.

UNIT – V STORAGE MANAGEMENT 9

File System structure- Allocation Methods-Free Space Management- Disk Structure-Disk Scheduling
Algorithms-Swap space Management- Case Study-Linux System.

TOTAL:45 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Describe the important computer system resources and the role of operating systems.
CO2 Explain various CPU scheduling algorithm and synchronization.
CO3 Exemplify with handling deadlock mechanism.
CO4 Evaluate various page replacement algorithms.
CO5 Exhibit file system structure and disk scheduling algorithms.

TEXT BOOKS:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”‖, 10th
Edition, John Wiley and Sons Inc., 2018
2. William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition, Prentice
Hall, 2018.
REFERENCES:
1. Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education, 2016.
2. Ramaz Elmasri, A. Gil Carrick, David Levine, “Operating Systems – A Spiral Approach”, Tata
McGraw Hill Edition, 2010
3. Maurice J Bach, “The Design of the Unix Operating System”, Edition, Pearson Education.2017.
 CO’s-PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 3 1 2 2 3 2 3 1 1 2
2 2 2 3 1 1 2 1 1 2 2 1
3 1 3 2 2 1 2 2 1 1 1 2
4 1 3 3 3 1 2 1 2 1 3
5 3 1 2 1 1 3 2 2 2 2 2
Low (1) ; Medium (2) ; High (3)

24CS3452 THEORY OF COMPUTATION L T P C

3 0 0 3

COURSE OBJECTIVES:
1. To understand foundations of computation including automata theory
2. To construct models of regular expressions and languages.
3. To design context free grammar and push down automata
4. To understand Turing machines and their capability
5. To understand Undecidability and NP class problems

UNIT – I AUTOMATA AND REGULAR EXPRESSIONS 9

Need for automata theory - Introduction to formal proof – Finite Automata (FA) Deterministic Finite
Automata (DFA) – Non-deterministic Finite Automata (NFA) – Equivalence between NFA and DFA
– Finite Automata with Epsilon transitions – Equivalence of NFA and DFA- Equivalence of NFAs
with and without ε-moves- Conversion of NFA into DFA – Minimization of DFAs.

UNIT – II REGULAR EXPRESSIONS AND LANGUAGES 9

Regular expression – Regular Languages- Equivalence of Finite Automata and regular expressions –
Proving languages to be not regular (Pumping Lemma) – Closure properties of regular languages

UNIT – III CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA 9

Types of Grammar - Chomsky‘s hierarchy of languages -Context-Free Grammar (CFG) and
Languages – Derivations and Parse trees – Ambiguity in grammars and languages – Push Down
Automata (PDA): Definition – Moves - Instantaneous descriptions -Languages of pushdown
automata – Equivalence of pushdown automata and CFG-CFG to PDA-PDA to CFG – Deterministic
Pushdown Automata.

UNIT – IV NORMAL FORMS AND TURING MACHINE 9

Normal forms for CFG – Simplification of CFG- Chomsky Normal Form (CNF) and Greibach
Normal Form (GNF) – Pumping lemma for CFL – Closure properties of Context Free Languages –
Turing Machine: Basic model – definition and representation – Instantaneous Description – Language
acceptance by TM – TM as Computer of Integer functions – Programming techniques for Turing
machines (subroutines).

UNIT – V UNDECIDABILITY 9
Unsolvable Problems and Computable Functions –PCP-MPCP- Recursive and recursively
enumerable languages – Properties - Universal Turing machine Tractable and Intractable problems
- P and NP completeness – Kruskal’s algorithm – Travelling Salesman Problem- 3-CNF SAT
problems
TOTAL:45 PERIODS
COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Construct automata theory using Finite Automata
CO2 Write regular expressions for any pattern
CO3 Design context free grammar and Pushdown Automata
CO4 Design Turing machine for computational functions
CO5 Differentiate between decidable and undecidable problems

TEXT BOOKS:
1. Hopcroft J.E., Motwani R. & Ullman J.D., "Introduction to Automata Theory, Languages
andComputations", 3rd Edition, Pearson Education, 2008.
2. John C Martin, "Introduction to Languages and the Theory of Computation", 4th Edition, Tata
McGraw Hill, 2011.

REFERENCES:
1. Harry R Lewis and Christos H Papadimitriou , "Elements of the Theory of Computation", 2nd
Edition, Prentice Hall of India, 2015.
2. Peter Linz, "An Introduction to Formal Language and Automata", 6th Edition, Jones & Bartlett,
2016.
3. K.L.P.Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata Languages and
Computation”, 3rd Edition, Prentice Hall of India, 2006.
CO’s-PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 1 3 2 3 1 1 2 3 1 3
2 2 2 3 2 1 3 3 2 3 3 1
3 2 2 3 2 1 1 3 1 2 1 2
4 2 2 2 1 1 3 3 2 1 3
5 2 2 2 1 1 1 1 3 2 3 1
Low (1) ; Medium (2) ; High (3)

24CS3492 DATABASE MANAGEMENT SYSTEMS L T P C

C
3 0 0 3

COURSE OBJECTIVES:
1. To learn the fundamentals of data models, relational algebra and SQL
2. To represent a database system using ER diagrams and to learn normalization techniques
3. To understand the fundamental concepts of transaction, concurrency and recovery processing
3. To understand the internal storage structures using different file and indexing techniques which will
help in physical DB design
4. To have an introductory knowledge about the Distributed databases, NOSQL and database security

UNIT – I RELATIONAL DATABASE 9

Purpose of Database System – Views of data – Data Models – Database System Architecture –
Introduction to relational databases – Relational Model – Keys – Relational Algebra – SQL-
fundamentals – Advanced SQL features – Embedded SQL– Dynamic SQL.

UNIT – II DATABASE DESIGN 9

Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-Relational Mapping –
Functional Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms,
Dependency Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth
Normal Form – Join Dependencies and Fifth Normal Form

UNIT – III TRANSACTIONS 9

Transaction Concepts – ACID Properties – Schedules – Serializability – Transaction support in SQL–
Need for Concurrency – Concurrency control –Two Phase Locking- Timestamp – Multiversion –
Validation and Snapshot isolation– Multiple Granularity locking – Deadlock Handling – Recovery
Concepts – Recovery based on deferred and immediate update – Shadow paging – ARIES Algorithm

UNIT – IV IMPLEMENTATION TECHNIQUES 9

RAID – File Organization – Organization of Records in Files – Data dictionary Storage – Column
Oriented Storage– Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files
– Static Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for Selection,
Sorting and join operations – Query optimization using Heuristics - Cost Estimation

UNIT – V IMPLEMENTATION TECHNIQUES AND NoSQL DATABASE 9

Distributed Databases: Architecture, Data Storage, Transaction Processing, Query processing and
Optimization – NOSQL Databases: Introduction – CAP Theorem – Document Based systems – Key
value Stores – Column Based Systems – Graph Databases. Database Security: Security issues –
Access control based on privileges – Role Based access control – SQL Injection – Statistical
Database security – Flow control – Encryption and Public Key infrastructures – Challenges

TOTAL:45 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Construct SQL Queries using relational algebra
CO2 Design database using ER model and normalize the database
CO3 Construct queries to handle transaction processing and maintain consistency of the database
CO4 Compare and contrast various indexing strategies and apply the knowledge to tune the
performance of the database
CO5 Appraise how advanced databases differ from Relational Databases and find a suitable
database for the given requirement.
 TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan, "Database System Concepts", 7th
Edition, McGraw Hill, 2020.
2. Ramez Elmasri, Shamkant B. Navathe, "Fundamentals of Database Systems", 7th Edition, Pearson,
2017.
REFERENCES:
1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth
Edition,
Pearson Education, 2006

CO’s-PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 2 3 2 1 2 1 1 1 2 1
2 3 1 1 1 1 2 3 3 3 3 1
3 3 2 3 2 1 2 1 1 2 2 3
4 1 2 3 2 3 2 3 3 1 2
5 1 1 3 3 2 1 3 3 1 2 2
Low (1) ; Medium (2) ; High (3)

24GE3451 ENVIRONMENTAL SCIENCES AND L T P C

SUSTAINABILITY
2 0 0 2

COURSE OBJECTIVES:
1. To introduce the basic concepts of environment, ecosystems and biodiversity and emphasize
on the biodiversity of India and its conservation.
2. To impart knowledge on the causes, effects and control or prevention measures of
environmental pollution and natural disasters.
3. To facilitate the understanding of global and Indian scenario of renewable and nonrenewable
resources, causes of their degradation and measures to preserve them.
4. To familiarize the concept of sustainable development goals and appreciate the
interdependence of economic and social aspects of sustainability, recognize and analyze
climate changes.
5. To inculcate and embrace sustainability practices and develop a broader understanding on
green materials, energy cycles and analyze the role of sustainable urbanization.

UNIT I ENVIRONMENT AND BIODIVERSITY 6

Definition, scope and importance of environment-need for public awareness. Eco-system and
Energy flow- Types of biodiversity: genetic, species and ecosystem diversity-values of
biodiversity, India as a mega-diversity nation-hot-spots of biodiversity-threats to biodiversity:
habitat loss, poaching of wildlife, man-wildlife conflicts -conservation of biodiversity: In-situ and
ex-situ.

UNIT – II ENVIRONMENTAL POLLUTION 6

Causes, Effects and Preventive measures of Water, Soil, Air and Noise Pollutions. Solid and E-
Waste management. Case studies on Occupational Health and Safety Management system
(OHASMS). Environmental protection, Environmental protection acts.

UNIT – III RENEWABLE SOURCES OF ENERGY 6

Energy management and conservation, New Energy Sources: Need of new sources. Different
types new energy sources. Applications of-Hydrogen energy, Ocean energy resources, Tidal
energy conversion. Concept, origin and power plants of geothermal energy.

UNIT – IV SUSTAINABILITY AND MANAGEMENT 6

Development, GDP ,Sustainability-concept, needs and challenges-economic, social and aspects of
sustainability-from unsustainability to sustainability-millennium development goals, and
protocols-Sustainable Development Goals-targets, indicators and intervention areas Climate
change-Global, Regional and local environmental issues and possible solutions-case studies.

UNIT – V SUSTAINABILITY PRACTICES 6

Zero waste and R concept, Circular economies ISO:14000 Series, Material Life cycle assessment,
Environmental Impact Assessment. Sustainable habitat: Green buildings, Green materials, Energy
efficiency, Sustainable transports. Sustainable energy: Green Engineering: Sustainable
urbanization
TOTAL: 30 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 To recognize and understand the functions of environment, ecosystems and biodiversity
and their conservation.
CO2 To identify the causes, effects of environmental pollution and natural disasters and
contribute to the preventive measures in the society.
CO3 To identify and apply the understanding of renewable and non-renewable resources and
contribute to the sustainable measures to preserve them for future generations.
CO4 To recognize the different goals of sustainable development and apply them for suitable
technological advancement and societal development.
CO5 To demonstrate the knowledge of sustainability practices and identify green materials,
energy cycles and the role of sustainable urbanization.

TEXT BOOKS:
1. Anubha Kaushik and C. P. Kaushik’s “Perspectives in Environmental Studies”, 6th
Edition, New Age International Publishers, 2018.
2. Benny Joseph, ‘Environmental Science and Engineering’, Tata McGraw-Hill, New Delhi,
2016.
3. Gilbert M.Masters, ‘Introduction to Environmental Engineering and Science’, 2nd edition,
Pearson Education, 2004.
4. Allen, D. T. and Shonnard, D. R., Sustainability Engineering: Concepts, Design and Case
Studies, Prentice Hall.
5. Bradley. A.S; Adebayo, A.O., Maria, P. Engineering applications in sustainable design and
development, Cengage learning.
6. Environment Impact Assessment Guidelines, Notification of Government of India, 2006.
7. Mackenthun, K.M., Basic Concepts in Environmental Management, Lewis Publication,
London, 1998
REFERENCES:
1. R.K. Trivedi, ‘Handbook of Environmental Laws, Rules, Guidelines, Compliances and
Standards’, Vol. I and II, Enviro Media. 38. Edition 2010.
2. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’, Jaico Publ.,
House, Mumbai, 2001.
3. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT. LTD, New Delhi,
2007.
4. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press,
Third Edition, 2015.
5. Erach Bharucha “Textbook of Environmental Studies for Undergraduate Courses” Orient
Blackswan Pvt. Ltd. 2013.
6. S.Pream Kumar, K.Vijay Sankar, A. Suresh Kumar, M.Priyanka, “Environmental Science
and Sustainability”, Charulatha Publications.2025

COs’ – PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 2 2 2 2 2 2 1 2 1 1 2 1
2 2 2 2 2 2 2 1 2 1 1 2 1
3 2 2 2 2 2 2 1 2 1 1 2 2 1
4 2 2 2 2 2 2 1 2 1 2 2 2 1
5 2 2 2 2 2 2 1 2 1 1 2 2 1
Low (1) ; Medium (2) ; High (3)
24CS3461 OPERATING SYSTEMS LABORATORY L T P C
0 0 3 1.5

COURSE OBJECTIVES:
1. To install windows operating systems.
2. To understand the basics of Unix command and shell programming.
3. To implement various CPU scheduling algorithms.
4. To implement Deadlock Avoidance and Deadlock Detection Algorithms
5. To implement Page Replacement Algorithms
6. To implement various memory allocation methods.
7. To be familiar with File Organization and File Allocation Strategies

LIST OF EXPERIMENTS:
1. Installation of windows operating system
2. Illustrate UNIX commands and Shell Programming
3. Process Management using System Calls : Fork, Exit, Getpid, Wait, Close
4. Write C programs to implement the various CPU Scheduling Algorithms
5. Illustrate the inter process communication strategy
6. Implement mutual exclusion by Semaphore
7. Write C programs to avoid Deadlock using Banker's Algorithm
8. Write a C program to Implement Deadlock Detection Algorithm
9. Write C program to implement Threading
10. Implement the paging Technique using C program
11. Write C programs to implement the following Memory Allocation Methods
a. First Fit b. Worst Fit c. Best Fit
12. Write C programs to implement the various Page Replacement Algorithms
13. Write C programs to Implement the various File Organization Techniques
14. Implement the following File Allocation Strategies using C programs
a. Sequential b. Indexed c. Linked
15. Write C programs for the implementation of various disk scheduling algorithms
16. Install any guest operating system like Linux using VMware.
TOTAL:60 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Define and implement UNIX Commands
CO2 Compare the performance of various CPU Scheduling Algorithms.
CO3 Compare and contrast various Memory Allocation Methods
CO4 Define File Organization and File Allocation Strategies.
CO5 Implement various Disk Scheduling Algorithms.
CO’s-PO’s & PSO’s MAPPING
PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 3 1 3 1 1 1 3 3 3 2 1
2 3 1 1 2 2 3 2 1 1 3 1
3 3 3 2 1 2 3 3 1 2 2 2
4 1 2 2 3 2 3 1 3 1 1 2
5 2 2 1 1 3 1 2 2 3 1 3
Low (1) ; Medium (2) ; High (3)
 24CS3481 DATABASE MANAGEMENT SYSTEMS L T P C
LABORATORY
0 0 3 1.5

COURSE OBJECTIVES:
1. To learn and implement important commands in SQL.
2. To learn the usage of nested and joint queries.
3. To understand functions, procedures and procedural extensions of databases.
4. To understand design and implementation of typical database applications.
5. To be familiar with the use of a front end tool for GUI based application development

LIST OF EXPERIMENTS:
1. Create a database table, add constraints (primary key, unique, check, Not null), insert rows,
2. update and delete rows using SQL DDL and DML commands.
3. Create a set of tables, add foreign key constraints and incorporate referential integrity.
4. Query the database tables using different ‘where’ clause conditions and also implement
aggregate functions.
5. Query the database tables and explore sub queries and simple join operations.
6. Query the database tables and explore natural, equi and outer joins.
7. Write user defined functions and stored procedures in SQL.
8. Execute complex transactions and realize DCL and TCL commands.
9. Write SQL Triggers for insert, delete, and update operations in a database table.
10. Create View and index for database tables with a large number of records.
11. Create an XML database and validate it using XML schema.
12. Create Document, column and graph based data using NOSQL database tools.
13. Develop a simple GUI based database application and incorporate all the above mentioned
features Case Study using any of the real life database applications from the following list
a) Inventory Management for a EMart Grocery Shop
b) Society Financial Management
c) Cop Friendly App – Eseva
d) Property Management – eMall
e) Star Small and Medium Banking and Finance
 Build Entity Model diagram. The diagram should align with the business and
functional goals stated in the application.
 Apply Normalization rules in designing the tables in scope.
 Prepared applicable views, triggers (for auditing purposes), functions for enabling
enterprise grade features.
 Build PL SQL / Stored Procedures for Complex Functionalities, ex EOD Batch
 Processing for calculating the EMI for Gold Loan for each eligible Customer.
 Ability to showcase ACID Properties with sample queries with appropriate settings
 TOTAL:60 PERIODS

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Create databases with different types of key constraints.
CO2 Construct simple and complex SQL queries using DML and DCL commands.
CO3 Use advanced features such as stored procedures and triggers and incorporate in GUI based
application development.
CO4 Create an XML database and validate with meta-data (XML schema).
CO5 Create and manipulate data using NOSQL database.

CO’s-PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 1 2
1 3 3 3 3 3 1 3 2 2 3
2 2 2 3 2 2 1 2 3 3 2 1
3 3 3 2 1 1 1 1 1 3 2 3
4 1 3 3 3 1 1 1 3 2 3 1
5 3 2 1 1 1 2 2 3 1 3 1
Low (1) ; Medium (2) ; High (3)

24CS3491 PROJECT WITH DESIGN THINKING L T P C

(PRODUCT/SOFTWARE DEVELOPMENT LIFE 0 0 0 2
CYCLE)

COURSE DESCRIPTION:
1. The Project with Design Thinking (Product/Software Development Life Cycle) course
Integrates design thinking principles into the product or software development lifecycle,
Fostering innovation and user-centricity throughout the project. Students learn to
empathize With end-users, define problem statements (TRL 2), ideate potential solutions
(TRL 4),
2. Prototype designs (TRL 5), and conduct iterative testing to gather feedback and refine
their
Creations (TRL 6). The course emphasizes multidisciplinary approach (SDG 11),
encouraging
3. Collaboration between designers, developers, and stakeholders to ensure that the final
product
4. Meets user needs and business objectives (SDG 12) effectively. Through hands-on
projects, Students gain practical experience in applying design thinking methodologies
within the context of the product or software development process, preparing them to
address complex Challenges and create impactful solutions in diverse industries

COURSE OBJECTIVES:
1. Identify current problems in computer and communication engineering through Literature.
 2. Survey. (TRL 1-2: Basic principles observed, Technology formulation)
3. Design and analyse solutions for identified problems using modern engineering tools.
(TRL 3-4: Experimental proof of concept, Technology development, SDG 8: Decent Work
and Economic Growth)
4. Create innovative methodologies and develop working models to solve existing Problems.
5. (TRL 4-5: Technology development and validation in a relevant environment, Prototype
development, SDG 11: Sustainable Cities and Communities)
6. Apply appropriate software development methods to implement and deploy solutions.
7. Computer and communication-related issues. (TRL 5-6: Prototype development and
Demonstration in a relevant environment, Technology demonstration, SDG 12:
Responsible Consumption and Production)
8. Evaluate teamwork's role in project execution and estimate financial requirements
for Project success. (TRL 6-7: System prototype demonstration in an operational
Environment, Technology readiness for deployment)
3. Guidelines:

The student identifies the problems in the computer and communication engineering field by
conducting a literature or industry survey (TRL 2). After that, the student finds the Solution (TRL
4) to solve those problems by applying modern engineering tools. Continuous Review will be
conducted based on approved rubrics to ensure ongoing progress and quality. After finding the
solution, the student develops the working model (TRL 5, SDG 11), design, or simulation for
evaluation. Each student shall finally submit a report covering background Information, literature
survey, problem statement, methodology, and use of modern tools Within the stipulated date.
Every project work must be guided by the institute faculty members.

COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Identify the problems in computer and communication engineering field by literature
Survey.
CO2 Design, analyse and solve the identified problems by using modern engineering tools
CO3 Create innovative methodologies to solve the existing problems and developing the
working models.
CO4 Apply appropriate software development methods, to implement and deploy Solutions for
the computer and communication related problems.
CO5 Implement the role of team work in a project to find the solution and estimate the
financial requirement of a project.

24CS3411 SUMMER INTERNSHIP L T P C

0 0 0 2

COURSE OBJECTIVES:
1. Get connected with reputed industry/ laboratory/academia / research institute
2. Get practical knowledge on Product Development / Services and operations / Software
Design and Development / Testing / Analytics/ research/ start-ups/ professionalism / business
processes and insights / domain knowledge/ Industry Practices/ and other related aspects and
develop skills to solve related problems
3. Develop technical, soft, team skills to cater to the needs of the industry / academia /
businesses / research / organizations in the core aspects of Automation, Digitalization
4. The students individually undergo training in reputed firms/ research institutes / laboratories
for the specified duration. After the completion of training, a detailed report should be
submitted within ten days from the commencement of next semester. The students will be
evaluated as per the Regulations.
No. of Weeks: 04
COURSE OUTCOMES:
At the end of the course the students will be able to
CO1 Industry Practices, Processes, Techniques, technology, automation and other core aspects
of software industry
CO2 Analyze, Design solutions to complex business problems
CO3 Build and deploy solutions for target platform
CO4 Preparation of Technical reports and presentation.