SCHEME OF EXAMINATION

B. Tech- 2nd Year Semester: 4th

Branch: Computer Science and Business Systems
Periods per
Scheme of Exam Credit
Subject week Total
S.N. Subject Name L+(T+
Code Theory/Practical Marks
L T P P)/2
ESE CT TA
Design And Analysis Of
1 CS112401 3 1 - 100 20 30 150 3
Algorithms

2 Operating Systems CS112402 3 0 - 100 20 30 150 3

3 Software Engineering CS112403 3 1 - 100 20 30 150 3

4 Operations Research CS112404 3 0 - 100 20 30 150 3

Introduction To Innovation,
5 IP Management & CS112405 3 0 - 100 20 30 150 3
Entrepreneurship
Design And Analysis Of
6 CS112491 - 2 25 - 25 50 1
Algorithms Lab
Operating Systems Lab
7 CS112492 - 2 25 - 25 50 1
(Unix Environment)

Software Engineering Lab - 2 - 25 50 1

8 CS112493 25

9 Operations Research Lab CS112494 - 2 25 - 25 50 1

10 Design Thinking - - 25 - 25 50 -

Essence of Indian
Traditional Knowledge CS112496
(Non Credit)

Total 13 2 10 625 100 275 1000 20

Note:

L-Lecture T-Tutorial P-Practical

CT-Class Test TA-Teachers Assessment ESE-End Semester Exam
Note: (1) The teaching in the 1st and 2nd Semester will be divided in two groups consisting of various branches.
(2) Applied Mathematics-I will be taught to both the groups in the first semester.
(3) Self-Learning –I will be conducted by the humanities / relevant discipline as decided by the Director.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code Design And Analysis Of
L= T=0 P=0 Credits = 3
CS112401 Algorithms
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objective Course Outcomes

The Objective of this course is: CO1 Design algorithms for various computing
 To understand and apply the algorithm problems.
analysis techniques. CO2 Analyze the time and space complexity of
 To critically analyze the efficiency of algorithms.
alternative algorithmic solutions for the CO3 Critically analyze the different algorithm
same problem. design techniques for a given problem.
 To understand different algorithm design CO4 Modify existing algorithms to improve
techniques. efficiency.
 To understand the limitations of CO5 To Understand how to apply various
Algorithmic power. algorithms.

UNIT – I Introduction: Characteristics of Algorithm. Analysis of Algorithm: Asymptotic analysis of

Complexity Bounds – Best, Average and Worst-Case behavior; Performance Measurements of
Algorithm, Time and Space Trade-Offs, Analysis of Recursive Algorithms through Recurrence
Relations: Substitution Method, Recursion Tree Method and Masters’ Theorem

UNIT – II Fundamental Algorithmic Strategies: Brute-Force, Heuristics, Greedy, Dynamic

Programming, Branch and Bound and Backtracking methodologies; Illustrations of these techniques
for Problem-Solving, Bin Packing, Knapsack, Travelling Salesman Problem.

UNIT – III: Graph and Tree Algorithms: Traversal algorithms: Depth First Search (DFS) and
Breadth First Search (BFS); Shortest path algorithms, Transitive closure, Minimum Spanning Tree,
Topological sorting, Network Flow Algorithm.

UNIT – IV: Tractable and Intractable Problems: Computability of Algorithms, Computability

classes – P, NP, NP-complete and NP-hard. Cook’s theorem, Standard NP-complete problems and
Reduction techniques.

UNIT – V Advanced Topics: Approximation algorithms, Randomized algorithms, Class of problems

beyond NP – P SPACE, Introduction to Quantum Algorithms.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
Text Books:

S. No. Title Author(s) Publisher

E. Horowitz and S.
1 Fundamental of Computer Algorithms,
Sahni.

Reference Books:

S. No. Title Author(s) Publisher

Introduction to Algorithms, T. H. Cormen, C. E.
1 Leiserson and R. L.
Rivest.
Computer Algorithms: Introduction to Design
2
and Analysis, S. Baase.
The Art of Computer Programming,
3 Vol. 1, Vol. 2 and Vol. 3, . D. E. Knuth

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Operating Systems L=3 T=0 P=0 Credits = 3
CS112402
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objective Course

