IV SEMESTER

CSE

Dept. of Computer Science and Engineering, UVCE Page 32

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18BSEM401

Category Basic Sciences
Course title Engineering Mathematics-IV
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
2 2 0 0 3
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
This course will enable all students to
1. To understand range of analytic functions and concerned results.
2. Understand and find Taylor series and determine their intervals of convergence.
3. Solve an algebraic or transcendental equation using an appropriate numerical method.
4. Solve boundary value problems using the finite difference method.
5. Being aware of exact, approximate and numerical methods to solve the resulting
equations.

UNIT I: 09 Hours
Sets in a complex plane - Functions of a complex variables. Limit, Continuity and
differentiability (definitions only). Analytic function - Riemann equations in Cartesian and
polar forms. Harmonic functions, Constructions of analytic functions (Cartesian and polar
forms). Line integral - -
function and for derivatives, Conformal transformations: and .
Bilinear transformations.

UNIT II: 09 Hours

(Statements only) Singularities. Poles Calculation of residues. Residue theorem (without

proof) problems. Evaluation of Contour integrals.

UNIT III: 10 Hours

Numerical solution of algebraic and transcendental equations-solution by Bisection,
Ramanujan method, linear iteration and Newton-Raphson methods. Solution of linear
simultaneous equations: Gauss elimination method, Gauss Jordan method, Gauss Seidel
methods, LU decomposition method, methods of Crout, Doolittle and Cholesky.

UNIT IV: 10 Hours

Finite differences (Forward and backward differences), Interpolation, Newtons forward and
backward interpolation formulae, Central difference formulae: stirlings and Bessels formula.
Interpolation with unequal spaced points: Lagarange interpolation formula, and inverse
interpolation formulae. Divided differences and their properties: Newtons general interpolation

Dept. of Computer Science and Engineering, UVCE Page 33

formula. Interpolation by iteration, Numerical differentiation using Newtons forward and
backward interpolation formulae, Numerical integration: Trapezoidal method, Simpson 1/3
rule Simpons3/8th rule.

UNIT V: 10 Hours

second and fourth order, Predictor and corrector methods Adams Bashforth method,
Adams-Moultons method.

TEXT BOOKS:

1. B. S. Grewal, "Higher Engineering Mathematics", Khanna publishers, 42nd edition,

2013.
2. E. Kreyszig, "Advanced Engineering Mathematics" - Wiley, 2013.

REFERENCE BOOKS:

1. B.V. Ramana "Higher Engineering Mathematics" Tata Mc Graw-Hill, 2006

2. N P Bali and M. Goyal, "A text book of Engineering mathematics", Laxmi publications,
latest edition.
3. H. K Dass and Er. Rajnish Verma, "Higher Engineering Mathematics", S. Chand
publishing, 1st edition, 2011.
4. S. S. Sastry, Introductory methods of Numerical Analysis, 3 rd edition, Prentice-Hall
India.
5. M. K. Jain, S. R. K. Iyengar, R. K. Jain, Numerical methods for scientific and
Engineering computation, New Age international Publishers.

COURSE OUTCOMES:

The students at the end of the course, will be able to

CO1:
integral formula.
CO2: Express the length of a curve as a (Riemann) sum of linear segments, convert to definite
integral form and compute its value.
CO3: Approximate a function using an appropriate numerical method.
CO4: Solve boundary value problems using the finite difference method.
CO5: Being aware of exact, approximate and numerical methods to solve the resulting
equations.

Dept. of Computer Science and Engineering, UVCE Page 34

SCHEME OF EXAMINATION:

Quiz I
Test I (Any Three Units) - 20 Marks 25 Marks
CIE 50 5 Marks Total: 50
Marks Test II (Remaining Two Units) - 20 Quiz II Marks
25 Marks
Marks 5 Marks
Q1 (Compulsory): MCQs or Short answer type
15 Marks
questions for 15 Marks covering entire syllabus.
SEE 100 Q2 & Q3 from Units which have 09 Hours are 17 * 2 = Total: 100
Marks compulsory. 34 Marks Marks
Q4 or Q5, Q6 or Q7 and Q8 or Q9 from Units 17 * 3 =
which have 10 Hours shall have Internal Choice. 51 Marks

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 35

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18CIPC402

Category Engineering Science Courses : Professional Core
Course title FINITE AUTOMATA AND FORMAL LANGUAGES THEORY
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
4 0 0 0 4
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
The course will enable the students to
1. Design Deterministic finite automata, Nondeterministic finite automata, conversion of
NFA to DFA, design of E- NFA and regular expressions.
2. Obtain minimized DFA and convert automata to regular expressions and regular
expression to automata and proving languages are not regular.
3. Writing Construction of parse trees, understand ambiguity in grammars,
designing problems on Pushdown Automata.
4. Conversion of grammar to Chomsky Normal Form, Greibach normal form and
conversion of grammar to PDA. Prove that languages are not context free using
pumping lemma.
5. Designing turing machines, understanding the working of turing machines and solving
post correspondence problems.

UNIT I: INTRODUCTION TO FINITE AUTOMATA 10 Hours

The central concepts of Automata theory; Deterministic finite automata; Nondeterministic
finite automata An application of finite automata; Finite automata with Epsilon transitions;
Regular expressions.

