Academic Year 2021-22 Scheme and Syllabus

Scheme for Academic Year: 2021-2022
Admission Year: 2020-21
IV Semester
Credits Total #
Course Course Total of
Course Title L T P
Category Code Credits Contact
Hours
BS-8 20MA401 Statistics and Complex analysis 3 1 0 4 5
BS-9 Discrete Mathematical

20MA402 2 1 0 3 4
Structures
PC-8 Object Oriented Programming
20CS403 3 0 1 4 5
with JAVA
PC-9 Design and Analysis of
20CS404 4 0 0 4 4
Algorithms
PC-10 Microcontroller and Embedded
20CS405 4 0 0 4 4
Systems
PC-11 20CS406 Software Engineering 3 0 0 3 3
PC-12 Algorithms Laboratory with

20CS407 0 0 1 1 2
Java
PC-13 20CS408 Microcontroller Laboratory 0 0 1 1 2
HSM-4 Social Skills

20SSK 0 2 0 0 2
(Mandate Audit Course)
BS 20BCM401 Bridge Course Mathematics - 2 3 0 0 0 3
(Mandate Audit Course)
Total 22 4 3 24 34
1
Course Title STATISTICS AND COMPLEX ANALYSIS
, Course Code 20MA401 L-T-P-C 3-1-0-4
Exam. 3 Hrs Hours / Week 05
SEE 50 Marks Total hours 52
Course Objective: The student will study Statistics, probability and calculus of a complex valued function
Course Outcomes (COs): Upon completion of the course, students shall be able to:
# Mapping Mapping
Course outcomes
to PO’s to PSO’s
1. Apply the concepts of analytic functions, conformal mapping, complex
integration , singularities, residues to engineering oriented problems such PO1, PO2 -
as stability of a system
2. Adopt statistical techniques such as correlation/regression, curve fitting to PO1, PO2,
-
analyze the data PO3
3. Predict the probability of happening, through the concepts of random
variables, study the system applications, through the suitable pdf, PO1, PO2, -
sampling theory and gain the capability to study the reliability of the PO3
system
4. Predict the behavior of Markov chain based problems in the long run and PO1, PO2,
study the correlation, covariance of random variables using joint PDF -
concept. PO3
Course Contents:
MODULE – 1 13 Hrs
Statistics: Curve fitting by least square method – Straight lines, parabola, (when the experimental output
depends on one input)Correlation – Karl Pearson coefficient of correlation and Spearman’s rank correlation
coefficient. Physical interpretation of numerical value of the rank correlation coefficient. Linear Regression
analysis(when the experimental output depends on one input). Illustrative examples from engineering field,
Multiple regression analysis. (linear- when the experimental output depends on two inputs)
Probability: Discrete Random Variables: Definitions of PDF & CDF, Expectation and Variance. Binominal pdf,
Illustrative examples.
Self study-- Poisson probability distribution functions.---examples
MODULE – 2 13 Hrs
Continuous Random Variables: Definition of PDF and CDF, Expectation and Variance, illustrative examples.
Uniform pdf, Normal/Gaussian pdf, discussion on the choice of PDF. Illustrative examples from engineering
field.
Sampling Distribution: Introduction, Testing a hypothesis, central limit theorem-statement, Level of
significance, Simple sampling of attributes, Test of significance for large samples, Comparison of large samples,
Student’s t-distribution, Chi-square distribution
Self study- Exponential pdf, confidence intervals in sampling theory
MODULE – 3 13 Hrs
Joint Probability Distribution & Stochastic Processes: Concept of joint probability, Joint distributions of
discrete random variables, Independent random variables – problems. Joint expectation, co-variance and
correlation.
Markov Chains: Introduction, stochastic matrices, fixed probability vectors and regular stochastic matrices.
2
Functions of a complex variable: Analytic functions. -Statement of Cauchy-Riemann equations in Cartesian
form and illustrative examples,
Self study---Construction of an analytic function using Milne-Thomson method (Cartesian form). Illustrative
examples from engineering field.
MODULE – 4 13 Hrs
Harmonic functions and Conformal Mapping: Properties of Harmonic functions and Illustrative examples
(Cartesian form) Definition of Conformal transformation and discussion of some standard transformations (
2 z k2
w z ,w e ,w z . ) Bilinear transformation, Illustrative examples. Applications of conformal mapping.
z
Complex Integration: – Evaluation of line integrals, Statement of Cauchy’s theorem, generalized Cauchy’s
Integral formula- illustrative examples. Brief introduction to Taylor and Lorentz series and illustrative
examples, Zeros of an analytic function, Singularities and Residues.
Self study--Calculation of residues, Evaluation of real definite integrals using Cauchy’s residue theorem.
Text Books :
1. Dr. B. S. Grewal, Higher Engineering Mathematics, Khanna Publications, 44thEdition, 2016

2. Erwin Kreyszig, Advanced Engineering Mathematics, Wiley India Pvt. Ltd 9th edition, 2014
nd
3. B V Ramana Higher Engineering Mathematics, Tata McGraw Hill Publications, 2 edition, 2007
Reference Books:
1. Scott L. Miller, Donald G. Childers: Probability and Random Process with application to Signal Processing,
Elsevier Academic Press, 2nd Edition,2013.
2. Statistics for engineers and Scientists, William Navide, Mc-Graw hill education, India pvt. Ltd., 3rd edition
2014.
3. T. Veerarajan: Probability, Statistics and Random Process, 3rd Edition, Tata McGraw Hill Co., 2008.
3
Course Title DISCRETE MATHEMATICAL STRUCTURES
Course Code 20MA402 L-T-P-C 2-1-0-3
Course Objective: Introduction of Discrete structures and principle of Combinatory which may be employedas
tools in the applications of Computer Science & Information Technology. Course Outcomes (COs): Upon
completion of the course, students shall be able to:
# Mapping Mapping
Course outcomes
1. Use logic along with computational rules to analyze / programming
PO1,PO2 -
language algorithm for better understanding.
2. Understand the fundamental concepts of the topics; relations and
functions to a greater extent and with good maturity so as employ these PO1,PO2 -
in project related works later.
3. Apply graph concepts to model and analyze problems of Computer Science
PO1,PO2 -
& Engineering
Course Contents:
MODULE – 1 10 Hrs
Fundamental principles of Counting: The rule of sum and product, permutation principle, combination principle,
rule of generalized permutations and Combinations. A note on Catalan numbers.
Properties of Integers: The well ordering principle: mathematical induction. Recursive Definitions. Fundamental
theorem of Arithmetic.
Self study: Implementation of minor projects (these will be given to students in groups).
MODULE – 2 10 Hrs
Fundamentals of logic: Basic logic connectives and truth tables. Logical equivalence and Tautologies. Statement
of laws of logic. Logic implication - Rules of inference theory.
Relations : Cartesian products and relations, computer representation of a relation and directed graph,
properties / various types of relations. Equivalence relations and partitions.
Self study: Methods of proof; indirect and direct approach. Application of Mathematical induction principle
MODULE – 3 10 Hrs
Function I: Definition, various types of functions - Injective and Surjective functions, invertible functions,function
composition.
Functions - II: Ceiling function, Floor function, Characteristic function, and Application of Stirlingnumbers of
second kind.
Self study: Special discrete functions
MODULE – 4 10 Hrs
Graph theory: Basic terminologies of a graph. Discussion of connected and disconnected graphs, Eulerand
Hamilton graphs, Planar graphs and Graph colouring.
Trees: Definition, properties of a tree. Weighted trees, prefix codes and biconnected components.
Text Books :
Discrete and Combinatorial Mathematics, R C Grimaldi, Pearson’s publications, 5th edition, 2007.
Reference Books:
Discrete Mathematical Structures, by D. S. Malik & M. K. Sen, Thomson’s Publications, First edition, 2006..
4
Course Title OBJECT ORIENTED PROGRAMMING WITH JAVA
Course Code 20CS403 L-T-P-C 3-0-1-4
Course Objective: Design and Develop java application programs using object-oriented concepts
# Mapping to Mapping
Course outcomes
PO’s to PSO’s
1. Apply Java constructs for the development of object oriented programs. PO1 -
2. Analyze the given java program to make suitable changes. PO2 -
3. Design a java program for the given problem. PO3 -
4. Conduct practical experiments for demonstrating object oriented PO1,PO2,
-
concepts through java using IDE. PO5
Course Contents:
MODULE – 1 13 Hrs
Java programming fundamentals – The Java Language, The key attributes of Object Oriented programming,
Java Development Kit (JDK), JVM, A first Simple program, handling syntax errors, The Java Keywords, Identifiers
in Java. Introducing Data Types and Operators : Java’s Primitive Types, A Closer Look at Variables, The Scope
and Lifetime of Variables, operators, Shorthand Assignments, Type conversion in Assignments, Using Cast,
Operator Precedence, Expressions. Program Control Statements: Input characters from the Keyboard, if
statement, Nested ifs, if-else-if Ladder, Switch Statement, Nested switch statements, for Loop, Enhanced for
Loop, While Loop, do-while Loop, Use break, Use continue, Nested Loops. Introducing Classes, Objects and
Methods: Class Fundamentals, How Objects are Created, Reference Variables and Assignment, Methods,
Returning from a Method, Returning Value, Using Parameters, Constructors, Parameterized Constructors, The
new operator Revisited, Garbage Collection. The this Keyword. More Data Types and Operators: Arrays,
Multidimensional Arrays, Alternative Array Declaration Syntax, Assigning Array References, Using the Length
Member, The For-Each Style for Loop, Strings, The Bitwise operators.
MODULE – 2 13 Hrs
A Closer Look at Methods and Classes: Controlling Access to Class Members, Pass Objects to Methods, How
Arguments are passed, Returning Objects, Method Overloading, Overloading Constructors, Recursion,
Understanding Static, Introducing Nested and Inner Classes, Varargs: Variable-Length Arguments. Inheritance:
Inheritance Basics, Member Access and Inheritance, Constructors and inheritance, Using super to C all
Superclass constructors, Using super to Access Superclass Members, Creating a Multilevel Hierarchy, When are
Constructors Executed, Superclass References and Subclass Objects, Method Overriding, Overridden Methods
support polymorphism, Why overridden Methods, Using Abstract Classes, Using final, The object class.
MODULE – 3 13 Hrs
Interfaces: Interface Fundamentals, Creating an Interface, Implementing an Interface, Using Interface
References, Implementing Multiple Interfaces, Constants in Interfaces, Interfaces can be extended, Nested
Interfaces. Packages: Package Fundamentals, Packages and Member Access, Importing Packages, Static import.
Exception Handling: The Exception Hierarchy, Exception Handling Fundamentals, The Consequences of an
Uncaught Exception, using Multiple catch clauses, Catching subclass Exceptions, try blocks can be nested,
Throwing an Exception, A Closer look at Throwable, using finally, using throws, Java’s Built-in Exceptions.
MODULE – 4 13 Hrs
Multithreaded Programming: Multithreading fundamentals, The Thread Class and Runnable Interface, Creating
Thread, Creating Multiple Threads, Determining When a Thread Ends, Thread Priorities, Synchronization, using
Synchronization Methods, The Synchronized Statement, Thread Communication using notify(), wait() and notify
All(), suspending, Resuming and stopping Threads. Exploring java.io – The I/O Classes and Interfaces, File, Auto
5
closeable, Closeable and Flushable Interfaces, I/O Exceptions, The Stream Classes, The Byte Streams, The
Character Streams, The Console Class
Text Books :
1. Java Fundamentals, A comprehensive Introduction by Herbert Schildt, Dale Skrien.Tata McGraw Hill
Edition 2013 (Chapters 1,2,3,4,5,6,7,8,9,10,12)
2. Java –The complete Reference, by Herbert Schildt Eight Edition Tata Mcgraw Hill Education ( Chapter
19).
MOOCs:
1. http://nptel.ac.in/courses/106106147/
2. http://www.nptelvideos.com/java/java_video_lectures_tutorials.php
3. https://www.youtube.com/watch?v=0KL_zftem4g
4. https://www.coursera.org/specializations/object-oriented-programming
Reference Books:
1. Programming in JAVA2 by Dr K Somasundaram ,Jaico publications
2. Java Programming by Hari Mohan Pandey, Pearson Education, 2012.
3. Deitel and Deitel – "Java How to Program" – 6th Ed. – Pearson.
Activity:
Write and execute the following programs in java
1. Design Java application to model Employee of an “ABC” organization. Consider types of employees as : a)
Manager b) Sales Person Perform the following:
 Implement simple inheritance where Employee (employee ID, First Name, Last Name, Current salary) is
