4th Sem – 2018 Batch

Linear Algebra(18BS4CS01)
(3-0- 0)
Course Type :core Credits :3
Semester :4 Contact :60
Hrs/Week
Max marks : 30 Max marks SEE : 70
IA
Examination : 3 Hours
Duration

Prerequisite: as applicable

Course Objectives
1.
2.
3.
4.

Course Outcomes
CO
1.

CO
2.

CO
3.

CO
4.

CO
5.

CO
6.

Course Content
Hour CO POs/PSO
s s s
UNIT – 1 8

Matrices and Gaussian Elimination: Introduction, Geometry of linear

equations, Gaussian Elimination, Triangular
factors & Row exchanges, Inverses and transposes.

Dept of ISE, SET, JUPage 1

4th Sem – 2018 Batch

UNIT – 2 10
Vector Spaces -1: Vector spaces & subspaces (only definitions). Linear
independence, basis and dimension, the four
fundamental subspaces.
UNIT – 3 10
Linear transformations & Orthogonality - 1: Linear transformations,
orthogonal vectors & subspaces cosines &
projections onto lines, projections & least squares
UNIT – 4 8
Orthogonalization, Eigen Values and Eigen Vectors: Gram- Schmidt
Orthogonalization, Introduction to Eigen values
& Eigen vectors, Diagonalization of a matrix.
UNIT – 5 9
Linear Programming Problem-1: LPP- Formulation of the problem,
General Linear Programming Problem, Canonical
& Standard forms, Simplex method

Text Book:
Text Books
1. “Linear Algebra and its Applications”, G. Strang, 4th Edition, Thomson Brooks/Cole, 2nd
Indian reprint, 2007.
2. “Higher Engineering Mathematics”, B S Grewal, 42nd Edition, Khanna Publishers, 2005
(Chapter nos. 2, 28, 33).
Semester End Examination Question paper pattern:

Sl # Details
1. Eight questions are to be set covering entire syllabus. (student shall answer 5 full
question)
Q1 and Q2 are compulsory from UNIT 1 and UNIT 2 respectively.
Q3 and Q4 from UNIT 3, Q5 and Q6 from UNIT 4, Q7 and Q8 from UNIT 5.
2. There shall be a maximum of three sub divisions under each question. Numerical
problems shall be set wherever possible
3. Each question will carry 14 marks.

Dept of ISE, SET, JUPage 2

4th Sem – 2018 Batch

Design and Analysis of Algorithms(18CSI401)

(3-0- 0)
Course Type :core Credits :3
Semester :4 Contact :45
Hrs/Week
Max marks : 30 Max marks SEE : 70
IA
Examination : 3 Hours
Duration

Course Objectives
1 Reinforce basic design concepts (e.g., pseudocode, specifications, top-down design)
.
2 Familiarity with an assortment of important algorithms

3 Understand and analyze efficient algorithms for various applications.

4 Use mathematical concepts in problem-solving through integration of modeling

Course Outcomes
CO1 Analyze the asymptotic performance of algorithms
CO2 Explain the basics of various mathematical concept of searching and traversing
techniques.
CO3 Understand how the choice of data structures and the algorithm design methods impact
the performance of programs
CO4 Apply the Concept of Dynamic programming method to solve the real-world problems.

CO5 Apply important algorithmic design paradigms and methods of analysis

CO6 Devise an algorithm using appropriate design strategies for problem solving

Course Content
Hour CO POs/PSO
s s s
Dept of ISE, SET, JUPage 3
4th Sem – 2018 Batch

UNIT – 1 Introduction to Algorithms and Elementary Data 10Hr

Structures s
What is an Algorithm? Algorithm Specification, Performance Analysis:
Space complexity, Time complexity. Asymptotic Notations: Big-Oh
notation (O), Omega notation (Ω), Theta notation (Θ). Introduction to
Randomized algorithms. Stacks and queues, trees, Dictionaries: Binary
search tree, AVL tree, Cost amortization. Priority queue, sets and disjoint
set union, graphs

UNIT – 2 Basic Traversal, Search Techniques and Divide and 9

