Kolhapur Institute of Technology’s

College of Engineering Kolhapur

Department of Computer Science and Business System
SEM-III-Syllabus
Course Code: UCBC0301 L T P Credit
Course Name: Formal Language & Automata Theory 3 1 4

Course Prerequsites:
Fundamentals of Discrete Mathematics

Course Description:
This course to study about different formal langugaes and how these languaes are validate with respect there
machines. Also this course provides the knowledge of designing abstrsct process model for any discrete system
through state transition diagram.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
CO1 Understand the different formal languages and its acceptors II Understand
Apply the knowledge of automata Theory, grammars & Regular
CO2 III Apply
Expressions for solving language problems.
CO3 Apply different language acceptors to validate the respective formal languages. III Apply
CO4 Undestand decidable and undecidble languages with time complexity. II Understand

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3
CO2 3 1 1 2
CO3 2 1
CO4 3 1 1 1 1

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Introduction to Finitinte Automata 8 Hours

Alphabet, languages and grammars, productions and derivation,Regular expressions and languages, deterministic
finite automata (DFA) and equivalence with regular expressions,nondeterministic finite automata (NFA) and
equivalence with DFA, regular grammars and equivalence with finite automata, properties of regular languages.

Unit 2 Kleen's Theorem 5 Hours

Kleene’s theorem, pumping lemma for regular languages, Myhill-Nerode theorem and its uses, minimization of finite
automata.Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms.
Unit 3 Context-free languages, Pushdown Automata and Context Sensitive Languages 8 Hours
Context-free grammars (CFG) and languages (CFL), Chomsky and Greibachnormal forms, nondeterministic
pushdown automata (PDA) and equivalence with CFG,parse trees, ambiguity in CFG, pumping lemma for context-
free languages, deterministic pushdown automata, closure properties of CFLs.
Context-sensitive languages:Context-sensitive grammars (CSG) and languages, linear bounded automata.

Unit 4 Turing machines 7 Hours

The basic model for Turing machines (TM), Turingrecognizable(recursively enumerable) and Turing-decidable
(recursive) languages,variants of Turing machines, nondeterministic TMs and equivalence withdeterministic TMs

Unit 5 Undecidability 5 Hours

Church-Turing thesis, universal Turing machine, theuniversal and diagonalization languages, reduction between
languages and Rice s theorem,undecidable problems about languages.

Unit 6 Basic Introduction to Complexity 7 Hours

Introductory ideas on Time complexity of deterministic and nondeterministic Turing machines, P and NP, NP-
completeness, Cook’s Theorem, other NP -Complete problems.

Text Books:
1. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman (2008). Introduction to Automata Theory, Languages,
and Computation. Pearson .
2. John C. Martin (2002). Introduction to Languages and Theory of Computation. McGraw-Hill Higher Education.

Reference Books:
1. Harry R. Lewis and Christos H. Papadimitriou (1981). Elements of the Theory of Computation. Springer.
2. Michel Sipser (2013). Introduction to Theory of Computation. Cengage Learning .
Course Code: UCBC0302 L T P Credit
Course Name: Computer Organization & Architecture 3 3

Course Prerequsites:
Basic functional units of a computer system

Course Description:
The course helps the students to gather a conceptual overview of memory, registers, arithmetic unit, control unit, and
input/output components. It also helps to examine computer design trade-offs. This course will be also helpful for
exams like GATE.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
CO1 Understand the digital representation of data in a computer system. II Understand
Explain the concepts of parallel processing, pipelining and inter processor
CO2 II
communication. Understand
CO3 Analyze the performance aspects of control unit, memory unit and arithmetic III Apply
CO4 Demonstrate the concepts of computer organization in designing the solution. III Apply

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 0 0 0 0 0 0 0 1 0 2 1 0
CO2 2 2 0 0 2 0 0 0 1 0 0 0 0
CO3 1 1 1 1 3 0 0 0 0 0 0 1 0 2
CO4 2 1 0 1 1 0 0 0 0 0 0 0 1 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Introduction 4 Hours
Revision of basics in Boolean logic and Combinational/Sequential Circuits. Functional blocks of a computer: CPU,
memory, input-output subsystems, control unit.

Unit 2 Instruction set architecture of a CPU 5 Hours

Registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set.
Outlining instruction sets of some common CPUs.
Unit 3 Data representation 8 Hours
Signed number representation, fixed and floating-point representations, character representation. Computer
arithmetic:‎Integer‎addition‎and‎subtraction,‎ripple‎carry‎adder,‎carry‎look-ahead‎adder,‎etc.‎multiplication‎–‎shift-
and-add, Booth multiplier, carry save multiplier, etc. Division restoring and non-restoring techniques, floating point
arithmetic, IEEE 754 format

Unit 4 Control unit and memory design 8 Hours

Introduction to x86 architecture. CPU control unit design: Hardwired and micro-programmed design approaches,
design of a simple hypothetical CPU. Memory system design: Semiconductor memory technologies, memory
organization.

Unit 5 Peripheral devices and their characteristics 8 Hours

Input-output‎subsystems,‎I/O‎device‎interface,‎I/O‎transfers‎–‎program‎controlled,‎interrupt‎driven‎and‎DMA,‎
privileged‎and‎non-privileged‎instructions,‎software‎interrupts‎and‎exceptions.‎Programs‎and‎processes‎–‎role‎of‎
interrupts‎in‎process‎state‎transitions,‎I/O‎device‎interfaces‎–‎SCII,‎USB.‎Pipelining:‎Basic‎concepts‎of‎pipelining,‎
throughput and speedup, pipeline hazards.

Unit 6 Memory organization 7 Hours

Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache coherency. Memory
organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs.
block size, mapping functions, replacement algorithms, write policies.

Text Books:
1. Mano M. M. (1993). Computer System Architecture. Prentice Hall of India, New Delhi.
2. A. David Patterson and John L. Hennessy (2009). Computer Organization and Design: The Hardware/Software
Interface. Morgan Kaufmann.

3. V. Carl Hamacher and Safwat G. Zaky (2011). Computer Organization and Embedded Systems. McGraw Hill
Higher Education.

Reference Books:
1. John P. Hayes (2017). Computer Architecture and Organization. McGraw Hill Education.
2.William Stallings (2016). Computer Organization and Architecture: Designing for Performance.
Pearson Education India.
3. Vincent P. Heuring and Harry F. Jordan (1996). Computer System Design and Architecture.
‎Pearson Education India.
Course Code: UCBC0303 L T P Credit
Course Name: Data Structures and Algorithms 3 0 0 3

Course Prerequsites:
Fundamentals of Programming language

Course Description:
Introduces linear and non-linear data structures such as lists, stack, queues, trees, and graphs. Discusses about the
implementations and applications of these data structures on real time applications. Examines algorithms for sorting,
searching and some graph algorithms. Algorithm analysis and efficient code design is introduced.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
CO1 Understand basic terminologies related to algorithms analysis. II Understand

CO2 Select and apply suitable linear and non-linear data structures. III Apply

CO3 Apply different searching/sorting techniques and analyze their time complexities. IV Analyse

CO4 Represent and implement various file organizations and graphs. III Apply

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 2 0 0 2 2 0
CO2 2 2 0 0 2 0 2 2
CO3 2 3 2 2 2 2
CO4 3 2 3 2 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Basic Terminologies and Introduction to Algorithm & Data Organization 5 Hours

Algorithm specification, Recursion, Performance analysis, Asymptotic Notation - The Big-O, Omega and Theta
notation, Programming Style, Refinement of Coding - Time-Space Trade Off, Testing, Data Abstraction.
Unit 2 Linear Data Structure 7 Hours
Array, Stack, Queue, Linked-list and its types, Various Representations, Operations & Applications of Linear Data
Structures.

Unit 3 Non-linear Data Structure 8 Hours

Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay Tree), Applications
of Non-Linear Data Structures

Unit 4 Searching and Sorting on Various Data Structures 5 Hours

Sequential Search, Binary Search, Comparison Trees, Breadth First Search, Depth First Search Insertion Sort,
Selection Sort, Shell Sort, Divide and Conquer Sort, Merge Sort, Quick Sort, Heapsort, Introduction to Hashing

Unit 5 Files 7 Hours

Organization (Sequential, Direct, Indexed Sequential, Hashed) and various types of accessing schemes.

Unit 6 Graphs 8 Hours

Basic Terminologies and Representations, Graph search and traversal algorithms and complexity analysis.

Text Books:

1. E. Horowitz, S. Sahni, S. A-Freed (2008). Fundamentals of Data Structures. Universities Press.

2. A. V. Aho, J. E. Hopcroft, J. D. Ullman (1982). Data Structures and Algorithms. Pearson.

Reference Books:
1. Donald E. Knuth (1997). The Art of Computer Programming: Volume 1: Fundamental Algorithms. Addison-
Wesley Professional.