super class, consider Manager (number of stock options) and SalesPerson (number of sales, commission
rate) as subclasses.
 Define parameterized constructors in class hierarchy.
 Define methods to display status of employee (override toString() ) and increase current payment (salary)
as giving bonus by a small amount.
2. Create class Employee with name, Id, cellNum, designation, department, salary permanent (boolean) as
members. Also create separate class for member name as EmpName, department as Department and salary as
Salary. Members of EmpName are firstName, midName, lastName . Members of Salary are BASIC, DA percent,
HRA , PF, insurance. Members of Department are deptName, deptCode. Create an instance of Employee and
initialize all its members from user input console. Access the same instance by more than one reference of
Employee. Count the number of references and objects being created. [class, reference, objects].
3. Create a super class Bind {x,y} and subclass Bind3d {z} include
 Parameterized constructor in class Bind to initialize object.
 Include a method in class Bind to Print data members of object. Override the same method in sub¬class
and reuse the inherited method in it.
 Create final static member printArr (Bind[ ]) which print array of objects. In this method use above method
to print member of individual objects of array.
 Write test class to create to array of Bind3d type. Use the above method to print all the objects of array.
4. A bank maintains two kinds of accounts – Savings account and Current account. The savings account
provides simple interest, deposit and withdrawal facilities. The current account only provides deposit and
withdrawal facilities. Current account holders should also maintain minimum balance. If balance falls below
minimum level a service charge is imposed. Create an abstract class Account that stores customer name, account
6
number type of account and abstract methods. From this derive the classes Curr_Account (double balance,
double min_bal, double serviceCharge / penalty) and Sav_Account (double balance).
Include the necessary methods in order to achieve the following:
 Define parameterized constructor in a class hierarchy. P
 Allow deposit and update the balance.
 Display the balance.
 Compute interest and add to balance.
 Permit withdrawal and update the balance (check for minimum balance).
 Apply polymorphism if required for methods in class hierarchy.
 Create an array of super class / object and populate with subclass objects and call the overridden /object
methods.
 Write a test program to demonstrate the above said implementations.
5. Define a interface EMPInterface (void displayEMP(), void giveBonus (double amount)). Define an abstractclass
Employee(empID, fName, lName, salary). Define a concrete class Manager (noOfOtockOptions), subclass of
Employee and define interface methods.
Perform the following:
1. Define appropriate constructors in a class hierarchy.
2. Ensure the bonus amount should not be negative and zero using exception handling mechanism (use
throws and throw clauses of exception handling)
3. Create array of interface reference variables and populate with manager objects.
4. Write a test program to implement the above said requirements of interface implementation and
exception handling.
7
Course Title DESIGN AND ANALYSIS OF ALGORITHMS
Course Objective: Students should be capable of designing algorithms using suitable algorithmdesign
method and mathematically analyze it.
Course outcomes
PO’s to PSO’s
1. Apply analysis framework to perform mathematical analysis of
recursive and non-recursive algorithms.
PO1,PO2 -
2. Use various algorithmic design techniques to solve real time problems. PO1,PO2,PO3 -
3. Use techniques that spares more space for saving run time like
input enhancement and Dynamic programming.
PO1,PO2,PO3 -
4. Apply techniques that help to cope up with limitation of algorithm
PO1,PO2,PO3 -
power like backtracking & branch and bound.
Course Contents:
MODULE – 1 13 Hrs
Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Fundamentals of the
Analysis of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and Basic efficiency classes,
Mathematical analysis of Recursive and Non-recursive algorithms, Examples.Brute Force: Selection Sort and
Bubble Sort, Sequential Search and String Matching, Exhaustive Search;
MODULE – 2 13 Hrs
Divide-and-Conquer : Merge sort, Quick sort, Binary Search, Binary tree Traversals and related properties,
Multiplication of large integers, Strassen's Matrix Multiplication.
Decrease-and-Conquer: Insertion Sort, Depth First and Breadth First Search, Topological Sorting, Algorithms for
Generating Combinatorial Objects.
MODULE – 3 13 Hrs
Transform-and-Conquer: Presorting, Heaps and Heapsort, Problem Reduction.
Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in String Matching, Hashing.
Dynamic Programming: Computing binomial coefficient, Warshall's Algorithm, Floyd's Algorithms, The
Knapsack Problem and Memory Functions.
MODULE – 4 13 Hrs
Greedy Technique: Prim's Algorithm, Kruskal's Algorithm, Dijkstra's Algorithm, Huffman Trees.
Limitations of Algorithm Power Lower-bound Arguments, Decision Trees, P, NP and NP-Complete Problems.
Coping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound, Approximation Algorithms
for NP-hard problems.
Text Books :
1. Anany Levitin, Introduction to The Design and Analysis of Algorithms, 3rd Edition, Pearson Education, 201
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms, 2nd Edition,
press, 2014.
Reference Books:
1. Coremen T.H., Leiserson C. E., and Rivest R. L., Introduction to Algorithms, 3rd edition, PHI, 2015.
2. R.C.T. Lee, S.S. Tseng, R.C. Chang and Y.T.Tsai, Introduction to the Design and Analysis of Algorithms A
Strategic Approach, 1st Edition, Tata McGraw Hill, 2005.
8
Course Title MICROCONTROLLERS AND EMBEDED SYSTEMS
Exam. 3 Hrs Hours/Week 04
Course Objective: To make familiar with importance and applications of microcontrollers and embedded
systems.
Course Outcomes(COs):Upon completion of the course, students shall be able to:
Course outcomes
PO’s to PSO’s
1. Describe the concepts of ARM embedded system and its
PO2 -
components
2. Design ARM based Assembly Language Programs to solve PO1,PO2,P
PSO1
problems O5,
3. Illustrate different embedded systems and its applications PO2,PO3 PSO1
4. Develop embedded programs using IDE PO1, PO2 PSO1
Course Contents:
MODULE – 1 13Hrs
ARM Embedded Systems: Microprocessors, Microcontrollers, Microprocessors v/s Microcontrollers, RISC v/s
CISC, Harvard v/s Von-Neumann processor, Big-endian v/s Little-endian processors, Load store operation, 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-cache and tightly coupled memory.
MODULE – 2 13Hrs
Introduction to the ARM Instruction Set: Data Processing Instructions-move, barrel shifter, arithmetic,logical,
comparison, multiply. Branch Instructions, Load-store instructions-single register transfer, single register load-
store addressing modes, multiple register transfer, stack operations, swap instruction. Program Status Register
Instructions, Loading Constants, conditional execution. Introduction to Embedded Systems: What is an
embedded system?, Embedded Vs General computing system,
Classification of Embedded systems, Major applications and purpose of ES .
MODULE – 3 13Hrs
Memory, Sensors, Actuators, LED, 7 segment LED display, stepper motor, Keyboard, Push button switch,Embedded
firmware. RTOS and IDE for Embedded System Design: operating system basics, Types of operating systems,
integration of hardware and firmware-out of circuit programming, ISP, IAP, use of
factory programmed chip firmware loading; Dynamic host configuration
MODULE – 4 13Hrs
Embedded system Development Environment – Block diagram, disassemble/decompile, simulators, emulators
and debugging. Characteristics and Quality Attributes of Embedded Systems: characteristics of an embedded
system, Operational and non-operational quality attributes, Embedded Systems Application and Domain specific,
Hardware Software Co-Design and computational models in Embedded
design, embedded firmware design and development languages.
Text Books :
1. ARM system developers guide, Andrew N Sloss, Dominic Symes and Chris Wright, Elsevier,Morgan
Kaufman publishers, 2008. (1.1 to 1.4, 2.1 to 2.5.1, 3.1 to 3.3, 3.5 to 3.6
(Excluding 3.5.1, 3.5.2),3.8)
9
2. Ragunandan, An Introduction to ARM System Design, Cengage Publication
Reference Books:
1. The Insider’s Guide to the ARM7 Based Microcontrollers, Hitex Ltd.,1st edition, 2005
2. Steve Furber, ARM System-on-Chip Architecture, Second Edition, Pearson, 2015
3. Raj Kamal, Embedded System, Tata McGraw-Hill Publishers, 2nd Edition, 2008
MOOCs:
https://onlinecourses.nptel.ac.in/noc18_ec03/preview
10
Course Title SOFTWARE ENGINEERING
Course Objective: To create software development and testing skills and to introduce some major tools for
software testing and software project management.
Course outcomes
PO’s to PSO’s
1. Apply software process models for a given software project. PO1, PO2 -
2. Depict the role of software project manager. PO1, PO11 -
3. Create SRS document for a software product. PO1, PO2 -
4. Explore different software architectural styles. PO3, PO5 -
5. Exercise approaches to verify and validate a software product. PO3, PO5 -
Course Contents:
MODULE – 1 10 Hrs
Introduction: Professional software development, Software engineering Ethics, Case studies, Software
processes, Software process models, Process activities, Coping with change, The RU process. Requirements
Engineering: Functional and non-functional requirements, the software requirements document, requirements
specification, requirements engineering processes, requirements elicitation and analysis, requirements
validation
MODULE – 2 10 Hrs
Requirements Management and System modeling: Context models interaction Models, Structural models,
Behavioural models model-driven engineering Software testing: Development testing Test-driven development
Release testing, User testing. Software evolution: Evolution processes Program evolution dynamics. Software
maintenance, Legacy system management
MODULE – 3 10 Hrs
Dependability and Security: Dependability properties, Availability and Reliability, Safety, Security Component-
Based Software Engineering: CBSE Process Component composition, Project management: Risk management,
Managing People, teamwork Quality Management Software quality, software standards, Reviews and
Inspections, software measurement.
MODULE – 4 10 Hrs
Agile software development: Agile Methods, plan-drive and agile development, extreme programming Agile
project management, scaling agile methods and metrics, Scrum: an online tool for agile development, Scrum
events, Scrum Artifacts
Text Book:
Ian Sommerville, Software Engineering, Person Education Ltd., 9th Edition, 2013.
Reference Books:
Roger .S. Pressman, Software Engineering-A Practitioners approach, McGraw-Hill, 7th Edition, 2007.
MOOCs
1. www.infoweblinks.com/content/casetools.htm
2. https://www.mooc-list.com/categories/cs-software-engineering
3. https://www.scrum.org/resources/what-is-scrum
11
Activity:
1. You are expected to develop software for a typical management system. Create SRS for the same.
2. Assume you are the manager for a given project. You are given 20 employees; your project needs only
8 employees. Develop a report on how the team is formed with necessary justification.
3. Design test cases for a sales organization. Assume that four different products are available. Minimum
two products are to be ordered. Minimum of any product quantity is four and
maximum total products ordered are 40.
12
Course Title ALGORITHMS LABORATORY WITH JAVA
Course Objective: To demonstrate various algorithmic design techniques using Java programming.
# Mapping
Course outcomes Mapping to PO’s
to PSO’s
1. Implement various algorithms using Java PO2, PO3 -
Course Contents:
Programs to Execute in the Laboratory: Implement the following using Java Language
1. a. Consider the runs scored by batsmen in a cricket match. Implement Recursive Binary search to find whether
the specified runs have been scored by any batsman or not. Determine the time required for search.
b. Sort a given set of elements using the Heap sort method.
2. a. Employees in an organization need to be grouped for a tournament based on their ages. Sort the ages using
Merge sort and find the time required to perform the sorting.
b. Print all the nodes reachable from a given starting node in a graph using Depth First Search method and
check whether a graph is connected.
3. a. Students in a department need to be selected for a high jump competition based on their height (integer
values only). Sort the heights of students using Quick sort and find the time required for the Sorting.
b. Print all the nodes reachable from a given starting node in a digraph using BFS method.
4. a. Sort a given set of elements using Insertion sort method.

