PSNA College of Engineering and Technology

(An Autonomous Institution Approved by AICTE and Affiliated to Anna University, Chennai)

Dindigul – 624 622.

B.E. Computer Science and Engineering

(III and IV Semester)

Curriculum for Regulations 2022

(Choice Based Credit System)

For the Students admitted in the Academic year 2022-23 onwards

February 2023
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

MA2C21 DISCRETE MATHEMATICS L T P C

3 1 0 4
COURSE OBJECTIVES:
 To learn the logical and mathematical maturity and ability to deal with abstraction.
 To understand as basic concepts of combinatory, graph theory, the applications of algebraic
structures, lattices and boolean algebra.
 To learn the basic concepts of Graphs and Matrix representation of graphs and graph
isomorphism.
 To understand the most of the basic terminologies used in computer science courses and
application of ideas to solve practical problems.

UNIT I LOGIC AND PROOFS

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

UNIT II COMBINATORICS
12
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

12
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 12

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 12
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 – Boolean Homomorphism.
TOTAL : 60 PERIODS
COURSE OUTCOMES:
On successful completion, the students will be able to:
CO1: Have knowledge of the concepts needed to test the logic of a program.
CO2: Have an understanding in identifying structures on many levels.
CO3: Be aware of a class of functions which transform a finite set into another finite set which
relates to input and output functions in computer science.
CO4: Be aware of the counting principles.
CO5: Be exposed to concepts and properties of algebraic structures such as groups, rings
and fields.
1
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

TEXT BOOKS:
1. Rosen. K.H., "Discrete Mathematics and its Applications", 7th Edition, Tata McGraw Hill Pub. Co.
Ltd., New Delhi, Special Indian Edition, 2017.
2. Tremblay. J.P. and Manohar. R, "Discrete Mathematical Structures with Applications to Computer
Science", Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
REFERENCES:
1. Grimaldi. R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction", 5thEdition,
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, 3rd Edition, 2010.

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 3 2
CO2 3 3 3 2
CO3 3 3 3 2
CO4 3 3 3 2
CO5 3 3 3 2
Low (1); Medium (2); High (3)

EC2C22 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION LTPC

3024
COURSE OBJECTIVES:
 To analyze and design combinational circuits.
 To analyze and design sequential circuits
 To understand the basic structure and operation of a digital computer.
 To study the design of data path unit, control unit for processor and to familiarize with the
hazards.
 To understand the concept of various memories and I/O interfacing.
UNIT I COMBINATIONAL LOGIC 9
Introduction to Combinational Circuits –Simplification of Boolean functions - Karnaugh Map - Analysis
and Design Procedures – Binary Adder – Subtractor - 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.
2
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

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 encoder and decoder circuits
6. Implementation of functions using Multiplexers.
7. Implementation of the synchronous counters
8. Implementation of a Shift register.
9. Simulator based study of Computer Architecture
Total: 30 Periods
COURSE OUTCOMES:
On successful completion, 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
Total: 75 Periods
TEXT BOOKS:
1. M. Morris Mano, Michael D. Ciletti, “Digital Design : With an Introduction to the Verilog HDL, VHDL,
and System Verilog”, Sixth Edition, Pearson Education, 2018
2. David A. Patterson, John L. Hennessy, “Computer Organization and Design, The Hardware/Software
Interface”, Sixth Edition, Morgan Kaufmann/Elsevier, 2020.
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. CO’s- PO’s &
PSO’s

3
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 1 1 2 1 1 2 1 2 2 1
CO2 2 2 1 2 2 1 1 1 2 2 2 2
CO3 2 1 1 1 2 1 1 2 2 3 1
CO4 2 2 1 2 2 1 1 1 2 1 3 2 2 3
CO5 3 2 2 1 2 1 1 2 2 3 3 2
Low (1); Medium (2); High (3)

CS2321 SOFTWARE ENGINEERING LTPC

3003
COURSE OBJECTIVES:
 To understand the phases in a software process
 To understand fundamental concepts of requirements engineering and Analysis Modeling.
 To understand the various software design methodologies
 To learn various testing and maintenance measures
UNIT I SOFTWARE PROCESS 9
Basics − S/W engineering paradigm − Life cycle models (Water fall, Incremental, Spiral, WINWIN
Spiral, Evolutionary, Prototyping, Object Oriented) − System engineering − Computer based system −
Verification − Validation − Life cycle process − Development process − System engineering hierarchy
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:
On successful completion, the students will be able to
CO1 : Identify appropriate process models for the given problem.
CO2 : Apply the concepts of requirements engineering and Analysis Modeling
4
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

CO3 : Apply systematic procedure for modeling the structure and behavior of the software system
CO4 : Employ various testing, maintenance and quality assurance techniques at the system level and
organization level.
CO5 : Estimate, schedule and manage the development of software projects.
CO6: Prepare technical documentations on various aspects of software development project
including the technical aspects as well as the managerial aspects
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.
WEB REFERENCES
1. http://nptel.ac.in/.
2. https://www.edx.org/learn/software-engineering
3. https://www.tutorialspoint.com/software_engineering/index.htm
4. https://www.geeksforgeeks.org/software-engineering/
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3
CO2 3 1
CO3 3 1
CO4 3
CO5 3
CO6 3 2 1 2 2 2 2 3 3
Low (1); Medium (2); High (3)