UNIT II: REGULAR EXPRESSIONS & REGULAR LANGUAGES 10 Hours

Finite Automata and Regular Expressions; Applications of Regular Expressions. Regular
languages; Proving languages not to be regular languages; Closure properties of regular
languages; Decision properties of regular languages; Equivalence and minimization of
automata.

UNIT III: CONTEXT-FREE GRAMMARS AND LANGUAGES, PUSH DOWN

AUTOMATA 10 Hours
Context free grammars; Parse trees; Applications; Ambiguity in grammars and Languages.
Definition of the Pushdown automata; The languages of a PDA.

UNIT IV: PROPERTIES OF CONTEXT-FREE LANGUAGES 09 Hours

Dept. of Computer Science and Engineering, UVCE Page 36

CFGs; The pumping lemma for CFGs; Closure properties of CFLs.

UNIT V: TURING MACHINE & UNDECIDABILITY 09 Hours

The Turing machine; Programming techniques for Turing Machines; Extensions to the basic
Turing Machines; A Language that is not recursively enumerable; An Undecidable problem

TEXT BOOKS:

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata

Theory, Languages and Computation, 3rd Edition, Pearson education, 2007.

REFERENCE BOOKS:

1. Raymond Greenlaw, H.James Hoover: Fundamentals of the Theory of Computation,

Principles and Practice, Morgan Kaufmann, 1998.
2. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata
McGraw-Hill, 2007.
3. Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley & Sons,
2004.
4. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science, Languages
and Machines, 3rd Edition, Pearson Education, 2006.

e-BOOKS/ONLINE RESORCES:

1. Foundations of Computation-CAROL CRITCHLOW, DAVID ECK.

MOOCs:

1. www.nptel/videos.in/2012/11/theory-of-computation.html.
2. nptel.ac.in/courses/106104028/theory of computation.

COURSE OUTCOMES:

The students at the end of the course, will be able to

CO1: Design finite automata and NFA for given languages.
CO2: Write regular expressions for given languages and properties of regular languages.
CO3: Convert finite automata to regular expressions and vice versa.
CO4: Design context free grammar for specified language and Design Push Down
Automata.
CO5: Analyze Turing Machine and undecidability problem.

Dept. of Computer Science and Engineering, UVCE Page 37

SCHEME OF EXAMINATION:

Quiz I
Test I (Any Three Units) - 20 Marks 25 Marks
CIE 50 5 Marks Total: 50
Marks Test II (Remaining Two Units) - 20 Quiz II Marks
25 Marks
Marks 5 Marks
Q1 (Compulsory): MCQs or Short answer type
15 Marks
questions for 15 Marks covering entire syllabus.
SEE 100 Q2 & Q3 from Units which have 09 Hours are 17 * 2 = Total: 100
Marks compulsory. 34 Marks Marks
Q4 or Q5, Q6 or Q7 and Q8 or Q9 from Units 17 * 3 =
which have 10 Hours shall have Internal Choice. 51 Marks

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 38

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18CIPC403

Category Engineering Science Courses : Professional Core
Course title DESIGN AND ANALYSIS OF ALGORITHMS THEORY
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
2 2 0 0 3
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
The course will enable the students to
1. Understand the importance of algorithm and need for finding the time complexity of
an algorithm.
2. Learn the algorithms under Brute force, Divide and Conquer, Greedy and Dynamic
programming concepts.
3. Compute the time complexity of various algorithmic techniques.
4. Acquire the Knowledge of P, NP and NP Hard problems.
5. Learn to apply the algorithmic techniques to real world problems.

UNIT I: INTRODUCTION 09 Hours

The Notion of Algorithm, Fundamentals of algorithmic Problem Solving. The Analysis of
Framework. Asymptotic Notations and Standard Efficiency Classes. Mathematical analysis
of Non-Recursive Algorithms. Mathematical Analysis of recursive algorithms. An Example:
the Fibonacci Numbers. Empirical Analysis of Algorithms. Algorithm Visualization.

UNIT II: BRUTE FORCE AND DECREASE & CONQUER 10 Hours

Brute-Force: Selection Sort and Bubble Sort. Sequential Search and Brute-Force String
Matching. Closest-Pair and Convex-Hull Problems by Brute Force. Exhaustive Search. Depth
First Search (DFS), Breadth First Search (BFS), Applications of DFS and BFS, Decrease and
conquer: Insertion Sort, Topological Sort, Generating Permutations, Binary search, Computing
Median and the Selection problem.

UNIT III: DIVIDE & CONQUER AND TRANSFORM & CONQUER 10 Hours
Divide-and-Conquer: Mergesort. Quicksort. Binary Tree Traversals and Related Properties.
Multiplication of Large Integers and Strassen's Matrix Multiplication. Transform and Conquer:
Presorting and its Applications, Balanced Search Trees, Heaps and Heap sort. rule
and Binary exponentiation, Space & Time Tradeoff: Horspool string matching algorithm,
Btrees.

Dept. of Computer Science and Engineering, UVCE Page 39

UNIT IV: DYNAMIC PROGRAMMING AND GREEDY TECHNIQUES 10 Hours
Dynamic Programming: Basic examples, The Knapsack Problem and Memory Functions
Binomial Coefficients, Optimal Binary Search Trees, Warshall's and Floyd's Algorithms
Greedy Approach: Prim's Algorithm. Kruskal's Algorithm. Dijkstra's Algorithm. Huffman
Trees.