Outcomes
1. Students will learn how Operating CO1 To learn what is operating system and how it
System is Important for Computer makes computers work.
System.
CO2 To know how operating system manages
2. To make aware of different types of
complexity through appropriate abstraction of CPU,
Operating Systemand their services.
memory, files, semaphores etc.
3. To learn different process
scheduling algorithms and CO3 To get knowledge about different components
synchronization techniques to of operating system like Process Management,
achieve better performance of a Concurrencymechanisms.
computer system.
4. To know virtual memoryconcepts. CO4 To get knowledge about Deadlock handling,
5. To learn secondary memory Memory Management techniques
Management.
CO5 To get knowledge about Virtual Memory, File
System

UNIT – I Introduction: Concept of Operating Systems (OS), Generations of OS, Types of OS,
OS Services, Interrupt handling and System Calls, Basic architectural concepts of an OS, Concept
of Virtual Machine, Resource Manager view, process view and hierarchical view of an OS.
UNIT – II Processes: Definition, Process Relationship, Different states of a Process, Process
State transitions, Process Control Block (PCB), Context switching.
Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of multithreads.
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling
criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time.
Scheduling algorithms: Pre-emptive and non-pre-emptive, FCFS, SJF, RR; Multiprocessor
scheduling: Real Time scheduling: RM and EDF.
Inter-process Communication: Concurrent processes, precedence graphs, Critical Section, Race
Conditions, Mutual Exclusion, Hardware Solution, Semaphores, Strict Alternation, Peterson’s
Solution, The Producer / Consumer Problem, Event Counters, Monitors, Message Passing,
Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem, Barber’s shop
problem.

UNIT – III: Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Prevention, Deadlock Avoidance: Banker’s algorithm, Deadlock detection and Recovery.
Concurrent Programming: Critical region, conditional critical region, monitors, concurrent
languages, communicating sequential process (CSP); Deadlocks - prevention, avoidance, detection
and recovery.
UNIT – IV: Memory Management: Basic concept, Logical and Physical address maps, Memory
allocation: Contiguous Memory allocation – Fixed and variable partition–Internal and External
fragmentation and Compaction.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of
reference, Page allocation, Partitioning, Paging, Page fault, Working Set, Segmentation, Demand
paging, Page Replacement algorithms: Optimal, First in First Out (FIFO), Second Chance (SC),
Not recently used (NRU) and Least Recently used (LRU).
UNIT – V: I/O Hardware: I/O devices, Device controllers, Direct Memory Access, Principles of
I/O.
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed),Free-space
management (bit vector, linked list, grouping), directory implementation(linear list, hash table),
efficiency and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks.
Case study: UNIX OS file system, shell, filters, shell programming, programming with the
standard I/O, UNIX system calls.

Text Books:
S. No. Title Author(s) Publisher
Abraham Silberschatz,
1 Operating System Concepts Essentials Peter Baer Galvin and Greg Gagne.

Reference Books:

S. No. Title Author(s) Publisher

Operating Systems: Internals and
1 William Stallings
Design Principles
Operating System: A Design-oriented Charles Patrick
2
Approach. Crowley
Operating Systems: A Modern
3 Gary J. Nutt
Perspective.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
CS112403 Software Engineering CS112403 T = 0 P=0 Credits =

ESE CT TA Total ESE Duration

Examination 100 20 30 150 3 Hours
Scheme Minimum number of class tests to be Minimum
conducted=02 Assignments=02

Course Objectives Course Outcomes

UNIT – I Introduction: Programming in the small vs. programming in the large; software project
failures and importance of software quality and timely availability; engineering approach to software
development; role of software engineering towards successful execution of large software projects;
emergence of software engineering as a discipline.
UNIT – II Software Project Management: Basic concepts of life cycle models – different models
and milestones; software project planning – identification of activities and resources; concepts of
feasibility study; techniques for estimation of schedule and effort; software cost estimation models and
concepts of software engineering economics; techniques of software project control and reporting;
introduction to measurement of software size; introduction to the concepts of risk and its mitigation;
configuration management

UNIT – III: Software Quality and Reliability: Internal and external qualities; process and product
quality; principles to achieve software quality; introduction to different software quality models like
McCall, Boehm, FURPS / FURPS+, Dromey, ISO – 9126; introduction to Capability Maturity Models
(CMM and CMMI); introduction to software reliability, reliability models and estimation.
Software Requirements Analysis, Design and Construction: Introduction to Software
Requirements Specifications (SRS) and requirement elicitation techniques; techniques for requirement
modeling – decision tables, event tables, state transition tables, Petri nets; requirements documentation
through use cases; introduction to UML, introduction to software metrics and metrics based control
methods; measures of code and design quality.