Conquer
Techniques for binary trees, techniques for graphs: breadth first search
and traversal, depth first search and traversal, connected components and
spanning trees, biconnected components and DFS.
General method of divide and conquer, Binary search, Finding the
maximum and minimum, Merge sort, Quick sort Strassen’s matrix
multiplication. Advantages and Disadvantages of divide and conquer
UNIT – 3 Greedy Method 8
General method, Knapsack Problem, Job sequencing with deadlines,
minimum cost spanning trees: Prim's Algorithm, Kruskal's Algorithm.
single source shortest paths.

UNIT – 4 Dynamic Programming 9

General method, Multistage Graphs, Single source shortest paths:
Dijkstra's Algorithm, All Pairs Shortest Paths: Floyd's Algorithm,
Optimal Binary Search Trees, Knapsack problem, Bellman-Ford
Algorithm, Travelling Sales Person problem.
UNIT – 5 Backtracking, Branch and Bound 9
General method of backtracking, N-Queens problem, Sum of subsets
problem, Graph coloring, Hamiltonian cycles, Knapsack problem.
General method of Branch and Bound, 0/1 Knapsack problem: LC
Branch and Bound solution, FIFO Branch and Bound solution, Travelling
Sales Person problem, NP-Hard and NP-Complete problems: Basic
concepts

Text Book:
Fundamentals of computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekaran, 2nd
Edition, 2014, Universities Press
Introduction to the Design and Analysis of Algorithms, Anany Levitin: 2nd Edition, 2009.
Pearson.

Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,
Clifford Stein, 3rd Edition, PHI
2. Design and Analysis of Algorithms, S. Sridhar, Oxford (Higher Education)

Semester End Examination Question paper pattern:

Dept of ISE, SET, JUPage 4

4th Sem – 2018 Batch

Sl # Details
1 Eight questions are to be set covering entire syllabus. (student shall answer 5 full
question)
Q1 and Q2 are compulsory from UNIT 1 and UNIT 2 respectively.
Q3 and Q4 from UNIT 3, Q5 and Q6 from UNIT 4, Q7 and Q8 from UNIT 5.
2 There shall be a maximum of three sub divisions under each question. Numerical
problems shall be set wherever possible
3 Each question will carry 14 marks.

Design and Analysis of Algorithms Lab

Subject Code: 18CSI401L
Credits : 02 L-T-P : 0-0-4

Design, develop, and implement the specified algorithms for the following problems using Java
language under LINUX/Windows environment. Netbeans/Eclipse IDE tool can be used for
development and demonstration.

List of Experiments:

Lab Exercise 1
A Create a Java class called Student with the following details as variables within it. (i) USN (ii)
Name (iii) Branch (iv) Phone no. Write a Java program to create nStudent objects and print the USN,
Name, Branch, and Phone no. of these objects with suitable headings.
B Write a Java program to implement the Stack using arrays. Write Push(), Pop(), and Display()
methods to demonstrate its working.

Lab Exercise 2
A. Write a Java program to read two integers a and b. Compute a/b and print, when b is not zero. Raise
an exception when b is equal to zero.
B. Write a Java program that implements a multi-thread application that has three threads. First thread
generates a random integer for every 1 second; second thread computes the square of the number and
prints; third thread will print the value of cube of the number.

Lab Exercise 3
Print all the nodes reachable from a given starting node in a digraph using BFS an DFS method

Lab Exercise 4
Sort a given set of elements using the quick 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 1st to be
sorted and plot a graph of the time taken versus n. The elements can be read from a file or can be
generated using the random number generator.

Lab Exercise 5

Dept of ISE, SET, JUPage 5

4th Sem – 2018 Batch

Implement merge sort algorithm to sort a given set of elements 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 n. The elements can be read from a file or can be
generated using the random number generator

Lab Exercise 6
Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal'salgorithm
and Prim's algorithm.

Lab Exercise 7
From a given vertex in a weighted connected graph, find shortest paths to other vertices using
Dijkstra's algorithm. Write the program in Java.

Lab Exercise 8
Implement in Java, the 0/1 Knapsack problem using Greedy method and Dynamic Programming
method

Lab Exercise 9
Write Java programs to Implement Travelling Sales Person problem using Dynamic programming