CS2312 DATA STRUCTURES LTPC

3003
COURSE OBJECTIVES:
 To understand the fundamentals of algorithm and concepts of ADTs.
 To Learn linear data structures – lists, stacks, and queues.
 To understand non-linear data structures – trees and graphs.
 To apply Tree and Graph structures.
 To understand sorting, searching and hashing algorithms.
UNIT I LISTS 9
Notion of an Algorithm-Fundamentals of Analysis of algorithmic efficiency- Primitive Data Types-
Abstract Data Types (ADTs) – List ADT - Array-based implementation – Linked list implementation:
Singly linked lists – Doubly linked lists - Circular linked lists - Applications of lists: Polynomial ADT –
Radix Sort – Multilists.

5
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

UNIT II STACKS AND QUEUES 9

Stack ADT – Operations – Applications – Infix to Postfix conversion- Evaluating arithmetic expressions
– Tower of Hanoi. Queue ADT – Operations – Circular Queue – Double Ended Queue – Applications of
Queues.
UNIT III TREES 9
Tree - Terminology, Binary Tree – Terminology and Properties, Tree Traversals - Expression Trees –
Binary Search Trees – operations in BST: insertion, deletion, finding min and max - AVL Trees –
Terminology – operations in AVL: rotation, insertion, deletion - B-Tree – B+ Tree - Priority Queue
(Heaps) – Binary Heap.

UNIT IV GRAPHS 9
Graph – Definition and Terminology – Representation of Graphs - Types of Graph – Graph Traversal:
Breadth -first Search, Depth-first Search - Connectivity, strong connectivity – Topological Sort -
Minimum Spanning Tree: Prim's algorithm, Kruskal's algorithm- Single Source Shortest Path:
Dijkstra’s algorithm.
UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9
Searching - Linear Search - Binary Search - Sorting – Bubble sort - Insertion sort - Selection sort – Shell
sort – Radix sort. Hashing - Hash functions - Open Hashing - Separate Chaining - Closed Hashing -
Linear Probing, Quadratic Probing, Double Hashing, Random Probing, Rehashing, Extendible Hashing,
Applications – Dictionary - Telephone directory.
TOTAL :45 PERIODS
COURSE OUTCOMES:
On successful completion, the students will be able to:
CO1: Create abstract data types for Linked list data structures.
CO2 :Develop algorithms to solve problems using stack and queue data structures.
CO3 :Apply non-linear data structures to solve a problem.
CO4 :Apply graph data structure to solve real-life problems.
CO5 :Analyse various sorting, searching and hashing tecniquess.

TEXT BOOKS:
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Fourth Edition, Pearson
Education, 2014.
2. Alfred V.Aho, John E.Hopcroft, Jeffrey D.Ullman, Data Structures and Algorithms, Fourth
Edition, Pearson Education.
REFERENCE BOOKS:

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. Adam Drozdek, Data structures and algorithms in C++, Fourth Edition, Cengage Learning,2013.
4. Michael Main, Walter Svaitch, Data Structures and other objects using C++, 4th Edition,
Pearson Education 2011.
WEB REFERENCES
1. https://www.codechef.com/certification/data-structures-and-algorithms/prepare
2. https://nptel.ac.in/courses/106102064

6
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 2
CO2 3 2 2
CO3 3 2 2
CO4 3 2 2 2
CO5 3 3 2 2 2
Low (1); Medium (2); High (3)
CS2323 OBJECT ORIENTED PROGRAMMING LTPC
3003
COURSE OBJECTIVES:
 To understand the basic concepts of Java programming
 To understand Object Oriented Programming concepts and the principles of packages,
inheritance and interfaces
 To develop a java application with exceptions and threads
 To design an application using I/O streams and String handling
 To design and build Graphical User Interface Application using JAVAFX