UNIT – IV: Object Oriented Analysis, Design and Construction: Concepts -- the principles of
abstraction, modularity, specification, encapsulation and information hiding; concepts of abstract data

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 type; Class Responsibility Collaborator (CRC) model; quality of design; design measurements;
concepts of design patterns; Refactoring; object oriented construction principles; object oriented
metrics.

UNIT – V: Software Testing: Introduction to faults and failures; basic testing concepts; concepts of
verification and validation; black box and white box tests; white box test coverage – code coverage,
condition coverage, branch coverage; basic concepts of black-box tests – equivalence classes,
boundary value tests, usage of state tables; testing use cases; transaction based testing; testing for non-
functional requirements – volume, performance and efficiency; concepts of inspection.

Text Books:

S. No. Title Author(s) Publisher

1 Software Engineering Ian Sommerville

Reference Books:

S. No. Title Author(s) Publisher

Fundamentals of Software Carlo Ghezzi, Jazayeri

1 Mandrioli Dino
Engineering, Mehdi

A Lexicon of Practice,
Software Requirements and
2 Principles and Michael Jackson
Specification:
Prejudices,
Ivar Jacobson, Grady
3 The Unified Development Process James Rumbaugh
Booch,

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Operations Research L= T=0 P=0 Credits =
CS112404
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme Minimum number of class tests to be Minimum
conducted=02 Assignments=02

Course Objectives Course Outcomes

UNIT – I Introduction to OR:

Origin of OR and its definition. Concept of optimizing performance measure, Types of OR problems,
Deterministic vs. Stochastic optimization, Phases of OR problem approach – problem formulation,
building mathematical model, deriving solutions, validating model, controlling and implementing
solution.
UNIT – II Linear Programming:
Linear programming – Examples from industrial cases, formulation & definitions, Matrix form.
Implicit assumptions of LPP. Some basic concepts and results of linear algebra – Vectors, Matrices,
Linear Independence/Dependence of vectors, Rank, Basis, System of linear eqns., Hyperplane,
Convex set,Convex polyhedron, Extreme points, Basic feasible solutions.Geometric method: 2-
variable case, Special cases – infeasibility, unboundedness, redundancy &degeneracy, Sensitivity
analysis. Simplex Algorithm – slack, surplus & artificial variables, computational details, big-M
method,identification and resolution of special cases through simplex iterations. Duality –
formulation, results, fundamental theorem of duality, dual-simplex and primal-dualalgorithms
UNIT – III: Transportation and Assignment problems:
TP - Examples, Definitions – decision variables, supply & demand constraints, formulation, Balanced
& unbalanced situations, Solution methods – NWCR, minimum cost and VAM, test for
optimality(MODI method), degeneracy and its resolution. AP - Examples, Definitions – decision
variables, constraints, formulation, Balanced &unbalanced situations, Solution method – Hungarian,
test for optimality (MODI method), degeneracy & its resolution.

UNIT – IV PERT – CPM:

Project definition, Project scheduling techniques – Gantt chart, PERT & CPM, Determination of
critical paths, Estimation of Project time and its variance in PERT using statistical principles, Concept
of project crashing/time-cost trade-off.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 UNIT – V: Inventory Control:
Functions of inventory and its disadvantages, ABC analysis, Concept of inventory costs, Basics of
inventory policy (order, lead time, types), Fixed order-quantity models – EOQ, POQ & Quantity
discount models. EOQ models for discrete units, sensitivity analysis and Robustness, Special cases of
EOQ models for safety stock with known/unknown stock out situations, models under prescribed
policy, Probabilistic situations.

Text Books:

S. No. Title Author(s) Publisher

An Introduction. H.A.
1 Operations Research:
Taha.

Reference Books:

S. No. Title Author(s) Publisher

1 Linear Programming. K.G. Murthy.

2 Linear Programming. G. Hadley.

Principles of OR with Application to
3 Managerial Decisions. H.M. Wagner.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Introduction To Innovation,
Subject Code
IP Management & L=3 T=0 P=0 Credits = 3
CS112405
Entrepreneurship
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme Minimum number of class tests to be Minimum
conducted=02 Assignments=02

Course Objectives Course Outcomes

UNIT – I Innovation: What and Why

Innovation as a core business process, Sources of innovation, Knowledge push vs. need pull innovations.
Class Discussion- Is innovation manageable or just a random gambling activity?