2. Thomas, H. Cormen, Charles E. Leiserson, R L. Rivest, Clifford Stein (2009). Introduction to Algorithms. PHI Learning Pvt. Ltd

3. Pat Morin (2013). Open Data Structures: An Introduction (Open Paths to Enriched Learning). UBC Press.
Course Code: UCBC0304 L T P Credit
Course Name: Computational Statistics 3 3

Course Prerequsites:
Basic statistics and Probability Distributions

Course Description:
In this course you will develop a sound understanding of current, modern computational statistical approaches and
their application to a variety of datasets and to apply principles of data science to analyze the business problems also
to develop a sound understanding of current, modern computational statistical approaches and their application to a
variety of datasets.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
CO1 Interpret statistical data using multivariate normal distributions. II Understand

Develop a sound understanding of computational statistical approaches and their

CO2 III Apply
application to a variety of datasets.

CO3 Apply the concept of statistical analysis. III Apply

CO4 Classify the approaches to point estimation of parameters II Understand

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 1
CO2 3 2 1 2
CO3 3 2 1 2
CO4 3 2 1

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Multivariate Normal Distribution: 7 Hours
Multivariate Normal Distribution Functions, Conditional Distribution and its relation to regression model, Estimation
of parameters
Unit 2 Discriminant Analysis: 7 Hours
Statistical background, linear discriminant function analysis, Estimating linear discriminant functions and their
properties.

Unit 3 Principal Component Analysis: 7 Hours

Principal components, Algorithm for conducting principal component analysis, deciding on how many principal
components to retain, H-plot.

Unit 4 Factor Analysis: 7 Hours

Factor analysis model, extracting common factors, determining number of factors, Transformation of factor analysis
solutions, Factor scores.

Unit 5 Clustering: 8 Hours

Introduction, Types of clustering, Correlations and distances, clustering by partitioning methods, hierarchical
clustering, overlapping clustering, K-Means Clustering-Profiling and Interpreting Clusters.

Unit 6 Data Aggregation, Group Operations: 5 Hours

Group by Mechanics, Data Aggregation, Groupwise Operations and Transformations, Pivot Tables and Cross
Tabulations.

Text Books:

1. T.W. Anderson (2009). An Introduction to Multivariate Statistical Analysis. Wiley.

2. J.D. Jobson (1992). Applied Multivariate Data Analysis Volume II: Categorical and Multivariate Methods. Springer.

Reference Books:
1 D.A. Belsey, E. Kuh and R.E. Welsch (2004). Regression Diagnostics, Identifying Influential Data and Sources of
Collinearety. Wiley-Interscience.

2. J. Neter, W. Wasserman and M.H. Kutner (2003). Applied Linear Regression Models. McGraw-Hill Education.

3. A.S. Mulaik. (2009). The Foundations of Factor Analysis. Chapman and Hall/CRC.
4. D.C. Montgomery and E.A. Peck (2006). Introduction to Linear Regression Analysis. Wiley India Pvt Ltd.
5. M.R. Anderberg (1973). Cluster Analysis for Applications. Academic Press Inc.
6. D.F. Morrison (1990). Multivariate Statistical Analysis. McGraw-Hill Education.
Course Code: UCBC0305 L T P Credit
Course Name: Software Engineering 3 0 0 3

Course Prerequsites:
Fundamentals of Programming Languages

Course Description:
This course helps the students learn advanced concepts of software engineering. It focuses on various aspects of
software engineering, such as traditional life cycle models, software development using agile and extreme
programming methods, capability maturity models, object oriented ways of designing large software systems, and
different ways of testing the software.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
Demonstrate the advanced knowledge of various aspects of software engineering
CO1 II Understand
starting from requirements gathering till the Beta testing
Analyse the gathered requirements and able to apply suitable life cycle model for
CO2 IV Analyse
software development.

CO3 Design a reliable software using appropriate design patterns and standards. VI Create

Implement and test the developed software by the modern software project
CO4 VI Create
management tools and techniques.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 0 0 2 2 2
CO2 2 2 0 0 2 0 2 2 2
CO3 2 3 3 2 2 2 2
CO4 2 2 3 3 2 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents
Course Contents:
Unit 1 Introduction 5 Hours

Introduction: Programming in the small vs. programming in the large; software project failures and importance of
software quality and timely availability; of software engineering towards successful execution of large software
projects; emergence of software engineering as a discipline, Software Engineering Historical Development from
Jackson Structured Programming to Agile Development.

Unit 2 Software Project Management 8 Hours

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 3 Agile Software Engineering and Software Quality Management and Reliability 8 Hours

Agile Software Engineering : Concepts of Agile Methods, Extreme Programming; Agile Process Model - Scrum,
Feature; Scenarios and Stories Software quality ; Garvin’s quality dimensions, McCall’s quality factor, ISO 9126
quality factor; Software Quality Dilemma; Introduction to Capability Maturity Models (CMM and CMMI);
Introduction to software reliability, reliability models and estimation.

Unit 4 Software Requirements Analysis, Design and Construction 6 Hours

Introduction to Software Requirements Specifications (SRS) and requirement elicitation techniques; techniques for
requirement modelling – 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 5 Object Oriented Analysis, Design and Construction 5 Hours

Concepts -- the principles of abstraction, modularity, specification, encapsulation and information hiding; concepts of
abstract data type; Class Responsibility Collaborator (CRC) model; quality of design; design measurements; concepts
of design patterns; Refactoring; object-oriented construction principles; object oriented metrics.

Unit 6 Software Testing 8 Hours

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; Unit Testing,
Integration Testing, System Testing and Acceptance Testing.
Text Books:

1. Sommerville, I (2016). Software Engineering. 10th Edition, Pearson Education Limited.

2. Pressman, Roger S., Maxim, Bruce R. (2015). SOFTWARE ENGINEERING; A Practitioner's Approach (8th).
Mcgraw-Hill.

Reference Books:

1. Ivar Jacobson, Harold Bud Lawson, Pan-Wei Ng, Paul E. McMahon and Michael Goedicke (2019). The Essentials
of Modern Software Engineering: Free the Practices from the Method Prisons. Morgan & Claypool Publishers

2. Carlo Ghezzi, Jazayeri Mehdi and Mandrioli Dino (2002). Fundamentals of Software Engineering. Pearson.

3. Michael Jackson (1995). Software Requirements and Specification: A Lexicon of Practice, Principles and
Prejudices.
Addison-Wesley.

4. Ivar Jacobson, Grady Booch and James Rumbaugh (2002). The Unified Development Process. Pearson Education.

5. Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides (1994). Design Patterns: Elements of Object-
Oriented Reusable Software. Addison-Wesley Professional.

6. Norman E Fenton and Shari Lawrence Pfleeger (1996). Software Metrics: A Rigorous and Practical Approach.
Cengage Learning.

7. Bertrand Meyer (1997). Object-Oriented Software Construction. Prentice Hall.

8. Ivar Jacobson (1992). Object Oriented Software Engineering: A Use Case Driven Approach. Addison-Wesley.

10. Bertrand Meyer (2013). Touch of Class: Learning to Program Well with Objects and Contracts. Springer.

11. Martin Fowler (2003). UML Distilled: A Brief Guide to the Standard Object Modeling Language. Addison-Wesley.
Course Code: UCBC0306 L T P Credit
Course Name: Fundamentals of Management 2 2

Course Prerequsites:
Self management, Business and society

Course Description:
The course helps the students to know the necessary skills and functions required for efficient manager in contemporary
business environment.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
Understand current management concepts, models and managerial process and
CO1 II Understand
their integration into business activities.

CO2 Differentiate between various aspects of managing organizations. II Understand

CO3 Explain the concepts and significance of management in business. II Understand