b. Obtain the topological ordering of vertices in a given digraph.
5 . a. Implement Horspool algorithm for String Matching.

b. Write a program using Transform and Conquer technique for checking whether the digits of mobile
number of a person are unique.
6 . a. Consider n cities. The shortest path between every pair of cities needs to be determined.
Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.
b. Find the Binomial Co-efficient using Dynamic Programming.
7. a. There are n different routes from hostel to college. Each route incurs some cost. Find the minimum cost
route to reach the college from hostel using Prim’s algorithm.
b. Compute the transitive closure of a given directed graph using Warshall’s algorithm.
8 . a. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm.
b. Implement computing a mode using pre-sorting method.
9. Consider the distance between Hassan and n different cities. Every city can be reached from Hassan directly
or by using intermediate cities whichever costs less. Find the shortest distance from Hassan to other cities
using Dijkstra’s algorithm.
13
10. Implement 0/1 Knapsack problem using dynamic programming.
11. Implement N Queens problem using Back Tracking.
12. Find the subset of given set S={s1,s2,….sn} of an positive integers whose sum is equal to a given positive
integer d. A suitable message is to be displayed if the given problem instance doesn’t have a solution.
14
Course Title MICROCONTROLLER LABORATORY
SEE 50 Marks Total Hours 28
Course Objective: To develop and test Assembly Level Programs using ARM7TDMI/LPC2148.
Course Outcomes (COs) : Upon completion of the course, students shall be able to:
# Mapping Mapping
Course outcomes
1. Develop ALP using the software tool KEIL and document. PO2,PO5 PSO1
2. Develop hardware interfacing programs using ARM7 PO2,PO5 PSO1
microcontroller.
Course Contents:
PART- A
Conduct the following experiments by writing Assembly Language Program (ALP) using ARM7TDMI/LPC2148
using an evaluation board/simulator and the required software tool.
1. In a class of strength 40 students, I need to find the tallest guy in the class to reach the projector of the
classroom. Help me to identify the tallest guy.
2. To determine the number of ways to distribute ‘N’ marbles to a group of children you need to find
factorial of N. Hence find factorial of a number.
3. To illustrate the working of lookup table in ARM processor, find the square of a number (1 to 10) stored
in look-up table.
4. RAM is an important component of microcontroller. To understand how it can be accessed, add an

array of 16 bit numbers and store the 32 bit result stored in internal RAM.
5. Count the number of ones and zeros in two consecutive memory locations
PART – B
Conduct the following experiments on an ARM7TDMI/LPC2148 evaluation board using evaluation version of
Embedded 'C' and Keil Uvision-4 tool/compiler.
1. In the retail shop, the owner wants to know how many customers have been using the service of the
shop. A device is used to keep count of incoming customers in the shop. Program the device to carry
out the counting. Also the device should reset back to ZERO by down counting. Implement the above
using Logic Controller Interface.
2. In a petrol bunk, if a fire occurs accidently you need to display messages FIRE and HELP alternately on a
7-segment display interface to alarm the people. Implement the above scenario.
3. A toy car uses a Stepper Motor interface to rotate the motor in specified direction. Program the toy to
rotate (Clockwise or Counter-Clockwise) by N steps. Introduce suitable delay between successive steps.
(Any arbitrary value for the delay may be assumed by the student).
4. Generate Sine Wave using DAC interface (The output of the DAC is to be displayed on the CRO).
Activity
Scan a 4X4 keypad for key pressed and display the key pressed on LCD screen.
Note: Students need to execute one from PART-A and one form PART-B for SEE
15
VI Semester
Credits Total #
Course Total of
Category Course Code Course Title Credits
L T P Contact
Hours
System Software and
PC-20 19CS601 Compiler Design 4 0 0 4 4
Computer Graphics and

PC-21 19CS602 Visualization 3 1 0 4 5
PC-22 19CS603 Computer Networks 4 0 0 4 4

Mobile Application
PC-23 19CS604 Development Laboratory 0 0 1 1 2
PC-24 19CS605 System Software Laboratory 0 0 1 1 2

Mini Project -1 (Inter
PROJ-1 19CS606 Discipline) 0 0 2 2 2
PE-1 19CS65X Elective – I 3 0 0 3 3

OE-1 19OEXXXX Open Elective – 1 3 0 0 3 3
Aptitude Reasoning
HSM-8 19ARD Development (Mandate Audit 0 2 0 0 2
Course )
Environmental Studies
HSM-9 19EVS (Mandate Audit Course ) 2 0 0 0 2
SWAYAM Course -1 (Mandate

OE-2 19SW01 Audit Course ) 0 0 0 0 3
Total 21 3 4 22 32
Elective – I
Sl. Course Course Title
No. Code
1. 19CS651 Multimedia Computing
16
2. 19CS652 Python Applications Programming
3. 19CS653 Graph Theory and Combinatorics
4. 19CS654 Data Mining and Warehousing
5. 19CS655 Principles of Programming Languages
Open Electives
1 19OECS61 Introduction to Cloud Computing
2 19OECS62 Database Fundamentals
17
Course Title SYSTEM SOFTWARE AND COMPILER DESIGN
Course Objective: Analyze the features of system software and illustrate different phases of compiler design.
Course outcomes
PO’s to PSO’s
1. Understand system software concepts and outline the features of various
PO1,PO2 PSO1
machine architectures.
2. Demonstrate function and features of assembler used to generate the PO1, PO2,
-
object program. PO3
3. Analyze the function and features of Loaders, Linkers and Macro
PO2, PO3 -
Processors.
4. Analyze different phases of compilation. PO1, PO2
Course Contents:
MODULE – 1 13 Hrs
Machine Architecture, Assembler 1: The Simplified Instructional Computer (SIC) Assemblers: Basic assembler
functions, Machine dependent assembler features.
Assembler 2: Machine Independent Assembler Features, Assembler Design Options
MODULE – 2 13 Hrs
Loaders and Linkers: Basic Loader Functions, Machine-Dependent Loader Features, Machine-Independent
Loader Features, Loader Design Options
Macro Processor: Basic Macro Processor Functions, Machine-Independent Macro Processor Features
MODULE – 3 13 Hrs
Introduction: Language Processors, The structure of a Compiler, Applications of Compiler Technology,
Programming Language Basics
Lexical Analysis: Role of Lexical Analyzer, Input buffering, Specifications of tokens, Recognition of Tokens
MODULE – 4 13 Hrs
Syntax Analysis : Introduction, Context –free Grammar and Structure of Language, Parser and its Types, Top-
Down parser-Recursive descent parsing and Non-Recursive descent parsing, Predicting parsing table, Error
recovering strategies.
Text Books :
1. Leland Beck, D. Manjula - System Software – An Introduction to Systems Programming, Third Edition,
Pearson Education 2013.
2. Alfred V Aho, Ravi Sethi, Jeffrey D Ullman, Compilers- Principles, Techniques and Tools, Addison-
Wesley 2013.
Reference Books:
1. K. Muneeswaran, Compiler Design , Oxford University Press,2013
2. Alfred V Aho, Ravi Sethi, Jeffrey D Ullman, Compilers- Principles, Techniques and Tools, Addison-Wesley
2013.
3. D. M. Dhamdhere, Systems Programming and Operating Systems, Tata McGraw Hill Company, Second
Edition, 2009
4. John J. Donovan, Systems Programming, Tata McGraw Hill Company, Second Edition, 2000
5. John. R. Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 2012
18
6. S. V. Raghavan, Principles of Compiler Design,Tat McGraw Hill Education Publication, 2010.
MOOCs:
https://in.udacity.com/course/compilers-theory-and-practice--ud168
19
Course Title COMPUTER GRAPHICS AND VISUALIZATION
Course Objective: Student will learn the concepts of computer graphics to design a 2D and 3D scene using
OpenGL.
Course outcomes
PO’s to PSO’s
1. Identify core concepts of computer graphics with OpenGL. PO1,PO2 -
2. Apply concepts of geometric transformations and projections on an PO2,PO3,
object & illumination models to naturalize the scene using OpenGL. PO4,PO5
-
3. Analyze various clipping methods for extraction of the scene to
graphical display device.
PO2, PO3, PO5 -
4. PO1, PO2,
Design a 2D/3D image using graphical concepts through OpenGL.
PO3, PO4, PO5
PSO1
Course Contents:
MODULE – 1 13 Hrs
Introduction: Applications of computer graphics; A graphics system; Images: Physical and synthetic; Imaging
systems; The synthetic camera model; The programmer’s interface; Graphics architectures; Programmable
pipelines; Performance characteristics. Graphics Programming: The Sierpinski gasket; Programming two-
dimensional applications. The OpenGL: The OpenGL API; Primitives and attributes; Color; Viewing; Control
functions; The Gasket program; Polygons and recursion; The three-dimensional gasket.
MODULE – 2 13 Hrs
Input and Interaction: Interaction; Input devices; Clients and servers; Display lists; Display lists and modeling;
Programming event-driven input; Menus; Picking; Design of interactive programs; Geometric Objects and
Transformations – 1: Scalars, points, and vectors; Three-dimensional primitives; Coordinate systems and
frames; Modeling a colored cube; Affine transformations; Rotation, translation and scaling
MODULE – 3 13 Hrs
Geometric Objects and Transformations – 2: Transformations in homogeneous coordinates; Concatenation of
transformations; OpenGL transformation matrices; Viewing: Classical and computer viewing; Viewing with a
computer; Positioning of the camera; Simple projections; Projections in OpenGL; Hidden-surface removal;
Interactive mesh displays; Parallel-projection matrices; Perspective-projection matrices; Projections and
shadows.
MODULE – 4 13 Hrs
Lighting and Shading: Light and matter; Light sources; The Phong lighting model; Computation of vectors;
Polygonal shading; Approximation of a sphere by recursive subdivisions; Light sources in OpenGL; Specification
of materials in OpenGL; Shading of the sphere model; Global illumination. Implementation: Basic
implementation strategies; The major tasks; Clipping; Line-segment clipping; Polygon clipping; Clipping of other
primitives; Rasterization; Bresenham’s algorithm; Polygon rasterization; Hidden-surface removal; Antialiasing;
Display considerations.
20
Text Books :
Edward Angel, “Interactive Computer Graphics A Top-Down Approach with OpenGL”, Addison-Wesley, 5th
Edition, 2013. (Chapters 1, 2, 3, 4, 5, 6, 7)
Reference Books:
1. F.S. Hill,Jr, “Computer Graphics Using OpenGL”, Pearson education,2nd Edition,2011.
2. James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes, “Computer Graphics”, Addison-wesley.
MOOCs
1. http://nptel.ac.in/keyword_search_result.php?word=computer+graphics?
2. https://www.edx.org/course/computer-graphics-uc-san-diegox-cse167x-3
3. https://www.mooc-list.com/course/interactive-computer-graphics-coursera
Activity:
1. To recursively subdivide a tetrahedron to from 3D Sierpinski gasket. The number of recursive steps is to be
specified by the user
2. To draw a Rocket and allow the user to change the color.
3. To create a house like figure and rotate it about a given fixed point using OpenGL functions
4. To draw a color cube and spin it using OpenGL transformation matrices
5. To create a cylinder and a parallelepiped by extruding a circle and quadrilateral respectively. Allow the user
to specify the circle and the quadrilateral
6. Using OpenGL functions draw a simple shaded scene consisting of a tea pot on a table. Define suitably the
position and properties of the light source along with the properties of the surfaces of the solid object used
in the scene.
7. To fill any given polygon using scan-line area filling algorithm. (Use appropriate data structures.)
8. To display a set of values { fij } as a rectangular mesh.
9. To dip the line PQ against the window coordinates (0,0) and (10,10). P=(-8,2) and Q=(2,14) using
LiangBarsky line clipping algorithm.
10. To clip the line segment A(-4,2) and B(-1,7) in a window defined by left bottom corner at (-3,1)
and upper right corner at (2,6). Find the visible portion of the line segment using Cohen
Sutherland line clipping algorithm.
21
Course Title COMPUTER NETWORKS
Course Objective: Students able to acquire knowledge of working mechanism of different types of Networks,
Address Mechanisms and Protocols.
Course outcomes
PO’s to PSO’s
1. Distinguish different types of networks and Connecting devices PO1, PO5 -
2. Recognize the importance of the Network Layer Services and Network
PO1, PO2 -
addressing mechanisms.
3. Apply the different Versions of Internet Protocols and IP Addresses PO2, PO4 -
4. Analyse the performance of Uncast and Multicast routing algorithms and
PO2, PO3 -
their uses.
5. Design the Transport Layer Protocols for different service. PO3 -
6. Investigate the use of different QoS models and their applications. PO4 -
Course Contents:
MODULE – 1 13 Hrs
Wired and Wireless Networks: Telephone Networks, Cable Networks, Bluetooth, Wimax, Satellite Networks;
Connecting Devices and Virtual LANs: Connecting devices and Virtual LANs; Network Layer: Network Layer
Services, IPv4 Addresses: Address Space, Classful Addressing, Classless Addressing, DHCP, NAT.
MODULE – 2 13 Hrs
Network Layer Protocols: Internetwork Protocol: Datagram format, Fragmentation, Options, Security of IPV4
Datagrams; ICMPv4: Messages, Mobile IP: Addressing, Agents, Three Phases, Inefficiency in Mobile IP; Unicast
Routing: Introduction: General Idea, Least Cost Routing; Routing Algorithms: Distance Vector, Link-State
Routing , Path-Vector Routing; Unicast Routing Protocols: Internet Structure, Routing Information Protocol
(RIP), Open Shortest Path First (OSPF), Border Gateway Protocol Version 4 (BGP4).
MODULE – 3 13 Hrs
Multicast Routing: Introduction: Unicasting, Multicasting, Broadcasting; MULTICASTING BASICS: Multicast
Addresses, Delivery at Data-Link Layer, Collecting Information about Groups, Multicast Forwarding, Two
Approaches to Multicasting; INTRADOMAIN MULTICAST PROTOCOLS: Multicast Distance Vector (DVMRP),
Multicast Link State (MOSPF) Protocol Independent Multicast (PIM); INTERDOMAIN MULTICAST PROTOCOLS:
IGMP: Messages, Propagation of Membership Information, Encapsulation; Next Generation IP: IPV6 Addressing
,The IPV6 Protocol; Transport Layer protocols: Introduction: Services, Port Numbers, User Datagram
Protocol(UDP): User Datagram, UDP Services, UDP Applications; Transmission Control
Protocol(TCP): TCP Services, TCP Features , Segment, A TCP Connection, Windows in TCP.
MODULE – 4 13 Hrs
Transmission Control Protocol: Flow Control, Error Control, TCP Congestion Control; TCP Timer and Options;
Stream Control Transmission Protocol (SCTP): Services, Features, Packet Format and Association; Quality of
Services: Data Flow Characteristics; Flow Control to Improve QoS: Scheduling, Traffic Shaping or Policing,
22
Resource Reservation, Admission Control; INTEGRATED SERVICES (INTSERV): Flow Specification, Admission,
Service Classes, Resource Reservation Protocol (RSVP), Problems with Integrated Services; DIFFERENTIATED
SERVICES (DFFSERV).
Text Books :
Behrouz A. Forouzan, Data Communications and Networking, Tata McGraw-Hill, 5th Edition
(Chapters 14,15.3,16,17,18.1,18.4,19,20,21,22.1,22.2,24,30)
Reference Books:
1. Alberto Leon-Garcia and Indra Widjaja, Communication Networks–Fundamental Concepts and Key
architectures, Tata McGraw- Hill, 2nd Edition.
2. William Stallings, Data and Computer Communication, Pearson Education, 8th Edition.
3. Nader F. Mir, Computer and Communication Networks, Pearson Education, 2014.
MOOCs
2. https://www.edx.org/course/computer-networks-internet-kironx-fhlcnx
23
Course Title MOBILE APPLICATION DEVELOPMENT LABORATORY
Course Objective: Design and develop apps for android devices.

# Mapping Mapping
Course outcomes
1. Install and configure Android app development tools PO5 -
2. Develop simple GUI applications, using built-in widgets and components PO5,PO9
of android studio
-
Course Contents:
1. Develop an android application which accepts the SGPA of all the six semesters and displays your CGPA.
2. Design an app that displays the names of all planets in our universe. Clicking on “Solar System” in first activity
should display all the planet’s names in second activity and it should return the total number of planets to
first activity.
3. Develop an android application to login into a system which is redirected to the Home screen. The login
should be successful on
email: [email protected]
password: admin123
If the email/password is invalid display a Toast with an error message
4. Develop a QUIZ app that displays a question with four answers as options. Clicking an option should display
whether the selected option is right or wrong.
5. Assume you need accept order online for fast food items. Design an app such that it accepts the order for
multiple items and displays the total amount to be paid on placing the order.
6. Design an app to display menu options on clicking a button “FILE”. The menu options are : New, Open, Save,
Save as, Print. Clicking on any option should display the relevant information.
7. Design an app to accept your name, roll number and branch programmatically.
8. Develop an android application to list all the engineering branches of MCE and displays a brief information
of any department which the user clicks on in a separate page.
a. Assume you are accepting employee details: Name, Designation, Salary, Phone number. Develop app
that displays an alert message if phone number entered is more than 10 digits.
b. Develop an android application to render the text data into TextView from the remote server. Show
progress bar when the data is loading or Toast message if data fails to load.
9. Consider a scenario where you need to send an email to multiple users. Design an app to implement the
same.
10. Develop an android application to get the satellite map of the co-ordinate given using text input.
11. Develop an android application to display a gallery view (Grid View) of at least 10 images.
24
Course Title SYSTEM SOFTWARE LABORATORY
SEE 50 Marks Total Hours 28
Course Objective: Implement shell script, Unix system Programs and make use of LEX and YACC to generate
the grammar.
Course Outcomes (COs) : Upon completion of the course, students shall be able to:
# Mapping Mapping
Course outcomes
1. Execute various programs using Unix system calls and shell script. PO2,PO3 PSO1
2. Implement programs using grammar driven tools such as LEX and YACC. PO1,PO2,
-
PO3
3. Implement parser using regular expressions and grammar. PO1,PO2,
PSO1
PO3
Course Contents:
1. a) Create an input text file in few lines which describes about your aim in life and develop a LEX program
to count the number of characters, words, spaces & no. of lines in the input file.
b) Create an input file which consists of a C program to find the area of a circle with comment lines and
develop a LEX program to count the number of comment lines in the input file and also eliminate them
and copy that program into separate file.
2. Develop a LEX program to recognize valid arithmetic expression and recognize the identifiers and
operators present in the expression and print them separately.
3. a) Create a C program and for this file develop LEX program to recognize and count the number of
identifiers in a given C program.
b) Write a short note on Computer Science and Engineering and develop LEX program to find and replace
the word Computer as CS.
4. a) Create a file which lists the latest open source application useful for Computer Science and
Engineering and develop a LEX program to copy the content of this file with line numbers to another
file.
b) Check whether the dates are in valid format [DD/MM/YYYY] by developing LEX program.
5. Write and Execute YACC program to convert infix to postfix.
6. Develop YACC program to evaluate an arithmetic expression involving operators +, -, * and /.
7. a) Write and Execute YACC program to recognize the grammar (anb, n >= 10).
b) Write and Execute YACC Program to recognize the grammar (anbmck, m,n,k>=0 and m=n+k).
8. Write a C/C++ program which demonstrates inter process communication between a reader process
and a writer process. Use mkfifo, open, read, write and close APIs in your program.
9. Write a C/C++ program to illustrate the race condition.
10. Write a C/C++ POSIX compliant program to check the following limits:
(i) No. of clock ticks
(ii) Max. no. of child processes
(iii) Max. path length
(iv) Max. no. of characters in a file name
(v) Max. no. of open files/ process
11. Write a C/C++ program to implement the system function.
25
12. Write a C/C++ program to set up a real-time clock interval timer using the alarm API.
13. Write and Execute C program to do the following:
(i) Using fork( ) create a child process.
(ii) The child process prints its own process-id and id of its parent and then exits.
(iii) The parent process waits for its child to finish (by executing the wait( )) and prints its own process-
id and the id of its child process and then exits.
26
Course Title MULTIMEDIA COMPUTING
Course Objective: To study the features of multimedia services and applications.