UNIT I OVERVIEW OF JAVA 9
Java - Features of Java - Setting up of Environment- JDK - JVM - JRE - Tokens -Operators - Keywords -
Identifiers - Access specifiers - Static and Final - Type casting –Control Structures, Naming
Conventions- Arrays.
UNIT II FEATURES OF OBJECT ORIENTED PROGRAMMING 9
Class - Objects - Encapsulation - Constructors - this keyword – Inheritance: Single, Multilevel,
hierarchy – Abstraction: Abstract class – Interface: Simple and Nested – Multiple Inheritance -
Packages.
UNIT III POLYMORPHISM AND STRING HANDLING 9
Polymorphism – Method overloading vs overriding – Dynamic Casting: Upcasting, Downcasting -
Inner classes - Access Modifiers -–Singleton class–Collections - Strings: Basic String class, methods
and String Buffer Class.
UNIT IV EXCEPTION HANDLING, I/O AND MULTITHREADING 9
Exception Handling: Java’s Built-in Exceptions, User defined Exception. Wrapper class – Auto boxing
and Unboxing. I/O Streams - Byte-oriented streams - Character–oriented streams – File Streams –
Multithreading: Thread Creations - Thread Life Cycle – priority - Inter-Thread Communication -
Synchronization – real time applications.
UNIT V EVENT DRIVEN PROGRAMMING 9
JAVAFX Events and Controls: JAVAFX Life cycle- UI Controls – Layouts - Event Basics – Handling Key
and Mouse Events – Menu basics. JDBC: ODBC – JDBC basics – Steps to build database applications.
Total: 45 Periods
COURSE OUTCOMES:
On successful completion, the students will be able to:
CO1: Apply the basic concepts of java to solve simple problems
CO2: Develop programs using classes, objects inheritance, packages and interfaces
CO3: Make use of exception handling mechanisms and multithreaded model to solve real world
problems

7
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

CO4: Build Java applications with I/O packages and string classes
CO5: Develop GUI based applications using JavaFX and JDBC.
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.
Reference Books
1 Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11th Edition, Prentice Hall, 2018.
2 Paul Deitel, Harvey Deitel, “Java How to Program”, Pearson, Eleventh edition, 2017. ISBN:13:
978-0134743356
3 Bruce Eckel, “Thinking in Java”, Fourth Edition, Prentice Hall, 2006. ISBN: 978-0131872486.
4 Kathy Sierra, Bert Bates, “Head First Java”, Second Edition, O'Reilly Media, 2005. ISBN: 10-
0596004656, ISBN-13:9780596004651.
Web References
1 https://www.javatpoint.com/java-tutorial

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 1
CO2 3 2 2
CO3 3 2 2
CO4 3 2 2
CO5 3 2 3 2 2 2 2 2 2 3
Low (1); Medium (2); High (3)

CS2381 DATA STRUCTURES USING C++ LABORATORY L T P C

0 0 3 1.5
Course Objectives:
 To understand and apply the concepts of C++ programming language.
 To implement linear data structure.
 To implement nonlinear data structure.
 To apply sorting, searching and hashing techniques.
List of Experiments:
1. C++ program using classes and objects.
2. C++ program using constructor and destructor.
3. C++ program using structure, new and delete operator.
4. Array Implementation of List ADT.
5. Linked List Implementation of List ADT - Singly Linked List & Doubly Linked List.
6. Implementation of Polynomial Manipulation Using Linked List.
7. Array & Linked List Implementation of Stack ADT.
8. Implementation of Evaluating Postfix Expressions, Infix To Postfix Conversion.
9. Array & Linked List Implementation of Queue ADT.
10. Implementation of Binary Search Tree.
11. Implementation of HEAP using Priority Queues.
8
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

12. Implementation of Graph Traversal -Breadth First Traversal And Depth First Traversal.
13. Sorting Algorithm - Implementation of Bubble Sort , Insertion Sort.
14. Searching Algorithm - Implementation of Linear Search and Binary Search.
15. Implementation of Open Addressing (Linear Probing And Quadratic Probing).

Total: 45 Periods
Course Outcomes:
On successful completion, the students will be able to:
CO1: Develop simple C++ programs using classes, objects, methods.
CO2: Implement abstract data types(ADT) of linear data structures.
CO3: Implement abstract data types(ADT) of non linear data structures.
CO4: Develop program using various searching and sorting techniques.
CO5: Design different hashing functions.
TEXT BOOKS:
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Fourth Edition, Pearson
Education, 2014.
2. Alfred V.Aho, John E.Hopcroft, Jeffrey D.Ullman Data Structures and Algorithms, Fourth
Edition, Pearson Education
REFERENCE BOOKS:
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. Adam Drozdek, Data structures and algorithms in C++, Fourth Edition, Cengage Learning, 2013.
4. Michael Main, Walter Svaitch, Data Structures and other objects using C++, 4th Edition, Pearson
Education 2011.
WEB REFERENCES
1. https://www.codechef.com/certification/data-structures-and-algorithms/prepare
2. https://nptel.ac.in/courses/106102064
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 2 2 2 2 2
CO2 3 3 2 2 2 2 2
CO3 3 3 2 2 2 2 2
CO4 3 3 2 2 2 2 2
CO5 3 3 2 2 2 2 2
Low (1); Medium (2); High (3)

OBJECT ORIENTED PROGRAMMING LABORATARY LTPC

CS2382
0 0 3 1.5
Course Objectives

 To build software development skills using java programming for real-world applications.
 To illustrate the concepts of classes, packages, interfaces, inheritance, exception handling
and file processing
 To develop applications using event handling
9
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

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 using JavaFX controls, layouts and menus.
10. Develop a mini project for any application using Java concepts.

Course Outcomes
On successful completion, the students will be able to:
CO1: Develop simple programs using object oriented programming concepts
CO2: Implement simple applications using package and exceptions
CO3: Implement applications using multithreading and files
CO4: Create GUIs and event driven programming applications
CO5: Develop web applications for real world problems
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.

Reference Books
1 Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11th Edition, Prentice Hall, 2018.
2 Paul Deitel, Harvey Deitel, “Java How to Program”, Pearson, Eleventh edition, 2017.
ISBN:13: 978-0134743356
3 Bruce Eckel, “Thinking in Java”, Fourth Edition, Prentice Hall, 2006. ISBN: 978-0131872486.
4 Kathy Sierra, Bert Bates, “Head First Java”, Second Edition, O'Reilly Media, 2005. ISBN: 10-
0596004656, ISBN-13:9780596004651.
10
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

Web References
1 https://www.javatpoint.com/java-tutorial

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 2
CO2 3 3 2
CO3 3 3 2
CO4 3 3 2
CO5 3 2 3 3 3 3 3 3 3
Low (1); Medium (2); High (3)

GE2381 PROFESSIONAL DEVELOPMENT LTPC

0021
Course Objectives
 To be proficient in using MS WORD / Google Docs to create technical documents
 To be proficient in using MS EXCEL/ Google sheets for all data manipulation tasks.
 To be able to create and share presentations by using the features of MS PowerPoint .
 To create a collaborative environment using Figma (web based tool).
MSWORD & GOOGLE DOCS: 5 Hours

Create and format a document using different symbol

Working with tables-Insert a image into a table.

Working with styles, shapes, smart art, charts

Inserting objects, charts and importing objects from other office tools

Working with Table of contents and References, citations

Insert and review comments, bookmarks and hyperlinks,

Working with document protection and security Inspect document for accessibility

Converting Image into editable text in google docs and google docs to pdf

MSEXCEL& GOOGLE SHEETS: 10 Hours

Sort and filter data

Use pivot tables to summarize and analyze data
Perform data analysis using own formulae and functions
Combine data from multiple Google sheets using built-in functions to generate results
Export data and sheets to other file formats in Google Sheets.
Protecting data and securing the workbook

11
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

MSPOWERPOINT & ONE NOTE 10 Hours

Select slide templates, layout and themes

Insert and format images, smartart, tables, and charts

Working with animation and transitions, Organize and Group slides

Import or create and use media objects: audio, video, animation.

Perform slides how recording and Record narration and create presentable videos.

Using One Note create notes for different subjects.

Organize the created notes, Tag important notes

FIGMA –WEB BASED TOOL 5 Hours

Create and design your own brief and mood board

Create a button system

Create a mobile app card

Create a storyboard instruction

Create your own Wireframe
Working with icons and effects

TOTAL: 30 PERIODS
Course Outcomes:
On successful completion, the students will be able to
CO1: To create documents using MSWord and Google Docs
CO2: Use MS Excel and Google sheets to perform data retrieval and data analytics
CO3: Prepare presentations using MS Power Point
CO4: Design a web application using Figma tool.

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3
CO2 3 3
CO3 3 3
CO4 3 3 3 1
Low (1); Medium (2); High (3)
CS2411 THEORY OF COMPUTATION LTPC
3003
Course Objectives
 To construct automata for any given pattern and find its equivalent regular expressions
 To design a context free grammar for any given language
 To understand Turing machines and their capability
 To understand undecidable problems and NP class problems
12
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

Unit I AUTOMATA FUNDAMENTALS 9

Introduction: Alphabets-languages--Finite state systems: Finite Automata - Deterministic Finite
Automata – Non-deterministic Finite Automata – Finite Automata with Epsilon Transitions-
Equivalence of NFA and DFA – Equivalence of NFA‘s with and without Epsilon moves.
Unit II REGULAR EXPRESSIONS AND LANGUAGES 9
Regular Expressions – Equivalence of Regular expression and FA- Equivalence of FA and Regular
Expressions- Arden's theorem – Applications of Regular Expression-–Closure Properties of Regular
Languages – Equivalence and Minimization of Automata.
Unit III CONTEXT FREE GRAMMAR AND LANGUAGES 9
Grammar Introduction- Types of Grammar- Context-Free Grammar (CFG) – Parse Trees – Ambiguity
in Grammars and Languages – Definition of the Pushdown Automata – Languages of Pushdown
Automata – Equivalence of Pushdown Automata and CFG.
Unit IV PROPERTIES OF CONTEXT FREE LANGUAGES AND TURING MACHINE 9
Normal Forms for CFG – Chomsky Normal Form – Greibach Normal Form-Pumping Lemma for CFL –
Closure Properties of CFL – Turing Machines– Language of a Turing Machine- Programming
Techniques for TM- Storage in finite control – multiple tracks – checking of symbols – subroutines
Unit V UNDECIDABILITY 9
A language that is not Recursively Enumerable (RE) - An undecidable problem that is RE –
Undecidable problems about Turing Machine - Rice Theorem -Post's Correspondence Problem-
Modified Post Correspondence Problem, P and NP Problems
Total: 45 Periods
Course Outcomes
On successful completion, the students will be able to:
CO1: Construct Finite Automata to solve computational problems.
CO2: Write an regular expression for finite automata.
CO3: Design context free grammar for Pushdown Automata
CO4: Design Turing machine for computational problems
CO5: Analyze undecidable problems and NP class problems
Text Book
1. John E.Hopcroft, Rajeev Motwani and Jeffrey.D Ullman, Introduction to Automata Theory,
Languages and Computations, Pearson Education, Third Edition, 2014
Reference Books
1.H.R.Lewis and C.H.Papadimitriou, ―Elements of the theory of Computation, Second Edition, PHI,
2003.
2. J.Martin, ―Introduction to Languages and the Theory of Computation, Third Edition, TMH, 2003
3. Micheal Sipser, ―Introduction of the Theory and Computation, Thomson Brokecole, 1997.

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 1
CO2 3 1
CO3 3 2 1
CO4 3 3 2 1 1
CO5 3 3 1
Low (1); Medium (2); High (3)

13
 PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

CS2C12 DATABASE MANAGEMENT SYSTEMS LTPC

3003
Course Objectives:
 To learn the fundamentals of DBMS, relational algebra and SQL.
 To represent a database system using ER diagrams and to learn normalization techniques
 To understand the fundamental concepts of transaction, concurrency and recovery.
 To understand the data storage structures using file, indexing and hashing techniques.
 To have an introductory knowledge about the querying, Distributed databases, NOSQL.
UNIT I RELATIONAL DATABASES 10
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 - Introduction to NOSQL.
UNIT II DATABASE DESIGN 8
Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-Relational Mapping –
Functional Dependencies – Anomaly - First, Second, Third, Boyce/Codd, Fourth and Fifth Normal
Form - Denormalization.
UNIT III TRANSACTIONS 9
Transaction Concepts – ACID Properties – Schedules – Serializability – Need for Concurrency –
Concurrency control –Two Phase Locking- Timestamp – Multiversion – Deadlock Handling – Recovery
Concepts – Recovery based on deferred and immediate update – Shadow paging – ARIES Algorithm
UNIT IV DATA STORAGE 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.
UNIT V QUERY PROCESSING AND DISTRIBUTED DATABASES 9
Query Processing: Overview – Algorithms for Selection and join operations – Query optimization
using Heuristics - Cost Estimation. Distributed Databases: Architecture, Data Storage, Transaction
Processing - NOSQL Databases: Introduction – CAP Theorem – Document Based systems – Key value
Stores – Column Based Systems – Graph Databases.
Total: 45 Periods
COURSE OUTCOMES:
On successful completion, the students will be able to
CO1 write relational algebra and SQL queries.
CO2: Design database using ER model and normalize the database.
CO3: 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: Learn advanced databases and identify a suitable database for the given requirement.
TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, Seventh
Edition, McGraw Hill, 2020.
14
 PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

2. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Seventh Edition,

Pearson Education, 2017
REFERENCE BOOKS:
1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition,
Pearson Education, 2006.
2. G.K.Gupta,"Database Management Systems”, Tata McGraw Hill, 2011.
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 3
CO2 3
CO3 3
CO4 3 2
CO5 3 3 3 3
Low (1); Medium (2); High (3)

CS2413 COMPUTER NETWORKS LTPC

3003
Course Objectives:
 To understand the protocol layering and physical layer.
 To understand the various components required to build different networks.
 To learn the functions of network layer and the various routing protocols.
 To familiarize the functions and protocols of the Transport layer.
UNIT I DATA COMMUNICATION AND PHYSICAL LAYER 9
Networks – Network Types – Protocols - Layering – TCP/IP Protocol suite – OSI Model – Introduction
to Data Communication – Data and Signals – Signal encoding techniques – Multiplexing – spread
spectrum - Transmission media – Switching – Circuit-switched Networks – Packet Switching –
Performance.
UNIT II DATA-LINK LAYER & MEDIA ACCESS 9
Introduction – Link-Layer Addressing – DLC Services – Data-Link Layer Protocols – HDLC – PPP – Error
detection and correction - Wired LANs: Ethernet - Wireless LANs – Introduction – IEEE 802.11,
Bluetooth – Connecting Devices.
UNIT III NETWORK LAYER 9
Network Layer Services – Performance – Network Layer Protocols: IP - IPv4 Addresses – Forwarding
of IP Packets – ARP – RARP - ICMPv4 – Unicast Routing Algorithms: RIP, OSPF – Multicasting Basics –
IPv6 Addressing – IPv6 Protocol.
UNIT IV TRANSPORT LAYER 9
Introduction – Transport Layer Protocols – Services – Port Numbers – User Datagram Protocol –
Transmission Control Protocol – Connection establishment – Flow Control – Window Management –
Sliding Window protocol – TCP Congestion Control – Congestion avoidance.
UNIT V APPLICATION LAYER 9
Application Layer Protocols – WWW and HTTP – FTP – Email –Telnet –SSH – DNS – SNMP.
TOTAL: 45 PERIODS

15
 PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

COURSE OUTCOMES:
On successful completion, the students will be able to:
CO1: Describe the components and functions of data communication and physical layer.
CO2: Discuss the data flows from one node to another using DLC services.
CO3: Compare various routing algorithms.
CO4: Describe protocols for various mechanisms in the transport layer.
CO5: Illustrate the working of various application layer protocols.
TEXT BOOKS:
1. Behrouz A. Forouzan, Data Communications and Networking, Fifth Edition TMH, 2013.
REFERENCE BOOKS:
1. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth Edition,
Morgan Kaufmann Publishers Inc., 2012.
2. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education,
2013.
3. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall, 2014.
4. Ying-Dar Lin, Ren-Hung Hwang and Fred Baker, Computer Networks: An Open Source
Approach, McGraw Hill Publisher, 2011.
5. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach Featuring the
Internet, Sixth Edition, Pearson Education, 2013.

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2
CO3 3 2
CO4 3 3 2 1
CO5 3 2
CO6 3 2 2
Low (1); Medium (2); High (3)

CS2414 DESIGN AND ANALYSIS OF ALGORITHM LTPC

3003
Course Objectives:
 To understand and apply the algorithm analysis techniques on searching and sorting
algorithms.
 To analyse the efficiency of graph algorithms.
 To understand different algorithm design techniques.
 To solve programming problems using state space tree.
 To understand the concepts behind NP Completeness, Approximation algorithms and
randomized algorithms.

16
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

UNIT I INTRODUCTION 9
Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best case,
Worst case and average case analysis – Solving Recurrence relation - Pattern search: The naïve string-
matching algorithm - Rabin-Karp algorithm - Knuth-Morris-Pratt algorithm.
UNIT II GRAPH ALGORITHMS 9
Graph algorithms: bi-connectivity- Euler circuits - Shortest path: Bellman-Ford 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 — 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
coloring problem - Branch and Bound: 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.
Total: 45 Periods
COURSE OUTCOMES:
On successful completion, the students will be able to
CO1: Analyze the efficiency of algorithms using various frameworks
CO2: Analyze the efficiency of graph algorithms to solve problems
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
TEXT BOOK:
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.
2. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.

17
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 2 2
CO2 3 3 2 2
CO3 3 2 2 2
CO4 3 2 2 2
CO5 3 2 2 2
Low (1); Medium (2); High (3)

IT2C25 INTRODUCTION TO OPERATING SYSTEMS LTPC

3003
Course Objectives:
 To understand the basic concepts and functions of operating systems.
 To understand Processes, Threads and Deadlock.
 To understand various memory management
 To understand files, directories and IO
 To be familiar with the basics of virtual machines and Mobile OS like iOS and Android.
UNIT I OPERATING SYSTEM OVERVIEW 9
Computer System -Basic Elements; Operating system -objectives and functions, Evolution of
Operating System. - Operating System Structure and Operations- System Calls, System Programs,
Virtual machines, OS Generation and System Boot – UEFI and Legacy boot.
UNIT II PROCESS MANAGEMENT 9
Process Management: Processes-Operation on Process-Process Scheduling-Inter Process
Communication; CPU Scheduling Algorithms; Multithreading: overview –Multithreading models;
Process Synchronization-Critical Section Problem-Semaphore-Dining Philosopher Problem, Deadlock:
Deadlock characterization, Methods for handling deadlocks, Deadlock Prevention, Deadlock
Avoidance, Deadlock Detection and Deadlock Recovery. CASE STUDY - Linux Process Management.
UNIT III MEMORY MANAGEMENT 9
Main Memory - Swapping, Contiguous Memory Allocation, Paging, Segmentation; Virtual Memory:
Demand Paging, Page Replacement, Allocation of frames, thrashing; Allocating Kernel Memory. CASE
STUDY - Linux Memory Management.
UNIT IV I/O SYSTEMS 9
Mass Storage: Disk Scheduling and Management; File System: File Concepts- Access methods -File
System Structure- Directory and Disk Structure- Allocation Methods- Free Space Management; I/O
Systems: I/O Hardware-Application I/O interface, Kernel I/O subsystem. CASE STUDY – Linux File
system.
UNIT V VIRTUAL MACHINES AND MOBILE OS 9
Virtual Machines – Features, Building Blocks, Types of Virtual Machines and their Implementations,
Virtualization- Types of Operating Systems-Introduction to Dockers and Containers, Types of
hypervisors; Mobile OS – Android and iOS.
Total: 45 Periods
COURSE OUTCOMES:
On successful completion, the students will be able to
CO1: Describe the basic concepts of Operating system.
CO2: Analyze various scheduling algorithms and process synchronization.

18
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

CO3: Apply deadlock prevention and avoidance algorithms.

CO4: Compare and contrast various memory management schemes.
CO5: Explain the File, Directory and I/O systems.
CO6: Interpret the concept of Virtualization and Mobile OS
Text Book:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 10th
Edition, John Wiley and Sons Inc., 2018.
2. Steve Shah and Wale Soyinka “ Linux Administration: A Begineer’s Guide”, 4th
Edition, Tata McGraw-Hill Publishing Company Limited, New Delhi, ISBN: 978-
0072262599

References:
1.Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 5th Edition,2022 New Delhi.
2.https://access.redhat.com/documentation/enus/red_hat_enterprise_linux/7/pdf/system_adminis
trators_guide/red_hat_enterprise_linux-7-system_administrators_guide-en-us.pdf

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3
CO2 3 2
CO3 3
CO4 3 2
CO5 3 2
CO6 3 2 3 3
Low (1); Medium (2); High (3)

GE2421 ENVIRONMENTAL SCIENCES AND SUSTAINABILITY LTPC

2002
COURSE OBJECTIVES
 To introduce the basic concepts of environment, ecosystems and biodiversity and emphasize on
the biodiversity of India and its conservation.
 To impart knowledge on the causes, effects and control or preventive measures of environmental
pollution
 To identify new renewable energy resources and contribute to the sustainable measures to
conserve them for future generations.
 To facilitate the understanding of global and Indian scenario of regional and local environmental
issues and providing solutions to lead sustainability.
 To demonstrate the knowledge of green technology to conserve the environment.

UNIT I ENVIRONMENT AND BIODIVERSITY 6

Definition, scope and importance of environment – need for public awareness. Eco-system and
Energy flow– ecological succession. Biodiversity- Definition-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 –
endangered and endemic species of India – conservation of biodiversity: In-situ and ex-situ. Field visit
of simple ecosystem.
19
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

UNIT II ENVIRONMENTAL POLLUTION 6

Definition, Causes, Effects and Preventive measures of Water, Soil, Air and Noise Pollutions.
Solid, Hazardous and E-Waste management. Case studies on Occupational Health and Safety
Management system (OHASMS). Environmental protection Acts. Environmental Impact Assessment.
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
Sustainable Development-Definition, concept, needs and challenges-GDP-economic and social
aspects of sustainability-measures of sustainability-millennium development goals, and protocols-
targets, indicators and intervention areas.
Climate change- Global, Regional and local environmental issues and possible solutions-case studies.
Concept of Carbon Credit, Carbon Footprint. Environmental management in industry-A case study.
UNIT V SUSTAINABILITY PRACTICES 6
Zero waste and 3R concept, Circular economy, ISO 14000 Series, Material Life cycle assessment,
Sustainable habitat: Green buildings, Green materials, Energy efficiency, Sustainable transports.
Sustainable energy: Energy Cycles- carbon cycle, emission and sequestration, Green Engineering:
Sustainable urbanization- Socio- economical and technological change.
TOTAL: 30 PERIODS

COURSE OUTCOMES:
On successful completion, 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 various environmental pollution and contribute to the
preventive measures in the immediate society.
CO3: To recognize different forms of renewable energy resources and apply them for suitable
applications for technological advancement and societal development.
CO4: To identify and apply the knowledge of engineering & technology for environmental
management to achieve sustainability.
CO5: To facilitate the understanding of global and Indian scenario of green technologies for future
generations.

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. Anjali Bagad, “ Environmental Sciences and Sustainablity”,1st Edition, Technical Publications,
Pune, 2022.

REFERENCE BOOKS:
1. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press, Third
Edition, 2015.
2. Erach Bharucha “Textbook of Environmental Studies for Undergraduate Courses” 3 rd Edition.
Orient BlackswanPvt. Ltd. 2021.
3. Tyler Miller, G and Scott Spoolman “ Environmental Science” Cengage Learning; 16th edition,
2018.

20
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

4. Ravikrishnan, A “ Environmental Sciences and Sustainablity”,15 th Edition, Sri Krishna Hitech

Publishing Company Pvt Ltd. 2023.

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 1 3
CO2 3 3 2 3
CO3 2 2
CO4 3 3 2 3
CO5 3 3 2 3
Low (1); Medium (2); High (3)

CS2481 DATABASE MANAGEMENT SYSTEMS LABORATORY L T P C

0 0 3 1.5
COURSE OBJECTIVES:
 To learn and implement important commands in SQL
 To learn the usage of nested and joint queries.
 To understand functions, procedures and procedural extensions of databases
 To understand design and implementation of typical database applications.
 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, update and delete rows using SQL DDL and DML commands.
2. Create a set of tables, add foreign key constraints and incorporate referential integrity.
3. Query the database tables using different ‘where’ clause conditions and also
implement aggregate functions.
4. Query the database tables and explore sub queries and simple join operations.
5. Query the database tables and explore natural, equi and outer joins.
6. Write user defined functions and stored procedures in SQL.
7. Execute complex transactions and realize DCL and TCL commands.
8. Write SQL Triggers for insert, delete, and update operations in a database table.
9. Create View and index for database tables with a large number of records.
10. Create Document, column and graph based data using NOSQL database tools.
11. Develop a simple GUI based database application and incorporate all the above-mentioned
features
12. 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

21
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

goals stated in the application.

 Apply Normalization rules in designing the tables in scope
 Build PL SQL / Stored Procedures for Complex Functionalities, ex EOD Batch Processing
for calculating the EMI for Gold Loan for each eligible Customer
TOTAL: 45 PERIODS
COURSE OUTCOMES
On successful completion, 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 and manipulate data using NOSQL database.
CO5: Develop a simple GUI based database application.
TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, Seventh
Edition, McGraw Hill, 2020.
2. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Seventh Edition,
Pearson Education, 2017
REFERENCE BOOKS:
1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition,
Pearson Education, 2006.
2. G.K.Gupta,"Database Management Systems”, Tata McGraw Hill, 2011.
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 2
CO2 3 2 2 2
CO3 3 2 2 2
CO4 3 3 2 2 3
CO5 3 3 2 2 3 2 3
Low (1); Medium (2); High (3)

CS2482 Operating Systems Laboratory L T P C

0 0 3 1.5
COURSE OBJECTIVES:
 Installation of operating System.
 To understand the basics of shell programming
 To implement various CPU scheduling algorithms and Threading
 To implement Deadlock Avoidance
 To implement various memory allocation methods
 To implement disk scheduling algorithms.
LIST OF EXPERIMENTS:
1. Installation of Windows and Linux operating systems
2. Illustrate System Calls and shell programming
3. Write C programs to implement the various CPU Scheduling Algorithms

22
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

4. Illustrate the inter process communication strategy

5. Implement Process Synchronization-Semaphore
6. Write C programs to avoid Deadlock using Banker’s Algorithm
7. Write C program to implement Threading
8. Write C programs to implement the following Memory Allocation Methods
a. First Fit b. Worst Fit c. Best Fit
9. Write C programs to implement the various Page Replacement Algorithms
10. Write C programs for the implementation of various disk scheduling algorithms.
11. Installation of guest operating system like Linux using VMware.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Define and implement Linux Commands.
CO2: Compare the performance of various CPU Scheduling Algorithms.
CO3: Implement Deadlock Prevention.
CO4: Compare and contrast various Memory Allocation Methods.
CO5: Implement various Disk Scheduling Algorithms.
List of Software Requirements:
Linux OS with GNU Compiler
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 3 2 2 2 2 3 3
CO2 2 2 2 1 2 2
CO3 2 2 2 1 2 2
CO4 3 2 1 2 2 2
CO5 3 3 2 3 1 1 2 3 3
Low (1); Medium (2); High (3)

CS2483 NETWORKS LABORATORY L T P C

0 0 31.5
COURSE OBJECTIVES:
 To learn and use network commands.
 To learn socket programming.
 To implement and analyze various network protocols.
 To learn and use network simulation tools.
 To use simulation tools to analyze the performance of various network protocols.
List of Experiments
1. Learn to use commands like netstat, ipconfig, nslookup, ping, traceroute, hostname, getmac,
arp, tasklist, pathping, systeminfo and net.
2. Implement a HTTP web client program to download a web page using TCP sockets.
3. Applications using TCP sockets like: Echo client and echo server, Chat & File Transfer
4. Implementation of DNS using UDP sockets.
23
PSNACET (Autonomous), Dindigul -624 622 Regulations 2022 B.E. CSE

5. Write a code implementing ARP/RARP protocol.

6. Implementation of error correction code (like CRC).
7. Simulation of static routing using simulation tool.
8. Simulation of Distance Vector/ Link State Routing algorithm.
9. Performance evaluation of Routing protocols using Simulation tool.
10. Study of TCP/UDP performance using Simulation tool.
TOTAL: 45 PERIODS
COURSE OUTCOMES
On successful completion, the students will be able to
CO1: Use various network commands to retrieve network configuration and performance
statistics.
CO2: Demonstrate various network applications using TCP and UDP socket.
CO3: Experiment the functionality of various network layer services and error correction code.
CO4: Investigate the routing information of various routing algorithms using network simulation tool.
CO5: Compare the performance of various network protocols.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS SOFTWARE:
 C / C++ / Java / Equivalent Compiler
 Network simulator: CISCO Packet Tracer, Wireshark
HARDWARE:
 Standalone desktops
TEXT BOOKS:
1. Behrouz A. Forouzan, Data Communications and Networking, Fifth Edition TMH, 2013.
REFERENCE BOOKS:
1. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth Edition,
Morgan Kaufmann Publishers Inc., 2012.
2. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education,
2013.
3. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall, 2014.
4. Ying-Dar Lin, Ren-Hung Hwang and Fred Baker, Computer Networks: An Open Source
Approach, McGraw Hill Publisher, 2011.
5. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach Featuring the
Internet, Sixth Edition, Pearson Education, 2013.
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 2 3 2
CO2 3 3 3 2 3 3
CO3 3 3 2 2 3 3
CO4 2 3 3 3 2 2 3 3
CO5 2 2 3 3 2 2 3 2
Low (1); Medium (2); High (3)

24
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110