CO4 Analyze the role of management in society and in our lives. IV Analyze
CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 2
CO2 1 2 2
CO3 2 2
CO4 1 1 1 2
Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents
Course Contents:
Unit 1 Management Theories 4 Hours
Concept and Foundations of Management, Evolution of Management Thoughts [Pre-Scientific Management Era (before
1880), Classical management Era (1880-1930), Neo-classical Management Era (1930-1950), Modern Management era
(1950-on word). Contribution of Management Thinkers: Taylor, Fayol, Elton Mayo etc.

Unit 2 Functions of Management 4 Hours

Introduction to Management and the POSDC Functions, Importance and purpose of planning, Types of plans (strategic,
tactical, operational), Principles of organizing, Types of organizational structures (functional, divisional, matrix, etc.),
Recruitment, training, performance management, employee engagement, Leadership styles and theories, Importance of
control in management, Types of control mechanisms (feed forward, concurrent, feedback).
Unit 3 Organization Behavior 5 Hours
Introduction, Personality, Perception, Learning and Reinforcement, Motivation, Group Dynamics, Power & Influence,
Work Stress and Stress Management, Decision Making, Problems in Decision Making, Decision Making, organizational
Culture, Managing Cultural Diversity.

Unit 4 Organizational Design 5 Hours

Classical, Neoclassical and Contingency approaches to organizational design; Organizational theory and design,
Organizational structure (Simple Structure, Functional Structure, Divisional Structure, Matrix Structure).

Unit 5 Managerial Ethics 5 Hours

Ethics‎and‎Business,‎Ethics‎of‎Marketing‎&‎advertising,‎Ethics‎of‎Finance‎&‎Accounting,‎Decision‎–‎making‎
frameworks, Business and Social Responsibility, International Standards, Corporate Governance, Corporate
Citizenship, Corporate Social Responsibility.

Unit 6 Leadership 5 Hours

Leadership Theories: Trait theory of leadership, Behavioral theories (e.g., Ohio State studies, Michigan studies),
Situational leadership theory, Transformational and transactional leadership, Servant leadership and other contemporary
theories, Motivation and Employee Engagement: Motivation theories and their application in leadership, Employee
engagement strategies

Home Assignment: The topic for class discussion will be mentioned beforehand and students should be ready to
discuss these topics (in groups) in class. Students are required to meet in groups before coming to class and prepare on
the topic. Few topics are mentioned below as examples. Instructor can add or change any topic as per requirement.
1. Topic: Corporate social responsibility (CSR) and HRM implications: What does it mean to be socially responsible
within an increasingly financially driven market economy?
2. Topic: Leaders are Born, Not Made! The debate

Text Books:
1. Richard L. Daft (2016). Understanding the Theory and Design of Organizations. Cengage Learning India Private
Limited.
2. Stephen P. Robbins, David A. Decenzo (2016). Fundamentals of Management. Pearson Education.

Reference Books:
1. Stephen P. Robbins,‎Timothy A. Judge,‎Neharika Vohra (2018). Organizational Behaviour. Pearson Education.
2. Harold Koontz, O'Donnell and Heinz Weihrich (2012). Essentials of Management. Tata McGraw Hill.
Course Code: UCBC0307 L T P Credit
Course Name: Computer Organization & Architecture Lab 2 1

Course Prerequsites:
Fundamentals of Electronics and Computer, Fundamentals of Computer Programming

Course Description:
This is one of the core course of Computer Science & Engineering Programme. In this course you will become
familiar with the core concepts of OS - how OS work, how a processes & threads are created, inter-process
communication & synchronisation, the various scheduling algorithms, memory management & memory
allocation strategies, etc. This course will be also helpful for exams like GATE.

Course Outcomes:
CO After the completion of the course the student should be able to Blooms Level Descriptor
CO1 Design Combinational and Sequential Circuits 6 Create
CO2 Develop C/C++ Program to demonstrate data types. 3 Apply
CO3 Develop Machine language program to perform different task. 3 Apply
CO4 Classify I/O systems and its techniques. 2 Understand

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 0 0 0 0 0 0 0 1 0 2 1 0
CO2 2 2 0 0 2 0 0 0 1 2 0 0 0 0
CO3 1 1 2 1 3 0 0 0 0 0 0 1 0 2
CO4 2 2 0 1 1 0 0 0 0 0 0 0 1 2
CO5 0 0 0 1 0 0 0 0 0 0 1 1 1 0

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents

Practical No. Practical Title and Contents Hours

1 Implementation of Encoder and Decoder (Simulation). 2

2 Implementation of Counter/Linear Feedback Shift Register (Simulation). 2
Write a C/C++ programmer to understand the formats of char, int, float,
3 2
double, long etc.
 Write a Machine language program to perform addition, subtraction,
4 2
Multiplication and Division
5 Write a Machine language program to Access memory locations/ports. 2
Write a Machine language program to Count odd and even integers from a
6 2
series of memory locations.
7 Write a Machine language program to Print values of selected registers 2
8 Write a Machine language program to Handling interrupts. 2
9 Study of Peripheral devices and their characteristics. 2
10 Study of Pipelining. 2

Text Books:
1. Mano M. M. (1993). Computer System Architecture. Prentice Hall of India, New Delhi.

2. A. David Patterson and John L. Hennessy (2009). Computer Organization and Design: The Hardware/Software
Interface. Morgan Kaufmann.

3. V. Carl Hamacher and Safwat G. Zaky (2011). Computer Organization and Embedded Systems. McGraw Hill
Higher Education.

Reference Books:
1. John P. Hayes (2017). Computer Architecture and Organization. McGraw Hill Education.

2.William Stallings (2016). Computer Organization and Architecture: Designing for Performance. Pearson Education India.

3. Vincent P. Heuring and Harry F. Jordan (1996). Computer System Design and Architecture.‎Pearson Education India.

Reference Books:
1. John P. Hayes (2017). Computer Architecture and Organization. McGraw Hill Education.
2.William Stallings (2016). Computer Organization and Architecture: Designing for Performance.
Pearson Education India.
3. Vincent P. Heuring and Harry F. Jordan (1996). Computer System Design and Architecture.
‎Pearson Education India.
Course Code: UCBC0308 L T P Credit
Course Name: Data Structures and Algorithms lab 0 0 4 2

Course Prerequsites:
Fundamentals of Programming

Course Description:
In this laboratory course, the students will develop problem solving skills using C programming. This course helps the
students to understand, select and apply appropriate data structures to solve the real world problems. Additionally, the
students will also learn various searching and sorting techniques. The course teaches the students to implement various
abstract data structures such as lists, graphs and trees.

Course Outcomes:
After the completion of the course the student should be
CO Blooms Level Descriptor
able to
CO1 Select appropriate data structures to solve real world problems I Remember
Implement linear and non-linear data structure operations using
CO2 III Apply
C programs
Implement searching and sorting algorithms using suitable data
CO3 III Apply
structures.
Implement ADTs such as lists, graphs, search trees to solve
CO4 III Apply
computational problems

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 0 0 2 0 0 0 1 0
CO2 2 2 3 1 2 0 0 0 0 0
CO3 2 1 2 1 2 0 0 0 0 2
CO4 2 3 3 1 2 0 0 0 1 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 50% Lab Assignments, Internal POE, Lab Book, Attendance
2 End Semester Examination (ESE) 50% Practical Oral Examination (POE)

Course Contents
Practical No. Practical Title and Contents Hours
Write a menu driven & modular program for database management of any
1 Restaurant. Based on a customer's consumption of food items, the program should 2
generate the bill.
Design, develop and execute a program in C to input N integer numbers in
ascending order into a single dimension array, and then to perform a binary search
2 for a given key integer number and report success or failure in the form of a 2
suitable message.
 Design, Develop and Implement a menu driven Program in C for the following
operations on STACK of Integers (Array Implementation of Stack with maximum
size MAX).
1. Push an Element on to Stack
2. Pop an Element from Stack
3 3. Demonstrate how Stack can be used to check Palindrome 2
4. Demonstrate Overflow and Underflow situations on Stack
5. Display the status of Stack
6. Exit
Support the program with appropriate functions for each of the above operations

Design, Develop and Implement a Program in C for converting an Infix Expression

to Postfix Expression. Program should support for both parenthesizedand free
4 parenthesized expressions with the operators: +, -, *, /, %(Remainder), ^(Power) 2
and alphanumeric operands.
Design, Develop and Implement a menu driven Program in C for the following
operations on Circular QUEUE of Characters (Array Implementation of Queue
with maximum size MAX)
1. Insert an Element on to Circular QUEUE
2. Delete an Element from Circular QUEUE
5 3. Demonstrate Overflow and Underflow situations on Circular QUEUE 2
4. Display the status of Circular QUEUE
5. Exit
Support the program with appropriate functions for each of the above operations

Design, Develop and Implement a menu driven Program in C for the following
operations on Singly Linked List (SLL) of Student Data with the fields: USN,
Name, Branch, Sem, PhNo
1. Create a SLL of N Students Data by using front insertion.
6 2
2. Display the status of SLL and count the number of nodes in it
3. Perform Insertion / Deletion at End of SLL
4. Perform Insertion / Deletion at Front of SLL(Demonstration of stack)
5. Exit
Design, Develop and Implement a menu driven Program in C for the following
operations on Doubly Linked List (DLL) of Employee Data with the fields: SSN,
Name, Dept, Designation, Sal, PhNo
1. Create a DLL of N Employees Data by using end insertion.
2. Display the status of DLL and count the number of nodes in it
7 2
3. Perform Insertion and Deletion at End of DLL
4. Perform Insertion and Deletion at Front of DLL
5. Demonstrate how this DLL can be used as Double Ended Queue
6. Exit

Write a C program that implements Selection Sort algorithm to arrange the

8 following list of integers in ascending order. 23, 2
-2, 56, 1, 78, 8, 34, 23, 42, -31, 0
 Design, Develop and Implement a menu driven Program in C for the following
operations on Binary Search Tree(BST) of Integers
1. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
9 2. Traverse the BST in Inorder, Preorder and Post Order 2
3. Search the BST for a given element (KEY) and report the appropriate message
4. Exit

Given a File of N employee records with a set K of Keys(4-digit) which uniquely

determine the records in file F. Assume that file F is maintained in memory by a
Hash Table(HT) of m memory locations with L as the set of memory addresses (2-
digit) of locations in HT.
10 Let the keys in K and addresses in L are Integers. Design and develop a program in 2
C that uses Hash function H: K → L as H(K)=K mod m (remainder method), and
implement hashing technique to map a given key K to the address space L. Resolve
the collision (if any) using linear probing.
Write a C++ program that uses functions to perform the following:
1. Create a binary search tree of integers.
11 2. Traverse the above Binary search tree recursively in Preorder, Inorder, Postorder 2

Design, Develop and Implement a Program in C for the following operations on

Graph(G) of Cities
12 1. Create a Graph of N cities using Adjacency Matrix. 2
2. Print all the nodes reachable from a given starting node in a digraph using
DFS/BFS method

Textbooks:
1. Bjarne Stroustrup (2005). The C++ Programming Language. Pearson Education.
2. Debasish Jana (2004). C++ and Object-Oriented Programming Paradigm. PHI Learning Pvt. Ltd.
Reference Books:
1. Yashavant Kanetkar (2019). Let us C++. BPB publications.

2. Peter Prinz and Ulla Prinz (2001). A Complete Guide to Programming in C++. Jones and Bartlett Publishers, India
Course Code: UCSBC0309 L T P Credit
Course Name: Computational Statistics lab 2 1

Course Prerequsites:
Multivariate calculus, familiarity with basic matrix algebra, Statistical Methods and Data Analysis.

Course Description:
Computational statistics is a branch of mathematical sciences concerned with efficient methods for obtaining
numerical solutions to statistically formulated problems. This course will introduce students to a variety of
computationally intensive statistical techniques and the role of computation as a tool of discovery.

Course Outcomes:
CO After the completion of the course the student should be able to Blooms Level Descriptor
CO1 Summarize the data by applying statistical analysis L2 Understand

CO2 Apply predefined libraries for various applications L3 Apply

CO3 Construct the graphs for the given data sets L6 Create
CO4 Analyze the results by applying various statistical methods L4 Analyze

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 1
CO2 3 1 2
CO3 3 2 1 2
CO4 3 1

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation (ISE) 100% Practical Performance, Oral

Course Contents
Practical No. Practical Title and Contents Hours
Write Simple Python Program containing python statements, expressions,
1 control flow, functions and its execution 2

2 Write python program using function and numeric types 2

3 Write python program using sequences, class defination and Constructors 2
4 Test the performance analysis of discriminant function analysis analysis 2

5 Write python program to implement file handling operations 2

6 Test the performance analysis of regression analysis 2
Implementation of Principal Component Analysis for finding important texts in
7 2
a corpus
 8 Clustering of images and text documents 2

9 Plot a graph using matplotlib package 2

10 Importing and Data wrangling 2

11 Performing Data aggregation group operations 2

12 Visualization in Python using matplotlib 2

Text Books:
1. T.W. Anderson (2009). An Introduction to Multivariate Statistical Analysis. Wiley.

2. J.D. Jobson (1992). Applied Multivariate Data Analysis Volume II: Categorical and Multivariate Methods. Springer.

Reference Books:
1 D.A. Belsey, E. Kuh and R.E. Welsch (2004). Regression Diagnostics, Identifying Influential Data and Sources of
Collinearety. Wiley-Interscience.

2. J. Neter, W. Wasserman and M.H. Kutner (2003). Applied Linear Regression Models. McGraw-Hill Education.

3. A.S. Mulaik. (2009). The Foundations of Factor Analysis. Chapman and Hall/CRC.
4. D.C. Montgomery and E.A. Peck (2006). Introduction to Linear Regression Analysis. Wiley India Pvt Ltd.
5. M.R. Anderberg (1973). Cluster Analysis for Applications. Academic Press Inc.

6. D.F. Morrison (1990). "Multivariate Statistical Analysis". McGraw-Hill Education.

2. John C. Martin (2002). Introduction to Languages and Theory of Computation. McGraw-Hill Higher Education.

Reference Books:
1. Harry R. Lewis and Christos H. Papadimitriou (1981). Elements of the Theory of Computation. Springer.

2. Michel Sipser (2013). Introduction to Theory of Computation. Cengage Learning .

Course Code: UCBC0310 L T P Credit
Course Name: Software Engineering Lab 2 1

Course Prerequsites:
Knowledge of Software Engineering Process, Programming Languages

Course Description:

This course to apply the knowledge of software engineering process and design the solution for real time problems
using design tools and technologies.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor

CO1 Analyze and identify requirements for real time problems IV Analyze
Design and implement various software design models using modern engineering
CO2 tools VI Create
Provide appropriate solutions for the real time problems using software
CO3 engineering methodology VI Create
CO4 Design test cases for various real time problems VI Create

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 2 2 3 3
CO2 2 3 3 2 1 2 2 2 2 2
CO3 2 3 3 2 1 2 2 2 2 2
CO4 2 3 2 2 2 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation (ISE1) 100% Parameter based evaluation for every assignment.

Course Contents:
Assignment No 1 : Prepare the problem statement for the given applications 2 Hours
Assignment No 2 : Develop Software Requirement Specification (SRS) for the applications
2 Hours
considered in the assignment no. 1

Assignment No 3 : Design the data flow diagram for the application. 2 Hours

Assignment No 4 : Design the class diagrams for the application. 2 Hours

Assignment No 5 : Design the Use-case diagrams for the application. 2 Hours

Assignment No 6 : Design the activity diagrams for the application. 2 Hours

Assignment No 7 : Design the interaction diagrams for the application. 2 Hours
Assignment No 8 : Implementation of UML in C++ 2 Hours

Assignment No 9 : Wriing test cases for the functions in the application and create test report. 2 Hours
Assignment No 10 : Study the configuration management tools(github) and project management
2 Hours
tools(jira) used in software developement life cycle.
Instructions for Students:

1. Individual student must select project application from the given list.

2. All the assigemnet solutions need to prepare in given format and the same should submit in moodle.

3. For designing UML diagrams students must use modern open source tools such as draw.io, UModel etc

List of Project Applications:

1. Railway Reservation System

2. Airline Management System

3. Hospital Management System

4. Examination Management System

5. KIT Bus Service System

Text Books:

1. Ian Sommerville (2006). Software Engineering. Pearson Education.

2. Pressman, Roger S., Maxim, Bruce R. (2015). SOFTWARE ENGINEERING, A Practitioner's Approach (8th).
Mcgraw-Hill.

Reference Books:
1. Carlo Ghezzi, Jazayeri Mehdi, Mandrioli Dino (2003). Fundamentals of Software Engineering. Prentice Hill

2. Ivar Jacobson, Grady Booch, James .Rumbaugh (1999). The Unified Development Process. Pearson Education.

3. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides (1995). Design Patterns: Elements of Object-
Oriented Reusable Software. Addison-Wesley.
 Kolhapur Institute of Technology’s
College of Engineering Kolhapur
Department of Computer Science and Business System
SEM-IV-Syllabus
Course Code: UCBC0401 L T P Credit
Course Name: Operating Systems 3 0 0 3

Course Prerequsites:
Fundamentals of Electronics and Computer ,Data Structure and Algorithms, Computer Organization and Architecture

Course Description:
This is one of the core course of Computer Science & Engineering Programme. In this course you will become
familiar with the core concepts of OS - how OS work, how a processes & threads are created, inter-process
communication & synchronisation, the various scheduling algorithms, memory management & memory allocation
strategies, etc.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor

CO1 Summarize basic concept of operating system and process management I Remember

CO2 Apply the concept of resource management and Process Scheduling III Apply

CO3 Describe concepts of Process Synchronization and deadlock II Analyse

CO4 Explain concept of Memory Management II Understand

CO5 Demonstrate concepts of File System and Disk management III Apply

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 1 0
CO2 2 2 1 1 2
CO3 2 2 1 1 2 1
CO4 2 3 2 1 1 1 2
CO5 2 1 1 1 2 1

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents
Course Contents:
Unit 1 Introduction to Operating Systems 6 Hours

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. 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 .Self-Study: OS Booting System

Unit 2 Process Scheduling 6 Hourss.

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.

Unit 3 Process Synchronization 7 Hours

Over view of Process Synchronization, Inter-process Communication:Concurrent processes,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.

Unit 4 Deadlocks 6 Hours

Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention, Deadlock Avoidance:
Deadlock allocation graphs Banker’s algorithm, Deadlock detection and Recovery.

Unit 5 Memory Management 8 Hours

Basic concept, Logical and Physical address maps, Memory allocation: Contiguous Memory allocation – Fixed and
variable partition– Internal and External fragmentation and Compaction. Concept Of Copy on Wite ,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 6 File I/O and Disk Management 7 Hours

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.I/O Hardware: I/O devices,
Device controllers, Direct Memory Access, Principles of I/O.Disk Management: Disk structure, Disk scheduling -
FCFS, SSTF, SCAN, C-SCAN, Disk reliability, Disk formatting, Boot-block, Bad blocks.
Text Books:

1.Abraham Silberschatz, Peter Baer Galvin, Greg Gagne (2009). Operating System Principles. Wiley India.

2.Abraham Silberschatz, Peter Baer Galvin and Greg Gagne (2010). Operating System Concepts Essentials. John
Wiley & Sons Inc.

3.Dhananjay Dhamdhere (2017). Operating Systems A Concept Based Approach. Mc-Graw Hill

Reference Books:

1.William Stallings (2012). Operating Systems: Internals and Design Principles. Pearson Education

2.Charles Patrick Crowley(2017). Operating System: A Design-oriented Approach. McGraw Hill Education

3.Milan Milenkovic (2001). Operating Systems –Concepts and design. TMGH.

4.Andrew S. Tanenbaum (2015). Modern Operating Systems. Pearson Education International.

5.Maurice J. Bach.(2015). Design of the Unix Operating Systems. Pearson Education India.

6. Norman E Fenton and Shari Lawrence Pfleeger (1996). Software Metrics: A Rigorous and Practical Approach.
Cengage Learning.

7. Bertrand Meyer (1997). Object-Oriented Software Construction. Prentice Hall.

8. Ivar Jacobson (1992). Object Oriented Software Engineering: A Use Case Driven Approach. Addison-Wesley.

10. Bertrand Meyer (2013). Touch of Class: Learning to Program Well with Objects and Contracts. Springer.

11. Martin Fowler (2003). UML Distilled: A Brief Guide to the Standard Object Modeling Language. Addison-Wesley.
Course Code: UCBC0402 L T P Credit
Course Name: Database Management Systems 3 3

Course Prerequsites:
Set Theory, Operating Systems, and Data Structures.

Course Description:
This Course is designed to understand the internals of Database System, with elaboration from Database Design,
Using Relational Database (using SQL) and the transaction concepts

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor

CO1 Describe the fundamentals of database management systems programming. II Understand

CO2 Design appropriate database for a given problem. II Create

CO3 Write SQL queries to design & manage the database. III Apply

CO4 Illustrate Transactions, Concurrency and Recovery apply to database system. II Understand

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 1
CO2 2 3 2 2
CO3 1 1 3 2
CO4 1 1 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents
Course Contents:
Unit 1 Introduction to Database 7 Hours

Introduction to Database. Hierarchical, Network, and Relational Models.

Database System Architecture: Data Abstraction, Data Independence, Data definition language (DDL), Data
Manipulation Language (DML).

Unit 2 Data models & Relational query languages 7 Hours

Data models: Entity-relationship model, network model, relational and object-oriented data models, integrity
constraints, and data manipulation operations.
Relational query languages: Relational algebra, Tuple and domain relational calculus, SQL3, DDL and DML
constructs, Open source and Commercial DBMS - MYSQL, ORACLE, DB2, SQL server.

Unit 3 Inroduction to NoSQL Database and Relational database design 5 Hours

Inroduction to NoSQL Database, Relational database design: Domain and data dependency, Armstrong's axioms,
Functional Dependencies, Normal forms, Dependency preservation, Lossless design.

Unit 4 Query Optimization & Storage strategies 7 Hours

Query processing and optimization: Evaluation of relational algebra expressions, Queryequivalence, Join
strategies, Query optimization algorithms.
Storage strategies: Indices, B-trees, Hashing.

Unit 5 Transaction processing: 7 Hours

Transaction processing: Concurrency control, ACID property, Serializability of scheduling, Locking and timestamp-
based schedulers, Multi-version and optimistic Concurrency Control schemes, Database recovery.

Unit 6 Database Security 5 Hours

Database Security: Authentication, Authorization and access control, DAC, MAC andRBAC models, Intrusion
detection, SQL injection.
Text Books:

1. Abraham Silberschatz, S. Sudarshan and Henry F. Korth (2019). Database System Concepts. McGraw-Hill.

2. E. F. Codd (1990). The relational model for database management. Addison-Wesley Longman Publishing Co.

Reference Books:

1. Alfred V. Aho and J. D. Ullman (1988). Principles of Database and Knowledge – Base Systems. Computer Science
Press

2. R. Elmasri and S. Navathe (2011). Fundamentals of Database Systems. Pearson Education, Inc-Addison-Wesley

3. Serge Abiteboul, Richard Hull and Victor Vianu (1994). Foundations of Databases. Pearson Education, Inc-
Addison-Wesley

4.Andrew S. Tanenbaum (2015). Modern Operating Systems. Pearson Education International.

5.Maurice J. Bach.(2015). Design of the Unix Operating Systems. Pearson Education India.

6. Norman E Fenton and Shari Lawrence Pfleeger (1996). Software Metrics: A Rigorous and Practical Approach.
Cengage Learning.

7. Bertrand Meyer (1997). Object-Oriented Software Construction. Prentice Hall.

8. Ivar Jacobson (1992). Object Oriented Software Engineering: A Use Case Driven Approach. Addison-Wesley.

10. Bertrand Meyer (2013). Touch of Class: Learning to Program Well with Objects and Contracts. Springer.

11. Martin Fowler (2003). UML Distilled: A Brief Guide to the Standard Object Modeling Language. Addison-Wesley.
Course Code: UCBC0403 L T P Credit
Course Name: Software Design with UML 3 3

Course Prerequsites:
Fundamentals of Software Development Life Cycle Process, Object Oriented Concepts.

Course Description:
This course to study about SDLC modeling techniques using UML diagrams and also understand the object-oriented
approach to analyzing and designing systems and software solutions .

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
Understand the concepts and principles of object oriented programming concepts
CO1 II Understand
and the software development process models

CO2 Make use of static and dynamic UML diagrams for solving design solutions III Apply

CO3 Analyze the design methods and modeling techniques. IV Analyze

CO4 Design UML diagrams for real time problems. VI Create

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 1 2 1
CO2 1 1 2 1 1 2 2
CO3 1 2 2 1 2 2 2
CO4 3 2 2 2 2 1 2 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Introduction to Object Oriented Software Engineering and UML 8 Hours

Software development process: The Waterfall Model vs. The Spiral Model, The Software Crisis, description of the
real world using the Objects Model, Classes, inheritance and multiple configurations, Quality software
characteristics, Description of the Object Oriented Analysis process vs. the Structure Analysis Model.
Unit 2 Introduction to the UML Language. 6 Hours

Standards, Elements of the language, General description of various models, The process of Object-Oriented software
development. Description of Design Patterns. Technological Description of Distributed Systems.

Unit 3 Requirement Analysis and Design 7 Hours

Requirements Analysis Using Case Modeling:

Analysis of system requirements. Actor definitions, writing a case goal, Use Case Diagrams, Use Case
Relationships. Design (Interaction Diagrams):Description of goal, Defining UML Method, Operation, Object
Interface, Class. Sequence Diagram. Finding objects from Flow of Events. Describing the process of finding objects
using a Sequence Diagram. Describing the process of finding objects using a Collaboration Diagram.

Unit 4 Static and Package Diagram Model 8 Hours

The Logical View Design Stage: The Static Structure Diagrams. The Class Diagram Model, Attributes descriptions,
Operations descriptions, Connections descriptions in the Static Model, Association, Generalization, Aggregation,
Dependency, Interfacing, Multiplicity. Package Diagram Model: Description of the model, White box, black box,
Connections between packagers, Interfaces., Create Package Diagram, Drill Down.

Unit 5 Dynamic and Component Diagrams 7 Hours

Description of the State Diagram,Events Handling,Description of the Activity Diagram,Physical Aspect,Logical

Aspect,Connections and Dependencies,User face,Initial DB design in a UML environment

Unit 6 Deployment Model 6 Hours

Processors,Connections,Components,Tasks,Threads,Signals and Events,Case Studies

Text Books:

1. Bernd Bruegge and Allen H. Dutoit (2013). Object-Oriented Software Engineering: using UML, Patterns, and Java.
Pearson Edu.
Reference Books:

1. Erich Gamma, Richard Helm, Ralph Johnson, and John M. Vlissides (1977). Design Patterns: Elements of
Reusable Object-Oriented Software. Addison-Wesley Professional Computing Series

2. Craig Larman (2005). Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and
Iterative Development. Pearson Education.

3. Simon Bennett, Steve Mc Robb and Ray Farmer (2010). Object Oriented Systems Analysis and Design Using
UML. McGraw Hill Education.

3. Serge Abiteboul, Richard Hull and Victor Vianu (1994). Foundations of Databases. Pearson Education, Inc-
Addison-Wesley

4.Andrew S. Tanenbaum (2015). Modern Operating Systems. Pearson Education International.

5.Maurice J. Bach.(2015). Design of the Unix Operating Systems. Pearson Education India.

6. Norman E Fenton and Shari Lawrence Pfleeger (1996). Software Metrics: A Rigorous and Practical Approach.
Cengage Learning.

7. Bertrand Meyer (1997). Object-Oriented Software Construction. Prentice Hall.

8. Ivar Jacobson (1992). Object Oriented Software Engineering: A Use Case Driven Approach. Addison-Wesley.

10. Bertrand Meyer (2013). Touch of Class: Learning to Program Well with Objects and Contracts. Springer.

11. Martin Fowler (2003). UML Distilled: A Brief Guide to the Standard Object Modeling Language. Addison-Wesley.
Course Code: UCBC0404 L T P Credit
Course Name: Introduction to Innovation, IP Management & Entrepreneurship 3 3

Course Prerequsites:
General Awareness, Innovative and Creative Mindset, Genuine interest towards startup & Business development

Course Description:

The major emphasis of the course will be on creating a learning system through which management students can
enhance their innovation and creative thinking skills, acquaint themselves with the special challenges of starting new
ventures and use IPR as an effective tool to protect their innovations and intangible assets from exploitation.

Course Outcomes:
COs Upon completion of the course, students shall have ability to

CO1 Learn to be familiar with creative and innovative thinking styles

CO2 Learn to investigate, understand and internalize the process of founding a startup

CO3 Learn to manage various types of IPR to protect competitive advantage

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 0 2 0 0 0 0 1 1 1 0 2 0 2
CO2 0 0 0 0 0 0 0 0 0 0 0 2 0 0
CO3 0 0 0 0 0 0 0 0 1 2 0 3 0 2
Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Innovation: What and Why? 7 Hours

Introduction to Innovation and Entrepreneurship: Definition of innovation and entrepreneurship, the importance of
innovation in the business world, Characteristics of successful entrepreneurs, Types of Innovation: Product
innovation, Process innovation, Business model innovation, Service innovation, Social and sustainable innovation.
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 2 Building an Innovative Organization 7 Hours

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 3 Entrepreneurship: 7 Hours

Opportunity recognition and entry strategies, Entrepreneurship as a Style of Management, Maintaining Competitive
Advantage - Use of IPR to protect Innovation.

Unit 4 Entrepreneurship- Financial Planning: 6 Hours

Financial Projections and Valuation, Stages of financing, Debt, Venture Capital and other forms of Financing,
Funding and Financing for Startups: Sources of funding for entrepreneurial ventures (bootstrapping, angel investors,
venture capital, etc.), Pitching to investors and securing funding, Managing finances for startups, Understanding the
entrepreneurship ecosystem, Support organizations for startups (incubators, accelerators, etc.), Networking and
mentorship for entrepreneurs.

Unit 5 Intellectual Property Rights (IPR) 7 Hours

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

• IPR in India – Genesis and Development
• International Context
• Concept of IP Management, Use in marketing

Unit 6 Types of Intellectual Property 8 Hours

• 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?
Class Discussion- Major Court battles regarding violation of patents between corporate companies

Text Books:
1. Joe Tidd, John Bessant (2012). Managing Innovation: Integrating Technological, Market and Organizational
Change. Wiley
2. Case Study Materials: To be distributed for class discussion
Reference Books:

1. Hisrich, Robert D., Peters, Michael P., Shepherd, Dean A. (2017). Entrepreneurship. Tata McGraw-Hill Education.

2 Erich Gamma, Richard Helm, Ralph Johnson, and John M. Vlissides (1977). Design Patterns: Elements of Reusable
Object-Oriented Software. Addison-Wesley Professional Computing Series

3. Craig Larman (2005). Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and
Iterative Development. Pearson Education.

4. Simon Bennett, Steve Mc Robb and Ray Farmer (2010). Object Oriented Systems Analysis and Design Using
UML. McGraw Hill Education.

5. Serge Abiteboul, Richard Hull and Victor Vianu (1994). Foundations of Databases. Pearson Education, Inc-
Addison-Wesley

6.Andrew S. Tanenbaum (2015). Modern Operating Systems. Pearson Education International.

7.Maurice J. Bach.(2015). Design of the Unix Operating Systems. Pearson Education India.

8. Norman E Fenton and Shari Lawrence Pfleeger (1996). Software Metrics: A Rigorous and Practical Approach.
Cengage Learning.

9. Bertrand Meyer (1997). Object-Oriented Software Construction. Prentice Hall.

10. Ivar Jacobson (1992). Object Oriented Software Engineering: A Use Case Driven Approach. Addison-Wesley.

11. Bertrand Meyer (2013). Touch of Class: Learning to Program Well with Objects and Contracts. Springer.

12. Martin Fowler (2003). UML Distilled: A Brief Guide to the Standard Object Modeling Language. Addison-Wesley.
Course Code: UCBC0405 L T P Credit
Course Name: Business Communication & Value Science –III 2 2

Course Prerequsites:
Basic Knowledge of English (verbal and written)

Course Description:
This course will help students to understand oneself, be motivated, understand and apply various aspects of cross-
cultural communication, learn technical writing skills, and be a societal technocrat.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
CO1 Understand the basic principles of SWOT & life positions. II Understand

CO2 Identify & respect pluralism in cultural spaces III Apply

CO3 Understand, apply & analyze the tools of technical writing IV Analyze
CO4 Understand Artificial intelligence & recognize its impact in daily life II Understand

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 2 2
CO2 1 2 3 1 1
CO3 2 2 1 3 1 3
CO4 1 1 3 1 3

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, GD, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, GD, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Principles of SWOT and life positions 4 Hours
Understanding SWOT, Applications of SWOT, SWOT Vs. TOWS

Unit 2 Motivation in real life 4 Hours

Maslow’s theory - Recognize how motivation helps real life - Leverage motivation in real-life scenarios, stories,
videos

Unit 3 Pluralism in cultural spaces 6 Hours

Awareness and respect for pluralism in cultural spaces
Concepts and differences between global, glocal and translocational culture
Cross-cultural communication (Verbal and non-verbal communication): Implications, common mistakes made in
cross-cultural communication, Gender awareness
Unit 4 Role of science in nation building 4 Hours
Introduction to role of science in nation building- discussion through Augmented Reality, role of science post-
independence

Unit 5 Introduction to technical writing: Technical report writing 6 Hours

Importance of reports, objectives, characteristics
Types/categories, formats (Manuscript, memo, letter)
Structure/elements of manuscript reports
Report writing and presentation in teams with the help of ICT tools

Unit 6 Recognize the importance of AI 4 Hours

AI in Everyday Life
Communicating with machines
Ted talk videos

Web References:
1. Examples of Technical Writing for Students: https://freelance-writing.lovetoknow.com/kinds-technical-writing

2. Skills of a Good Technical Writer

https://clickhelp.com/clickhelp-technical-writing-blog/11-skills-of-a-good-technical-writer/

3. Benefits and challenges of cultural diversity in the workplace:

https://www.hult.edu/blog/benefits-challenges-cultural-diversity-workplace/

Online Resources:
1. https://youtu.be/CsaTslhSDI

2. https://m.youtube.com/watch?feature=youtu.be&v=IIKvV8_T95M

3. https://m.youtube.com/watch?feature=youtu.be&v=e80BbX05D7Y

4. https://m.youtube.com/watch?v=dT_D68RJ5T8&feature=youtu.be
Course Code: UCBC0406 L T P Credit
Course Name: Business Strategy 3 0 0 3

Course Prerequsites:
Fundamentals of Management

Course Description:
This course enables the learners to understand new forms of Strategic Management concepts and their use in
business. The course helps the students understand the internal and external environments of firms and prepare a
competitive strategy for industry attractiveness. The syllabus emphasises corporate strategy and its implementation.
In addition, the learners will also be acquainted with recent developments and trends in the business world.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
demonstrate the fundamental concepts of strategic management to analyze
CO1 II Understand
business situations and apply these concepts to solve business problems.
understand the fundamental principles of and interrelationships among business
CO2 functions such as: R&D, production, marketing, finance, HR and information II Understand
technology
discover the inter-relationships of business to individuals, other organizations,
CO3 IV Analyze
government and society.

analyze complex, unstructured qualitative and quantitative problems using

CO4 IV Analyze
appropriate tools.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 0 0 2 2 2 3
CO2 2 2 2 2 3
CO3 2 2 2 2 3
CO4 2 2 2 3

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Introduction to Strategic Management 5 Hours
Importance of Strategic Management, Vision and Objectives, Schools of thought in Strategic Management, Strategy
Content, Process, and Practice, Fit Concept and Configuration Perspective in Strategic Management

Unit 2 Internal Environment of Firm- Recognizing a Firm’s Intellectual Assets 8 Hours

Core Competence as the Root of Competitive Advantage, Sources of Sustained Competitive Advantage, Business
Processes and Capabilities-based Approach to Strategy.
Unit 3 External Environments of Firm- Competitive Strategy 8 Hours
Five Forces of Industry Attractiveness that Shape Strategy, The concept of Strategic Groups, and Industry Life Cycle,
Generic Strategies, Generic Strategies and the Value Chain.

Unit 4 Corporate Strategy, and Growth Strategies 6 Hours

The Motive for Diversification, Related and Unrelated Diversification, Business Portfolio Analysis, Expansion,
Integration and Diversification, Strategic Alliances, Joint Ventures, and Mergers & Acquisitions.

Unit 5 Strategy Implementation: Structure and Systems 5 Hours

The 7S Framework, Strategic Control and Corporate Governance.

Unit 6 Emerging Strategic Trends 8 Hours

Business Process Outsourcing and Knowledge Process Outsourcing in India: Concept and Strategies. Start-up
Business Strategies and Make in India Model: Process of business start ups and its Challenges, Growth Prospects and
government initiatives in Make in India Model with reference to National manufacturing.

Text Books:
1. Robert M. Grant (2012). Contemporary Strategic Management. Blackwell.

Reference Books:
1. M.E. Porter (1980). Competitive Strategy: Techniques for Analyzing Industries and Competitors. New York: Free
Press
2. M.E. Porter (1985). Competitive Advantage: Creating and Sustaining Superior Performance. New York: Free Press

3. Rumelt (2017). Good Strategy Bad Strategy: The Difference and Why It Matters. Profile Books-Main edition

4. Sukul Lomash and P.K Mishra (2003). Business Policy and Strategic Management.Vikas Publishing House
Pvt. Ltd, New Delhi
3. Vincent P. Heuring and Harry F. Jordan (1996). Computer System Design and Architecture.
‎Pearson Education India.
Course Code: UCBC0407 L T P Credit
Course Name: Operations Research 2 2

Course Prerequsites:
Fundamentals of Mathematics and Basic functional areas of Engineering.

Course Description:

Operations Research is the study of Optimization techniques. OR has wide scope of applications in various fields as
it helps solve various Industry problems. The various Optimization techniques like LPP, Assignment, Sequencing,
Queing, Inventory Control will be helpful to obtain optimal solutions to various problems.

Course Outcomes:
COs Upon completion of the course, students shall have ability to Blooms Descriptor
Formulate Linear programming Model to solve Engineering and management
CO1 VI Create
problems.
Make use of Course knowledge to solve Transportation, Assignment and Project
CO2 III Apply
Management problems.

CO3 Solve Inventory related problems. III Apply

CO4 Demonstrate the knowledge of Queuing and Simulation in Engineering problems. II Understand

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 0 0 0 0 0 0 0 1 0 1 0
CO2 3 2 0 0 2 0 0 0 1 1 1 1 0 0
CO3 2 1 0 0 0 0 0 0 1 0
CO4 2 0 1 0 0 0 0 0 0 0

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
Unit 1 Introduction to OR and Linear programming problems 7 Hours
Origin of OR and its definition. Scope and Applications, Types of OR Models, Formulation of linear programming
problem (LPP), graphical method, simplex method, artificial variable technique- Big M method , concept of duality
in LPP.

Unit 2 Transportation and Assignment Model 6 Hours

TP - Formulation, Balanced & unbalanced situations, Solution methods – NWCR, least cost and VAM, test for
optimality(MODI method). AP - Examples, Definitions – decision variables, constraints, formulation, Balanced &
unbalanced situations, Solution method – Hungarian, test for optimality.
Unit 3 Network Models 5 Hours
Project definition, Concept and construction of network diagram, CPM and PERT, Determination ofcritical paths,
Estimation of Project time and its variance in PERT using statistical principles, Concept of project crashing.

Unit 4 Inventory Control: 3 Hours

Objectives of Inventory Control, Concept of inventory costs, Classification of Inventory Models, Concept of EOQ,
EOQ Model

Unit 5 Queuing Theory 4 Hours

Definitions – queue (waiting line), waiting costs, characteristics (arrival, queue, service discipline) of queuing system,
queue types (channel vs. phase). Classification of Queuing models, Kendall's notation for representing Queuing
models.

Unit 6 Simulation Methodology 3 Hours

Definition of Simulation, Advantages, Disadvantages, Applications, Components of a Simulation System, Types Of

Simulation, Discrete Event Simulation.

Text Books:
1. S.D.Sharma (2012). Operations Research. KEDAR NATH
2. Kanti Swarup, Man Mohan and P.K.Gupta (2019). Operations Research. Sultan Chand & Sons, New Delhi
3. Manohar Mahajan (2016). Operations Research. Dhanpat Rai & Sons
4. H. A.Taha (2018). Operations Research- An Introduction. Pearson.

5. D. S. Hira, P. K. Gupta (2015). Operations Research. S Chand & Co. Ltd New Delhi

Reference Books:

1. Wagner H. M.(1980). Principles of Operations Research. Prantice- Hall Of India, New Delhi.

2. F.S. Hiller and G.J. Lieberman (2005). Introduction to Operations Research. McGraw Hill.
3. A. Ravi Ravindran (2007). Operations Research and Management Science-Hand Book. CRC Press Inc.
4. Wiest & Levy (1970). Management Guide to PERT/CPM. Prentice Hall
Course Code: UCBC0408 L T P Credit
Course Name: Operating Systems Lab (Unix) 2 1

Course Prerequsites:
Fundamentals of Electronics and Computer

Course Description:
This is one of the core course of Computer Science & Engineering Programme. In this course you will become
familiar with the core concepts of OS - how OS work, how a processes & threads are created, inter-process
communication & synchronisation, the various scheduling algorithms, memory management & memory allocation
strategies, etc. This course will be also helpful for exams like GATE.

Course Outcomes: After the completion of the course the student will be able to -
Blooms
COs Upon completion of the course, students shall have ability to Descriptor
Level
Summarize the features of different operating systems and Impliment basic
CO1 III Apply
consecpts of OS
Compare algorithms for CPU scheduling, Disk Scheduling and page replacement
CO2 IV Analyse
policies.

CO3 Demonstrate and impliment Concepts on File amd I/O system III Apply

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 0 2 0 0 0 1 1 1 0 2 1 2
CO2 2 2 0 2 0 0 0 1 1 0 0 1 0 1
CO3 1 2 2 0 1 0 0 0 1 1 0 1 0 3

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation (ISE) 50% Parameter based evaluation for every assignment.
2 End Semester Evaluation (OE) 50% Parameter based evaluation for every assignment.

Course Contents:
Experiment 1: Installation and configuration of any one of the operating system (UBUNTU, CENT-
2 Hours
OS Linux etc). Execute System Calls - fork(), exit(), exec(), wait(), waitpid(), getpid(), getppid().

Experiment 2:Program to create process using Fork(). 2 Hours

Experiment 3:Evaluate performance of scheduling algorithms. a) FCFS b) SJF c) RR d) PRIORITY in

2 Hours
terms of turnaround time, response time.
Experiment 4 : Program of Multithreading . POSIX threads. pthread_create(), pthread_join(),
2 Hours
pthread_exit(), pthread_self()

Experiment 5 :Program For classical problem of Inter-Process Synchronization(IPS). 2 Hours

Experiment 6 :Write a Program For Inter Process Communication using Pipe. 2 Hours
Experiment 7:Write a Program to simulate page Replacement algorithm. a) FIFO b) LRU c) Optimal 2 Hours

Experiment 8: Program to simulate disk Scheduling Algorithm. 2 Hours

Experiment 9: Program related to shell Programming. 2 Hours

Experiment 10: Program for file allocation methods- a) continuous b) Linked c) Indexed. 2 Hours

Instructions for Students:

1) Continuous assessment shall be based on experiments performed, submission of results of program in the form of
report/journal, timely completion, attendance ,understanding, efficient codes, punctuality and neatness.

2) Practical/Oral examination shall be based on the practical’s performed in the lab.

3) Lab assessment of 25 marks shall be based on continuous assessment and performance in Practical/Oral
examination.
Text Books:
1.Abraham Silberschatz, Peter Baer Galvin, Greg Gagne (2009). Operating System Principles. Wiley India.

2.Abraham Silberschatz, Peter Baer Galvin and Greg Gagne (2010). Operating System Concepts Essentials. John
Wiley & Sons Inc.

3.Dhananjay Dhamdhere (2017). Operating Systems A Concept Based Approach. Mc-Graw Hill

Reference Books:
1.William Stallings (2012). Operating Systems: Internals and Design Principles. Pearson Education
2.Charles Patrick Crowley(2017). Operating System: A Design-oriented Approach. McGraw Hill Education
3.Milan Milenkovic (2001). Operating Systems –Concepts and design. TMGH.
4.Andrew S. Tanenbaum (2015). Modern Operating Systems. Pearson Education International.
5.Maurice J. Bach.(2015). Design of the Unix Operating Systems. Pearson Education India.
3. Manohar Mahajan (2016). Operations Research. Dhanpat Rai & Sons
4. H. A.Taha (2018). Operations Research- An Introduction. Pearson.
5. D. S. Hira, P. K. Gupta (2015). Operations Research. S Chand & Co. Ltd New Delhi

Reference Books:
1. Wagner H. M.(1980). Principles of Operations Research. Prantice- Hall Of India, New Delhi.

2. F.S. Hiller and G.J. Lieberman (2005). Introduction to Operations Research. McGraw Hill.
3. A. Ravi Ravindran (2007). Operations Research and Management Science-Hand Book. CRC Press Inc.
4. Wiest & Levy (1970). Management Guide to PERT/CPM. Prentice Hall
Course Code: UCBC0409 L T P Credit
Course Name: Database Engineering Lab 2 1

Course Prerequsites:
Basics of ER notations, Normalization and Data Structures.

Course Description:
This course to apply the basic knowledge of dbms design strategies to solve real world database applications. Also
implementing the relational daabase models using DDL and solve the functional queries using various DML
commands.

Course Outcomes:
Blooms
COs Upon completion of the course, students shall have ability to Descriptor
Level

CO1 Analyze and design ER model for a application VI Create

CO2 Create relational database model for a real world application VI Create

CO3 Solve data manipulation queries in the application by writing SQL queries. VI Create

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 2 2 3 3
CO2 2 3 3 2 1 2 2 2 2 2
CO3 2 3 3 2 1 2 2 2 2 2
CO4 2 3 2 2 2 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation (ISE) 50% Parameter based evaluation for every assignment.
2 End Semester Evaluation (POE) 50% Parameter based evaluation for every assignment.

Course Contents:

Assignment No 1 : Design ER Model and apply the normalization for a given application database. 2 Hours

Assignment No 2 : Create relational database using DDL commands and mention the necessary key
2 Hours
constraints for required attributes.

Assignment No 3 : Write SQL queries to fetch required data using basic DML commands. 2 Hours

Assignment No 4 : Write SQL queries to fetch required data using set operations. 2 Hours

Assignment No 5 : Write SQL queries to fetch required data using join operations. 2 Hours

Assignment No 6 : Write SQL queries to fetch required data using aggregate functions. 2 Hours
Assignment No 7 : Write SQL queries to fetch required data using String operations. 2 Hours

Assignment No 8 : Write SQL queries to fetch required data using nested quesries 2 Hours
Assignment No 9 : Create triggers and stored functions to perform data modification across the
2 Hours
dependent tables.
Assignment No 10 : Write SQL queries for creating views and perform the modification operations
2 Hours
on view tables.
Assignment No 11 : Create program interface with database and perform SQL opertions over the
2 Hours
database.
Instructions for Students:

1. Each practical batch will be asigned as perticular database application.

2. All the assigemnet should perfrom on the assigned database application.

List of Applications:

1. Railway Reservation System

2. Airline Management System
3. Hospital Management System
4. Examination Management System
5. KIT Bus Service System

Text Books:
1. Abraham Silberschatz, S. Sudarshan and Henry F. Korth (2019). Database System Concepts. McGraw-Hill.
2. E. F. Codd (1990). The relational model for database management. Addison-Wesley Longman Publishing Co.

Reference Books:
1. Alfred V. Aho and J. D. Ullman (1988). Principles of Database and Knowledge – Base Systems. Computer
Science Press
2. R. Elmasri and S. Navathe (2011). Fundamentals of Database Systems. Pearson Education, Inc-Addison-Wesley
3. Serge Abiteboul, Richard Hull and Victor Vianu (1994). Foundations of Databases. Pearson Education, Inc-
Addison-Wesley
2. F.S. Hiller and G.J. Lieberman (2005). Introduction to Operations Research. McGraw Hill.
3. A. Ravi Ravindran (2007). Operations Research and Management Science-Hand Book. CRC Press Inc.
4. Wiest & Levy (1970). Management Guide to PERT/CPM. Prentice Hall
Course Code: UCBC0410 L T P Credit
Course Name: Business Communication and Value Science-II (Practical) - 2 1

Course Prerequsites:
Business Communication and Value Science-III Theory

Course Description:
This course will help students to understand oneself, be motivated, understand and apply various aspects of cross-
cultural communication, learn technical writing skills, and be a societal technocrat.

Course Outcomes: After the completion of the course the student will be able to -

CO After the completion of the course the student should be able to

Blooms Level Descriptor
CO1 Apply & analyze the basic principles of SWOT & life positions. III Apply

CO2 Apply the concepts of Global, glocal and translocational III Apply

CO3 Analyze cross cultural communication IV Analyze

CO4 Apply the science of Nation building III Apply

CO5 Analyze the social issues around and provide solutions IV Analyze

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 2 2
CO2 1 2 3 1 1
CO3 2 2 1 3 1 3
CO4 1 1 3 1 3
CO5 1 2 2 1 2

Assessment Scheme:
SN Assessment Weightage Remark

ISE: ISE is based on practical performance/ Quiz/

1 In Semester Evaluation 1 (ISE1)- (25 marks)
100% Presentation/ Group Discussion/Role
plays/Assignments/Demonstration, etc.

Course Contents
Practical No. Practical Title and Contents Hours
Applying SWOT in real life scenarios: Create your SWOT, SWOT Vs. TOWS-
The Balancing Act- Ted talk on biomimicry
1 Turning your threat into opportunity-two people mutually identifying 2
opportunities from each other's threats.
 Presentation: on the strengths identified during SWOT to survive in the VUCA
2 World. 2
Group presentations of 10 mins each.
Leverage motivation in real-life scenarios: recognize how motivation helps in
real life. Scenario based activity on identifying and leveraging motivation
3 2
Presenting findings and approaches as groups
They need to explain the idea of motivation with the help of examples

Learn and Exchange: Group activity in which participants need to learn the
following four greetings of a state (different from their own) and exchange it
4 with another group: (Indicative only): “Good 2
morning/afternoon/evening/night”, "please", "thank you", "you're welcome"
and "I'm sorry"
Debate: on Global, glocal, tanslocational impacts (topics to be decided by the
5 faculty or suggested by the students) 2
Culture shock: Group activity to perform skits based on situations
Gender awareness campaign: Groups to present the detailed plan of Gender
6 awareness campaigns with four different themes: College, Workplace, Family, 2
Friends
7 Group presentations: on eminent scientists and mathematicians of ancient India. 2

“Voice of the Future” Activity

How will a voice assistant evolve in 25 years from now? Each group will
(+4
present a skit.
hours
Design your college in the year 2090
8 2 home
AI in Everyday Life
activit
Discussion in groups on given topics and then cross sharing of discussion
y)
points amongst the groups.
Debate- Will machines control us in future?
Visit to rural area/ underprivileged parts of city to address some of the local
9 issues; 2
if relevant, suggest a practical technology solution to the issues
10 Group presentations on the above issues and solutions 2

Web References:
1. Examples of Technical Writing for Students: https://freelance-writing.lovetoknow.com/kinds-technical-
writing
2. Skills of a Good Technical Writer
https://clickhelp.com/clickhelp-technical-writing-blog/11-skills-of-a-good-technical-writer/

3. Benefits and challenges of cultural diversity in the workplace:

https://www.hult.edu/blog/benefits-challenges-cultural-diversity-workplace/
Online Resources:
1. https://youtu.be/CsaTslhSDI

2. https://m.youtube.com/watch?feature=youtu.be&v=IIKvV8_T95M
3. https://m.youtube.com/watch?feature=youtu.be&v=e80BbX05D7Y
4. https://m.youtube.com/watch?v=dT_D68RJ5T8&feature=youtu.be
1. Abraham Silberschatz, S. Sudarshan and Henry F. Korth (2019). Database System Concepts. McGraw-Hill.
2. E. F. Codd (1990). The relational model for database management. Addison-Wesley Longman Publishing Co.

Reference Books:
1. Alfred V. Aho and J. D. Ullman (1988). Principles of Database and Knowledge – Base Systems. Computer
Science Press
2. R. Elmasri and S. Navathe (2011). Fundamentals of Database Systems. Pearson Education, Inc-Addison-Wesley
3. Serge Abiteboul, Richard Hull and Victor Vianu (1994). Foundations of Databases. Pearson Education, Inc-
Addison-Wesley
2. F.S. Hiller and G.J. Lieberman (2005). Introduction to Operations Research. McGraw Hill.
3. A. Ravi Ravindran (2007). Operations Research and Management Science-Hand Book. CRC Press Inc.
4. Wiest & Levy (1970). Management Guide to PERT/CPM. Prentice Hall