Lab Exercise 10
Write a Java program to Implement All-Pairs Shortest Paths problem using Floyd's algorithm.

Lab Exercise 11
Design and implement in Java to find a subset of a given set S = {Sl, S2,.....,Sn} of n positive integers
whose SUM is equal to a given positive integer d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are
two solutions {1,2,6}and {1,8}. Display a suitable message, if the given problem instance doesn't have
a solution.

Lab Exercise 12
Design and implement in Java to find all Hamiltonian Cycles in a connected undirected Graph G of n
vertices using backtracking principle.

Dept of ISE, SET, JUPage 6

4th Sem – 2018 Batch

Automata Theory and Logic (18CIC42)

(4-0- 0)
Course Type :core Credits :4
Semester :4 Contact :60
Hrs/Week
Max marks : 30 Max marks SEE : 70
IA
Examination : 3 Hours
Duration

Course Objectives
1 Reinforce basic design concepts (e.g., pseudocode, specifications, top-down design)
.
2 Familiarity with an assortment of important algorithms

3 Understand and analyze efficient algorithms for various applications.

4 Use mathematical concepts in problem-solving through integration of modeling

Course Outcomes
CO List computational devices according to their computational power, and tools which will allow us to
tell if a device is powerful enough to solve a given computational problem
1
CO
2 Relate the concept of the grammar with the concept of programming language
CO
3 Design Solutions for problems related to Finite Automata, RE, CFG, PDA and Turing Machine.
CO
4 Ability to provide theoretical preparation of the study of programming languages and compilers.
CO
5 Analyze various problems and categorize them into P, NP, NP-Complete and NP Hard problems
CO Apply the concepts of automata in system level
6

Course Content
Hour CO POs/PSO
s s s
UNIT – 1 10
Introduction to Finite Automata: Introduction to finite automata, The
central concepts of automata theory,
Deterministic finite automata – definition, how a DFA processes strings,
notations for DFA’s Non-deterministic
finite automata – definition, extended transition function, the language of
an NFA
UNIT – 2 14
Finite Automata, Regular Expressions: An application – Text search,
finding strings in a Text, NFA for text search, a

Dept of ISE, SET, JUPage 7

4th Sem – 2018 Batch

DFA to recognize a set of keywords, Finite automata with Epsilon

transitions, exercise problems.
Regular languages: Finite automata and regular expressions - from
DFA’s to regular expressions, converting DFA’s
to regular expressions by eliminating states, Applications of regular
expressions. Regular Languages, Applications
of regular expressions.
UNIT – 3 12
Properties of regular languages- proving languages not to be regular,
the pumping lemma for regular languages ,
Closure properties of regular languages – closure of regular languages
under Boolean operations-union,
complementation, intersection & difference, Equivalence and
minimization of automata
Context free grammars and languages: Definition of context-free
grammars, derivations using a grammar,
leftmost and rightmost derivations, the language of a grammar and
sentential forms, exercise problems, Parse
trees – constructing a parse tree, the yield of a parse tree, inference,
derivations and parse trees, Applications of
context free grammars – Markup languages, XML and document-type
definitions, Ambiguity in grammars and
languages – ambiguous grammars.
UNIT – 4 14
Pushdown automata: The languages of a PDA – acceptance by final
state, acceptance by empty stack Informal
introduction, formal definition of PDA, a graphical notation for PDA’s,
The languages of a PDA – from empty stack
to final state, from final state to empty stack, Equivalence of PDA’s and
CFG’s – from grammars to PDA, from PDA’s
to grammars.
Properties of context free languages: Normal forms for context free
grammars – eliminating useless symbols,
computing the generating and reachable symbols, Eliminating -
productions, eliminating unit productions,
Chomsky normal form (CNF), exercise problems, The pumping lemma
for context free languages, Closure
properties of context free languages.
UNIT – 5 10
Introduction to Turing machines: Problems that computers cannot
solve, The Turing machine – the quest to
decide all mathematical questions, notation for the Turing machine,
instantaneous descriptions for Turing
machines. Programming techniques for Turing machines – storage in the
state, multiple subroutines, exercises
tracks, An undecidable problem that is RE, Post’s correspondence
problem.

Text Books:

Dept of ISE, SET, JUPage 8

4th Sem – 2018 Batch

Introduction to Automata theory, Languages and Computation, John E. Hopcroft, Rajeev

Motwani Jeffery D.
Ullman, Third Edition Pearson education. 2007

Reference Books:

An Introduction to Formal languages and Automata, Peter Linz, III Edition

Semester End Examination Question paper pattern:

Sl # Details
1 Eight questions are to be set covering entire syllabus. (student shall answer 5 full
question)
Q1 and Q2 are compulsory from UNIT 1 and UNIT 2 respectively.
Q3 and Q4 from UNIT 3, Q5 and Q6 from UNIT 4, Q7 and Q8 from UNIT 5.
2 There shall be a maximum of three sub divisions under each question. Numerical
problems shall be set wherever possible
3 Each question will carry 14 marks.

Dept of ISE, SET, JUPage 9

4th Sem – 2018 Batch

PYTHON PROGRAMMING (18IS43)

(3-0- 0)
Course Type :core Credits :3
Semester :4 Contact :45
Hrs/Week
Max marks : 30 Max marks SEE : 70
IA
Examination : 3 Hours
Duration

Course Objectives
1 Appreciate the basic and advanced features of core language built ins
2 Handle and control system/OS level features c
3 Communicate using sockets, write client and server side scripts c
4 Design and implement basic applications with database connectivity

Course Outcomes
CO
1
CO
2
CO
3
CO
4
CO
5
CO
6

Course Content
Hour CO POs/PSO
s s s
UNIT – 1 CORE PYTHON 10
Introduction to Python, Python Interpreter and its working, Syntax and
Semantics, Data Types, Assignments and Expressions, Control Flow
Statements, Sequences and Dictionaries, Functions and lambda
expressions
UNIT – 2 ADVANCED FEATURES 14
Iterations and Comprehensions, Handling text files, Modules, Classes and
OOP, Exception Handling, Strings and Regular Expressions.
UNIT – 3 SYSTEM PROGRAMING 12
System tools : OS and Sys modules, Directory Traversal tools, Parallel
System tools : threading and queue, Program Exits

UNIT – 4 NETWORK AND WEB PROGRAMMING 14

Dept of ISE, SET, JUPage 10

4th Sem – 2018 Batch

Socket Programming : Handling Multiple Clients, Client side scripting,

urlib, Server Side Scripting : CGI Scripts with User Interaction, Passing
Parameters.

UNIT – 5 GUI PROGRAMMING AND DATABASE 10

CONNECTIVITY
Introduction to tkinter, Top Level Windows, Dialogs, Message and Entry,
Event Handling, Menus, List boxes and Scrollbars, Text, SQL Database
interfaces with sqlite3 : Basic operations and table load scripts.

Text Books:

1. Mark Lutz ,”Learning Python”, O Reily, 4thEdition, 2009, ISBN: 978-0-596- 15806-4
2. Mark Lutz ,”Programming Python “, O Reily, 4thEdition, 2010, ISBN 9780596158118
3. Tim Hall and J-P Stacey ,”Python 3 for Absolute Beginners” , 2009, ISBN:9781430216322
4. Magnus Lie Hetland , “Beginning Python: From Novice to Professional”, 2nd Edition, 2009,
ISBN:9781590599822

Semester End Examination Question paper pattern:

Sl # Details
1 Eight questions are to be set covering entire syllabus. (student shall answer 5 full
question)
Q1 and Q2 are compulsory from UNIT 1 and UNIT 2 respectively.
Q3 and Q4 from UNIT 3, Q5 and Q6 from UNIT 4, Q7 and Q8 from UNIT 5.
2 There shall be a maximum of three sub divisions under each question. Numerical
problems shall be set wherever possible
3 Each question will carry 14 marks.

Dept of ISE, SET, JUPage 11

4th Sem – 2018 Batch

Python Scripting(18IS43L)

Prerequisite: Knowledge on problem solving skills and C/C++ programming or any scripting.

Course Objectives:

 Be able to implement python concepts

 Be able to implement looping and sorting problems
 Be able to implement OOP concepts

1. Python Program to check Armstrong Number
2. Python Program for n\’th multiple of a number in Fibonacci Series
3. Python Program to check if given array is Monotonic
4. Sort the values of first list using second list
5. Check for URL in a String
6. Scraping and Finding Ordered Words in A Dictionary using Python
7. Python Program for Binary Search (Recursive and Iterative) using function
8. Program to print double sided stair-case pattern
9. Python program to convert time from 12 hour to 24 hour format
10. Python Program for Tower of Hanoi
11. Python program to implement stack with all its cases
12. Python program to copy odd lines of one file to other

Dept of ISE, SET, JUPage 12

4th Sem – 2018 Batch

Operating Systems (18CIC45)

(4-0- 0)
Course Type :core Credits :4
Semester :4 Contact :60
Hrs/Week
Max marks : 30 Max marks SEE : 70
IA
Examination : 3 Hours
Duration

Course Objectives
1
2
3
4

Course Outcomes
CO Demonstrate understanding of the concepts, structure and design of operating Systems.
1
CO Demonstrate understanding of process management concepts including scheduling,
2 synchronization, deadlocks be familiar with multithreading.
CO Demonstrate concepts of memory management and system resources sharing
3
CO Demonstrate competence related to file system interface and implementation, disk
4 management in recognizing and using operating system features.
CO
5
CO
6

Course Content
Hour CO POs/PSO
s s s
UNIT – 1 14
Introduction to Operating System:
Objectives and Functions of OS, Evolution of OS, OS Structures, OS
Components, OS Services, System calls, System
programs, Virtual Machines.
Processes, types of processes and Threads:
Processes: Process concept, Types of process:-Co-operating processes,
Operations on processes, Inter process
communication, Process Communication in client-server systems.
Threads: Introduction to Threads, Single and Multi-threaded processes
and its benefits, User and Kernel threads,
Multithreading models, threading issues.

Dept of ISE, SET, JUPage 13

4th Sem – 2018 Batch

Process Scheduling:
Process scheduling: CPU Scheduling: Basic concepts, scheduling criteria,
Scheduling Algorithms, Multiple Processor
Scheduling, Algorithm Evaluation.
UNIT – 2 14
Behavior of process in different states:
Process Synchronization: Mutual Exclusion, Critical – section problem,
Synchronization hardware, Semaphores,
Classic problems of synchronization, Critical Regions, Monitors,
Synchronization Examples, Atomic Transactions.
Deadlocks:
Deadlocks: System Model, Deadlock characterization, Methods for
handling Deadlocks, Deadlock prevention,
Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock.
UNIT – 3 SYSTEM PROGRAMING 14
Memory Management:
Memory Management: Logical and physical Address Space, Swapping,
Contiguous Memory Allocation, Paging,
Segmentation, Segmentation with paging.
Virtual Memory
Virtual Management: Demand paging, Process creation, Page
Replacement Algorithms, Allocation of Frames,
Thrashing, Operating System Examples, other considerations.
UNIT – 4 NETWORK AND WEB PROGRAMMING 10
Storage Management:
File-System Interface: File concept, Access Methods, Directory
structure, Protection and consistency semantics.
File-System Implementation: File-System structure, File-System
Implementations, Directory Implementation,
Allocation Methods, Free-space Management. Disk Management: Disk
Scheduling, Disk Management, Swap-Space
Management, stable-storage Implementation.
UNIT – 5 GUI PROGRAMMING AND DATABASE 8
CONNECTIVITY
The Linux Operating System, Linux history; Design principles; Kernel
modules; Process management; File systems,
Input and output; Inter-process communication.

Text Books:
1. Operating System by Silberschatz / Galvin / Gagne, 6th Edition,WSE (WILEY Publication)
Reference Books:
1. Operating System Concepts and design by Milan Milonkovic, II Edition, McGraw Hill 1992.
2. Operation System Concepts by Tanenbaum, 2nd Edition, Pearson Education.
3. Operating System by William Stallings, 4th Edition, Pearson Education

Semester End Examination Question paper pattern:

Sl # Details
1 Eight questions are to be set covering entire syllabus. (student shall answer 5 full
question)

Dept of ISE, SET, JUPage 14

4th Sem – 2018 Batch

Q1 and Q2 are compulsory from UNIT 1 and UNIT 2 respectively.

Q3 and Q4 from UNIT 3, Q5 and Q6 from UNIT 4, Q7 and Q8 from UNIT 5.
2 There shall be a maximum of three sub divisions under each question. Numerical
problems shall be set wherever possible
3 Each question will carry 14 marks.

Business Communication and Presentation Skills (18HSS04)

(3-0- 0)
Course Type :core Credits :3
Semester :4 Contact :45
Hrs/Week
Max marks : 30 Max marks SEE : 70
IA
Examination : 3 Hours
Duration

Course Objectives
1
2
3
4

Course Outcomes
CO The course will enhance reflection on current trends in industry.
1
CO The course Advances association into work culture, placements, Internships and
2 graduate employment.
CO By the end of the Presentation skills course , students will be able to deal positively
3 about public speaking and deliver a well-practiced Presentation
CO
4
CO
5
CO
6

Course Content
Hour CO POs/PSO
s s s
UNIT – 1 11
Business communication: Role of communication in information age;
concept and meaning of communication; skills necessary for technical
communication; Communications in a technical organization; Barriers to
the process of communication and sola.
Style and organization in technical communication: Listening,

Dept of ISE, SET, JUPage 15

4th Sem – 2018 Batch

speaking, reading and writing as skills; Objectivity,

clarity, precision as defining features of technical communication;
Various types of business writing: Letters,
reports, notes, memos; Language and format of various types of business
letters; Language and style of reports;
Report writing strategies; Analysis of a sample report.
UNIT – 2 9
Communication and personality development: Psychological aspects
of communication, cognition as a part of
communication; Emotional Intelligence; Politeness and Etiquette in
communication; Cultural factors that influence
communication; Mannerisms to be avoided in communication; Language
and persuasion; Language and conflict
resolution.
Language Laboratoryemphasizing: Listening and comprehension skills;
Reading Skills; Sound Structure of English
and intonation patterns.
UNIT – 3 10
Oral Presentation and professional speaking: Basics of English
pronunciation; Elements of effective presentation;
Body Language and use of voice during presentation; Connecting with
the audience during presentation; Projecting
a positive image while speaking; Planning and preparing a model
presentation; Organizing the presentation to suit
the audience and context; Basics of public speaking; Preparing for a
speech.
Career Oriental Communication: Resume and biodata: Design & style;
Applying for a job: Language and format of
job application. Job Interviews: purpose and process; How to prepare for
interviews; Language and style to be used
in interview; Types of interview questions and how to answer them;
Group Discussion: structure and dynamics;
Techniques of effective participation in group discussion; Preparing for
group discussion.
UNIT – 4 8
Advanced Techniques in Technical Communication: Interview
through telephone/video-conferencing; Powerpoint
presentation: structure and format; Using e-mail for business
communication; Standard e-mail practices;
Language in e-mail; Using internet for collecting information;
Referencing while using internet materials for project
reports; Writing for the media.
UNIT – 5 7
Language laboratory training in speaking skills covering oral
presentations, mock interviews and model group discussions through the
choice of appropriate programmers.

Text/Reference books:

Dept of ISE, SET, JUPage 16

4th Sem – 2018 Batch

1. Fred Luthans, Organizational Behaviour, McGraw Hill

2. Lesikar and petit, Report writing for Business
3. M. Ashraf Rizvi, Effective Technical Communication, McGraw Hill
4. Wallace and masters, Personal Development for Life and Work, Thomson Learning
5. Hartman Lemay, Presentation Success, Thomson Learning
6. Malcolm Goodale, Professional Presentations
7. Farhathullah, T. M. Communication skills for Technical Students

Semester End Examination Question paper pattern:

Sl # Details
1 Eight questions are to be set covering entire syllabus. (student shall answer 5 full
question)
Q1 and Q2 are compulsory from UNIT 1 and UNIT 2 respectively.
Q3 and Q4 from UNIT 3, Q5 and Q6 from UNIT 4, Q7 and Q8 from UNIT 5.
2 There shall be a maximum of three sub divisions under each question. Numerical
problems shall be set wherever possible
3 Each question will carry 14 marks.

Dept of ISE, SET, JUPage 17