Course outcomes
PO’s to PSO’s
1. Differentiate the types of media and data streams. PO1, PO2 -
2. Identify various video technologies, graphics and images. PO2, PO3 -
3. Implement different types of Data compression techniques. PO3, PO4 -
4. Compare the different data, file formats and storage media. PO1, PO2 -
5. Design multimedia applications. PO3, PO4 -
Course Contents:
MODULE – 1 10 Hrs
Introduction, Media and Data Streams, Audio Technology: Multimedia Elements; Multimedia Applications;
Multimedia Systems Architecture; Evolving Technologies for Multimedia Systems; Defining Objects for
Multimedia Systems; Multimedia Data Interface Standards; The need for Data Compression; Multimedia
Databases. Media: Perception Media, Representation Media, Presentation Media, Storage Media, Transmission
Media, Information Exchange Media, Presentation Spaces & Values, and Presentation Dimensions; Key
Properties of a Multimedia System: Discrete & Continuous Media, Independence Media, Computer Controlled
Systems, Integration; Characterizing Data Streams: Asynchronous Transmission Mode, Synchronous
Transmission Mode, Isochronous Transmission Mode; Characterizing Continuous Media Data Streams.
MODULE – 2 10 Hrs
Data Compression: Storage Space; Coding Requirements; Source, Entropy, and Hybrid Coding; Basic
Compression Techniques; JPEG: Image Preparation, Lossy Sequential DCT-based Mode, Expanded Lossy DCT-
based Mode, Lossless Mode. H.261 (Px64) and H.263: Image Preparation, Coding Algorithms, Data Stream;
MPEG: Video Encoding, Audio Coding, Data Stream
MODULE – 3 10 Hrs
Audio Technology: Sound: Frequency, Amplitude, Sound Perception and Psychoacoustics; Audio
Representation on Computer. Graphics and Images, Video Technology, Computer-Based Animation Capturing
Graphics and Images Computer Assisted Graphics and Image Processing; Reconstructing Images; Graphics and
Image Output Options. Basics; Television Systems; Digitalization of Video Signals; Digital Television; Basic
Concepts; Specification of Animations; Methods of Controlling Animation; Display of Animation.
MODULE – 4 10 Hrs
Data and File Format Standards: Rich-Text Format; TIFF File Format; Resource Interchange File Format (RIFF);
MIDI File Format; JPEG DIB File Format for Still and Motion Images; Multimedia Application Design: Multimedia
Application Classes; Types of Multimedia Systems; Virtual Reality Design; Components of Multimedia Systems;
Organizing Multimedia Databases;
Text Books :
27
1. Ralf Steinmetz, Klara Narstedt, Multimedia Fundamentals: Vol 1-Media Coding and Content Processing,
Pearson Education / PHI, 2012.
2. Prabhat K. Andleigh, Kiran Thakrar, “Multimedia Systems Design”, PHI, 2013
Reference Books:
1. K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic, Multimedia Communication Systems: Techniques,
Standards and Networks, Pearson Education, 2012.
2. Nalin K Sharad, Multimedia information Networking, PHI, 2012.
MOOCs:
https://nptel.ac.in/courses/117/105/117105083/
Activities:
Activities on signal, image and video processing techniques using MATLAB.
28
Course Title PYTHON APPLICATIONS PROGRAMMING
Course Objective: Design and implement python application related to network programming, web services and
databases.
Course Outcomes(COs): Upon completion of the course, students shall be able to:
Course outcomes
PO’s to PSO’s
1. Describe Regular expressions, networking, threads and web services PO1 -
2. Demonstrate the interactions among various components PO1, PO2 -
3. PO1,PO2,
Analyze the various packages and modules of python language -
PO3
4. PO2, PO3,
Design python applications for the given context PSO1
PO4, PO5
Course Contents:
MODULE – 1 10 Hrs
Regular expressions: Introduction/Motivation, Special symbols and combination, Regexes and Python and
Examples. Text Processing: Comma-Separated values, Java Script object notation, Extensible Markup Language
(EML).
MODULE – 2 10 Hrs
Internet Programming: Introduction, what is client /server architecture? Sockets: Communication Endpoints,
Network Programming in Python, the socket server Model, Transferring files. Multithreaded programming:
Introduction/Motivation, threads and process, threads and pythons, the thread module, the threading module,
comparing single and multithreaded execution.
MODULE – 3 10 Hrs
GUI Programming: Tkinter, Introduction, Tkinter and python programming, Tkinter examples, A Brief Tour of
other GUIs, Related modules and Other GUIs. Web clients and server: Introduction, python wed client’s tool,
Web (HTTP Server), Related modules.
MODULE – 4 10 Hrs
Web Application Programming: Introduction, helping Web servers process client data, building GUI
Application, using Unicode with CGI Web Frame Works: Django-Introduction Web Frame works, Introduction
to Django, Project and apps, your “Hello World Application” (A blog), creating a module to add data base
service, A Python application shell.
Text Books:
Core Python Application Programming, Wesley J Chun, 3rdEdition, Pearson Publication, 2016.
Reference Books:
1. Beginning Python: Using python 2.6 and Python 3.1, James Paynelives, Wiley Private limited, 2014
2. Learning Python, Fabrizio Romano, Packt publishing, 2nd Edition, 2014
MOOCs:
https://onlinecourses.nptel.ac.in/noc22_cs31
Activity:
1. Given a password, check for its validity using regex and appropriate functions. The password must
contain:
29
a. Minimum 8 characters.
b. The alphabets must be between [a-z]
c. At least one alphabet should be of Upper Case [A-Z]
d. At least one digit
e. At least one special character from [ _ or @ or $].
2. Given a json file containing details about all countries, retrieve the list of countries with their capital cities,
national language and respective national currency.
3. One of my friends has some problem in his/her PC and he/she is in out of state, so using reverse shell
connection (socket programming) help me out to connect his/her PC since, I couldn’t reach him/her.
4. You guys are familiar with Dining Philosopher problem, so using Multithreading demonstrate dining
philosopher problem.
5. Using tkinter module create a simple CRUD GUI, where you can create, read, update and delete data from
database
30
Course Title GRAPH THEORY AND COMBINATORICS
Course Objective: To design and perform abstract concepts of graph theory in modeling and solving non-trivial
problems.
Course outcomes
PO’s to PSO’s
1. Describe the concepts of graphs and counting principles. PO1 -
2. Apply the concepts of graphs and counting principles in solving real time PO1,PO2
-
applications
3. Analyze various concepts of graph and counting techniques applied in PO1,PO2
-
solving real time applications
4. Design solutions for real time problems adopting the concepts of graph PO1,PO2,
-
and counting ideas. PO3
Course Contents:
MODULE – 1 10 Hrs
An Introduction to Graph theory: Definitions and examples, Sub graphs, Complements and Graph
isomorphism, Vertex degree, Euler Trails and Circuits, Planar Graphs: Planar graphs, Hamilton paths and
cycles.
MODULE – 2 10 Hrs
An Introduction to Graph theory (conti..):Graph coloring, chromatic number, and chromatic polynomials.
Optimization and Matching: Transport Networks: The Max-Flow Min-Cut Theorem, Matching Theory.
MODULE – 3 10 Hrs
The Principles of Inclusion and Exclusion: The Principle of Inclusion and Exclusion, generalizations of the
principle, Derrangements, Rook Polynomials, Arrangements with forbidden Positions. Generating function:
Introductory examples, Definition and examples; Partitions of Integers.
MODULE – 4 10 Hrs
Generating function (conti..): The exponential generating function, the Summation Operator. Recurrence
relations: First-order and second order linear recurrence relations, with constant coefficients, The non-
homogeneous recurrence relation, The Method of Generating Functions.
Text Books :
1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, , 5th Edition, Pearson Education. 2004.
Chapters 8, 9,10,11,12.
2. Dr. D.S. Chadrashekar: Graph Theory and Combinotorics, 4th Edition, Prism,2012(Chapter 4)
Reference Books:
1. NarsingDeo, Graph Theory with applications to Engineering and Computer Science, PHI Publications.
2. V Balakrishnan, Combinatorics, Schaum Series, Tata-McGraw Hill Publications
MOOCs
31
Activity:
1. Two cases of soft drinks, 24 bottles of one type and 24 of another are distributed among five surveyors who
are conducting taste tests. In how many ways can the 48 bottles be distributed so that each surveyors
gets (a) at least two bottles of each type? (b) At least two bottles of one particular type and at least three
of the other?
2. How can Mary split up 12 hamburgers and 16 hot dogs among her sons Richard, Peter Christopher, and
James in such a way that James gets at least one hamburger and three hot dogs, and each of his brothers
gets at least two hamburgers but at most five hot dogs?
3. Sergeant bueti must distribute 40bullets (20 for rifkes and 20 for handguns) among four officers so that each
officer gets at least two, but no more than seven, bullets of each type. In how many ways can he do this
4. Nineteen students in a nursery school play a game each day where they hold to hands to form a circle. For
how many days can they do this with no students holding hands with the same playmate twice?
5. In each of the following “transport networks” two companies c1 and c2, produce a certain product that is
used by two manufactures, m1 and m2. For the network shown in part(a) of Fig. 13.22, company c1 can
produce 8 units and company c2 can produce 7 units; manufacturer m1 requires 7 units and manufacturer
m2 needs 6 units. In the network shown in Fig 13.22 (b), each company can produce 7 units and each
manufacturer needs 6 units. In which situation(s) can the producers meet the manufactures demands?
6. Fritz is in charge of assigning students to part-time jobs at the college where he works. He has 25 student
applications, and there are 25 different part-time jobs available on the campus. Each applicant is qualified
for at least four of the jobs, but each job can be performed by at most four of the applicants. Can Fritz
assign all the students to jobs for which they are qualified? Explain. Characterize the type of graph in
which an Euler trail (circuit) is also a Hamilton path (cycle).
32
Course Title DATA MINING AND WAREHOUSING
Course Objective: To understand the concepts of data mining and to apply the same for a givenapplication.
Course outcomes
PO’s to PSO’s
1. Describe the design of Data Warehousing. PO1, PO2 -
2. PO2, PO3,
Compare and contrast different data mining tasks -
PO4
3. Analyze data related issues for successful data mining. PO1, PO2 -
4. PO1, PO3,
Evaluate models/algorithms with respect to their accuracy. -
PO4
Course Contents:
MODULE – 1 10 Hrs
Data Warehousing: Introduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), Data
Warehouses, Design issues, Guidelines for Data Warehouse Implementation, Data Warehouse metadata.
Online Analytical Processing (OLAP): Introduction, Characteristics of OLAP systems, Multidimensional view and
Data cube, Data cube implementations, Data cube operations, Implementation of OLAP.
MODULE – 2 10 Hrs
Introduction to Data Mining: What is Data Mining? Motivating Challenges, The origins of data mining, Data
Mining Tasks, Types of Data, Data Pre-processing, Measures of Similarity and Dissimilarity: Basics, Similarity and
Dissimilarity between Simple Attributes, Dissimilarities between Data Objects, and Similarities between Data
Objects.
MODULE – 3 10 Hrs
Classification: Preliminaries; General approach to solving a classification problem; Decision tree induction;
Rule-based classifier; Nearest-neighbor classifier, Association Analysis: Problem Definition; Frequent Item set
generation; Rule Generation; Compact representation of frequent item sets; Alternative methods for
generating frequent item sets.
MODULE – 4 10 Hrs
Association Analysis (cont...): FP-Growth algorithm, Evaluation of association patterns; Effect of skewed
support distribution; Sequential patterns.Cluster Analysis: Overview, K-means, Agglomerative hierarchical
clustering, DBSCAN.
Text Books:
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Introduction to Data Mining, 1st Edition
(Reprint) Pearson Education, 2014.
2. G. K. Gupta: Introduction to Data Mining with Case Studies, 3rd Edition, PHI, New Delhi, 2009.
Reference Books:
1. Jiawei Han and Micheline Kamber, Data Mining – Concepts and Techniques, Morgan Kaufmann, 3rd
Edition, 2012.
2. K.P. Soman, Shyam Diwakar, V.Ajay, Insight into Data Mining – Theory and Practice, PHI, 2006
MOOCs:
33
3. https://www.edx.org/course/analytics-for-decision-making
34
Course Title PRINCIPLES OF PROGRAMMING LANGUAGES
Course Objective: To make the students analyze constructs of programming languages and apply in
programming.
Course outcomes
PO’s to PSO’s
1. Understand the preliminary concepts of principles of programming PO1
-
languages.
2. Compare the concepts of data types, syntax and semantics, PO1, PO2
-
expressions of different programming languages.
3. Apply the concept of structured programming and procedures to PO1,PO2,P
PSO1
develop programs. O3
4. Apply the concept of OOP and exceptions handling in programming. PO1,PO2,P
PSO1
O3
5. Develop simple programs using functional and logical programming PO1,PO2,P
PSO1
languages. O3
Course Contents:
MODULE – 1 10 Hrs
Preliminary Concepts: Reasons for studying, concepts of programming languages, Programming domains,
Language Evaluation Criteria, influences on Language design, Language categories, Programming Paradigms –
Imperative, Object Oriented, functional Programming , Logic Programming. Programming Language
Implementation – Compilation and Virtual Machines, programming environments. Syntax and Semantics:
Expression notations, Abstract syntax trees, lexical syntax, context-free grammars, Grammars for expressions,
Attribute grammars, de-notational semantics.
MODULE – 2 10 Hrs
Data types: Introduction, primitive, character, user defined, arrays, record, union, pointers. Names, Variable,
concept of binding, type checking, strong typing, type equivalence. Structured programming: The need for
structured programming: static programs, dynamic computations, design principles for imperative languages,
example, syntax-directed control flow: composition of statements, selection, looping constructs, design
considerations: syntax, Handling special cases in loops.
MODULE – 3 10 Hrs
Procedure Activations: Introduction to procedures, parameter passing methods, scope rules for names, nested
scopes, activation records, Procedures as in C. Object-oriented programming and Concurrency: What is an
object?, Inheritance, OOP in C++, Derived classes and information hiding. Concurrency: Subprogram level
concurrency, semaphores, monitors, massage passing.
MODULE – 4 10 Hrs
Exception handling: Exceptions, exception Propagation, Exception handler in C++. Logic Programming Language:
The basic elements of Prolog, applications of logic programming. Functional Programming with Lists: Scheme, A
dialect of LISP, The structure of lists, List manipulation.
Text Books :
35
1. Concepts of Programming Languages, Robert .W. Sebesta 11/e, Pearson Education,2014.(Chapters 1.1
to 1.5, 1.7, 1.8, 3.4.1 to 3.4.6, 3.5.2, 3.5.2.1, 5.2 to 5.4, 6.1 to 6.5, 6.12 to 6.14, 13.2 to 13.5, 14.1, 14.3,
16.6, 16.8)
2. . Programming Languages concepts & constructs, Ravi Sethi, Pearson, 2ndedition. (Chapters 2, 3.1 to 3.4,
4.4, 4.5, 4.7, 5, 7.1, 7.3 to 7.5, 10.1 to 10.3)
Reference Books:
1. Programming Languages, 2nd Edition, A.B. Tucker, R.E. Noonan, TMH.
2. Programming Languages, K. C.Louden, 2nd Edition, Thomson,2003.
MOOCs:
http://nptel.ac.in/courses/106102067/
36
Course Title INTRODUCTION TO CLOUD COMPUTING
Course Code 19OECS61 L-T-P-C 3-0-0-3
Course Objective: Students will be able to find out cloud computing service models and applications
Course outcomes
PO’s to PSO’s
1. Apply the knowledge for the identification of architecture and PO2, PO4 -
infrastructure for Cloud Computing.
2. Assessment of the economics, financial, and technological implications for
PO2, PO4 -
selecting cloud deployment model
3. Choose appropriate cloud model for a given application PO3, PO5 -
4. Identify security management in cloud PO6, PO8 -
5. Develop applications for cloud computing PO5, PO7
Course Contents:
MODULE – 1 10 Hrs
Introduction: Cloud computing at a glance, historical developments, building cloud computing environments,
computing platforms and technologies. Principles of parallel and Distributed computing: Eras of computing,
parallel vs. Distributed computing, elements of parallel computing, elements of distributed computing,
technologies for distributed computing.
MODULE – 2 10 Hrs
Virtualization: Introduction, characteristics of virtualized environments, Taxonomy of virtualization techniques,
virtualization and cloud computing, pros and cons of virtualization technology
Cloud Computing architecture: Introduction, Cloud reference model, types of clouds, economics of the cloud,
open challenges.
MODULE – 3 10 Hrs
Cloud platforms in industry: Amazon Web Services, Google AppEngine, Microsoft Azure
Advanced topics in cloud computing: Energy efficiency in clouds, Market based management of clouds,
federated clouds/interclouds, Third party cloud services.
MODULE – 4 10 Hrs
Infrastructure security, IAM: Infrastructure security: network level, host level, application level, Identity and
Access management: trust boundaries and IAM, why IAM? IAM challenges, IAM definitions, IAM architecture
and practices, getting ready for cloud, IAM standards and protocols for cloud services, IAM practices in the cloud,
cloud authorization management.
Security management in the cloud: security management standards, security management in the cloud,
availability management, Saas, Paas. Iaas availability management, access control, security vulnerability, patch
and configuration management. Privacy: What is privacy? What is data life cycle? What are the key privacy
concerns in cloud? Who is responsible for protecting privacy?
Text Books:
1. Mastering Cloud Computing, McGraw Hill publication, Rajkumar Buyya, Christian Vecchiola,
S.ThamaraiSelvi
2. Cloud security and privacy an enterprise perspective on risks and compliances,2013, Tin Mather, Subra
kumarswamy, shahed Latif
37
Reference Books:
1. Cloud Computing: Theory and Practice, Dan C Marinescue, first edition, MK publishers Nalin K Sharad,
Multimedia information Networking, PHI, 2012.
2. Cloud Computing- A practical approach, McGraw Hill publication, Anthony T. Velte, Toby J. Velte, Robert
Elsenpeter
MOOCs
1. https://www.youtube.com/watch?v=Eg4AAGCE7X4
2. https://www.coursera.org/learn/cloud-computing
3. https://www.edx.org/course/introduction-cloud-computing-microsoft-cloud200x
Activities:
Students are required to demonstrate the usage of various cloud deployment models
38
Course Title DATABASE FUNDAMENTALS
Course Code 19OECS62 L-T-P-C 3-0-0-3
Course Objective: Design a database and write SQL queries.

Course outcomes
PO’s to PSO’s
1. Apply knowledge of database concepts in designing database PO1,PO2 -
2. Analyze a problem, in identifying appropriate computing requirements to PO1,PO2
-
get a solution.
3. Formulate SQL queries to manage database. PO2 -
4. Design a database for a given scenario using appropriate techniques. PO1,PO2 -
Course Contents:
MODULE – 1 10 Hrs
Introduction: Introduction; An example; Characteristics of Database approach; Actors on the screen; Workers
behind the scene; Advantages of using DBMS approach; when not to use a DBMS. Data models, schemas and
instances; Three-schema architecture and data independence; Database languages and interfaces; The
database system environment; Centralized and client-server architectures; Classification of Database
Management systems.
MODULE – 2 10 Hrs
Entity-Relationship Model: Using High-Level Conceptual Data Models for Database Design; A sample Database
Application; Entity Types, Entity Sets, Attributes and Keys. Relationship types, Relationship Sets, Roles and
Structural Constraints; Weak Entity Types; ER Diagrams, Naming Conventions and Design Issues; Relationship
types of degree higher than two.
MODULE – 3 10 Hrs
Relational Model and Relational Algebra: Relational Model Concepts; Relational Model Constraints and
Relational Database Schemas; Update Operations, Transactions and dealing with constraint violations; Unary
Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary Relational
Operations: JOIN and DIVISION.
SQL: SQL Data Definition and Data Types; Specifying basic constraints in SQL; Basic Retrieval queries in SQL; Insert,
Delete and Update statements in SQL;
MODULE – 4 10 Hrs
SQL: Additional features of SQL, More complex SQL Retrieval Queries; Views; Schema Change Statements in SQL.
Database Design: Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms
Based on Primary Keys; General Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form.
Concurrency control techniques: Two-Phase Locking Techniques for Concurrency control; Concurrency Control
Based on Timestamp Ordering.
Text Books :
1. Elmasri and Navathe, Fundamentals of Database Systems, Addison-Wesley, 7th Edition, 2015.
2. Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems, McGraw-Hill, 3rd Edition,
2007
Reference Books:
39
1. Silberschatz, Korth and Sudharshan, Data base System Concepts, 5th Edition, Mc-GrawHill, 2006
2. C.J. Date, A. Kannan, S. Swamynatham, A Introduction to Database Systems, Pearson education, 8th
Edition, 2006
MOOCs:
http://nptel.ac.in/courses/106106093
40
VIII Semester
Hours Total # of
Course Course Total
Course Title Contact
Category Code L T P Credits
Hours
Seminar on Advanced
SR 18CS801 0 0 1 1 2
Topics
PROJ-3 18CS802 Project Work 0 0 9 9 18
IN 18CS803 Internship (Four Weeks) 0 0 2 2 4
PE-4 18CS88X Elective -IV 3 0 0 3 3
Total 3 0 12 15 27
Elective -IV
Sl. Course Course Title
No. Code
1. 18CS881 C# Programming and .NET
2. 18CS882 Advanced Algorithms
3. 18CS883 Operations Research
4. 18CS884 Principles of Compiler Design
5. 18CS885 Storage Area Networks
6. 18CS886 Mobile Communications
41
Course Title C# PROGRAMMING AND .NET
Course Objective: Students will be able to develop various console and windows applications.
Mapping to Mapping
# Course outcomes
PO’s to PSO’s
1. Develop programs that use reusability properties and namespaces. PO3 -
Design applications using classes, methods, interfaces and inheritance
2. PO1, PO3 -
techniques and manage exceptions.
3. Create delegates, packages and manage database. PO2, PO3 -
Demonstrate windows application system and build their own
4. PO3 PSO1
applications
Course Contents:
MODULE – 1 10 Hrs
Overview of C#:Introduction , A Simple C# Program, Namespaces , Adding Comments, Main Returning a Value,
Using Aliases for Namespace Classes, Passing String Objects to WriteLine Method, Command Line Arguments,
Main with a Class, Providing Interactive Input, Using Mathematical Functions, Multiple Main Methods, Compile
Time Errors. Literals, Variables and Data Types: Introduction, Literals , Variables , Data Types , Value Types
Reference Types, Declaration of Variables , Initialization of Variables , Default Values ,Constant Variables ,
Scope of Variables , Boxing and Unboxing. Operators and Expressions : Introduction, Arithmetic Operators,
Relational Operators, Logical Operators, Assignment Operators, Increment and Decrement Operators,
Conditional Operator, Bitwise Operators , Special Operators ,Arithmetic Expressions, Evaluation of Expressions
,Precedence of Arithmetic Operators, Type Conversions ,Operator Precedence and Associatively. Mathematical
Functions. Decision Making and Branching: Introduction, Decision Making with if Statement, Simple if
Statement, The if... else Statement, Nesting of if... else Statements, The else if Ladder, The Switch Statement
The? : Operator. Decision Making and Looping: Introduction, The while Statement The do Statement, The for
Statement, The for each Statement. Methods in C#:Introduction, Declaring Methods, The Main Method,
Invoking Methods, Nesting of Methods, Method Parameters, Pass by Value, Pass by Reference, The Output
Parameters, Variable Argument Lists, Methods Overloading. Handling Arrays: One-Dimensional Arrays,
Creating an Array, Two- Dimensional Arrays, Variable- Size Arrays, the System. Array Class. Manipulating Strings
: Creating Strings, String Methods, Inserting Strings, Comparing Strings, Finding Substrings, Mutable Strings,
Arrays of Strings
MODULE – 2 10 Hrs
Classes and Objects :Introduction, Basic principles of OOP, Defining a Class, Adding Variables and Methods,
Member Access Modifiers, Creating Objects, Accessing Class members, Constructors, Overloaded Constructors,
Static Members, Static Constructors, Private Constructors, Copy Constructors, Destructors, Member
Initialization. Inheritance and Polymorphism: Introduction, Classical Inheritance, Containment Inheritance,
Defining a Subclass, Visibility Control, Defining Subclass Constructors, Multilevel Inheritance, Hierarchical
Inheritance, Overriding Methods, Hiding Methods, Abstract Classes, Abstract Methods, Sealed Classes:
Preventing Inheritance, Sealed Methods, The this reference, Nesting of Classes, Constant Members, Read-only
Members, Properties, Indexers. Polymorphism, Interface: Multiple Inheritance, Multiple Inheritance:
Introduction, Defining an Interface, Extending an Interface, Implementing Interfaces, Interfaces and
Inheritance, Explicit Interface Implementation, Abstract Class and Interfaces.
42
Operator Overloading: Introduction, Overloadable Operators, Need for Operator Overloading, Overloading
Unary Operators, Overloading Binary Operators, Overloading Comparison Operators Delegates and Events:
Introduction, Delegates, Delegate Declaration, Delegate Methods, Delegate Instantiation, Delegate Invocation,
Using Delegates, Multicast Delegates, Events. Managing Errors and Exceptions: Introduction, What is
Debugging? Types of Errors, Exceptions, Syntax of Exception Handling Code, Multiple Catch statements, The
Exception Hierarchy, General Catch Handler, Using Finally statement, Nested Try Blocks, Throwing our Own
Exceptions, Checked and Unchecked Operators, Using Exceptions for Debugging
MODULE – 3 10 Hrs
Understanding . NET: The C# Environment: Building a Better Window (Introducing Windows Forms):
Overview of the System. Windows. Forms Namespace, Working with the Windows Forms Types, The Role of the
Application Class ,The Anatomy of a Form, The Functionality of the Control Class, The Functionality of the Form
Class, Building Windows Applications with Visual Studio 2005, Working with Menu Strips and
ContextMenuStrips, Working with Status Strips.
Programming with Windows Forms Controls: The World of Windows Forms Controls, Adding Controls to
Forms by and, Adding Controls to Forms Using Visual Studio 2005, Working with the Basic Controls, Configuring
the Tab Order, Setting the Form’s Default Input Button, Working with More Exotic Controls, Building Custom
Windows Forms Controls, Testing the Car Control Type, Building a Custom Car Control Form Host.
MODULE – 4 10 Hrs
Data Access with ADO.NET: A High-Level Definition of ADO.NET, Understanding ,DO.NET Data Providers,
Additional ADO.NET Namespaces, The System. Data Types, Abstracting Data Providers Using Interfaces,
Increasing Flexibility Using Application ,Configuration Files, The .NET 2.0 Provider Factory Model, The
<connectionStrings> Element Installing the Cars Database, Understanding the Connected Layer of ADO.NET,
Working with Data Readers, Modifying Tables Using Command Objects, Working with Parameterized
Command Objects, Executing a Stored Procedure Using DB Command, Asynchronous Data Access Under .NET
2.0,Understanding the Disconnected Layer of ADO.NET.
ASP. NET Web Pages and Web Controls: The Role of HTTP, Understanding Web Applications and Web Servers,
The Role of HTML, The Role of Client-Side Scripting, Submitting the Form Data (GET and POST), Building a
Classic ASP Page, Problems with Classic ASP, The ASP.NET 2.0 Namespaces, The ASP.NET Web Page Code
Model, Details of an ASP.NET Website Directory Structure, The ASP.NET 2.0 Page Compilation Cycle, The
Inheritance Chain of the Page Type, Interacting with the Incoming HTTP Request, Interacting with the Outgoing
HTTP Response, The Life Cycle of an ASP.NET Web Page, Understanding the Nature of Web Controls
Text Books :
1. Andrew Troelsen , “Pro C# and the .NET 3, Special edition, A Press, 2012
2. E. Balagurusamy," Programming in C# A Primer", 3rd edition, TMH, 2010.
Reference Books:
Tom Archer: Inside C#, WP Publishers, 2001.
MOOCs:
1. https://www.udemy.com/course/c-net-for-beginners/
2. https://www.udemy.com/course/aspnet-webforms/
43
Course Title ADVANCED ALGORITHMS
Course Objective: Students should be capable of designing algorithms using suitable algorithm
design method and mathematically analyze it.
# Mapping Mapping
Course outcomes
1. Determine the asymptotic complexity of algorithms including solving of PO1, PO2
-
recurrence relations.
2. Explain advanced data structures. PO1, PO3 -
3. Apply the dynamic programming concept, greedy approach, and the PO2
-
graph algorithms for problem solving.
4. Develop algorithm for a given real life problem. PO1,PO2 PSO1
Course Contents:
MODULE – 1 10 Hrs
Growth Functions: Asymptotic notations, standard notations and common functions, Summations:
summations formulas and properties, bounding summations, recurrences: the substitution method, iteration
method, master method.
Hash tables: Direct- address tables, hash tables, hash functions, open addressing. Amortized analysis: The
aggregate method, the accounting method, the potential method, dynamic tables
MODULE – 2 10 Hrs
Definitions of B-trees, basic operations on B-trees, deleting a key from B-tree, Binomial heaps: binomial trees
and binomial heaps, operations on binomial heaps, Fibonacci heaps: structure of Fibonacci heaps, mergeble-
heap operations, decreasing a key and deleting a node, bounding the maximum degree
MODULE – 3 10 Hrs
Sorting Networks: Comparison networks, the zero-one principle, a Bitonic sorting network, a merging network,
a sorting network, Arithmetic circuits: combinational circuits, addition circuits, multiplication circuits.
String matching :The naïve-string algorithm, the rabin-karp algorithm, string matching with finite automata,
the Knuth morris-Pratt algorithm.
MODULE – 4 10 Hrs
NP-Completeness :Polynomial time, polynomial-time verification, NP-Completeness and reducibility
Approximation Algorithm: The vertex-cover algorithm, the travelling salesman problem, the set-covering
problem, the subnet-sum problem.
Text Books :
Thomas H Coreman, Charles E Leiseron, Ronald Rivest, “Introduction to Algorithms”, PHI India 2000,
Chapters( 2,3,4,12,18,19,20,21,28,29.1 to 29.3,34.1 to 34.4,36,37)
Reference Books:
Anany Levitin. “Introduction to Design & Analysis of Algorithms” Pearson Edition 2012.
MOOCs:
https://www.udemy.com/course/advanced-algorithm-python/
44
Course Title OPERATIONS RESEARCH
Course Objective: Formulate & Solve problems as networks & graphs.

Course outcomes
PO’s to PSO’s
1. Develop mathematical model for a given problem. PO1 -
2. Apply techniques of Operations Research. PO2 -
3. Solve prediction and estimation problems. PO1, PO2 -
4. Expose to the significance of various scientific tools. PO5 -
Course Contents:
MODULE – 1 10 Hrs
Introduction : Introduction: The origin, nature and impact of OR; Overview of the Operations Research Modeling
Approach: Defining the Problem and Gathering Data; Formulating a Mathematical Model; Deriving Solutions from
the Model; Testing the Model; Preparing to Apply the Model; Implementation
Linear Programming – 1 : Prototype example; The Linear Programming (LP) Model, Assumptions of LP, Additional
Examples
MODULE – 2 10 Hrs
Simplex Method - 1 : The Essence of the Simplex Method; Setting up the Simplex Method; The Algebra of the
Simplex Method; The Simplex Method in Tabular Form; Tie Breaking in the Simplex Method
Simplex Method – 2 : Adapting to other Model Forms; Post Optimality Analysis, Computer implementation
MODULE – 3 10 Hrs
Revised Simplex Methods : Foundations of the Simplex Method, The revised simplex method, A Fundamental
Insight
Duality Theory : The Essence of Duality Theory; Economic Interpretation of Duality. Primal-Dual Relationships,
Adapting to other primal forms, The role of duality in sensitive analysis; The essence of sensitivity analysis;
Applying sensitivity analysis, The dual simplex method ; Parametric linear programming; The upper bound
technique.
MODULE – 4 10 Hrs
Transportation Model :
Definition of the Transportation Model, Nontraditional Transportation Models, The Transportation Algorithm.
Assignment Model and Network Models : The Assignment Model, CPM and PERT
Text Books :
1. Frederick S. Hillier and Gerald J. Lieberman, “Introduction to Operations Research”, Tata McGraw Hill, 9th
Edition, 2012. (Chapters: 1.1 to 1.3, 2, 3.1 to 3.3, 4.1 to 4.7, 5, 6.1 to 6.7, 7.1)
2. Hamdy A Taha, “Operations Research: An Introduction”, Prentice Hall India, 8th Edition, 2005. (Chapters:
5, 6.4)
Reference Book:
Wayne L. Winston, “Operations Research Applications and Algorithms”, Thomson Course Technology, 4th Edition
2003
MOOCs:
https://www.udemy.com/course/operations-research-intro/
45
Course Title PRINCIPLES OF COMPILER DESIGN
Course Objective: To provide students with the knowledge and abilities to design and implement compilers.
Course outcomes
PO’s to PSO’s
1. Design syntax directed translation schemes for a given context free PO1,PO3
-
grammar
2. Understand various memory management issues while designing a PO1,PO3
-
compiler
3. Construct the intermediate code representations for a given simple PO1,PO3
-
programming constructs
4. Apply the optimization techniques to have a better code for code PO1,PO2
-
generation
Course Contents:
MODULE – 1 10 Hrs
Syntax-Directed Translation : Syntax Directed definitions, Evaluation order for SDD’s, Applications of Syntax-
Directed translation, Syntax Directed Translation Schemes, Implementing L-attributes SDD’s;
MODULE – 2 10 Hrs
Run time environment: Storage Organization, Stack Allocation Space, Access to Non-Local Data on the stack,
Heap Management, Introduction to Garbage Collection.
Intermediate Code Generation : Introduction, Variants of Syntax trees,
MODULE – 3 10 Hrs
Intermediate Code Generation (Contd.): Three Address code, Types and Declarations; translation of expression,
Type Checking, Control flow, Back patching. Switch statements; Intermediate Code for Procedures.
MODULE – 4 10 Hrs
Code Generation: Issues in the design of code generation, the target language, Address in target code. Basic
blocks and flow graphs, Optimization of basic blocks, A simple code generator, Peephole Optimization
Text Books :
Alfred V Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers- Principles, Techniques and Tools”, 2nd Edition , Addison-
Wesley, 2013
Reference Books:
1. Fischer, C. N. and LeBlanc, R. J., “Crafting a compiler with C”, Benjamin Cummings, 2003.
2. Bennet, J.P., “Introduction to Compiler Techniques”, 2nd Edition, TMH, 2003
3. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, Prentice Hall of
India, 2001
MOOCs:
https://nptel.ac.in/courses/106/108/106108113/
46
Course Title STORAGE AREA NETWORKS
Course Objective: Analyze various Storage Area Networks.

Course outcomes
PO’s to PSO’s
1. Demonstrate different RAID levels. PO1,PO2 -
2. Analyze the components of Storage Area Network (SAN). PO1,PO2 PSO2
3. Explore Storage Area Network. PO2 -
4. Demonstrate Network Attached Storage. PO1,PO2 PSO2
Course Contents:
MODULE – 1 10 Hrs
Introduction: Server Centric IT Architecture and its Limitations; Storage – Centric IT Architecture and its
advantages, Case study: Replacing a server with Storage Networks, Architecture of Intelligent Disk Subsystems,
Hard disks and Internal I/O Channels.
Intelligent Disk Subsystem: JBOD, Storage virtualization using RAID, different RAID levels; Caching: Acceleration
of Hard Disk Access; Instant copies, Remote mirroring, LUN masking, Availability of disk subsystems.
MODULE – 2 10 Hrs
I/O Technique: The Physical I/O path from the CPU to the Storage System; SCSI; Fibre Channel Protocol Stack-
links, ports, topologies, FC-0,FC-1,FC-2,FC-3, link services, FC-4.
Fiber channel SAN, Network Attached Storage: Fiber Channel SAN-point-to-point topology, fabric topology,
arbitrated loop topology, hardware components, IP Storage-IP storage standards: iscsi, iFCP, Mfcp, FCIP. The NAS
hardware Architecture, The NAS Software Architecture, Network connectivity.
MODULE – 3 10 Hrs
File System: Local File Systems; Network file Systems and file servers: basic principle, NAS, performance bottle
necks, acceleration of network file systems, case study-DAFS; Shared Disk file systems; Comparison: NAS, fiber
Channel SAN and iSCSI SAN.
Storage Virtualization: Definition of Storage virtualization; Implementation Considerations; Storage
virtualization on Block or file level; Storage virtualization on various levels of the storage Network; Symmetric
and Asymmetric storage virtualization in the Network.
MODULE – 4 10 Hrs
SAN Architecture and Hardware devices: Creating a Network for storage-The network part, The software part-
fabric OS services, The connectivity part- connecting server, connecting the storage, SAN Hardware devices- The
fiber channel switch, Host Bus adaptors. Software Components of SAN: The switch’s operating system, Device
Drivers, The Supporting components.
Text Books :
1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Second Edition Wiley
India, 2009
2. Robert Spalding: Storage Networks, The Complete Reference, Tata McGraw Hill, 2003. (Ch. 9, 13, 14, 15)
Reference Books:
Richard Barker and Paul Massiglia: Storage Area Network Essentials A Complete Guide to understanding and
Implementing SANs, John Wiley India, 2002
MOOCs:
https://onlinecourses.nptel.ac.in/noc18_cs50/preview
47
Course Title MOBILE COMMUNICATIONS
Course Objective: To apply knowledge of Mobile Communications and Technologies in real time applications.
Course outcomes
PO’s to PSO’s
1. Explore the applications, marketing and reference model of Mobile
PO6,PO12 -
communication system.
2. Classify the different types of transmissions, medium access control
PO1, PO2 -
techniques and satellite Systems.
3. Differentiate and analyze the mobile networks and Other Networks. PO1,PO3 -
4. Learn the Process involved in Mobile IP and DHCP Server. PO2,PO4 -
5. Analyze the Routing Protocols and TCP for mobile networks. PO3, PO5 -
Course Contents:
MODULE – 1 10 Hrs
Introduction to Mobile Communications: Applications, History of Wireless Communication, A Market for Mobile
Communications, Some open research Topics, A simplified reference model.
Wireless Transmission: Frequencies for Radio Transmission, Signals, Antennas, Signal Propagation, Multiplexing,
Modulation, Cellular Systems.
MODULE – 2 10 Hrs
Medium Access Control: Motivation for a specialized MAC, TDMA, CDMA, Comparison of S/T/F/CDMA. Satellite
Systems: History, Applications, Basics, Routing, Localizations, Handover; Broadcast Systems: Overview, Cyclical
Repetition of data, DAB, DVB, Convergence of Broadcasting and Mobile communications.
MODULE – 3 10 Hrs
Wireless LAN: Infrared versus radio transmission, Infrastructure and Adhoc Network, IEEE-802.11- System
Architecture and Protocol Architecture.
Mobile Network Layer: Mobile IP: Goals, assumptions and requirements, Entities and terminology, IP packet
delivery, Agent discovery, Registration, Tunnelling and encapsulation, Optimizations; Dynamic host
configuration protocol
MODULE – 4 10 Hrs
Mobile ad-hoc networks: Routing, Destination sequence distance vector, Dynamic source routing, Alternative
metrics , Overview ad-hoc routing protocols
Mobile Transport Layer: Traditional TCP, Classical TCP improvements, TCP over 2.5/3G wireless networks,
Performance enhancing proxies; Support for Mobility: File Systems, i-mode.
Text Books :
Jochen Schiller, Mobile communications, Pearson Education, 2nd edition
Reference Books:
1. Asoke K. Talkukder, Roopa R Yavagal: Mobile Computing – Technology, Applications and Service
Creation, Tata McGraw Hill, 2012
2. Reza B’Far: Mobile Computing Principles – Designing and Developing Mobile Applications with UML
and XML, 5th Edition, Cambridge University press, 2013
MOOCs:
http://www.udemy.com/5g-4g-lte-3g-2g-mobile-cellular-networks-for-beginners/
48
49

Academic Year 2021-22 Scheme and Syllabus

Uploaded by

Copyright:

Available Formats

Academic Year 2021-22 Scheme and Syllabus

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Academic Year 2021-22 Scheme and Syllabus

Uploaded by

Copyright:

Available Formats

Scheme for Academic Year: 2021-2022

Admission Year: 2020-21

BS-9 Discrete Mathematical

PC-12 Algorithms Laboratory with

HSM-4 Social Skills

1. Dr. B. S. Grewal, Higher Engineering Mathematics, Khanna Publications, 44thEdition, 2016

4. a. Sort a given set of elements using Insertion sort method.

5 . a. Implement Horspool algorithm for String Matching.

11. Implement N Queens problem using Back Tracking.

4. RAM is an important component of microcontroller. To understand how it can be accessed, add an

Admission Year: 2019-20

Computer Graphics and

PC-22 19CS603 Computer Networks 4 0 0 4 4

PC-24 19CS605 System Software Laboratory 0 0 1 1 2

PE-1 19CS65X Elective – I 3 0 0 3 3

SWAYAM Course -1 (Mandate

Course Objective: Design and develop apps for android devices.

11. Write a C/C++ program to implement the system function.

Course Objective: To study the features of multimedia services and applications.

Course Objective: Design a database and write SQL queries.

Admission Year: 2018-19

PROJ-3 18CS802 Project Work 0 0 9 9 18

IN 18CS803 Internship (Four Weeks) 0 0 2 2 4

PE-4 18CS88X Elective -IV 3 0 0 3 3

Course Objective: Formulate & Solve problems as networks & graphs.

Course Objective: Analyze various Storage Area Networks.

You might also like