UNIT V: COPING WITH LIMITATIONS OF ALGORITHM POWER 09 Hours

Backtracking: n-Queens Problem, Subset-Sum Problem, Branch-and-Bound: Travelling
Salesman problem, Knapsack Problem, Approximation Algorithms for NP hard problems,
Limitations of Algorithm Power: Decision Trees, P, NP, and NP-Complete Problems.

TEXT BOOKS:

1. Introduction to the Design and Analysis of Algorithms, by Anany Levitin, Pearson

Education, Third Edition, 2014.
2. Computer Algorithms, by Horowitz E., Sahani S., Rajasekharan S., Galgotia
Publications, 2001.

REFERENCE BOOKS:

1. Introduction to Algorithms, Cormen T.H, Leiserson C. E, Rivest R.L, Stein C, 3rd

Edition, PHI 2010.
2. Data Structures and Algorithm Analysis in C++, by Mark Allen Weiss, Pearson
Education, 4th edition, 2012.
3. Data Structures - Seymour Lipschutz, Schaum's Outlines, Revised 1st edition, McGraw
Hill, 2014.

e-BOOKS/ONLINE RESOURCES:

1. https://india.oup.com/product/design-and-analysis-of-algorithms-9780198093695.
2. https://www.pdfdrive.com/design-and-analysis-of-algorithms-books.html.

MOOCs:

1. https://nptel.ac.in/courses/106106093/35.
2. https://eu.udacity.com/course/intro-to-algorithms--cs215.
3. https://www.edx.org/course/algorithms-data-structures-microsoft-dev285x-1.
4. https://visualgo.net/en.
5. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-
design-and-analysis-of-algorithms-spring-2015/.

COURSE OUTCOMES:

The students at the end of the course, will be able to

CO1: Acquire the knowledge on fundamentals of algorithmic design steps, analyse concepts
and types of algorithm design techniques.
CO2: Understand and analyze the design of algorithms using Brute force, Divide & Conquer,

Dept. of Computer Science and Engineering, UVCE Page 40

 Decrease & Conquer, Transform & conquer, Dynamic Programming, Greedy
technique, Backtracking, Branch & Bound techniques.
CO3: Assess the performance and correctness of algorithms.
CO4: Design and Implement efficient algorithms by applying appropriate design techniques
for solving real world problems.
CO5: Design solutions for various engineering applications using appropriate algorithms.

SCHEME OF EXAMINATION:

Quiz I
Test I (Any Three Units) - 20 Marks 25 Marks
CIE 50 5 Marks Total: 50
Marks Test II (Remaining Two Units) - 20 Quiz II Marks
25 Marks
Marks 5 Marks
Q1 (Compulsory): MCQs or Short answer type
15 Marks
questions for 15 Marks covering entire syllabus.
SEE 100 Q2 & Q3 from Units which have 09 Hours are 17 * 2 = Total: 100
Marks compulsory. 34 Marks Marks
Q4 or Q5, Q6 or Q7 and Q8 or Q9 from Units 17 * 3 =
which have 10 Hours shall have Internal Choice. 51 Marks

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 41

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18CIPC404

Category Engineering Science Courses : Professional Core
Course title MICROPROCESSOR AND MICROCONTROLLER THEORY
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
2 2 0 0 3
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
This course will enable students to
1. Make familiar with importance and applications of microprocessors and
microcontrollers.
2. Discuss 8086 Microprocessor Instruction set.
3. Understand the working of 8255 Programmable Peripheral Interface.
4. Expose architecture of 8086 microprocessor and ARM processor.
5. Familiarize instruction set of ARM processor.

UNIT I: INTRODUCTION TO MICROPROCESSOR 10 Hours

The x86 microprocessor: Brief history of the x86 family, Inside the 8088/86, Introduction to
assembly programming, Introduction to Program Segments, The Stack, Flag register, x86
Addressing Modes. Assembly language programming: Directives & a Sample Program,
Assemble, Link & Run a program, More Sample programs, Control Transfer Instructions, Data
Types and Data Definition, Full Segment Definition, Flowcharts and Pseudo code.

UNIT II: 8086 MICROPROCESSOR INSTRUCTION SET 10 Hours

x86: Instructions sets description, Arithmetic and logic instructions and programs: Unsigned
Addition and Subtraction, Unsigned Multiplication and Division, Logic Instructions, BCD and
ASCII conversion, Rotate Instructions. INT 21H and INT 10H Programming: BIOS INT 10H
Programming, DOS Interrupt 21H. 8088/86 Interrupts, x86 PC and Interrupt Assignment.

UNIT III: 8255 PROGRAMMABLE PERIPHERAL INTERFACE 09 Hours

8255 Pin descriptions, Architecture, Control register, Mode 0, Mode 1 and Mode 2 Operations,
Interfacing of DAC and ADC to 8086 in Mode 0 only. 8255 I/O programming: I/O addresses
Programmable timer, pin
functions, architecture, Mode 0, 1, 2, 3, 4, and 5 operations, Programs for monostable and
astable operations.

UNIT IV: INTRODUCTION TO MICROCONTROLLER 10 Hours

Microprocessors versus Microcontrollers, ARM Embedded Systems: The RISC design
philosophy, The ARM Design Philosophy, Embedded System Hardware, Embedded System
Software, ARM Processor Fundamentals: Registers, Current Program Status Register, Pipeline,
Exceptions, Interrupts, and the Vector Table, Core Extensions.
Dept. of Computer Science and Engineering, UVCE Page 42
UNIT V: ARM INSTRUCTION SET 09 Hours
Introduction to the ARM Instruction Set: Data Processing Instructions, Branch Instructions,
Software Interrupt Instructions, Program Status Register Instructions, Coprocessor
Instructions, Loading Constants, Simple programming exercises.

TEXT BOOKS:

1. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Danny Causey, The x86 PC Assembly
Language Design and Interfacing, 5th Edition, Pearson, 2013.
2. Andrew N Sloss, Dominic Symes and Chris Wright, ARM System Developers Guide,
Elsevier, Morgan Kaufman publishers, 2008.

REFERENCE BOOKS:

1. Venugopal K R and Rajkumar, Microprocessor x86 Programming, BPB Publications,

New Delhi, 2017.
2. K M Bhurchandi and AK Ray, Advanced Microprocessors and Peripherals, 3rd Edition,
McGraw Hill, 2017.
3. Douglas V. Hall, Microprocessors and Interfacing, Revised 2nd Edition, Tata McGraw
Hill, 2006.
4. K. Udaya Kumar and B.S. Umashankar, Advanced Microprocessors & IBM-PC
Assembly Language Programming, Tata McGraw Hill, 2003.

e-BOOKS/ONLINE RESOURCES:

1. Microprocessor, https://lecturenotes.in/subject/21/microprocessor-mp.
2. https://www.smartzworld.com/notes/microprocessors-and-microcontrollers-mpmc/.
3. https://easyengineering.net/microprocessor-and-microcontroller-system-by-godse/.

MOOCs:

1. Microprocessors and Microcontrollers - NPTEL - PDF Drive,

https://www.pdfdrive.com/microprocessors-and-microcontrollers-nptel-
e17318114.html

COURSE OUTCOMES:
The students at the end of the course, will be able to
CO1: Differentiate between microprocessors and microcontrollers.
CO2: Design and develop assembly language code to solve problems using 8086
microprocessors.
CO3: Gain the knowledge for interfacing various devices to x86 family and ARM processor.
CO4: Demonstrate the design of interrupt routines for interfacing devices.
CO5: Apply the instructions of ARM processor to develop applications.

Dept. of Computer Science and Engineering, UVCE Page 43

SCHEME OF EXAMINATION:

Quiz I
Test I (Any Three Units) - 20 Marks 25 Marks
CIE 50 5 Marks Total: 50
Marks Test II (Remaining Two Units) - 20 Quiz II Marks
25 Marks
Marks 5 Marks
Q1 (Compulsory): MCQs or Short answer type
15 Marks
questions for 15 Marks covering entire syllabus.
SEE 100 Q2 & Q3 from Units which have 09 Hours are 17 * 2 = Total: 100
Marks compulsory. 34 Marks Marks
Q4 or Q5, Q6 or Q7 and Q8 or Q9 from Units 17 * 3 =
which have 10 Hours shall have Internal Choice. 51 Marks

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 44

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18CIPC405

Category Engineering Science Courses: Professional Core
Course title OPERATING SYSTEMS - THEORY
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
2 2 0 0 3
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
The course will enable the students to
1. Understand the Operating System Structure, System Call, Virtual Machines.
2. Demonstrate the process inter process communication and process states.
3. Analyze the various process synchronization algorithms and solve classical problems.
4. Identify presence of deadlock in the system and recover from deadlock.
5. Design File System and Evaluate the various secondary device and scheduling
algorithm for secondary devices.

UNIT I: INTRODUCTION TO OPERATING SYSTEMS 10 Hours

System structures: What operating systems do; Computer System organization; Computer
System architecture; Operating System structure; Operating System operations; Process
management; Memory management; Storage management; Protection and Security;
Distributed system; Special-purpose systems; Computing environments. Operating System
Services; User - Operating System interface; System calls; Types of system calls; System
programs; Virtual machines; Operating System generation; System boot. Process Management
Process concept; Process scheduling; Operations on processes; Inter process communication.

UNIT II: MULTI-THREADED PROGRAMMING 09 Hours

Overview; Multithreading models; Thread Libraries; Threading issues. Process Scheduling:
Basic concepts; Scheduling Criteria; Scheduling Algorithms; Multiple-processor scheduling;
Thread scheduling. Process Synchronization: Synchronization: The critical section problem;
; Semaphores; Classical problems of
synchronization; Monitors

UNIT III: DEADLOCKS 10 Hours

Deadlocks; System model; Deadlock characterization; Methods for handling deadlocks;
Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
Memory Management: Memory management strategies: Background; Swapping; Contiguous
memory allocation; Paging; Structure of page table; Segmentation.

Dept. of Computer Science and Engineering, UVCE Page 45

UNIT IV: VIRTUAL MEMORY MANAGEMENT 09 Hours
Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames;
Thrashing. File System, Implementation of File System: File system: File concept; Access
methods; Directory structure; File system mounting; File sharing; Protection: Implementing
File system: File system structure; File system implementation; Directory implementation;
Allocation methods; Free space management.

UNIT V: SECONDARY STORAGE STRUCTURES, PROTECTION 10 Hours

Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management;
Swap space management. Protection: Goals of protection, Principles of protection, Domain of
protection, Access matrix, Implementation of access matrix, Access control, Revocation of
access rights, Capability- Based systems. Case Study: The Linux Operating System: Linux
history; Design principles; Kernel modules; Process management; Scheduling; Memory
Management; File systems, Input and output; Inter-process communication.

TEXT BOOKS:

1.
Wiley Global Education, 2012.

REFERENCE BOOKS:

1. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th
Edition.
2. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw
Hill, 2013.
3. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition,
PHI (EEE), 2014.
4. William Stallings Operating Systems: Internals and Design Principles, 6th Edition,
Pearson. 2014.

e-BOOKS/ONLINE RESOURCES:

1. Operating Systems Study Guide by Tim Bower

2. Lecture Notes on Operating Systems by Mythili Vutukuru
3. Schaum's Outline of Operating Systems (Schaum's Outline Series) by J. Archer Harris.

MOOCs:

1. http://onlinevideolecture.com/?course=computer-science&subject=operating-systems.
2. http://www.nptel.ac.in/courses/106108101/.

COURSE OUTCOMES:

The students at the end of the course, will be able to

CO1: Describe features, types and design considerations of modern operating system.
CO2: Analyze & Apply the various process scheduling algorithms.
Dept. of Computer Science and Engineering, UVCE Page 46
CO3: Illustrate the concepts of synchronization and handle Deadlocks.
CO4: Explain memory management strategies and analyze various page replacement
Algorithms.
CO5: Describe the design considerations of file system and compare various disk
scheduling algorithms.

SCHEME OF EXAMINATION:

Quiz I
Test I (Any Three Units) - 20 Marks 25 Marks
CIE 50 5 Marks Total: 50
Marks Test II (Remaining Two Units) - 20 Quiz II Marks
25 Marks
Marks 5 Marks
Q1 (Compulsory): MCQs or Short answer type
15 Marks
questions for 15 Marks covering entire syllabus.
SEE 100 Q2 & Q3 from Units which have 09 Hours are 17 * 2 = Total: 100
Marks compulsory. 34 Marks Marks
Q4 or Q5, Q6 or Q7 and Q8 or Q9 from Units 17 * 3 =
which have 10 Hours shall have Internal Choice. 51 Marks

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 47

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18CIPC406

Category Engineering Science Courses : Professional Core
Course title SOFTWARE ENGINEERING THEORY
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
4 0 0 0 4
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
The course will enable the students to
1. Understand the various professional and ethical issues.
2. Learn the concept of software engineering process.
3. Gain knowledge in the project management.
4. Understand the software design methodology.
5. Analyse the verification process.

UNIT I: INTRODUCTION 09 Hours

Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-
Technical systems: Emergent system properties; Systems engineering; Organizations, people
and computer systems; Legacy systems.

UNIT II: CRITICAL SYSTEMS, SOFTWARE PROCESSES 09 Hours

Critical Systems: A simple safety- critical system; System dependability; Availability and
reliability. Software Processes: Models, Process iteration, Process activities; The Rational
Unified Process; Computer Aided Software Engineering.

UNIT III: REQUIREMENTS 10 Hours

Software Requirements: Functional and Non-functional requirements; User requirements;
System requirements; Interface specification; The software requirements document.
Requirements Engineering Processes: Feasibility studies; Requirements elicitation and
analysis; Requirements validation; Requirements management. System models, project
management System Models: Context models; behavioural models; Data models; Object
models; Structured methods. Project Management: Management activities; Project planning;
Project scheduling; Risk management.

UNIT IV: SOFTWARE DESIGN 10 Hours

Architectural Design: Architectural design decisions; System organization; Modular
decomposition styles; Control styles. Object-Oriented design: Objects and Object Classes; An
Object-Oriented design process; Design evolution.

Dept. of Computer Science and Engineering, UVCE Page 48

UNIT V: DEVELOPMENT 10 hours
Rapid Software Development: Agile methods; Extreme programming; Rapid application
development. Software Evolution: Program evolution dynamics; Software maintenance;
Evolution processes; Legacy system evolution. Verification and validation Verification and
Validation: Planning; Software inspections; Automated static analysis; Verification and formal
methods. Software testing: System testing; Component testing; Test case design; Test
automation. Management Managing People: Selecting staff; Motivating people; Managing
people; The People Capability Maturity Model. Software Cost Estimation: Productivity;
Estimation techniques; Algorithmic cost modelling, Project duration and staffing.

TEXT BOOKS:

1.

2.

REFERENCE BOOKS:

1.
Edition 2019.
2. Mohammad Ali Shaik Software Engineering with UML : Designed to Promote
Student Learning
3. Rajib Mall, Fundamentals of Software
Fourth Edition, 2018.

e-BOOKS/ONLINE RESOURCES:

1. https://nptel.ac.in/courses/106105087/pdf/m02L03.pdf

MOOCs:

1. https://www.mooc-list.com/tags/software-engineering

2. https://www.edx.org/learn/software-engineering

COURSE OUTCOMES:

The students at the end of the course, will be able to

CO1: Identify the process, services and delivery models in software engineering.
CO2: Employ the concept of project management.
CO3: Extend the functionalities of resource management and scheduling mechanisms.
CO4: Analyse the design models in software environment.
CO5: Develop management techniques in software.

Dept. of Computer Science and Engineering, UVCE Page 49

SCHEME OF EXAMINATION:

Quiz I
Test I (Any Three Units) - 20 Marks 25 Marks
CIE 50 5 Marks Total: 50
Marks Test II (Remaining Two Units) - 20 Quiz II Marks
25 Marks
Marks 5 Marks
Q1 (Compulsory): MCQs or Short answer type
15 Marks
questions for 15 Marks covering entire syllabus.
SEE 100 Q2 & Q3 from Units which have 09 Hours are 17 * 2 = Total: 100
Marks compulsory. 34 Marks Marks
Q4 or Q5, Q6 or Q7 and Q8 or Q9 from Units 17 * 3 =
which have 10 Hours shall have Internal Choice. 51 Marks

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 50

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18CIPC407

Category Engineering Science Courses : Professional Core
Course title DESIGN AND ANALYSIS OF ALGORITHMS LABORATORY
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
0 0 3 0 1.5
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
The course will enable the students to
1. Design and implement various algorithms in C++.
2. Determine the time complexity of various sorting algorithms.
3. Employ various design strategies for problem solving.
4. Measure and compare the performance of different algorithms.
5. Understand, develop and analyse the various algorithms under Divide & Conquer,
Greedy, Dynamic and backtracking techniques.

DESCRIPTION:
Design, develop, and implement the specified algorithms for the following problems
using C++ language under LINUX /Windows environment.

LAB PROGRAMS:

1. Sort a given set of elements using Merge sort and determine the time required to sort the
elements. Repeat the experiment for different values of n, the number of elements in the
list to be sorted and plot graph of the time taken versus number of elements. The elements
can be read from file or generated using random number generator.
2. Sort a given set of elements using Quick sort and determine the time required to sort the
elements. Repeat the experiment for different values of n, the number of elements in the
list to be sorted and plot graph of the time taken versus number of elements. The elements
can be read from file or generated using random number generator.
3. Write a program to perform insert and delete operations in Binary Search Tree.
4. Print all the nodes reachable from a given starting node in a digraph using BFS method.
5. a) Obtain the Topological ordering of vertices in a given digraph.
b) Compute the
6. a) Check whether a given graph is connected or not using DFS method.
-Pairs- Shortest-Paths problem.
7. Sort a given set of elements using the Heap sort method and determine the time required
to sort the elements. Repeat the experiment for different values of n, the number of
elements in the list to be sorted and plot a graph of the time taken versus number of
elements.
Dept. of Computer Science and Engineering, UVCE Page 51
 8. Search for a pattern string in a given text using Horspool String Matching algorithm.
9. Implement 0/1 Knapsack problem using dynamic programming.
10.
11. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's
algorithm.
12. From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstra's algorithm.
13. Write a program to solve Travelling Sales Person problem using dynamic programming
approach.
14. Implement N Queen's problem using Back Tracking.
15. Write a program to construct an AVL tree for a given set of integers.

COURSE OUTCOMES:

The student at the end of the course, will be able to

CO1: Design algorithms using appropriate design techniques (brute-force, greedy,
dynamic programming etc).
CO2: Implement a variety of algorithms such as sorting, graph related, combinatorial,
etc, in a high level language.
CO3: Develop programs and analyse its time complexity.
CO4: Analyze and compare the performance of algorithms using language features.
CO5: Apply and implement learned algorithm design techniques and data structures to
solve real world problems.

SCHEME OF EXAMINATION:

Continuous Internal Evaluation Marks Semester End Evaluation (SEE) Marks

(CIE) Laboratory - (50 Marks) Laboratory - (100 Marks)
Performance of the student in the 20 Write up 20
laboratory, every week
Test at the end of the semester 20 Execution 60
Viva voce 10 Viva voce 20
Total 50 Total 100

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 52

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18CIPC408

Category Engineering Science Course : Professional Core
Course title MICROPROCESSOR AND MICROCONTROLLER - LABORATORY
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
0 0 3 0 1.5
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
This course will enable students to
1. Learn 8086 instruction sets and gains the knowledge of how assembly language works
2. Provide practical exposure to the students on microprocessors, design and coding
knowledge on 80x86 family/ARM.
3. Understand the usage of 8255 Programmable peripheral Interface with I/O devices and
Microprocessor.
4. Give the knowledge and practical exposure on connectivity of the Hardware devices to
Microprocessor
5. Know how to execute the programs on interfacing devices with 8086/ARM kit like
LED displays, Keyboards, DAC/ADC, and various other devices.

DESCRIPTION:
Develop and execute the following programs using 8086 Assembly Language. Any
suitable assembler like MASM/TASM/8086 kit or any equivalent software may be used.
Program should have suitable comments.
The board layout and the circuit diagram of the interface are to be provided to the student
during the examination.
Software Required: Open source ARM Development platform, KEIL IDE and Proteus
for simulation.

SOFTWARE PROGRAMS: PART A

1.
-bit numbers. Adopt Binary search algorithm in your program for
searching.
2. -bit numbers in
ascending order. Adopt Bubble Sort algorithm to sort given elements.
3. Develop an assembly language program to reverse a given string and verify whether it
is a palindrome or not. Display the appropriate message.
4. Develop an assembly language program to compute nCr using recursive procedure.
-negative integers.

Dept. of Computer Science and Engineering, UVCE Page 53

 5. Design and develop an assembly language program to read the current time and Date
from the system and display it in the standard format on the screen.
6. To write and simulate ARM assembly language programs for data transfer, arithmetic
and logical operations (Demonstrate with the help of a suitable program).
7. To write and simulate C Programs for ARM microprocessor using KEIL (Demonstrate
with the help of a suitable program)

HARDWARE PROGRAMS: PART B

8. Design and develop an assembly program to demonstrate BCD Up-Down Counter (00-
99) on the Logic Controller Interface.
9. Design and develop an assembly program to read the status of two 8-bit inputs (X & Y)
from the Logic Controller Interface and display X*Y.
10.
alternately with flickering effects on a 7-segment display interface for a suitable period
of time. Ensure a flashing rate that makes it easy to read both the messages (Examiner
does not specify these delay values nor is it necessary for the student to compute these
values).
11. Design and develop an assembly program to drive a Stepper Motor interface and rotate
the motor in specified direction (clockwise or counter-clockwise) by N steps (Direction
and N are specified by the examiner). Introduce suitable delay between successive
steps. (Any arbitrary value for the delay may be assumed by the student).
12. Design and develop an assembly language program to generate the Sine Wave using
DAC interface (The output of the DAC is to be displayed on the CRO).
13. Design and develop an assembly language program to generate a Half Rectified Sine
waveform using the DAC interface. (The output of the DAC is to be displayed on the
CRO).
14. To interface LCD with ARM processor-- ARM7TDMI/LPC2148. Write and execute
programs in C language for displaying text messages and numbers on LCD
15. To interface Stepper motor with ARM processor-- ARM7TDMI/LPC2148. Write a
program to rotate stepper motor.

COURSE OUTCOMES:
The students at the end of the course, will be able to
CO1: Use 8086 instruction sets and gains the knowledge of how assembly language works.
CO2: Design and implement programs written in 80x86 assembly language.
CO3: Know functioning of hardware devices and interfacing them to x86 family.
CO4: Gain the knowledge of 8255 PPI interfacing with I/O devices and Microprocessor.
CO5: Choose processors for various kinds of real world applications.

Dept. of Computer Science and Engineering, UVCE Page 54

SCHEME OF EXAMINATION:

Continuous Internal Evaluation Marks Semester End Evaluation (SEE) Marks

(CIE) Laboratory - (50 Marks) Laboratory - (100 Marks)
Performance of the student in the 20 Write up 20
laboratory, every week
Test at the end of the semester 20 Execution of one program each
60
(Part A + Part B) from Part A and Part B
Viva voce 10 Viva voce 20
Total 50 Total 100

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.

*****

Dept. of Computer Science and Engineering, UVCE Page 55

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18MCCE409

Category Mandatory Course
Course title CONSTITUTION OF INDIA AND PROFESSIONAL ETHICS
Scheme and No. of Hours/Week
Credits L T P SS Credits Semester - IV CSE/ISE
1 0 0 0 1
CIE Marks: 50 ---- Total Max. Marks: 50
Prerequisites (if any): NIL

COURSE OBJECTIVES:
This course will enable the students
1. Constitution of India and Professional Ethics is to make the students aware of their
fundamental rights and duties.
2. As a citizen of India it would be a moral obligation on everyone to know the
Constitution of the country where they live in.
3. Constitution of India enlightens the citizen about the duties of the state and to what
extent those duties are translated into laws.
4. The objective of the coursework is to follow basic ethics of technical profession for
enabling them to be an expert professional.
5. The important object of the course work is to ensure everyone who attained the age of
voting right shall cast their vote and participate in the democratic process at different
levels.

UNIT I: 06 Hours
Preamble to the Constitution of India. Fundamental rights under Part-III-details of Exercise of
rights, Limitations & Important case laws.

UNIT II: 04 Hours

Relevance of Directive principles of State Policy under Part-IV, Fundamental Duties & their
significance.

UNIT III: 04 Hours

Union Executive President, Prime Minister, Parliament & the Supreme Court of India.
State Executive Governors, Chief Minister, State Legislator and High Courts.

UNIT IV: 05 Hours

Constitutional Provisions for Scheduled Castes & Tribes, Women & Children & Backward
classes; Emergency Provisions; Electoral process; Amendment procedure; Latest Important
Constitutional amendments.

UNIT V: 05 Hours
Scope & aims of engineering ethics, Responsibility of Engineers; Impediments to
responsibility; Honesty, Integrity and reliability, risks, safety & liability in engineering.

Dept. of Computer Science and Engineering, UVCE Page 56

REFERENCE BOOKS:

1.
Hall EEE, 19th/20th Edn., 2001.
2. J.Robins
Thompson Asia, 2003-08-05.
3.
4.
Hall of India Pvt. Ltd. New Delhi, 2004.

COURSE OUTCOMES:

The students at the end of the course, will be able to

CO1: Be able to know the basic Constitutional rights of citizens, i.e. Fundamental rights, right
to vote and participate in democratic process.
CO2: Be able to know the constitutional mandate in form of duties imposed upon the state
for ensuring social economic, political, ethical and cultural rights of the citizens.
CO3: Be able to know not only the rights, but also duties that a citizen has to abide in the
country they reside.
CO4: The outcome of the course predominantly would be to feel proud by every student that
they are aware of the Indian Constitution which is in a written document form.
CO5: Another important outcome would be to make aware the students the Preamble of the
Constitution which is a key opener for understanding the edifice of Indian Constitution.

SCHEME OF EXAMINATION:

Quiz I
Unit-I, II &III Test-I: 20 Marks. 25 Marks
5 Marks Total: 50
CIE 50 Marks
Quiz II Marks
Unit-IV &V Test-II: 20 Marks. 25 Marks
5 Marks

*****

Dept. of Computer Science and Engineering, UVCE Page 57

 BANGALORE UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU
B.Tech. PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING

Course Code 18BSBM410

Category Basic Sciences
Course title BRIDGE MATHEMATICS-II
Scheme and No. of Hours/Week
Semester - IV
Credits L T P SS Credits
Lateral Entry Students
2 2 0 0 3
CIE Marks: 50 SEE Marks: 50 Total Max. Marks: 100 Duration of SEE: 03 Hours
Prerequisites (if any): NIL

COURSE OBJECTIVES:
This course will enable all students to
1. Develop a thorough knowledge and deep understanding of Laplace transforms,
Laplace transform of derivatives, integrals and periodic function.
2. Study the reduction formulae for definite and indefinite integrals, Evaluation of these
integrals with standard limits.
3. Be skilled in computations and applications Double and Triple integrals, beta and
Gamma functions.
4. Be able to solve the ordinary differential equations of first order and first degree and
first order simultaneous differential equations.
5. Apply the concept of higher order differential equations.

UNIT I: LAPLACE TRANSFORMS 09 Hours

Laplace Transforms: Definition and basic properties, Laplace transform of elementary
functions and standard results, Laplace transform of derivatives and integrals, Laplace
transform of periodic function, Unit step functions, Inverse Laplace Transforms, Convolution
theorem.

UNIT II: INTEGRAL CALCULUS - I 09 Hours

Standard reduction formulae for definite and indefinite integrals, Evaluation of these integrals
with standard limits, problems, Tracing of standard limits, problems, Tracing of standard
curves in Cartesian form.

UNIT III: INTEGRAL CALCULUS - II 10 Hours

Double and Triple integrals, evaluation by the change of order of integration, Beta and Gamma
functions, Relation between beta and Gamma functions, applications.

UNIT IV: DIFFERENTIAL EQUATIONS I 10 Hours

Solutions of ordinary differential equations of first order and first degree: Homogeneous forms,
Linear and Bernoulli equations, Exact and reducible to exact equations, using standard
integration factors. Solving the first order simultaneous differential equations.

Dept. of Computer Science and Engineering, UVCE Page 58

UNIT V: DIFFERENTIAL EQUATIONS - II 10 Hours
Second and higher order differential equations, homogeneous linear equations with constant
and variable co-efficients, problems. Non-homogeneous linear equations with constant and
variable co-efficients, problems. Application of Laplace transform to solve linear ordinary
differential equations of first and second order with constant co-efficients.

TEXT BOOKS:

1. G. B. Thomas and R. L. Finney, Calculus, Addison Wesley, 9th Edition, 1998.

2. E. Kreyszig, "Advanced Engineering Mathematics" - Wiley, 2013.
3. P. V. O Neil Advanced Engineering Mathematics, Pearson/Thomson.
th
4. thematics-
Edition, 2014.

REFERENCE BOOKS:

1. B.V. Ramana "Higher Engineering Mathematics" Tata Mc Graw-Hill, 2006

2. N P Bali and M. Goyal, "A text book of Engineering mathematics", Laxmi
publications, latest edition.
3. H. K Dass and Er. Rajnish Verma, "Higher Engineering Mathematics", S. Chand
publishing, 1st edition, 2011.

COURSE OUTCOMES:

The students at the end of the course, will be able to

CO1: Use Laplace transform of elementary functions and standard results, Laplace transform
of derivatives and integrals.
CO2: Compute reduction formulae for definite and indefinite integrals, Tracing of standard
curves in Cartesian form.
CO3: Use Double and Triple integrals, beta and gamma functions appearing in engineering
applications
CO4: Solve ordinary differential equations of first order and first degree and first order
simultaneous differential equations.
CO5: Solve second and higher order differential equations.

Dept. of Computer Science and Engineering, UVCE Page 59

SCHEME OF EXAMINATION:

Quiz I
Test I (Any Three Units) - 20 Marks 25 Marks
CIE 50 5 Marks Total: 50
Marks Test II (Remaining Two Units) - 20 Quiz II Marks
25 Marks
Marks 5 Marks
Q1 (Compulsory): MCQs or Short answer type
15 Marks
questions for 15 Marks covering entire syllabus.
SEE 100 Q2 & Q3 from Units which have 09 Hours are 17 * 2 = Total: 100
Marks compulsory. 34 Marks Marks
Q4 or Q5, Q6 or Q7 and Q8 or Q9 from Units 17 * 3 =
which have 10 Hours shall have Internal Choice. 51 Marks

Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50
Marks.
*****

Dept. of Computer Science and Engineering, UVCE Page 60