UNIT – II Building an Innovative Organization

Creating new products and services, Exploiting open innovation and collaboration, Use of innovation for
starting a new venture Class Discussion- Innovation: Co-operating across networks vs. ‘go-it-alone’
approach

UNIT – III Entrepreneurship:

 Opportunity recognition and entry strategies

 Entrepreneurship as a Style of Management
 Maintaining Competitive Advantage- Use of IPR to protect Innovation

UNIT – IV Entrepreneurship- Financial Planning:

 Financial Projections and Valuation

 Stages of financing
 Debt, Venture Capital and other forms of Financing

UNIT – V Intellectual Property Rights (IPR)

 Introduction and the economics behind development of IPR: Business Perspective

 IPR in India – Genesis and Development

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
  International Context
 Concept of IP Management, Use in marketing

Types of Intellectual Property

 Patent- Procedure, Licensing and Assignment, Infringement and Penalty

 Trademark- Use in marketing, example of trademarks- Domain name
 Geographical Indications- What is GI, Why protect them?
 Copyright- What is copyright

Industrial Designs- What is design? How to protect?

Text Books:

S. No. Title Author(s) Publisher

Managing Innovation: Integrating

1 Technological, Market and Joe Tidd, John Bessant.
Organizational Change

2 Case Study Materials: To be

distributed for class discussion

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code Design And Analysis Of
L= T=0 P = 02 Credits = 1
CS112491 Algorithms Lab
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme Minimum number of class tests to be Minimum
conducted=02 Assignments=02

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code Operating Systems Lab
L= T=0 P = 02 Credits = 1
CS112492 (Unix Environment)
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objective Course Outcomes

The objectives of this lab is : CO1 Students will be able to Work confidently in
Unix/Linux environment
1. To familiarize students with
the architecture of Unix OS. CO2 Students will able to Write shell scripts to automate
various tasks
2. To provide necessary skills for CO3 Students will understand different commands on Unix
developing and debugging and its usage
programs in UNIX CO4 Students will be able to describe and use
environment. thefundamental UNIX system tools and utilities
CO5 Students will understand different kernel
algorithmsand its usage

1. Unix commands (files directory, data manipulation, network communication etc), shell
programming and vi editor
2. C program implementation of the following:
a. Scheduling Algorithms
b. Shared memory
c. Thread and Multi Thread
d. Inter Process Communication
e. Deadlock Avoidance and Deadlock Detection
f. Semaphore
g. Memory Management
h. Indexing and Hashing

Text Books:
1. Operating System Concepts Essentials. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne.
Reference Books:
1. Operating Systems: Internals and Design Principles. William Stallings.
2. Operating System: A Design-oriented Approach. Charles Patrick Crowley.
3. Operating Systems: A Modern Perspective. Gary J. Nutt.
4. Design of the Unix Operating Systems. Maurice J. Bach.
5. Understanding the Linux Kernel, Daniel Pierre Bovet, ‎iraseC ocraM.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Software Engineering Lab L= T=0 P=2 Credits = 1
CS112493
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Laboratory
 Development of requirements specification, function oriented design using SA/SD,
 object-oriented design using UML, test case design, implementation using C++ and testing.
 Use of appropriate CASE tools and other tools such as configuration management tools,
program analysis tools in the software life cycle.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Operations Research Lab L= T=0 P = 02 Credits = 1
CS112494
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

1. Formulation of linear programming problems.

2. Solution of linear programming problem using graphical method with:
i. Multiple constraints
ii. Unbounded solution
iii. Infeasible solution
iv. Alternative or multiple solution
3. Enumeration of all basic solutions for linear programming problem.
4. Solution of linear programming problem with simplex method.
5. Problem solving using Big M method.
6. Problem solving using two phase method.
7. Solution on primal problem as well as dual problem.
8. Solution based on dual simplex method.
9. Verification of weak duality, strong duality and complementary slackness property.
10. Solution of transportation problem.
11. Solution of assignment problem.
12. Solution of integer programming problem using Branch and Bound method.
13. Solution of integer programming problem using Gomory’s cutting plane method.
14. Simulation: Random number generation.
15. Monte Carlo method.
16. Performance measures for M/M/1 queuing model.
17. ABC analysis.
18. Inventory model.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
CS112495 Design Thinking L= T=0 P=2 Credits = 1

ESE CT TA Total ESE Duration

Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards