r23 Cse Bos Syllabus 27-7-2024

COURSE STRUCTURE
AND
DETAILED SYLLABUS
B.Tech Second Year (III & IV Semesters)
R23
COMPUTER SCIENCE AND

ENGINEERING
For
B.TECH. FOUR YEAR DEGREE COURSE
(Applicable for batches admitted from 2023-2024)
SWARNANDHRA
COLLEGE OF ENGINEERING & TECHNOLOGY
(AUTONOMOUS)
Swarnandhra College of Engineering and Technology (Autonomous)
SEETHARAMAPURAM, NARSAPUR-534 280, W.G.DT., A.P.
SEMESTER-III
S. No. Course Code Course Title L T P C
1 BS & H Discrete Mathematics & Graph Theory 3 0 0 3
Management
2 Managerial Economics and Financial Analysis 2 0 0 2
Course-I
3 Engineering Science Computer Organization and Architecture 3 0 0 3
4 Professional Core Advanced Data Structures & Algorithms 3 0 0 3
5 Professional Core Database Management Systems 3 0 0 3
6 Professional Core Advanced Data Structures Lab 0 0 3 1.5
7 Professional Core Database Management Systems Lab 0 0 3 1.5
Skill Enhancement
8 Python Programming 0 1 2 2
course
9 Audit Course Environmental Science 2 0 0 -
Total 16 1 8 19
SEMESTER-IV
S. No Course Code Course Title L T P C
Universal human values –
1 BS & H understanding harmony and Ethical 2 1 0 3
human conduct
Engineering Science/
2 Probability & Statistics 3 0 0 3
Basic Science
3 Professional Core Operating Systems 3 0 0 3
Object Oriented Programming Through
4 Professional Core Java 3 0 0 3
5 Professional Core Software Engineering 3 0 0 3
Operating Systems & Software
6 Professional Core Engineering Lab 0 0 3 1.5
Object Oriented Programming Through
7 Professional Core Java Lab 0 0 3 1.5
8 Skill Enhancement Course Full Stack Development 0 1 2 2

9 BS&H Design Thinking & Innovation 1 0 2 2
Total 15 2 10 22
L-LECTURE HOURS, T- TUTORIAL HOURS, P-PRACTICAL HOURS, C-CREDITS,

IM- INTERNAL MARKS, EM- EXTERNAL MARKS, TM- TOTAL MARKS
B.TECH/IT/R23(CBCS) Page 2
L T P C
III SEMESTER
3 - - 3
DISCRETE MATHEMATICS AND GRAPH THEORY
Course Objectives:
 To introduce the students to the topics and techniques of discrete methods and combinatorial
reasoning.
 To introduce a wide variety of applications. The algorithmic approach to the solution of problems is
fundamental in discrete mathematics, and this approach reinforces the close ties between this
discipline and the area of computer science.
Course Outcomes: At the end of the course students will be able to

1. Build skills in solving mathematical problems (L3)
2. Comprehend mathematical principles and logic (L4)
3. Demonstrate knowledge of mathematical modeling and proficiency in using mathematical software
(L6)
4. Manipulate and analyze data numerically and/or graphically using appropriate Software (L3)
5. How to communicate effectively mathematical ideas/results verbally or in writing (L1)
UNIT–I: Mathematical Logic:

Propositional Calculus: Statements and Notations, Connectives, Well Formed Formulas, Truth
Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications, Normal Forms,
Theory of Inference for Statement Calculus, Consistency of Premises, Indirect Method of Proof,
Predicate Calculus: Predicates, Predicative Logic, Statement Functions, Variables and Quantifiers, Free
and Bound Variables, Inference Theory for Predicate Calculus.
UNIT-II: Set Theory:

Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties, Operations, Partition
and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering, Hasse Diagrams,
Functions: Bijective, Composition, Inverse, Permutation, and Recursive Functions, Lattice and its
Properties.
UNIT-III: Combinatorics and Recurrence Relations:

Basis of Counting, Permutations, Permutations with Repetitions, Circular and Restricted Permutations,
Combinations, Restricted Combinations, Binomial and Multinomial Coefficients and Theorems.
Recurrence Relations:
Generating Functions, Function of Sequences, Partial Fractions, Calculating Coefficient of Generating
Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving Recurrence Relations
by Substitution and Generating Functions, Method of Characteristic Roots, Solving Inhomogeneous
Recurrence Relations
UNIT-IV: Graph Theory:

Basic Concepts, Graph Theory and its Applications, Subgraphs, Graph Representations: Adjacency and
Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and Hamiltonian Graphs,
Unit-V: Multi Graphs
Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph Colouring and Covering, Chromatic
Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS Spanning Trees.
TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay and P.
Manohar, Tata McGraw Hill.
2. Elements of Discrete Mathematics-A Computer Oriented Approach, C. L.Liu and D.P. Mohapatra,
3rdEdition, Tata McGraw Hill.
3. Theory and Problems of Discrete Mathematics, Schaum’s Outline Series, Seymour Lipschutz and
Marc Lars Lipson, 3rd Edition, McGraw Hill.
REFERENCE BOOKS:
1. Discrete Mathematics for Computer Scientists and Mathematicians, J. L.Mott, A. Kandel and T. P.
Baker, 2nd Edition, Prentice Hall of India.
2. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby andSharon Cutler Ross, PHI.
3. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011.
4. Discrete Mathematics and its Applications with Combinatorics and GraphTheory, K.H. Rosen, 7 th
Edition, Tata McGraw Hill.
L T P C
III SEMESTER
2 - - 2
MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS
Course Objectives:
 To inculcate the basic knowledge of micro economics and financial accounting
 To make the students learn how demand is estimated for different products, input- out put
relationship for optimizing production and cost
 To Know the Various types of market structure and pricing methods and strategy
 To give an overview on investment appraisal methods to promote the students to learn how to plan
long-term investment decisions.
 To provide fundamental skills on accounting and to explain the process of preparing financial
statements.
Course Outcomes: At the end of the course, student will be able to

 Define the concepts related to Managerial Economics, financial accounting and management.
 Understand the fundamentals of Economics viz., Demand, Production, cost, revenue and markets
 Apply the Concept of Production cost and revenues for effective Business decision
 Analyze how to invest their capital and maximize returns
 Evaluate the capital budgeting techniques
 Develop the accounting statements and evaluate the financial performance of business entity.
UNIT-I
Managerial Economics: Introduction – Nature, meaning, significance, functions, and
advantages. Demand-Concept, Function, Law of Demand - Demand Elasticity- Types –
Measurement. Demand Forecasting- Factors governing Forecasting, Methods. Managerial Economics and
Financial Accounting and Management.
UNIT-II
Production and Cost Analysis: Introduction – Nature, meaning, significance, functions and advantages.
Production Function– Least-cost combination– Short run and long run Production Function- Isoquants and
Isocosts, MRTS -Cobb-Douglas Production Function - Laws of Returns - Internal and External Economies
of scale. Cost & Break-Even Analysis - Cost concepts and Cost behaviour- Break-Even Analysis (BEA) -
Determination of Break- Even Point (Simple Problems)-Managerial significance and limitations of Break-
Even Analysis.
UNIT-III
Business Organizations and Markets: Introduction–Nature, meaning, significance, functions and
advantages. Forms of Business Organizations- Sole Proprietary - Partnership - Joint Stock Companies -
Public Sector Enterprises. Types of Markets - Perfect and Imperfect Competition - Features of Perfect
Competition Monopoly-Monopolistic Competition– Oligopoly-Price-Output Determination-Pricing

Methods and Strategies
UNIT-IV
Capital Budgeting: Introduction – Nature, meaning, significance, functions and advantages. Types of
Working Capital, Components, Sources of Short-term and Long-term Capital, Estimating Working capital
requirements. Capital Budgeting–Features, Proposals, Methods and Evaluation. Projects– Pay Back Method,
Accounting Rate of Return(ARR) Net Present Value(NPV)Internal Rate Return(IRR)
Method (sample problems)
UNIT-V
Financial Accounting and Analysis: Introduction – Nature, meaning, significance, functions and
advantages. Concepts and Conventions-Double-Entry Book Keeping, Journal, Ledger, Trial Balance- Final
Accounts (Trading Account, Profit and Loss Account and Balance Sheet with simple adjustments). Financial
Analysis-Analysis and Interpretation of Liquidity Ratios, Activity Ratios, and Capital structure Ratios and
Profitability.
Textbooks:
1. Varshney &Maheswari: Managerial Economics,Sultan Chand,2013.
Reference Books:
1. Managerial Economics: Principles And Worldwide Applications, 9E (Adaptation) by Dominick
Salvatore and Siddhartha Rastogi
2. Managerial Economics: Principles and Worldwide Applications by Dominick Salvatore
L T P C
III SEMESTER
3 - - 3
COMPUTER ORGANIZATION AND ARCHITECTURE
Course Code Category L T P C I.M E.M. Exam

ES 3 -- -- 3 30 70 3 Hrs.
COMPUTER ORGANIZATION AND ARCHITECTURE

(For CSE)
Course Objectives: Students are expected to learn

1. Principles and the Implementation of Computer Arithmetic
2. Operation of CPUs including RTL, ALU, Instruction Cycle, and Busses
3. Functionality of central processing unit and control units
4. Memory System and I/O Organization
Course Outcomes: After completion of the course, the student will be able to
S.No Outcome KL
CO1 Identify set of digital components. K3
CO2 Demonstrate functional components and micro operations in a basic computer K2
system.
CO3 Demonstrate various instructions and arithmetic operations K3
CO4 Illustrate knowledge of functional components on central processing unit and K2
various control units.
CO5 Determine different memory components in a computer for better memory K3
organization
CO6 Explain different ways of communication with I/O devices and standard I/O K2
interface
SYLLABUS
Introduction: Basic Logic functions, Logic gates, Boolean functions, Canonical
forms, Simplification of Boolean functions (up to 4 variable), Basics of Flipflops,
Registers, Decoders and multiplexers.
UNIT-I Basic Structure of Computers: Computer Types, Functional units, Basic operational
(10 Hrs) concepts, Bus structures.
Register Transfer and Micro operations: Register Transfer Language, Register
Transfer, Bus and Memory Transfers, Arithmetic Micro operations, Logic Micro
operations, Shift Micro operations, Arithmetic Logic Shift Unit.
Basic Computer Organization and Design: Instruction Codes, Computer Register,

Computer Instructions, Instruction Cycle, Memory – Reference Instructions. Input –
Output and Interrupt, Complete Computer Description
UNIT-II Computer Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast
(08 Hrs) Adders, Multiplication of Positive Numbers, Signed-operand Multiplication, Fast
Multiplication, Integer Division, Floating-Point Numbers and Operations
Central Processing Unit:General Register Organization, STACK

Organization.Instruction Formats, Addressing Modes, Data Transfer and Manipulation,
UNIT-III Execution of a Complete Instruction, Multiple-Bus Organization,
(10 Hrs) Microprogrammed Control: Control Memory, Address Sequencing, Micro Program
example, Hardwired Control and Micro programmed Control.
The Memory Organization:Memory Hierarchy, Main memory, Auxiliary memory,

UNIT-IV Associate Memory, Cache Memory, and Virtual memory, Memory Management
(10 Hrs) Requirements, Secondary Storage.
Input / Output Organization: Accessing I/O Devices, Interrupts, Processor

UNIT-V Examples, modes of transfers, Direct Memory Access, Buses, Interface Circuits,
(12 Hrs.) Standard I/O Interfaces
Text Books:
1. Computer System Architecture M. M. Mano:, 3rd ed., Prentice Hall of India, New Delhi, 1993
2. Digital Design, 6th Edition, M. Morris Mano, Pearson Education.
Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 5/e, McGraw
3.
Hill,2002.
Reference Books:
1. Computer Organization and Architecture, William Stallings, 6/e, Pearson,2006.
2. Structured Computer Organization, Andrew S. Tanenbaum, 4/e, Pearson,2005.
Fundamentals of Computer Organization and Design, Sivarama P. Dandamudi, Springer,
3.
2006.
e-Resources
1. https://nptel.ac.in/courses/106/105/106105163/
2. http://www.cuc.ucc.ie/CS1101/David%20Tarnoff.pdf
L T P C
III SEMESTER
3 - - 3
ADVANCED DATA STRUCTURES & ALGORITHMS
Course Objectives:
The main objectives of the course is to
● provide knowledge on advance data structures frequently used in Computer Science domain
● Develop skills in algorithm design techniques popularly used
● Understand the use of various data structures in the algorithm design
Course Outcomes: At the end of the course students will be able to
CO1: Discover the performance of an algorithm using asymptotic notation. (K2)

CO2: Use divide and conquer technique to solve problems.(K3)
CO3: Understand greedy and dynamic programming techniques to solve efficient
solutions for optimization problem.(K3)
CO4: Recognize problems suitable for back tracking , branch and bound solutions.(K1)
CO5: Understand the complexity classes NP-Hard and NP-Complete and solve related
decision problems.(K2)
UNIT–I: [15 Hrs.]

Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic Notations,
Recursive functions,
AVL Trees – Creation, Insertion, Deletion operations and Applications
B-trees – Creation, Insertion, Deletion operations and Applications
B+trees - Creation, Insertion, Deletion operations and Applications
UNIT–II: [12 Hrs.]

HeapTrees (PriorityQueues)–Min andMaxHeaps,OperationsandApplications
Graphs–Terminology, Representations, Basic Search and Traversals, Connected Components and
Biconnected Components, applications
UNIT–III: [12 Hrs.]

Divide and Conquer: The General Method, Quick Sort, Merge Sort, Heap Sort, Strassen’s matrix
multiplication.
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem, Minimum
cost spanning trees, Single Source Shortest Paths
UNIT–IV: [15 Hrs.]
Dynamic Programming: General Method, All pairs shortest paths, Single Source Shortest Paths–
General Weights (Bellman Ford Algorithm), Optimal Binary Search Trees, 0/1 Knapsack, String
Editing.
Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph Coloring, 0/1
Knapsack Problem
UNIT–V: [14 Hrs.]

Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling Salesperson problem.
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem NP Hard Graph Problems:
Clique Decision Problem (CDP), Chromatic Number Decision Problem (CNDP), Traveling
Salesperson
Textbooks:
1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh 2nd Edition
Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran 2nd Edition University
Press
Reference Books:
1. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
2. An introduction to Data Structures with applications, Trembley & Sorenson, McGraw Hill
3. The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth, Addison-Wesley, 1997.
4. Data Structures using C & C++: Langsam, Augenstein & Tanenbaum, Pearson, 1995
5. Algorithms + Data Structures & Programs:, N.Wirth, PHI
6. Fundamentals of Data Structures in C++: Horowitz Sahni & Mehta, Galgottia Pub.
7. Data structures in Java:, Thomas Standish, Pearson Education Asia
Online Learning Resources:

1. https://www.tutorialspoint.com/advanced_data_structures/index.asp
2. http://peterindia.net/Algorithms.html
3. Abdul Bari, 1. Introduction to Algorithms (youtube.com)
4. https://www.swarnandhra.ac.in/dsv
5. bit.ly/BRK_DSV
L T P C
III SEMESTER
3 - - 3
DATABASE MANAGEMENT SYSTEMS
Course Objectives:
The main objectives of the course is to
 Introduce database management systems and to give a good formal foundation on the relational model
of data and usage of Relational Algebra
 Introduce the concepts of basic SQL as a universal Database language
 Demonstrate the principles behind systematic database design approaches by covering conceptual
design, logical design through normalization
 Provide an overview of physical design of a database system, by discussing Database indexing
techniques and storage techniques
UNIT I:
Introduction: Database system, Characteristics (Database Vs File System), Database Users, Advantages of
Database systems, Database applications. Brief introduction of different Data Models; Concepts of Schema,
Instance and data independence; Three tier schema architecture for data independence; Database system
structure, environment, Centralized and Client Server architecture for the database.
UNIT II:
Relational Model: Introduction to relational model, concepts of domain, attribute, tuple, relation, importance
of null values, constraints (Domain, Key constraints, integrity constraints) and their importance.
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set, relationship,
relationship set, constraints, sub classes, super class, inheritance, specialization, generalization using ER
Diagrams.
SQL:BASIC SQL: Simple Database schema, data types, table definitions (create, alter), different DML
operations (insert, delete, update).
UNIT III:
Basic SQL querying (select and project) using where clause, arithmetic & logical operations, SQL
functions(Date and Time, Numeric, String conversion).Creating tables with relationship, implementation of
key and integrity constraints, nested queries, sub queries, grouping, aggregation, ordering, implementation
of different types of joins, view(updatable and non-updatable), relational set operations.
Relational Algebra, Relational Calculus.
UNIT IV:
Schema Refinement (Normalization):Purpose of Normalization or schema refinement, concept of functional
dependency, normal forms based on functional dependency Lossless join and dependency preserving
decomposition, (1NF, 2NF and 3 NF), concept of surrogate key, Boyce-Codd normal form(BCNF), MVD,
Fourth normal form(4NF), Fifth Normal Form (5NF).
UNIT V:
TransactionConcept: TransactionState,ACIDproperties,ConcurrentExecutions,Serializability,
Recoverability, Implementation of Isolation, Testing for Serializability,
lockbased,timestampbased,optimistic,concurrencyprotocols,Deadlocks,Failure Classification, Storage,
Recovery and Atomicity, Recovery algorithm.
Introduction to Indexing Techniques: B+ Trees, operations on B+ Trees, Hash Based Indexing:
Text Books:
1) Database Management Systems, 3rd edition, Raghurama Krishnan, Johannes Gehrke, TMH (For
Chapters 2, 3, 4)
2) Database System Concepts,5th edition, Silberschatz, Korth, Sudarsan,TMH (For Chapter 1 and
Chapter 5)
Reference Books:
1) Introduction to Database Systems, 8thedition, C J Date, Pearson.
2) Database Management System, 6th edition, Ramez Elmasri, Shamkant B. Navathe, Pearson
3) Database Principles Fundamentals of Design Implementation and Management, Corlos Coronel,
Steven Morris, Peter Robb, Cengage Learning.
Web-Resources:
1) https://nptel.ac.in/courses/106/105/106105175/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/
lex_auth_01275806667282022456_shared/overview
L T P C
III SEMESTER
- - 3 1.5
ADVANCED DATA STRUCTURES LAB
Course Objectives:
The objectives of the course is to
 Acquire practical skills in constructing and managing Data structures
 Apply the popular algorithm design methods in problem-solving scenarios
Experiments covering the Topics:

 Operations on AVL trees, B-Trees, Heap Trees
 Graph Traversals
 Sorting techniques
 Minimum cost spanning trees
 Shortest path algorithms
 0/1 Knapsack Problem
 Travelling Salesperson problem
 Optimal Binary Search Trees
 N-Queens Problem
 Job Sequencing
Sample Programs:
1. Construct an AVL tree for a given set of elements which are stored in a file. And implement insert
and delete operation on the constructed tree. Write contents of tree into a new file using in-order.
2. Construct B-Tree an order of 5 with a set of 100 random elements stored in array. Implement
searching, insertion and deletion operations.
3. Construct Min and Max Heap using arrays, delete any element and display the content of the Heap.
4. Implement BFT and DFT for given graph, when graph is represented by
a) Adjacency Matrix b) Adjacency Lists
5. Write a program for finding the biconnected components in a given graph.
6. Implement Quick sort and Merge sort and observe the execution time for various input sizes
(Average, Worst and Best cases).
7. Compare the performance of Single Source Shortest Paths using Greedy method when the graph is
represented by adjacency matrix and adjacency lists.
8. Implement Job Sequencing with deadlines using Greedy strategy.
9. Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
10. Implement N-Queens Problem Using Backtracking.
11. Use Backtracking strategy to solve 0/1 Knapsack problem.
12. Implement Travelling Sales Person problem using Branch and Bound approach.
Reference Books:
1. Fundamentals of Data Structures in C++, Horowitz Ellis, SahniSartaj, Mehta, Dinesh, 2 ndEdition,
Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, 2 ndEdition,
University Press
3. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
4. An introduction to Data Structures with applications, Trembley& Sorenson, McGraw Hill

1. http://cse01-iiith.vlabs.ac.in/
2. http://peterindia.net/Algorithms.html
L T P C
III SEMESTER
- - 3 1.5
DATABASE MANAGEMENT SYSTEMS LAB
Course Objectives:
This Course will enable students to
 Populate and query a database using SQL DDL/DML Commands
 Declare and enforce integrity constraints on a database
 Writing Queries using advanced concepts of SQL
 Programming PL/SQL including procedures, functions, cursors and triggers
Experiments covering the topics:

 DDL, DML, DCL commands
 Queries, nested queries, built-in functions,
 PL/SQL programming- control structures
 Procedures, Functions, Cursors, Triggers,
 Database connectivity- ODBC/JDBC
List of Programs:
1. Creation, altering and droping of tables and inserting rows into a table (use constraints while creating tables)
examples using SELECT command.
2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION, INTERSET, Constraints.
Example:- Select the roll number and name of the student who secured fourth rank in the class.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING and Creation
and dropping of Views.
4. Queries using Conversion functions (to_char, to_number and to_date), string functions (Concatenation, lpad,
rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date functions (Sysdate, next_day, add_months,
last_day, months_between, least, greatest, trunc, round, to_char, to_date)
5. Create the following tables based on the above Schema Diagram with appropriate data types and constraints and
perform the following queries.
SAILORS (Saild, Salname, Rating, Age)
RESERVES (Sailid, boatid, Day)
BOATS (Boatid, Boat-name, Color)
a. Insert 5 to 10 rows in all tables?
b. Find the name of sailors who reserved boat number 3.
c. Find the name of sailors who reserved green boat.
d. Find the colors of boats reserved by Particular Sailor
e. Find the names of sailors who have reserved at least one boat.
f. Find the all sailid of sailors who have a rating of 10 or have reserved boated 104.
g. Find the Sailid‘s of sailors with age over 20 who have not registered a red boat.
h. Find the names of sailors who have reserved a red or green boat.
i. Find sailors whose rating is better than some sailor called ‗Dustin ‘.
j. Find the names of sailors who are older than the oldest sailor with a rating of 10.
6.
i. Create a simple PL/SQL program which includes declaration section, executable section and exception –
Handling section (Ex. Student marks can be
ii. selected from the table and printed for those who secured first class and an exception can be raised if no
records were found)
iii. Insert data into student table and use COMMIT, ROLLBACK and
SAVEPOINT in PL/SQL block.
7. Develop a program that includes the features NESTED IF, CASE and CASE expression. The program can be
extended using the NULLIF and COALESCE functions.
8. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops using ERROR Handling,
BUILT –IN Exceptions, USE defined Exceptions,
RAISE- APPLICATION ERROR.
9. Programs development using creation of procedures, passing

parameters IN and OUT of PROCEDURES.
10. Program development using creation of stored functions, invoke functions in SQL Statements and write
complex functions.
11. Write a function to check the validity of the given employee number from the employee table (print the
appropriate message using PL/SQL block)
12. Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR, WHERE CURRENT
of clause and CURSOR variables.
13. Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers and INSTEAD OF
Triggers
14. Create a table and perform the search operation on table using indexing and non- indexing techniques.
Text Books/Suggested Reading:

1. Oracle: The Complete Reference by Oracle Press
2. Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
3. Rick F Vander Lns, “Introduction to SQL”, Fourth Edition, Pearson Education, 2007.
L T P C
III SEMESTER
- 1 2 2
PYTHON PROGRAMMING (SKILL ENHANCEMENT COURSE)
Course Objectives:
The main objectives of the course are to
• Introduce core programming concepts of Python programming language.
• Demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries
• Implement Functions, Modules and Regular Expressions in Python Programming and to create
practical and contemporary applications using these
UNTI-I:
History of Python Programming Language, Thrust Areas of Python, Installing Anaconda Python
Distribution, Installing and Using Jupyter Notebook.
Parts of Python Programming Language: Identifiers, Keywords, Statements and Expressions, Variables,
Operators, Precedence and Associativity, Data Types, Indentation, Comments, Reading Input, Print Output,
Type Conversions, the type () Function and Is Operator, Dynamic and Strongly Typed Language.
Control Flow Statements: if statement, if-else statement, if...elif…else, Nested if statement, while Loop, for
Loop, continue and break Statements, Catching Exceptions Using try and except Statement.
Sample Experiments:
1. Write a program to find the largest element among three Numbers.
2. Write a Program to display all prime numbers within an interval
3. Write a program to swap two numbers without using a temporary variable.
4. Demonstrate the following Operators in Python with suitable examples.
i) Arithmetic Operators ii) Relational Operators iii) Assignment Operatorsiv) Logical Operators
v) Bit wise Operators vi) Ternary Operator vii) Membership Operatorsviii) Identity Operators
5. Write a program to add and multiply complex numbers
6. Write a program to print multiplication table of a given number.
UNIT-II:
Functions: Built-In Functions, Commonly Used Modules, Function Definition and Calling the function,
return Statement and void Function, Scope and Lifetime of Variables, Default Parameters, Keyword
Arguments, *args and **kwargs, Command Line Arguments.
Strings: Creating and Storing Strings, Basic String Operations, Accessing Characters in String by Index
Number, String Slicing and Joining, String Methods, Formatting Strings.
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In Functions Used on Lists,
List Methods, del Statement.
Sample Experiments:
1. Write a program to define a function with multiple return values.

2. Write a program to define a function using default arguments.
3. Write a program to find the length of the string without using any library functions.
4. Write a program to check if the substring is present in a given string or not.
5. Write a program to perform the given operations on a list:
i. addition ii. Insertion iii. slicing
6. Write a program to perform any 5 built-in functions by taking any list.
UNIT-III:
Dictionaries: Creating Dictionary, Accessing and Modifying key:value Pairs in Dictionaries, Built-In
Functions Used on Dictionaries, Dictionary Methods, del Statement.
Tuples and Sets: Creating Tuples, Basic Tuple Operations, tuple() Function, Indexing and Slicing in Tuples,
Built-In Functions Used on Tuples, Relation between Tuples and Lists, Relation between Tuples and
Dictionaries, Using zip() Function, Sets, Set Methods, Frozenset.
Sample Experiments:
1. Write a program to create tuples (name, age, address, college) for at least two members and
concatenate the tuples and print the concatenated tuples.
2. Write a program to count the number of vowels in a string (No control flow allowed).
3. Write a program to check if a given key exists in a dictionary or not.
4. Write a program to add a new key-value pair to an existing dictionary.
5. Write a program to sum all the items in a given dictionary.
UNIT-IV:
Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data, Reading and
Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Python os and os.path Modules.
Object-Oriented Programming: Classes and Objects, Creating Classes in Python, Creating Objects in
Python, Constructor Method, Classes with Multiple Objects, Class Attributes Vs Data Attributes,
Encapsulation, Inheritance, Polymorphism.
Sample Experiments:
1. Write a program to sort words in a file and put them in another file. The output file should have
only lower-case words, so any upper-case words from source must be lowered.
2. Python program to print each line of a file in reverse order.
3. Python program to compute the number of characters, words and lines in a file.
4. Write a program to create, display, append, insert and reverse the order of the items in the array.
5. Write a program to add, transpose and multiply two matrices.
6. Write a Python program to create a class that represents a shape. Include methods to calculate its
area and perimeter. Implement subclasses for different shapes like circle, triangle, and square.
UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python, NumPy with Python,
Pandas.
Sample Experiments:
1. Python program to check whether a JSON string contains complex object or not.
2. Python Program to demonstrate NumPy arrays creation using array () function.
3. Python program to demonstrate use of ndim, shape, size, dtype.
4. Python program to demonstrate basic slicing, integer and Boolean indexing.
5. Python program to find min, max, sum, cumulative sum of array
6. Create a dictionary with at least five keys and each key represent value as a list where this list
contains at least ten values and convert this dictionary as a pandas data frame and explore the data
through the data frame as follows:
a. Apply head () function to the pandas data frame
b. Perform various data selection operations on Data Frame
7. Select any two columns from the above data frame, and observe the change in one attribute with
respect to other attribute with scatter and plot operations in matplotlib
8. Case studies using python
9. Home assignments
10. Mini project
Reference Books:
1. Gowrishankar S, Veena A., Introduction to Python Programming, CRC Press.
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2ndEdition, Pearson, 2024
3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson.
Online Learning Resources/Virtual Labs:

1. https://www.coursera.org/learn/python-for-applied-data-science-ai
2. https://www.coursera.org/learn/python?specialization=python#syllabus
L T P C
III SEMESTER
2 - - -
ENVIRONMENTAL SCIENCE
Course Objectives:
 To make the students to get awareness on environment
 To understand the importance of protecting natural resources, ecosystems for future generations and
pollution causes due to the day-to-day activities of human life
 To save earth from the inventions by the engineers.
Course Outcomes:
 Grasp multidisciplinary nature of environmental studies and various renewable and non-renewable
resources.
 Understand flow and bio-geo-chemical cycles and ecological pyramids.
 Understand various causes of pollution and solid waste management and related preventive
measures.
 About the rainwater harvesting, watershed management, ozone layer depletion and waste land
reclamation.
 Casus of population explosion, value education and welfare programmes.
UNIT – I
Multidisciplinary Nature of Environmental Studies: – Definition, Scope and Importance – Need for Public
Awareness.
Natural Resources : Renewable and non-renewable resources – Natural resources and associated problems –
Forest resources – Use and over – exploitation, deforestation, case studies – Timber extraction – Mining,
dams and other effects on forest and tribal people – Water resources – Use and over utilization of surface
and ground water – Floods, drought, conflicts over water, dams – benefits and problems – Mineral
resources: Use and exploitation, environmental effects of extracting and using mineral resources, case
studies – Food resources: World food problems, changes caused by agriculture and overgrazing, effects of
modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. – Energy resources:
UNIT – II
Ecosystems: Concept of an ecosystem. – Structure and function of an ecosystem – Producers, consumers
and decomposers – Energy flow in the ecosystem – Ecological succession – Food chains, food webs and
ecological pyramids – Introduction, types, characteristic features, structure and function of the following
ecosystem:
a. Forest ecosystem.
b. Grassland ecosystem
c. Desert ecosystem
d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Biodiversity and Its Conservation : Introduction and Definition: genetic, species and ecosystem diversity –
Bio-geographical classification of India – Value of biodiversity: consumptive use, Productive use, social,
ethical, aesthetic and option values – Biodiversity at global, National and local levels – India as a mega-
diversity nation – Hot-sports 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 conservation of biodiversity.
UNIT – III
Environmental Pollution: Definition, Cause, effects and control measures of:
a. Air Pollution.
b. Water pollution
c. Soil pollution
d. Marine pollution
e. Noise pollution
f. Thermal pollution
g. Nuclear hazards
Solid Waste Management: Causes, effects and control measures of urban and industrial wastes – Role of an
individual in prevention of pollution – Pollution case studies – Disaster management: floods, earthquake,
cyclone and landslides.
UNIT – IV
Social Issues and the Environment: From Unsustainable to Sustainable development – Urban problems
related to energy – Water conservation, rain water harvesting, watershed management – Resettlement and
rehabilitation of people; its problems and concerns. Case studies – Environmental ethics: Issues and possible
solutions – Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and
holocaust. Case Studies – Wasteland reclamation. – Consumerism and waste products. – Environment
Protection Act. – Air (Prevention and Control of Pollution) Act. – Water (Prevention and control of
Pollution) Act – Wildlife Protection Act – Forest Conservation Act – Issues involved in enforcement of
environmental legislation – Public awareness.
UNIT – V
Human Population And The Environment: Population growth, variation among nations. Population
explosion – Family Welfare Programmes. – Environment and human health – Human Rights – Value
Education – HIV/AIDS – Women and Child Welfare – Role of information Technology in Environment and
human health – Case studies.
Field Work: Visit to a local area to document environmental assets River/forest grassland/hill/mountain –
Visit to a local polluted site-Urban/Rural/Industrial/Agricultural Study of common plants, insects, and birds
– river, hill slopes, etc.
Textbooks:
1. Erach Bharucha,Textbook ofEnvironmentalStudiesforUndergraduate Courses,Universities Press
(India) Private Limited, 2019.
2. Palaniswamy, Environmental Studies, 2/e, Pearson education, 2014.
3. S.Azeem Unnisa, Environmental Studies, Academic Publishing Company, 2021.
4. K.Raghavan Nambiar, “Text book of Environmental Studies for Undergraduate Courses as per
UGC model syllabus”, SciTech Publications (India), Pvt. Ltd, 2010.
Reference Books:
1. Deeksha Dave and E.Sai Baba Reddy, Textbook of Environmental Science, 2/e, Cengage
Publications, 2012.
2. M.Anji Reddy, “Textbook of Environmental Sciences and Technology”, BS Publication, 2014.
3. J.P. Sharma, Comprehensive Environmental studies, Laxmi publications, 2006.
4. J. Glynn Henry and Gary W. Heinke, Environmental Sciences and Engineering, Prentice Hall of
India Private limited, 1988.
5. G.R. Chatwal, A Text Book of Environmental Studies, Himalaya Publishing House, 2018.
6. Gilbert M. Masters and Wendell P. Ela, Introduction to Environmental Engineering and Science,
1/e, Prentice Hall of India Private limited, 1991.
 https://onlinecourses.nptel.ac.in/noc23_hs155/preview
 https://www.edx.org/learn/environmental-science/rice-university-ap-r-environmental-science-
part-3-pollution-and-resources?index=product&objectID=course-3a6da9f2-d84c-4773-8388-
1b2f8f6a75f2&webview=false&campaign=AP%C2%AE+Environmental+Science+
+Part+3%3A+Pollution+and+Resources&source=edX&product_category=course&placement_url
=https%3A%2F%2Ffanyv88.com%3A443%2Fhttps%2Fwww.edx.org%2Flearn%2Fenvironmental-science
 http://ecoursesonline.iasri.res.in/Courses/Environmental%20Science-I/Data%20Files/pdf/
lec07.pdf
 https://www.youtube.com/watch?v=5QxxaVfgQ3k
L T P C
IV SEMESTER
2 1 - 3
UNIVERSAL HUMAN VALUES – UNDERSTANDING HARMONY AND
ETHICAL HUMAN CONDUCT
Course Objectives:
 To help the students appreciate the essential complementary between 'VALUES' and 'SKILLS' to
ensure sustained happiness and prosperity which are the core aspirations of all human beings.
 To facilitate the development of a Holistic perspective among students towards life and profession
as well as towards happiness and prosperity based on a correct understanding of the Human reality
and the rest of existence. Such holistic perspective forms the basis of Universal Human Values and
movement towards value-based living in a natural way.
 To highlight plausible implications of such a Holistic understanding in terms of ethical human
conduct, trustful and mutually fulfilling human behaviour and mutually enriching interaction with
Nature.
Course Outcomes:
 Define the terms like Natural Acceptance, Happiness and Prosperity (L1, L2)
 Identify one’s self, and one’s surroundings (family, society nature) (L1, L2)
 Apply what they have learnt to their own self in different day-to-day settings in real life (L3)
 Relate human values with human relationship and human society. (L4)
 Justify the need for universal human values and harmonious existence (L5)
 Develop as socially and ecologically responsible engineers (L3, L6)
Course Topics
The course has 28 lectures and 14 tutorials in 5 modules. The lectures and tutorials are of 1- hour
duration. Tutorial sessions are to be used to explore and practice what has been proposed during the
lecture sessions.
The Teacher’s Manual provides the outline for lectures as well as practice sessions. The teacher is
expected to present the issues to be discussed as propositions and encourage the students to have a
dialogue.
UNIT I IntroductiontoValueEducation(6lecturesand3tutorialsforpractice session)

Lecture1:RightUnderstanding,RelationshipandPhysicalFacility(Holistic Development and
the Role of Education)
Lecture2:UnderstandingValueEducation
Tutorial 1: Practice Session PS1 Sharing about Oneself
Lecture 3: self-exploration as the Process for Value Education
Lecture4:ContinuousHappinessandProsperity–theBasicHumanAspirations
Tutorial 2: Practice Session PS2 Exploring Human Consciousness
Lecture 5: Happiness and Prosperity – Current Scenario
Lecture6:MethodtoFulfilltheBasicHumanAspirations
Tutorial3:PracticeSessionPS3ExploringNatural Acceptance
UNIT II Harmony in the Human Being (6 lectures and 3 tutorials for practice session)
Lecture 7: Understanding Human being as the Co-existence of the self and thebody.
Lecture8:DistinguishingbetweentheNeedsoftheselfandthebody
Tutorial 4: Practice Session PS4 Exploring the difference of Needs of self andbody.
Lecture 9: The body as an Instrument of the self.
Lecture 10: Understanding Harmony in the self.
Tutorial 5: Practice Session PS5 Exploring Sources of Imagination in the self.
Lecture 11: Harmony of the self with the body
Lecture12:Programmetoensureself-regulationandHealth
Tutorial6:PracticeSessionPS6ExploringHarmonyofselfwiththebody
UNIT III HarmonyintheFamilyandSociety(6lecturesand3tutorialsforpractice session)

Lecture 13: Harmony in the Family – the Basic Unit of Human Interaction
Lecture 14: 'Trust' – the Foundational Value in Relationship
Tutorial 7: Practice Session PS7 Exploring the Feeling of Trust
Lecture 15: 'Respect' – as the Right Evaluation
Tutorial 8: Practice Session PS8 Exploring the Feeling of Respect
Lecture 16: Other Feelings, Justice in Human-to-Human Relationship
Lecture 17: Understanding Harmony in the Society
Lecture18:VisionfortheUniversalHumanOrder
Tutorial9:PracticeSessionPS9ExploringSystemstofulfilHumanGoal
UNIT IV HarmonyintheNature/Existence(4lecturesand2tutorialsforpractice session)

Lecture19:UnderstandingHarmonyintheNature
Lecture 20: Interconnectedness, self-regulation and Mutual Fulfilment among the Four
Orders of Nature
Tutorial 10: Practice Session PS10 Exploring the Four Orders of Nature
Lecture 21: Realizing Existence as Co-existence at All Levels
Lecture22:TheHolisticPerceptionofHarmonyinExistence
Tutorial11:PracticeSessionPS11ExploringCo-existenceinExistence.
UNIT V Implications ofthe Holistic Understanding – aLookatProfessional Ethics(6 lectures and

3 tutorials for practice session)
Lecture 23: Natural Acceptance of Human Values
Lecture 24: Definitiveness of (Ethical) Human Conduct
Tutorial12:PracticeSessionPS12ExploringEthicalHumanConduct
Lecture25:ABasisforHumanisticEducation,HumanisticConstitutionand Universal Human
Order
Lecture26:CompetenceinProfessionalEthics
Tutorial 13: Practice Session PS13 Exploring Humanistic Models in Education
Lecture 27: Holistic Technologies, Production Systems and Management Models-
Typical Case Studies
Lecture28:StrategiesforTransitiontowardsValue-
basedLifeandProfession
Tutorial14:PracticeSessionPS14ExploringStepsofTransitiontowardsUniversal Human Order
Practice Sessions for UNIT I – Introduction to Value Education

PS1 Sharing about Oneself
PS2 Exploring Human Consciousness PS3
Exploring Natural Acceptance
Practice Sessions for UNIT II – Harmony in the Human Being

PS4 Exploring the difference of Needs of self and body
PS5 Exploring Sources of Imagination in the self
PS6 Exploring Harmony of self with the body
Practice Sessions for UNIT III – Harmony in the Family and Society
PS7 Exploring the Feeling of Trust
PS8ExploringtheFeelingofRespect
PS9ExploringSystemstofulfilHumanGoal
Practice Sessions for UNIT IV – Harmony in the Nature (Existence)
PS10 Exploring the Four Orders of Nature
PS11ExploringCo-existenceinExistence
PracticeSessionsforUNITV–ImplicationsoftheHolisticUnderstanding–aLookatProfessional Ethics
PS12ExploringEthicalHumanConduct
PS13ExploringHumanisticModelsinEducation
PS14ExploringStepsofTransitiontowardsUniversalHumanOrder
READINGS:
Textbook and Teachers Manual
a. The Textbook
R R Gaur, R Asthana, G P Bagaria, A Foundation Course in Human Values and Professional
Ethics, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-47-1
b. The Teacher’s ManualR R Gaur, R Asthana, G P Bagaria,Teachers’ Manual
for A Foundation Course in Human Values and Professional Ethics, 2nd
Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-53-2
Reference Books
1. JeevanVidya: EkParichaya, A Nagaraj, JeevanVidyaPrakashan, Amarkantak,
1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – PanditSunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom -MaulanaAbdulKalam Azad
12. Vivekananda -RomainRolland (English)
13. Gandhi -RomainRolland (English)
ModeofConduct:
Lecturehours aretobeusedforinteractivediscussion,placingtheproposalsaboutthetopics at hand and
motivating students to reflect, explore and verify them.
Tutorialhoursaretobeusedforpracticesessions.
While analyzing and discussing the topic, the faculty mentor’s role is in pointing to essential elements
to help in sorting them out from the surface elements. In other words, help thestudents explore the
important or critical elements.
In the discussions, particularly during practice sessions (tutorials), the mentor encourages the student
to connect with one’s own self and do self-observation, self-reflection and self- exploration.
Scenarios may be used to initiate discussion. The student is encouraged to take up ”ordinary”
situations rather than” extra-ordinary” situations. Such observations and their analyses are shared and
discussed with other students and faculty mentor, in a group sitting.
Tutorials (experiments or practical) are important for the course. The difference is that the
laboratoryiseverydaylife,andpracticalarehowyoubehaveandworkinreallife. Depending on the nature of
topics, worksheets, home assignment and/or activity are included. The practice sessions (tutorials)
would also provide support to a student in performing actions commensurate to his/her beliefs. It is
intended that this would lead to development of commitment, namely behaving and working based on
basic human values.
It is recommended that this content be placed before the student as it is, in the form of a basic
foundation course, without including anything else or excluding any part of this content. Additional
content may be offered in separate, higher courses. This course is to be taught by faculty from every
teaching department, not exclusively by any one department.
Teacher preparation with a minimum exposure to at least one 8-day Faculty
Development Program on Universal Human Values is deemed essential.
Online Resources:
1. https://fdp-si.aicte-india.org/UHV-II%20Class%20Notes%20&
%20Handouts/UHV%20Handout%201-Introduction%20to%20Value
%20Education.pdf
%20Handouts/UHV%20Handout%202-Harmony%20in%20the
%20Human%20Being.pdf
%20Family.pdf
4. https://fdp-si.aicte-india.org/UHV%201%20Teaching%20Material/D3-
S2%20Respect%20July%2023.pdf
%20Nature%20and%20Existence.pdf
6. https://fdp-si.aicte-india.org/download/FDPTeachingMaterial/3-days
%20FDP- SI%20UHV%20Teaching%20Material/Day
%203%20Handouts/UHV%203D%20D3- S2A%20Und%20Nature-
Existence.pdf
7. https://fdp-si.aicte- india.org/UHV%20II%20Teaching%20Material/UHV
%20II%20Lecture%2023- 25%20Ethics%20v1.pdf
8. https://www.studocu.com/in/document/kiet-group-of-institutions/
universal-human- values/chapter-5-holistic-understanding-of-harmony-
on-professional-ethics/62490385
9. https://onlinecourses.swayam2.ac.in/aic22_ge23/preview
L T P C
IV SEMESTER
3 - - 3
PROBABILITY AND STATISTICS
Course Objectives:
• To familiarize the students with the foundations of probability and statistical methods
• To impart probability concepts and statistical methods in various applications Engineering
Course Outcomes: Upon successful completion of this course, the student should be able to
1. Classify the concepts of data science and its importance (L2)
2. Interpret the association of characteristics and through correlation and regression tools (L4)
3. Apply discrete and continuous probability distributions (L3)
4. Design the components of a classical hypothesis test (L6)
5. Infer the statistical inferential methods based on small and large sampling tests (L4)
Unit – I: Descriptive statistics and methods for data science:

Data science – Statistics Introduction – Population vs Sample –Collection of data – primary and secondary
data – Type of variable: dependent and independent Categorical and Continuous variables – Data
visualization – Measures of Central tendency – Measures of Variability – Skewness – Kurtosis.
UNIT – II: Correlation and Regression:

Correlation – Correlation coefficient – Rank correlation.
Linear Regression: Straight line – Multiple Linear Regression - Regression coefficients and properties –
Curvilinear Regression: Parabola – Exponential – Power curves.
UNIT – III: Probability and Distributions:

Probability– Conditional probability and Baye’s theorem – Random variables – Discrete and Continuous
random variables – Distribution functions – Probability mass function, Probability density function and
Cumulative distribution functions – Mathematical Expectation and Variance – Binomial, Poisson, Uniform
and Normal distributions.
UNIT – IV: Sampling Theory:

Introduction – Population and Samples – Sampling distribution of Means and Variance (definition only) –
Point and Interval estimations – Maximum error of estimate – Centrallimit theorem (without proof) –
Estimation using t, and F-distributions.
UNIT – V: Tests of Hypothesis:

Introduction – Hypothesis – Null and Alternative Hypothesis – Type I and Type II errors – Level of
significance – One tail and two-tail tests – Test of significance for large samples and Small Samples: Single
and difference means – Single and two proportions – Student’s t- test,
F-test,-test.
Text Books:
• Miller and Freund’s, Probability and Statistics for Engineers,7/e, Pearson, 2008.
• S. C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e, Sultan Chand &
Sons Publications, 2012.
Reference Books:
• Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics Engineers and the
Scientists,8th Edition, Pearson 2007.
• Jay l. Devore, Probability and Statistics for Engineering and the Sciences, 8th Edition, Cengage.
• Sheldon M. Ross, Introduction to probability and statistics Engineers and the Scientists, 4 th Edition,
Academic Foundation, 2011.
• Johannes Ledolter and Robert V. Hogg, Applied statistics for Engineers and Physical Scientists,
3rd Edition, Pearson, 2010.
L T P C
IV SEMESTER
3 - - 3
OPERATING SYSTEMS
Course Objectives:
The main objectives of the course is to make student
 Understand the basic concepts and principles of operating systems, including process management,
memory management, file systems, and Protection
 Make use of process scheduling algorithms and synchronization techniques to achieve better
performance of a computer system.
 Illustrate different conditions for deadlock and their possible solutions.
UNIT - I
Operating Systems Overview: Introduction, Operating system functions, Operating systems operations,
Computing environments, Free and Open-Source Operating Systems
System Structures: Operating System Services, User and Operating-System Interface, system calls, Types of
System Calls, system programs, Operating system Design and Implementation, Operating system structure,
Building and Booting an Operating System, Operating system debugging
UNIT - II
Process Management System: Process Concept, Process scheduling, Operations on processes, Inter-process
communication.
Threads and Concurrency: Multithreading models, Thread libraries, Threading issues.
CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple processor
scheduling.
UNIT – III
Synchronization Tools: The Critical Section Problem, Peterson’s Solution, Mutex Locks, Semaphores,
Monitors, Classic problems of Synchronization.
Deadlocks: system Model, Deadlock characterization, Methods for handling Deadlocks, Deadlock
prevention, Deadlock avoidance, Deadlock detection, Recovery from Deadlock.
UNIT - IV
Memory-Management Strategies: Introduction, Contiguous memory allocation, Paging, Structure of the
Page Table, Swapping.
Virtual Memory Management: Introduction, Demand paging,Copy-on-write,Page replacement algorithm:
First In First Out (FIFO), Least Recently Used (LRU) and Optimal algorithms, Allocation of frames,
Thrashing.
Storage Management: Overview of Mass Storage Structure, HDD Scheduling.
UNIT - V
File System: File System Interface: File concept, Access methods, Directory Structure; File system
Implementation: File-system structure, File-system Operations, Directory implementation, Allocation
method, Free space management; File-System Internals: File- System Mounting, Partitions and Mounting,
File Sharing.
Protection: Goals of protection, Principles of protection, Protection Rings, Domain of protection, Access
matrix.
TextBooks:
1. Operating System Concepts, Silberschatz A, Galvin P B, Gagne G,10th Edition, Wiley,2018.
2. ModernOperatingSystems,TanenbaumAS,4thEdition,Pearson,2016
Reference Books:
1. Operating Systems -Internals and Design Principles, Stallings W, 9th edition, Pearson, 2018
2. Operating Systems: A Concept Based Approach, D.M Dhamdhere, 3rd Edition, McGraw- Hill, 2013

1. https://nptel.ac.in/courses/106/106/106106144/
2. http://peterindia.net/OperatingSystems.html
L T P C
IV SEMESTER
3 - - 3
OBJECT ORIENTED PROGRAMMING THROUGH JAVA
Course Objectives:
The learning objectives of this course are to:
 Identify Java language components and how they work together in applications
 Learn the fundamentals of object-oriented programming in Java, including defining classes,
invoking methods, using class libraries.
 Learn how to extend Java classes with inheritance and dynamic binding and how to use exception
handling in Java applications
 Understand how to design applications with threads in Java
 Understand how to use Java APIs for program development
UNIT I
OOPS Concepts: Data binding, Encapsulation, Absraction, Polymorphism.
Program Structure in Java, Data Types, Variables, and Operators.
Control Statements: Introduction, if Expression, Nested if Expressions, if–else Expressions, Ternary
Operator?:, Switch Statement, Iteration Statements, while Expression, do–while Loop, for Loop, Nested for
Loop, For–Each for Loop, Break Statement, Continue Statement.
UNIT II
Classes and Objects: Introduction, Class Declaration and Modifiers, Class Members, Declaration of Class
Objects, Assigning One Object to Another, Access Control for Class Members, Accessing Private Members
of Class, Constructor Methods for Class, Overloaded Constructor Methods, Nested Classes, Final Class and
Methods, Passing Arguments by Value and by Reference, Keyword this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded Constructor Methods, Class
Objects as Parameters in Methods, Access Control, Recursive Methods, Nesting of Methods, Overriding
Methods, Attributes Final and Static.
UNIT III
Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in Computer Memory,
Accessing Elements of Arrays, Operations on Array Elements, Assigning Array to Another Array, Dynamic
Change of Array Size, Sorting of Arrays, Search for Values in Arrays, Class Arrays, Two-dimensional
Arrays, Arrays of Varying Lengths, Three- dimensional Arrays, Arrays as Vectors.
Inheritance: Introduction, Process of Inheritance, Types of Inheritances, Universal Super Class-Object
Class, Inhibiting Inheritance of Class Using Final, Access Control andInheritance, Multilevel Inheritance,
Application of Keyword Super, Constructor Method and Inheritance, Method Overriding, Dynamic Method
Dispatch, Abstract Classes, Interfaces and Inheritance.
Interfaces: Introduction, Declaration of Interface, Implementation of Interface, Multiple Interfaces, Nested

Interfaces, Inheritance of Interfaces, Default Methods in Interfaces, Static Methods in Interface, Functional
Interfaces, Annotations.
UNIT IV
Packages and Java Library: Introduction, Defining Package, Importing Packages and Classes into
Programs, Path and Class Path, Access Control, Packages in Java SE, Java.lang Package and its Classes,
Class Object, Enumeration, class Math, Wrapper Classes, Auto- boxing and Auto-unboxing, Java util
Classes and Interfaces, Formatter Class, Random Class, Time Package, Class Instant (java.time.Instant),
Formatting for Date/Time in Java, Temporal Adjusters Class, Temporal Adjusters Class.
Exception Handling: Introduction, Hierarchy of Standard Exception Classes, Keywords throws and throw,
try, catch, and finally Blocks, Multiple Catch Clauses, Class Throwable, Unchecked Exceptions, Checked
Exceptions.
UNIT V
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for Extracting
Characters from Strings, Comparison, Modifying, Searching; Class String Buffer. Multithreaded
Programming: Introduction, Need for Multiple Threads Multithreaded Programming for Multi-core
Processor, Thread Class, Main Thread-Creation of New Threads, Thread States, Thread Priority-
Synchronization, Deadlock and Race Situations, Inter-thread Communication - Suspending, Resuming, and
Stopping of Threads.
Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL and MySQL
Connector/J, JDBC Environment Setup, Establishing JDBC Database Connections, ResultSet Interface
Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying text and image, event
handling, laying out nodes in scene graph, mouse events (Text Book 3)
Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2) Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis Samanta, Monalisa
Sarma, Cambridge, 2023.
3) JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.
References Books:
1) The complete Reference Java, 11thedition, Herbert Schildt,TMH
2) Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson
Online Resources:
L T P C
IV SEMESTER
3 - - 3
SOFTWARE ENGINEERING
Course Objectives:
The objectives of this course are to introduce
 Software life cycle models, Software requirements and SRS document.
 Project Planning, quality control and ensuring good quality software.
 Software Testing strategies, use of CASE tools, Implementation issues, validation &verification
procedures.
UNIT I:
Introduction: Evolution, Software development projects, Exploratory style of software developments,
Emergence of software engineering, Notable changes in software development practices, Computer system
engineering.
Software Life Cycle Models: Basic concepts, Waterfall model and its extensions, Rapid application
development, Agile development model, Spiral model.
UNIT II:
Software Project Management: Software project management complexities, Responsibilities of a software
project manager, Metrics for project size estimation, Project estimation techniques, Empirical Estimation
techniques, COCOMO, Halstead’s software science, risk management.
Requirements Analysis And Specification: Requirements gathering and analysis, Software Requirements
Specification (SRS), Formal system specification, Axiomatic specification, Algebraic specification,
Executable specification and 4GL.
UNIT III:
Software Design: Overview of the design process, How to characterize a good software design? Layered
arrangement of modules, Cohesion and Coupling, approaches to software design.
Agility: Agility and the Cost of Change, Agile Process, Extreme Programming (XP), Other Agile Process
Models, Tool Set for the Agile Process (Text Book 2)
Function-Oriented Software Design: Overview of SA/SD methodology, Structured analysis, Developing
the DFD model of a system, Structured design, Detailed design, and Design Review.
User Interface Design: Characteristics of a good user interface, Basic concepts, Types of user interfaces,
Fundamentals of component-based GUI development, and user interface design methodology.
UNIT IV:
Coding And Testing: Coding, Code review, Software documentation, Testing, Black-box testing, White-
Box testing, Debugging, Program analysis tools, Integration testing, Testing object-oriented programs,
Smoke testing, and Some general issues associated with testing.
Software Reliability And Quality Management: Software reliability. Statistical testing, Software quality,
Software quality management system, ISO 9000.SEI Capability maturity model. Few other important
quality standards and Six Sigma.
UNIT V:
Computer-Aided Software Engineering (Case): CASE and its scope, CASE environment, CASE support
in the software life cycle, other characteristics of CASE tools, Towards second generation CASE Tool, and
Architecture of a CASE Environment.
Software Maintenance: Characteristics of software maintenance, Software reverse engineering, Software
maintenance process models and Estimation of maintenance cost.
Software Reuse: reuse- definition, introduction, reason behind no reuse so far, Basic issues in any reuse
program, A reuse approach, and Reuse at organization level.
Text Books:
1. Fundamentals of Software Engineering, Rajib Mall, 5th Edition,PHI.
2. Software Engineering A practitioner’s Approach, Roger S. Pressman, 9 th Edition, Mc- Graw Hill
International Edition.
Reference Books:
1. Software Engineering, Ian Sommerville,10thEdition, Pearson.
2. SoftwareEngineering,PrinciplesandPractices, Deepak Jain, Oxford University Press.
e- Resources:
L T P C
IV SEMESTER
- - 3 1.5
OPERATING SYSTEMS & SOFTWARE ENGINEERING LAB
Course Objectives:
 Provide insights into system calls, file systems, semaphores,
 Develop and debug CPU Scheduling algorithms, page replacement algorithms, thread
implementation
 Implement Bankers Algorithms to Avoid the Dead Lock
 acquire the generic software development skill through various stages of software life cycle
 generate test cases for software testing

 UNIX fundamentals, commands & system calls
 CPU Scheduling algorithms, thread processing
 IPC, semaphores, monitors, deadlocks
 Page replacement algorithms, file allocation strategies
 Memory allocation strategies
 Software Requirement Specification, DFD, CFD
 Software estimation, UML diagrams, test case design
Sample Experiments in Operating Systems:

1. Practicing of Basic UNIX Commands.
2. Write programs using the following UNIX operating system calls fork, exec, getpid, exit, wait,
close, stat, opendir and readdir
3. Simulate UNIX commands like cp, ls, grep, etc.,
4. Simulate the following CPU scheduling algorithms
a) FCFS b) SJF c) Priority d) Round Robin
5. Control the number of ports opened by the operating system with
a) Semaphore b) Monitors.
6. Write a program to illustrate concurrent execution of threads using pthreads library.
7. Write a program to solve producer-consumer problem using Semaphores.
8. Implement the following memory allocation methods for fixed partition
a) First fit b) Worst fit c) Best fit
9. Simulate the following page replacement algorithms
a) FIFO b) LRU c) LFU
10. Simulate Paging Technique of memory management.
11. Implement Bankers Algorithm for Dead Lock avoidance and prevention
12. Simulate the following file allocation strategies

a) Sequential b) Indexed c) Linked
13. Download and install nachos operating system and experiment with it
Sample Experiments in Software Engineering:

1) Perform the following, for the following experiments:
i. DotheRequirementAnalysisandPrepareSRS
ii. DrawE-Rdiagrams,DFD,CFDandstructuredchartsfortheproject.
a. Course Registration System
b. Students Marks Analyzing System
c. Online Ticket Reservation System
d. Stock Maintenance
2) Consider any application, using COCOMO model, estimate the effort.
3) Consider any application, Calculate effort using FP oriented estimation model.
4) Draw the UML Diagrams for the problem a, b, c, d.
5) Design the test cases for e-Commerce application (Flipcart, Amazon)
6) Design the test cases for a Mobile Application (Consider any example from Appstore)
7) Design and Implement ATM system through UML Diagrams.
L T P C
IV SEMESTER
- - 3 1.5
OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB
Course Objectives:
The aim of this course is to
 Practice object oriented programming in the Java programming language
 ImplementClasses,Objects, Methods,Inheritance, Exception,RuntimePolymorphism, User defined
Exception handling mechanism
 Illustrate inheritance, Exception handling mechanism, JDBC connectivity
 Construct Threads, Event Handling, implement packages, Java FX GUI

 Object Oriented Programming fundamentals- data types, control structures
 Classes, methods, objects, Inheritance, polymorphism,
 Exception handling, Threads, Packages, Interfaces
 Files, I/O streams, JavaFX GUI
Sample Experiments:
Exercise – 1:
a) Write a JAVA program to display default value of all primitive data type of JAVA
b) Write a java program that display the roots of a quadratic equation ax 2+bx=0. Calculate the discriminate
D and basing on value of D, describe the nature of root.
Exercise - 2
a) Write a JAVA program to search for an element in a given list of elements using binary search
mechanism.
b) Write a JAVA program to sort for an element in a given list of elements using bubble sort
c) Write a JAVA program using String Buffer to delete, remove character.
Exercise - 3
a) Write a JAVA program to implement class mechanism. Create a class, methods and invoke them inside
main method.
b) Write a JAVA program implement method overloading.
c) Write a JAVA program to implement constructor.
d) Write a JAVA program to implement constructor overloading.
Exercise - 4
a) Write a JAVA program to implement Single Inheritance
b) Write a JAVA program to implement multi level Inheritance

c) Write a JAVA program for abstract class to find areas of different shapes
Exercise - 5
a) Write a JAVA program give example for “super” keyword.
b) Write a JAVA program to implement Interface. What kind of Inheritance can be achieved?
c) Write a JAVA program that implements Runtime polymorphism
Exercise - 6
a) Write a JAVA program that describes exception handling mechanism
b) Write a JAVA program Illustrating Multiple catch clauses
c) Write a JAVA program for creation of Java Built-in Exceptions
d) Write a JAVA program for creation of User Defined Exception
Exercise - 7
a) Write a JAVA program that creates threads by extending Thread class. First thread display “Good Morning
“every 1 sec, the second thread displays “Hello “every 2 seconds and the third display “Welcome” every 3
seconds,(Repeat the same by implementing Runnable)
b) Write a program illustrating is Alive and join ()
c) Write a Program illustrating Daemon Threads.
d) Write a JAVA program Producer Consumer Problem
Exercise – 8
a) Write a JAVA program that import and use the user defined packages
b) Without writing any code, build a GUI that display text in label and image in an ImageView (use
JavaFX)
c) Build a Tip Calculator app using several JavaFX components and learn how to respond to user
interactions with the GUI
Exercise – 9
a) Write a java program that connects to a database using JDBC
b) Write a java program to connect to a database using JDBC and insert values into it.
c) Write a java program to connect to a database using JDBC and delete values from it
L T P C
IV SEMESTER
- 1 2 2
FULL STACK DEVELOPMENT (SKILL ENHANCEMENT COURSE)
Course Objectives:
 Design and build static as well as dynamic web pages and interactive web-based applications
 Web development using Django framework.
 Analyze and create functional website in Django and deploy Django Web Application on Cloud
Course Objectives:
1. Make use of HTML elements and their attributes for designing static web pages
2. Build a web page by applying appropriate CSS styles to HTML elements
3. Experiment with JavaScript to develop dynamic web pages and validate forms
FULL STACK WEB APPLICATION DEVELOPMENT

UNIT I FUNDAMENTALS & TYPESCRIPT LANGUAGE
Server-Side Web Applications. Client-Side Web Applications. Single Page Application. About TypeScript.
Creating TypeScript Projects. TypeScript Data Types. Variables. Expression and Operators. Functions. OOP
in Typescript. Interfaces. Generics. Modules. Enums. Decorators. Enums. Iterators. Generators.
Experiments:
Server-Side Web Applications:
1. Setting Up a Node.js Server:

o Install Node.js and create a basic HTTP server using the built-in http module.
o Experiment with routing and handling different HTTP methods (GET, POST, etc.).
2. Using Express.js:
o Create a server-side web application using Express.js.
o Implement routes for handling CRUD operations (Create, Read, Update, Delete).
3. Database Integration:
o Integrate a database (e.g., MongoDB, PostgreSQL) with your Node.js application using
Mongoose or Sequelize.
o Implement data models and perform basic database operations (insert, retrieve, update,
delete).
4. Authentication and Authorization:
o Implement user authentication using packages like Passport.js.
o Experiment with different authentication strategies (e.g., local strategy, OAuth).
5. RESTful API Development:
o Design and implement RESTful APIs using Express.js.
o Test APIs using tools like Postman or curl.
6. Error Handling and Middleware:
o Implement error handling middleware to manage errors gracefully in your Node.js
application.
o Create custom middleware for logging, authentication checks, etc.
Client-Side Web Applications:
7. HTML and CSS Basics:

o Create a simple HTML page with CSS styling.
o Experiment with different layouts, styles, and responsive design principles.
8. JavaScript DOM Manipulation:
o Use JavaScript to manipulate the DOM (Document Object Model) dynamically.
o Implement interactive features like form validation, image sliders, etc.
9. AJAX and Fetch API:
o Make asynchronous requests to fetch data from a server using AJAX or the Fetch API.
o Update DOM elements dynamically based on the fetched data.
10. Single Page Application (SPA):
o Implement a basic SPA using a front-end framework like React.js, Angular, or Vue.js.
o Manage routing, state management, and data binding within the SPA.
11. Client-Side Frameworks:
o Choose a client-side framework (e.g., React, Angular, Vue) and build a simple application
using its components and features.
o Explore component-based architecture, state management solutions (like Redux or Vuex),
and reactive programming.
TypeScript:
12. Setting Up a TypeScript Project:

o Initialize a new TypeScript project using tsc (TypeScript compiler) or a modern JavaScript
framework like Angular.
13. TypeScript Data Types:
o Explore and experiment with TypeScript data types: primitives (number, string, boolean),
arrays, tuples, enums, etc.
o Create variables and functions with specified types and observe type inference.
14. Variables, Expressions, and Operators:
o Define variables with different scopes (local, global).
o Experiment with TypeScript expressions (arithmetic, logical) and operators.
15. Functions in TypeScript:
o Create and call functions with typed parameters and return types.
o Explore optional parameters, default parameters, and rest parameters in TypeScript.
16. Object-Oriented Programming (OOP) in TypeScript:
o Implement classes, constructors, methods, and properties in TypeScript.
o Explore inheritance, encapsulation, and polymorphism concepts.
17. Interfaces and Generics:
o Define interfaces to describe the structure of objects in TypeScript.
o Experiment with optional properties, readonly properties, and function types within
interfaces.
o Use generics to create reusable components that work with a variety of types.
18. Modules in TypeScript:
o Organize TypeScript code into modules using import and export statements.
o Create modules that encapsulate related functionality and demonstrate module resolution.
19. Enums and Decorators:
o Define and use enums to declare a set of named constants in TypeScript.
o Implement decorators to modify the behavior of classes, methods, or properties.
20. Iterators and Generators:
o Implement custom iterators and generators in TypeScript.
o Use iterators to iterate over collections and generators to generate sequences lazily.
UNIT II ANGULAR
About Angular. Angular CLI. Creating an Angular Project. Components. Components Interaction. Dynamic
Components. Angular Elements. Angular Forms. Template Driven Forms. Property, Style, Class and Event
Binding. Two way Bindings. Reactive Forms. Form Group. Form Controls. About Angular Router. Router
Configuration. Router State. Navigation Pages. Router Link. Query Parameters. URL matching. Matching
Strategies. Services. Dependency Injection. HttpClient. Read Data from the Server. CRUD Operations. Http
Header Operations. Intercepting requests and responses.
Experiments
Angular CLI and Project Setup
1. Install Angular CLI: Install Angular CLI globally on your machine.

2. Create a New Angular Project: Use Angular CLI to generate a new Angular project.
3. Serve the Application: Use ng serve to serve the Angular application locally.
Components
4. Create Components: Generate new components using Angular CLI (ng generate component) and
explore their structure.
5. Component Interaction: Implement communication between components using @Input and
@Output.
Dynamic Components and Angular Elements
6. Dynamic Components: Create components dynamically at runtime based on user interactions or

data.
7. Angular Elements: Build an Angular component as a custom element (Web Component) for use in
non-Angular applications.
Forms in Angular
8. Template Driven Forms: Create forms using template-driven approach (ngModel, validation).
9. Reactive Forms: Implement reactive forms with FormGroup, FormControl, and validation.
10. Form Group and Form Controls: Explore complex form structures using nested form groups and
controls.
Binding and Directives
11. Property Binding: Use [property]="value" to bind properties in templates.

12. Style Binding: Dynamically apply styles using [style.property]="value".
13. Class Binding: Conditionally apply CSS classes using [class.class-name]="condition".
14. Event Binding: Handle DOM events using (event)="expression".
Angular Router
15. Configure Routes: Set up routing in your Angular application using RouterModule.forRoot() and
define routes (Routes array).
16. Router State: Access route parameters and query parameters using ActivatedRoute.
17. Navigation and RouterLink: Navigate between routes using [routerLink] directive and
programmatic navigation with Router service.
18. Query Parameters and URL Matching: Pass and retrieve query parameters in route navigation and
use different matching strategies (prefix, full, etc.).
Services and Dependency Injection
19. Create Services: Generate Angular services (ng generate service) to encapsulate business logic or
data fetching.
20. Dependency Injection: Inject services into components, modules, and other services using Angular's
built-in dependency injection.
HttpClient and CRUD Operations
21. HttpClient Module: Import HttpClientModule and use HttpClient to make HTTP requests to a
server.
22. Read Data from the Server: Fetch data from a RESTful API and display it in your Angular
application.
23. CRUD Operations: Implement Create, Read, Update, and Delete operations with HttpClient (get(),
post(), put(), delete()).
24. Http Headers Operations: Set headers (e.g., Content-Type) for HTTP requests and handle response
headers.
Interceptors and Error Handling
25. Intercepting Requests and Responses: Create HTTP interceptors to modify requests or responses
globally in your application.
26. Global Error Handling: Implement a global error handler using ErrorHandler to manage and log
errors.
Miscellaneous
27. Testing: Write unit tests for components, services, and HTTP requests using Jasmine and Karma.
28. Deployment: Deploy your Angular application to platforms like Firebase, AWS, or GitHub Pages.
Advanced Concepts (Optional)
29. Lazy Loading Modules: Optimize performance by lazy loading feature modules using loadChildren
in routes.
30. Animation: Implement animations in Angular using Angular's animation library
(@angular/animations).
Project-Based Experiments
31. Task Management Application: Create a task management application with CRUD operations,
authentication, and routing.
32. E-commerce Platform: Build an e-commerce platform with product listings, shopping cart
functionality, and checkout process.
33. Real-Time Chat Application: Develop a real-time chat application using Angular with WebSocket
integration.
34. Dashboard with Data Visualization: Build a dashboard that fetches and visualizes data using charts
(e.g., Chart.js).
1 Develop Angular JS program that allows user to input their first name and last name and display their full
name. Note: The default values for first name and last name may be included in the program.
2 Develop an Angular JS application that displays a list of shopping items. Allow users to add and remove
items from the list using directives and controllers. Note: The default values of items may be included in the
program
3Develop a simple Angular JS calculator application that can perform basic mathematical operations
(addition, subtraction, multiplication, division) based on user input.
4 Write an Angular JS application that can calculate factorial and compute square based on given user input.
5Develop Angular JS application that displays a details of students and their CGPA. Allow users to read the
number of students and display the count. Note:Student details may be included in the program
6 Develop an Angular JS program to create a simple to-do list application. Allow users to add, edit, and
delete tasks. Note:The default values for tasks may be included in the program.
7Write an Angular JS program to create a simple CRUD application (Create, Read, Update, and Delete) for
managing users.
8Develop Angular JS program to create a login form, with validation for the username and password fields.
9 Create an Angular JS application that displays a list of employees and their salaries. Allow users to search
for employees by name and salary. Note:Employee details may be included in the program.
10 Create Angular JS application that allows users to maintain a collection of items. The application should
display the current total number of items, and this count should automatically update as items are added or
removed. Users should be able to add items to the collection and remove them as needed. Note:The default
values for items may be included in the program.
11 Create Angular JS application to convert student details to Uppercase using angular filters. Note: The
default details of students may be included in the program.
12 Create an Angular JS application that displays the date by using date filter parameters
UNIT III NODE.js
About Node.js. Configuring Node.js environment. Node Package Manager NPM. Modules. Asynchronous
Programming. Call Stack and Event Loop. Callback functions. Callback errors. Abstracting callbacks.
Chaining callbacks. File System. Synchronous vs. asynchronous I/O. Path and directory operations. File
Handle. File Synchronous API. File Asynchronous API. File Callback API. Timers. Scheduling Timers.
Timers Promises API. Node.js Events. Event Emitter. Event Target and Event API. Buffers. Buffers and
TypedArrays. Buffers and iteration. Using buffers for binary data. Flowing vs. non-flowing streams. JSON.
Experiments:
 Setting Up Node.js Environment:
 Install Node.js and set up a development environment on your machine. Experiment with different
versions using nvm.
 Using NPM:
 Create a new Node.js project, install dependencies using NPM, and explore package.json
configurations.
 Modules and Module System:
 Create and use custom modules in Node.js. Explore how modules can encapsulate functionality and
promote code reuse.
 Asynchronous Programming with Callbacks:
 Write functions that use callbacks to handle asynchronous tasks such as reading files or making
HTTP requests.
 Handling Callback Errors:
 Practice error handling in callback-based APIs. Implement strategies to propagate and handle errors
effectively.
 Abstracting Callbacks with Promises:
 Convert callback-based functions to use Promises. Implement promise chains for sequential
asynchronous operations.
 Chaining Callbacks with Async/Await:
 Rewrite asynchronous code using async functions and await expressions. Compare readability and
error handling with callback-based and Promise-based approaches.
 File System Operations:
 Perform file read/write operations synchronously and asynchronously using the fs module. Handle
errors and explore different file handling techniques.
 Path and Directory Operations:
 Use the path module to manipulate file paths. Experiment with path joining, resolution, and directory
operations.
 Timers and Event Loop:
 Explore Node.js timers with setTimeout, setInterval, and setImmediate. Understand how these
interact with the event loop.
 Event Emitter and Custom Events:
 Create custom events using the events module in Node.js. Implement event emitters and listeners for
different scenarios.
 Buffers and TypedArrays:
 Experiment with creating and manipulating buffers and TypedArrays in Node.js. Handle binary data
and perform operations like slicing and copying.
 Streams:
 Implement flowing and non-flowing streams using built-in Node.js modules. Experiment with piping
data between streams and handling events.
 JSON Handling:
 Read and write JSON data using built-in functions in Node.js. Explore parsing and stringifying
JSON objects.
UNIT IV EXPRESS.Js
Express.js. How Express.js Works. Configuring Express.js App Settings. Defining Routes. Starting the App.
Express.js Application Structure. Configuration, Settings. Middleware. body-parser. cookie-parser. express-
session. response-time. Template Engine. Jade. EJS. Parameters. Routing. router.route(path). Router Class.
Request Object. Response Object. Error Handling. RESTful.
Experiments
Basic Experiments
1. Hello World: Create a simple Express.js server that responds with "Hello, World!" when accessed.
2. Static Files: Serve static files (HTML, CSS, JavaScript) using express.static middleware.
3. Routing: Define multiple routes (GET, POST, PUT, DELETE) and handle different HTTP methods.
4. Middleware: Create custom middleware functions to log requests, manipulate request/response

objects, etc.
5. Error Handling: Implement error handling middleware to catch and respond to errors.
Intermediate Experiments
6. Template Engines: Use a template engine like EJS or Pug to render dynamic HTML pages.
7. Form Handling: Create a form that sends data to the server using POST method, and handle the
form data on the server.
8. Sessions and Cookies: Implement session management using express-session and handle cookies
with cookie-parser.
9. RESTful APIs: Build a RESTful API with endpoints for CRUD operations on a resource (e.g.,
users, products).
10. Database Integration: Connect Express.js with a database (e.g., MongoDB, MySQL) using
appropriate libraries (mongoose, mysql2, etc.) and perform CRUD operations.
Advanced Experiments
11. Authentication: Implement user authentication and authorization using libraries like Passport.js.
12. File Uploads: Allow users to upload files to the server and handle file uploads using multer
middleware.
13. Real-Time Communication: Integrate WebSocket functionality using libraries like Socket.io for
real-time communication between client and server.
14. Security: Implement security measures such as CSRF protection, input validation, and secure HTTP
headers.
15. Testing: Write unit tests for your Express.js routes and middleware using testing frameworks like
Mocha and Chai.
Project-Based Experiments
16. Blog Application: Build a simple blog application with features like user registration, post creation,
and commenting.
17. E-commerce Store: Develop an e-commerce platform with product listings, shopping cart
functionality, and checkout process.
18. Social Media Platform: Create a social media platform with user profiles, post feeds, likes, and
comments.
19. Task Management: Build a task management application with features for creating tasks, assigning
tasks to users, and tracking task status.
20. Location-Based Service: Develop a location-based service that retrieves and displays nearby places
using geospatial queries.
UNIT V MONGODB
Introduction to MongoDB. Documents. Collections. Subcollections. Database. Data Types. Dates. Arrays.
Embedded Documents. CRUD Operations. Batch Insert. Insert Validation. Querying The Documents.
Cursors. Indexing. Unique Indexes. Sparse Indexes. Special Index and Collection Types. Full-Text Indexes.
Geospatial Indexing. Aggregation framework.
Experiments
1. Documents:
o In MongoDB, data is stored as documents, which are BSON (Binary JSON) objects.
o Documents are analogous to rows in relational databases but are schema-less, meaning fields
can vary from document to document in the same collection.
2. Collections:
o A collection is a grouping of MongoDB documents.
o Collections are analogous to tables in relational databases but do not enforce a schema.
3. Subcollections:
o MongoDB does not have a built-in concept of subcollections like some relational databases.
o Instead, subcollections can be emulated using embedded documents within a parent
document.
4. Database:
o A database in MongoDB is a container for collections.
o It holds multiple collections which in turn hold documents.
5. Data Types:
o MongoDB supports various data types including strings, numbers, booleans, arrays, objects,
dates, and more.
6. Dates:
o Dates in MongoDB are stored as BSON Date objects.
o They can be manipulated and queried using various date operators.
7. Arrays:
MongoDB supports arrays as a data type within documents.
o
Arrays can contain multiple values of any type, including other arrays or embedded
o
documents.
8. Embedded Documents:
o Embedded documents are documents nested within another document.
o They allow for hierarchical relationships to be stored within a single document.
CRUD Operations
CRUD stands for Create, Read, Update, Delete, which are fundamental operations in MongoDB:
 Create: Inserting new documents into a collection.

 Read: Querying and retrieving documents from a collection.
 Update: Modifying existing documents in a collection.
 Delete: Removing documents from a collection.
Additional Operations
 Batch Insert: Inserting multiple documents into a collection in a single operation for efficiency.
 Insert Validation: Validating documents before they are inserted into a collection using validators.
 Querying: MongoDB supports powerful querying capabilities using a JSON-like query language.
 Cursors: When querying, MongoDB returns a cursor which allows iteration over the query results.
Indexing
 Indexing: MongoDB supports indexes to improve query performance.

 Unique Indexes: Ensures that the indexed fields do not store duplicate values.
 Sparse Indexes: Indexes where documents that do not contain the indexed field are not included in
the index.
 Special Index Types: Includes text indexes for full-text search and geospatial indexes for location-
based queries.
Aggregation Framework
 Aggregation Framework: MongoDB provides an aggregation framework for performing

aggregation operations such as grouping, sorting, and transforming data.
 It uses pipelines to process documents and output aggregated results.
Lab Exercise: Basic MongoDB Operations
Requirements:
 MongoDB installed on your local machine or accessible MongoDB server.

 MongoDB shell (mongo) or a MongoDB client (like MongoDB Compass).
Exercise Steps:
1. Connect to MongoDB:
o Open your terminal or command prompt.
o Connect to your MongoDB instance by running:
Copy code
mongo
o If MongoDB is running on a different host or port, connect using:

ruby
Copy code
mongo --host <hostname>:<port>
2. Create a Database and Collection:

o In MongoDB, databases and collections are created implicitly when data is inserted into
them. You can explicitly create them if needed:
perl
Copy code
use mydatabase
db.createCollection("mycollection")
3. Insert Documents:
o Insert some sample documents into your collection:
php
Copy code
db.mycollection.insertMany([
{ name: "John Doe", age: 30, city: "New York" },
{ name: "Jane Smith", age: 25, city: "San Francisco" },
{ name: "Mike Johnson", age: 35, city: "Seattle" }
])
4. Query Documents:
o Retrieve documents from the collection:
lua
Copy code
db.mycollection.find()
5. Update Documents:
o Update a document in the collection:
php
Copy code
db.mycollection.updateOne(
{ name: "John Doe" },
{ $set: { age: 31, city: "Boston" } }
)
6. Delete Documents:
o Delete a document from the collection:
css
Copy code
db.mycollection.deleteOne({ name: "Mike Johnson" })
7. Indexing:
o Create an index on a field (e.g., name):
css
Copy code
db.mycollection.createIndex({ name: 1 })
8. Aggregation:
o Perform an aggregation operation (e.g., calculate average age):
php
Copy code
db.mycollection.aggregate([
{ $group: { _id: null, avgAge: { $avg: "$age" } } }
])
Textbook: 1. Full Stack Web Application Development,ISBN:9789357574068,SIPH

2. Full-Stack Web Development with MERN: Design, Build, Test and Deploy Production-Grade
Web Applications with MongoDB, Express, React and NodeJS (Paperback, Nabendu Biswas)
References 1. Full Stack Web Development: The Comprehensive Guide (Grayscale Indian
Edition) (Paperback, Philip Ackermann)
Weblinks: 1. Full Stack Developer Roadmap (https://roadmap.sh/full-stack)

2. https://www.tutorialspoint.com/the-full-stack-web-development/index.asp
L T P C
IV SEMESTER
1 0 2 2
DESIGN THINKING & INNOVATION
Course Objectives: The objectives of the course are to

 Bring awareness on innovative design and new product development.
 Explain the basics of design thinking.
 Familiarize the role of reverse engineering in product development.
 Train how to identify the needs of society and convert into demand.
 Introduce product planning and product development process.
UNIT – I Introduction to Design Thinking

Introduction to elements and principles of Design, basics of design-dot, line, shape, form as fundamental
design components. Principles of design. Introduction to design thinking, history of Design Thinking, New
materials in Industry.
UNIT - II Design Thinking Process
Design thinking process (empathize, analyze, idea & prototype), implementing the process in driving
inventions, design thinking in social innovations. Tools of design thinking - person, costumer, journey map,
brainstorming, product development
Activity: Every student presents their idea in three minutes, Every student can present design process in the
form of flow diagram or flow chart etc. Every student should explain about product development.
UNIT - III Innovation
Art of innovation, Difference between innovation and creativity, role of creativity and innovation in
organizations. Creativity to Innovation. Teams for innovation, Measuring the impact and value of creativity.
Activity: Debate on innovation and creativity, Flow and planning from idea to innovation, Debate on value-
based innovation.
UNIT - IV Product Design
Problem formation, introduction to product design, Product strategies, Product value, Product planning,
product specifications. Innovation towards product design Case studies.
Activity: Importance of modeling, how to set specifications, Explaining their own product design.
UNIT – V Design Thinking in Business Processes
Design Thinking applied in Business & Strategic Innovation, Design Thinking principles that redefine
business – Business challenges: Growth, Predictability, Change, Maintaining Relevance, Extreme
competition, Standardization. Design thinking to meet corporate needs. Design thinking for Startups.
Defining and testing Business Models and Business Cases. Developing & testing prototypes.
Activity: How to market our own product, about maintenance, Reliability and plan for startup.
Textbooks:
1. Tim Brown, Change by design, 1/e, Harper Bollins, 2009.
2. Idris Mootee, Design Thinking for Strategic Innovation, 1/e, Adams Media, 2014.
Reference Books:
1. David Lee, Design Thinking in the Classroom, Ulysses press, 2018.
2. Shrrutin N Shetty, Design the Future, 1/e, Norton Press, 2018.
3. William lidwell, Kritinaholden, &Jill butter, Universal principles of design, 2/e, Rockport
Publishers, 2010.
4. Chesbrough.H, The era of open innovation, 2003.
 https://nptel.ac.in/courses/110/106/110106124/
 https://nptel.ac.in/courses/109/104/109104109/
 https://swayam.gov.in/nd1_noc19_mg60/preview
 https://onlinecourses.nptel.ac.in/noc22_de16/preview
Course Outcomes:
COs Statements Blooms

Level
CO1 Define the concepts related to design thinking. L1
CO2 Explain the fundamentals of Design Thinking and innovation. L2
CO3 Apply the design thinking techniques for solving problems invarious
L3
sectors.
CO4 Analyse to work in a multidisciplinary environment. L4
CO5 Evaluate the value of creativity. L5

r23 Cse Bos Syllabus 27-7-2024

Uploaded by

Copyright:

Available Formats

r23 Cse Bos Syllabus 27-7-2024

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

r23 Cse Bos Syllabus 27-7-2024

Uploaded by

Copyright:

Available Formats

COURSE STRUCTURE

COMPUTER SCIENCE AND

SEETHARAMAPURAM, NARSAPUR-534 280, W.G.DT., A.P.

8 Skill Enhancement Course Full Stack Development 0 1 2 2

L-LECTURE HOURS, T- TUTORIAL HOURS, P-PRACTICAL HOURS, C-CREDITS,

Course Outcomes: At the end of the course students will be able to

UNIT–I: Mathematical Logic:

UNIT-II: Set Theory:

UNIT-III: Combinatorics and Recurrence Relations:

UNIT-IV: Graph Theory:

Unit-V: Multi Graphs

Course Outcomes: At the end of the course, student will be able to

Competition Monopoly-Monopolistic Competition– Oligopoly-Price-Output Determination-Pricing

Course Code Category L T P C I.M E.M. Exam

COMPUTER ORGANIZATION AND ARCHITECTURE

Course Objectives: Students are expected to learn

Basic Computer Organization and Design: Instruction Codes, Computer Register,

Central Processing Unit:General Register Organization, STACK

The Memory Organization:Memory Hierarchy, Main memory, Auxiliary memory,

Input / Output Organization: Accessing I/O Devices, Interrupts, Processor

Course Outcomes: At the end of the course students will be able to

CO1: Discover the performance of an algorithm using asymptotic notation. (K2)

UNIT–I: [15 Hrs.]

UNIT–II: [12 Hrs.]

UNIT–III: [12 Hrs.]

UNIT–IV: [15 Hrs.]

UNIT–V: [14 Hrs.]

Online Learning Resources:

Experiments covering the Topics:

Online Learning Resources:

Experiments covering the topics:

9. Programs development using creation of procedures, passing

Text Books/Suggested Reading:

1. Write a program to define a function with multiple return values.

Online Learning Resources/Virtual Labs:

UNIT I IntroductiontoValueEducation(6lecturesand3tutorialsforpractice session)

UNIT III HarmonyintheFamilyandSociety(6lecturesand3tutorialsforpractice session)

UNIT IV HarmonyintheNature/Existence(4lecturesand2tutorialsforpractice session)

UNIT V Implications ofthe Holistic Understanding – aLookatProfessional Ethics(6 lectures and

Practice Sessions for UNIT I – Introduction to Value Education

Practice Sessions for UNIT II – Harmony in the Human Being

Unit – I: Descriptive statistics and methods for data science:

UNIT – II: Correlation and Regression:

UNIT – III: Probability and Distributions:

UNIT – IV: Sampling Theory:

UNIT – V: Tests of Hypothesis:

1. Operating System Concepts, Silberschatz A, Galvin P B, Gagne G,10th Edition, Wiley,2018.

Online Learning Resources:

Interfaces: Introduction, Declaration of Interface, Implementation of Interface, Multiple Interfaces, Nested

Experiments covering the Topics:

Sample Experiments in Operating Systems:

12. Simulate the following file allocation strategies

Sample Experiments in Software Engineering:

Experiments covering the Topics:

b) Write a JAVA program to implement multi level Inheritance

FULL STACK WEB APPLICATION DEVELOPMENT

Server-Side Web Applications:

1. Setting Up a Node.js Server:

7. HTML and CSS Basics:

12. Setting Up a TypeScript Project: