SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU

(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

CHOICE BASED CREDIT SYSTEM (CBCS)
SCHEME OF TEACHING AND EXAMINATION FOR BE DEGREE COURSE
(Effective from the academic year 2020-21)

III SEMESTER B.E.

III Semester B.E. Computer Science and Engineering Examination
(Subjects and Syllabus as per AICTE-Model Curriculum for UG Course in Eng. & Tech.- Jan. 2018)
SI Course Code Course Title Teaching Board of Credits CIE SEE Total Exam
No.
dept. Exam. Marks Hours
01 BS MA3TH1 Integral Transform and MA MA 4 50 50 100 3
Numerical Methods
02 PC CS3TH2 Object Oriented CS CS 3 50 50 100 3
Programming
03 PC CS3TH3 Data Structures CS CS 3 50 50 100 3
04 PC CS3TH4 Discrete Mathematical CS CS 3 50 50 100 3
Structures
05 PC CS3TH5 Digital Circuit Design CS CS 3 50 50 100 3
and its Applications
06 ES/ CS3TH6/ Computer Organization/ CS / CS / 3 50 50 100 3
MA MA3DP6 DIP Mathematics MA MA
07 PC CS3LB1 Object Oriented CS CS 1.5 50 50 100 3
Programming Lab
08 PC CS3LB2 Data Structures Lab CS CS 1.5 50 50 100 3
09 PC CS3LB3 Digital Circuit Design CS CS 1.5 50 50 100 3
Lab
10 HS SK3DP1 Skill Development-I HS HS 1 50 - 50 -
Total 24.5 500 450 950 -
CIE-Continuous Internal Evaluation, SEE-Semester End Examination
Note: MA3DP6: DIP Mathematics for Lateral Entry students only.
There is no SEE for Skill Development-I course.
However, all the students should maintain a minimum 85% of attendance and 40% of CIE to get pass in the subject.
 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
CHOICE BASED CREDIT SYSTEM (CBCS)
SCHEME OF TEACHING AND EXAMINATION FOR BE DEGREE COURSE
(Effective from the academic year 2020-21)

IV SEMESTER B.E.

IV Semester B.E. Computer Science and Engineering Examination

(Subjects and Syllabus as per AICTE-Model Curriculum for UG Course in Eng. & Tech.- Jan. 2018)
SI Course and Course Course Title Teaching Board Credits CIE SEE Total Exam
No Code dept. of Marks Hrs.
Exam.
01 BS MA4CS1 Engineering MA MA 3 50 50 100 3
Mathematics-IV
02 PC CS4TH2 Design and Analysis of CS CS 3 50 50 100 3
Algorithms
03 PC CS4TH3 Operating Systems CS CS 3 50 50 100 3
04 PC CS4TH4 Programming with CS CS 3 50 50 100 3
Python
05 PC CS4TH5 Automata Theory and CS CS 3 50 50 100 3
Computation
06 PC CS4TH6 Software Engineering CS CS 3 50 50 100 3
07 PC CS4LB1 Algorithms Lab CS CS 1.5 50 50 100 3
08 PC CS4LB2 Operating Systems Lab CS CS 1.5 50 50 100 3
09 PC CS4LB3 Python Programming CS CS 1.5 50 50 100 3
Lab
10 HS SK4DP2 Skill Development-II HS HS 1 50 - 50 -
Total 23.5 500 450 850 -
CIE-Continuous Internal Evaluation, SEE-Semester End Examination

Note: There is no SEE for Skill Development-II course. However, all the students should maintain a minimum 85% of attendance and 40% of CIE to get pass in the
subject.
 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Object Oriented Programming

Subject Code: CS3TH2 L-T-P-C: 4–0–0–3

Course Objectives:

Sl.No Course Objectives

Understand the fundamentals of object-oriented programming in Java,
1
including defining classes, Objects, invoking methods
2 Understand the principles of inheritance, packages, and interfaces.
Understand generic programming and implement generic classes and
3
methods.
4 Design and develop reliable Object oriented programs.

UNIT Description Hours

Fundamentals of Object Oriented Programming-
Introduction, Object oriented Paradigm, Basic Concepts of OOP,
Benefits of OOP, Applications of OOP. How Java differs from C and
I 8
C++, Java Environment, Simple Java Program, An Application with
Two Classes, Java Program Structure, Implementing a Java Program,
Java Virtual Machine, Command Line Arguments.
Classes, Objects and Methods; Inheritance

Classes, Objects and Methods - Introduction, Defining a Class,

Fields Declaration, Methods Declaration, Creating Objects, Accessing
Class Members, Constructors, Methods Overloading, Static Members,
II 8
Nesting of Methods.
Inheritance: Extending a Class, Overriding Methods, Final Variables
and Methods, Final Classes, Finalize Methods, Abstract Methods and
Classes, Methods with Variable arguments (Varargs), Visibility
Control.
Packages and Interface
Packages: Defining a Package, Finding Packages and CLASSPATH, A
Short Package Example, Access protection: An Access Example,
Importing Packages.
III Interfaces: Defining an Interface, Implementing Interfaces, Nested 8
Interfaces, Applying Interfaces, Variables in Interfaces, Interfaces Can
Be Extended, Default Interface Methods: Default Interface Methods, A
More Practical Example, Multiple Inheritance Issues, Use Static
Methods in an Interface.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Exception Handling and Generics

Exception Handling Fundamentals, Exception Types, Uncaught

Exceptions, Using try and catch: Displaying a Description of an
IV Exception, Multiple Catch Clauses, throw, throws, finally. 8
What Are Generics? A Simple Generics Example, A Generic Class with
Two Type Parameters, The General Form of a Generic Class, Bounded
Types, Creating a Generic Method, Generic Constructors, Generic
Interfaces, Some Generic Restrictions.
Programming with I/O
I/O Basics, Streams, Byte Streams and Character Streams, The
V Predefined Streams, Reading Console Read the values, Reading 7
Characters, Reading Strings, Writing Console Output, The PrintWriter
Class, Reading and Writing Files, Automatically Closing a File.

Text Books:
Sl
Title Author(s) Edition, Publisher, Year, ISBN
No
1 Programming with E Balagurusamy 6th edition, Mc Graw Hill, 2019, ISBN
Java 13-89351343202, ISB 10-
9351343200
2 Java - The Complete Herbert Schildt 9th Edition, Tata McGraw Hill, 2014,
Reference ISBN: 978-0-07-180856-9

Reference Books:
Sl
Title Author(s) Edition, Publisher, Year, ISBN
No
1 Introduction to JAVA Y. Daniel 10th Edition, Pearson Education,
Programming Liang 2015, ISBN-13: 9780133761313

Course Outcomes
Course Descriptions
outcome
CO1 Discuss the Object Oriented Programming concepts and apply the same to
design programs.
CO2 Design and implement object oriented solutions involving multiple objects,
packages & Interfaces.
CO3 Develop simpler, reliable and reusable programs using exception handling
and Generics.
CO4 Illustrate the versatility of I/O Operations in programs

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Data Structures

Subject Code: CS3TH3 L-T-P-C: 4–0–0–3

Course Objectives:

Sl.No Course Objectives

To provide the knowledge of basic data structures and their

1
implementations.
2 Define and Analyse the concepts of Linear & Non-Linear Data Structures.
To understand importance of data structures in context of writing efficient
3
programs.
To develop skills to apply appropriate data structures in solving real world
4
problems.

UNIT Description Hours

Stacks and Queues: Structures and Pointers revisited.

Stacks: Definition and Examples, Representing Stacks in C. Stack
Applications: Reversing Data: Reverse a list and convert decimal to
I
binary, Parsing, Postponement: infix to postfix transformation, 8
evaluating a postfix expression. Recursion. Queues: The Queue and
its Sequential Representation, C implementation of Queue.

Circular queue, Priority queue and Linked list: Circular Queue, and
The priority queue – Array implementation of priority queue. Queue
applications: Queue Simulation and categorizing data. Self-referential
structure, linking self –referential structures. List: Inserting and
II
removing nodes from a list, the getnode and free node operations, the
8
linked list as a data structure, examples of list operations, Header
nodes. Lists in C. Array implementation of lists, limitations of array
implementation.
Doubly linked list, Circular list and linear list applications: Linked
implementation of Stack, linked implementation of queues. Doubly
linked lists: Inserting and removing nodes from a double linked list.
III 8
Circular lists: primitive operations on circular list. Circular double
linked list. Linear list applications: Append linked lists, Array of linked
lists.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Trees: Basic tree concepts: Terminology, tree representation, Binary

trees: properties, binary tree structure. Binary tree traversals: Tree
IV traversal techniques: preorder, inorder and postorder, Expression 8
trees: infix, postfix and prefix traversal. General trees: Changing
general tree to binary tree, insertion into general trees.

Lexical Search Tree and Graphs: Tries: Introduction to Tries, Trie

structure, Trie search. Graphs:Terminologies, An application of
V 7
graphs, C representation of graphs, Warshall’s algorithm, Graph
traversal techniques: Depth First traversal, Breadth First traversal.

Text Books:

Sl Edition, Publisher, Year,

Title Author(s)
No ISBN
Aaron M. Tenenbaum,
Data Structure YedidyahLangsam and Moshe First edition, 2019, ISBN-
1
using C J. Augenstein, Pearson 13: 9789332543546.
publication
Data Structures: A Second Edition, Cengage
Richard F. Gilberg and
2 Pseudocode publication, 2007, ISBN-
Behrouz A. Forouzan
Approach with C 13: 9788131503140

Reference Books:

Sl Edition, Publisher, Year,

Title Author(s)
No ISBN
PHI, 2nd Edition, 2015,
Data Structures and Robert Kruse, C L Tondo,
1 ISBN- 13: 978-
Program Design in C Bruce Leung, ShashiMogalla
0132883665.
McGraw Hill publications,
Data Structures
2 Seymour Lipschutz 2018, ISBN-13: 978-0- 07-
with C
070198-4

Course Outcomes:

Course Descriptions
outcome
CO1 Interpret the basic concepts of data structures and their operations.

CO2 Explicate the working principle of linear and non-linear data structures.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

CO3 Evolve a code snippet for the implementation of data structures.

Distinguish and Involve concepts of linear and non-linear data structures

CO4
to solve a problem.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Discrete Mathematical Structures

Subject Code: CS3TH4 L-T-P-C: 4–0–0–3

Course Objectives:

Sl.No Course Objectives

1 Solve problems using counting techniques and combinatorics.
Perform operations on discrete structures such as functions,
2
relations and sequences.
3 Solve problems involving recurrence relations and coding theory
4 Learn different mathematical proof Techniques

UNIT Description Hours

Fundamentals of Logic: Basic connectivity and truth tables,
I Tautologies, Logical Equivalence: The Laws of Logic, Logical 8
implication: Rule of Inference.
Relations: Properties of Relations, Zero-one matrices and
directed graphs, Partial orders and Hasse Diagrams, Equivalence
relations and partitions. (No proof of theorems)
II Functions: Function definition, Types of Functions- One to 8
One, On to and one to one correspondence. Sterling number of
second kind. Function composition and inverse functions. The
Pigeonhole principle.( No proof of theorems)
Fundamental Principles of Counting: The rules of Sum and
product- Permutations and Combinations, Binomial Theorem,
III Combinations with repetitions. (No proof of theorems) 8
The well ordering principle: Mathematical Induction, Recursive
definitions (No proof of theorems)
Introduction to Graph Theory: Definitions and Examples:
Directed and undirected graphs, Walk, Trail, Path. Subgraphs,
Complements, and Graph Isomorphism, Vertex Degree: Euler
IV 8
Trails and Circuits, Planar Graphs, Hamilton Paths and
Cycles, Graph Colouring and Chromatic Polynomials.(No proof
of theorems)
Introduction to Finite Automata: Set Theory of strings, Basic
concepts of Finite Automata theory, Deterministic Finite
V Automata, Non-Deterministic Finite Automata, Finite 7
Automata with epsilon-transitions, Equivalence of NFA & DFA.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Text Books:
Sl
Title Author(s) Edition, Publisher, Year, ISBN
No
1 Discrete and Ralph P. 5th Edition, PHI/ Pearson
Combinatorial Grimaldi Education, 2004, ISBN-
Mathematics 13: 978-0201726343,
ISBN-10: 0201726343
2 An Introduction To Peter Linz, 6th Edition, An Introduction
Formal Languages & Jones & To Formal Languages &
Automata Bartlett Automata, 2016, ISBN: 978-
9384323219.
Reference Books:
Sl Title Author(s) Edition, Publisher, Year, ISBN
No
1 Discrete Mathematics Kenneth H 6th Edition, McGraw Hill 2007.
and its applications Rosen
2 Discrete Mathematics Trembly and McGraw Hill Education,1st edition
Manohar (1 July 2017)
ISBN-10:9780074631133
ISBN-13: 978-0074631133

Course Outcomes:

Course Descriptions
outcome
CO1 Define the basic concepts of Discrete Mathematics.
CO2 Formulate and solve abstract mathematical problems.
CO3 Identify and apply mathematical proof techniques to solve the problems.
Design solutions for complex problem using different concepts of discrete
CO4
mathematical structure as a logical predictable system.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Digital Circuit Design and its Applications

Subject Code: CS3TH5 L-T-P-C: 4–0–0–3

Course Objectives:

Sl.No Course Objectives

1 Understand the operating principles of digital circuits and Sensors
Equip with the skills to Design and Analyze combinational and sequential
2
digital circuits
Learn to Apply the concepts of digital circuits and sensors in real time
3
applications
Acquire the knowledge to Simulate digital circuits using Hardware
4
Descriptive Language (HDL)

UNIT Description Hours

Introduction to Digital Circuit Simplification Techniques
Algebraic Simplification using SOP and POS techniques, Karnaugh’s
I 8
map (4 Variables) and Quine Mc-Cluskey methods (Algorithm).
Introduction to HDL.
Combinational logic circuits
Design of Half adder, Full adder and 4 bit adder (IC7483),
Multiplexers, De-multiplexers, Decoder: BCD to Decimal Decoders,
II 8
Seven Segment Decoders, Combinational circuit design using MUX IC
74153 and Decoder IC 74138. Encoders, Magnitude Comparator and
ALU IC74181. HDL Implementation of combinational Circuits.
Sequential Circuits
Introduction to Flip-Flops: Basic RS latch RS Flip-Flop, Gated Flip-
Flops: JK FF, D FF, T FF. Various representations of flip flops and
Flip flop conversions. Register: Types of Registers: Serial In – Serial
III Out, Serial In – Parallel out, Parallel in Serial Out, Parallel In – 8
Parallel Out, Universal Shift Register, and Applications of Shift
Registers. Counters: Asynchronous Counters, Decoding Gates,
Synchronous Counter Changing the Counter Modulus. HDL
implementation of sequential circuits
Introduction to Arduino and Raspberry pi
Arduino Specifications, Arduino Components, Arduino IDE software,
Hands on example, Hands-on Example: A Simple Arduino "Hello
IV 8
World" Program with a LED, Raspberry Pi 3 Hardware Overview,
Raspberry Pi System Setup, Python IDLE Development Environment,
Hands-on Example: A Simple Raspberry Pi "Hello World" Program

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

with a LED, Overview of Python for Raspberry Pi

Arduino , Raspberry pi and Sensor applications
Human Sensor Projects ( IR sensor), Environmental Sensor Projects
V 7
( Rain Sensor and Temperature sensor), Magnetic Field sensor, photo
diode and LDR sensor projects

Text Books:
Sl Title Author(s) Edition, Publisher, Year, ISBN
No
1 Digital principles Donald P Leach, Albert 8th Edition, Mcgraw Hill,
and Applications Paul Malvino 2014, ISBN: 9789339203405
2 Arduino and Robert Chin McGraw-Hill Education, 2018
Raspberry Pi ISBN: 9781260010893
Sensor Projects for
the Evil Genius

Reference Books:
Sl Title Author(s) Edition, Publisher, Year, ISBN
No
1 Digital principles and Donald D Givone 3rd Edition , 2003,
Design Mc Hill Publications
ISBN:0072525037
2 Arduino Fundamentals Prof. Amit Kumar BFC Publications,
and Applications Mishra 2021, ISBN: 9789390478590

Course Outcomes:
Course outcome Descriptions
CO1 Explain the basic concepts of digital circuit and
Arduino/Raspberry Pi architecture.
CO2 Design and Analyze simple combinational and Sequential logic
circuits.
CO3 Apply the digital circuit concepts and Arduino/Raspberry Pi
platforms to develop small engineering applications.
CO4 Simulate digital circuits using HDL coding.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Computer Organization

Subject Code: CS3TH5 L-T-P-C: 4–0–0-3

Course Objectives:

Sl.No Course Objectives

1 Understand the basic structure and operations of a digital computer.
Learn the design philosophy of central processing unit
2
3 Discuss different types of computer arithmetic operations.

4 Demonstrate the working of I/O unit and memory unit.

UNIT Description Hours

Introduction to Computer Organization: Basic structure of
computers, Bus Structures, Performance of a Computer: Processor
clock, Basic Performance equation, Clock rate, Performance
Measurements.
Machine Instructions and Programs: Memory Locations & Address:
I Byte addressability, Big-endian & Little-endian assignments, Word 8
Alignment, Accessing Numbers, Characters & Character strings;
Memory operations, Instruction & Instruction Sequencing: Register
Transfer Notation, Assembly Language Notation. Basic Instruction
Types, Instruction execution & Straight-line sequencing, Branching,
Condition codes. Case Study: Microprocessors and Micro controllers.
Machine Instructions and Programs (Contd...) and Basic
Processing Unit: Addressing modes, Stacks and Queues,
Subroutines: Subroutine nesting & processor stack, Parameter
passing, The Stack Frame.
Basic Processing Unit: Some fundamental concepts: Register
II Transfers, Performing an Arithmetic or Logic operation, Fetching a 8
word from Memory, storing a word in Memory; Execution of a
complete instruction: Branch instruction; Multiple bus organization:
Hardwired control, A complete processor; Micro programmed control,
Micro instructions.
Case Study: Intel Processors.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Arithmetic: Addition & subtractions of signed Numbers:

Addition/Subtraction logic unit; Multiplication of positive numbers:
III Signed operand multiplication: Booth algorithm; Fast Multiplication: 8
Bit-pair recording of multipliers; Integer division, IEEE standard for
floating-point numbers.
Input/output Organization: Accessing I/O devices, Interrupts,
Interrupt hardware, Enabling & Disabling Interrupts, Handling
Multiple devices, Controlling Device Requests, Exceptions; Direct
IV memory access: Bus arbitration; Buses: Synchronous Bus, 8
Asynchronous bus. Interface circuits: Parallel port, Serial port;
Standard I/O interfaces: PCI bus, SCSI bus, USB.
Case Study: HDMI, Interrupt Controller, DMA Controller.
Memory System: Some Basic concepts: Semiconductor RAM
memories: Internal organization of Memory chips, static memories,
Asynchronous Drams, Synchronous DRAMs, Memory system
considerations, Read-only memories: ROM, PROM, EPROM,
V 7
EEPROM, Flash memory; Cache memories: Mapping functions;
Virtual memories: Address translation.
Case Study: HD Card, USB Memory.
Note: Case Studies are for internal evaluation only.

Text Books:
Sl
Title Author(s) Edition, Publisher, Year, ISBN
No
Carl Hamacher,
5th Edition, McGraw Hill, 2011
1 Computer Organization Z Vranesic& S
ISBN-13:978-1259005275
Zaky,

Reference Books:
Sl
Title Author(s) Edition, Publisher, Year, ISBN
No
Computer Organization
William 10th Edition, Pearson, 2010,
1 and Architecture:
Stallings ISBN:9 8-0-13-410161-3
Designing for performance
Computer System 3rd Edition, PHI, 2016
2 Morris Mano
Architecture ISBN: 978-9332585607
Computer Organization
David A 5th Edition, Elsevier, 2014,
3 and Design, The Hardware
Patterson ISBN: 978-0-12-407726-3
Software interface.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Course Outcomes:

Course
Descriptions
outcome
CO1 Analyze the basic organization of a central processing unit.
Explore the organization and functionality of I/O and memory
CO2
management hardware.
Apply appropriate technique to solve arithmetic related problems in
CO3
computer.
Appraise the different design issues in functional units of a computer
CO4
system.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Object Oriented programming Lab

Subject Code: CS3LB1 L-T-P-C: 0-0-3-1.5

Course Objectives:

Sl.No Course Objectives

Understand the fundamentals of Object oriented programming concepts in

1
Java
2 Understand the principles of Packages and Interfaces

3 Understand I/O programming in java

Lab Description
Cycles

1. Write a program to create a room class, the attributes of this class is

roomno, roomtype, roomarea and AC machine. In this class the
member functions are setdata and displaydata.
2. Write a program that creates a class circle with instance variables for
the centre and the radius. Initialize and display its variables.
i. Add a constructor to initialize its variables.
ii. Modify the program to show constructor overloading.
3. Write a Java program to find the area and volume of a room. Use a
I
base class rectangle with a constructor and a method for finding the
area. Use its subclass room with a constructor that gets the value of
length and breadth from the base class and has a method to find the
volume. Create an object of the class room and obtain the area and
volume
4. Write a Java Program to create an abstract class named shape
that contains two integers and an empty method named
printArea. Provide three classes named Rectangle, Triangle and
Circle such that each one of the classes extends the Class Shape.
Each one of the subclasses contain only the method printArea() that

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

prints the area of Shape.

Note: Read the input from the keyboard using Scanner Class.

5. Design a simple Java program to demonstrate different combinations

of access control modifiers for: same package subclass, same
package non-subclass, different package subclass, different package
non-subclass.
Note: Justify the result with the Access Protection table.
6. Write a Java program which has:
i. An interface for Stack Operations that defines push() and
II pop() methods.
ii. A class that implements the Stack Interface and creates a
dynamic length Stack and does the stack operations that
demonstrate the runtime binding.
7. Write a java program to perform simple command line calculator with
an exception handler that deals with nonnumeric operands; then
write another program without using an exception handler to achieve
the same objective. Your program should display a message that
informs the user of the wrong operand type before exiting.
8. Write a Java program that reads a text file and displays the contents
on the screen.

III 9. Write a program to create a file and write data into it using the
methods OutputStream class
10. Write a program to get the input from the user and store it into file.
Using Reader and Writer file.

Course Outcomes:

Course Descriptions
outcome
Implement the fundamentals of Object oriented programming concepts in
CO1
Java to solve real world problems.
Develop and Write java programs with multiple objects, packages and
CO2
interfaces , Generic programs and perform I/O operations
CO3 Analyze, interpret, test and debug the program.
CO4 Comprehend and write effective reports.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Data Structures Lab

Subject Code: CS3LB2 L-T-P-C: 0-0-3-1.5

Course Objectives:
Sl.No Course Objectives

To develop skills to design and analyze simple linear and nonlinear data
1
structures.
To Strengthen the ability to identify and apply suitable data structure for the
2
given real world problem.

3 To gain knowledge in practical applications of data structures.

Lab Description
Cycles

I Structures, Pointers and memory allocation functions.

II Stacks, Queues and Linked lists

III Trees

Course Outcomes:
Course Descriptions
outcome

CO1 Elicit the Working principles of data structures.

CO2 Identity and Apply appropriate data structure for efficient data storage and

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

retrieval.

Illustrate the role of data structures in improving the efficiency of a code

CO3
snippet
Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 3

Subject Name: Digital Foundations and Application Laboratory

Subject Code: CS3LB3 L-T-P-C: 0–0–1.5

Course Objectives:

Sl.No Course Objectives

1 Learn to simulate digital circuits using Verilog coding
2 Learn to simulate digital circuits using Multisim
Acquire the knowledge Analyze and test operations of Digital circuits using
3
Verilog/ Multisim packages

Experiment Description
No
1 Truth table verification of logic gates
Write the Verilog code to simulate the working a given combinational
2
logic circuit using Data flow model
3 Write the Verilog code to simulate the working of Half and Full adder
4 Design 4 bit adder using Multi sim and verify the working
Write the Verilog code to simulate the working of 1 bit Comparator
5
using data flow and design the same using Multisim
6 Write the Verilog code to simulate the working of 4:1 Mux and 8:1 Mux
7 Design 2: 4 decoder using Multisim
8 Write the Verilog code of RS, D and JK flip-Flop and verify their working
Design Mod-4 Asynchronous Up/Down counter using Multisim and
9
verify their working
Write the Verilog code to simulate 3 bit up-counter using behavioural
10
Model and verify its working

Design Arduino /Raspberry Pi Door Buzzer Alarm using Magnetic Reed

11
sensor

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Design and verify the working of Arduino motion detector using IR

12
sensor

13 Design Arduino/Raspberry Fire alarm using Temperature sensor

Design and verify the working of Rain Indicator using a Rain
14
sensor using Arduino platform
Course Outcomes:

Course Descriptions
outcome
CO1 To design and simulate the working of combinational circuits
CO2 To design and simulate the working of Sequential logic circuits
Develop and execute simple applications programs using
CO3
Arduino Uno/Raspberry Pi board and few sensors

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Design and Analysis of Algorithms

Subject Code: CS4TH2 L-T-P-C: 4–0–0–3

Course Objectives:

Sl. No Course Objectives

1 Learn the concepts of recursive and non-recursive algorithms.

2 Know different Algorithm Design Techniques for effective problem solving.

3 Analyze the algorithm with respect to space and time complexity.

Understand basic efficiency classes and asymptotic notations to express the

4
complexity.

UNIT Description Hours

Introduction, Fundamentals of the Analysis of Algorithm
Efficiency: What is an Algorithm?, Fundamentals of algorithmic
problem solving, Analysis Framework, Asymptotic Notations and
I 8
Basic efficiency classes, Mathematical analysis of Non-Recursive and
recursive Algorithms with Examples.
Brute Force: Selection Sort, String Matching, Exhaustive Search.
Divide and Conquer: Merge Sort, Quick Sort, Finding the minimum
II and maximum element in an array. 8
Decrease and Conquer: Insertion Sort, Topological Sorting.

Transform and Conquer: Balanced Search Trees, Heaps and Heap

Sort.
III Space and Time Tradeoffs: Input Enhancement in String Matching: 8
Horspool’s algorithm, Hashing: hash table, hash functions, collision
handling by open addressing and chaining.
Dynamic Programming: Floyd’s Algorithms, Knapsack Problem and
Memory Functions.
IV Greedy Technique: Prim’s algorithm, Kruskal’s algorithm, Dijkstra’s 8
algorithm.

Back tracking: n-Queen’s Problem, Subset-Sum Problem,

V Branch and Bound: Assignment Problem, Knapsack Problem, and 7
Traveling Salesman Problem.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Text Book:

Sl
Title Author(s) Edition, Publisher, Year, ISBN
No

Introduction to the 3rdEdition, Pearson Education, 2012,

1 Design & Analysis of Anany Levitin ISBN-13: 978-0-13-231681-1
Algorithms

Reference Books:

Sl
Title Author(s) Edition, Publisher, Year, ISBN
No

Introduction to Cormen T.H, 3rd Edition, PHI, 2009,

1 Algorithms Leiserson C.E. ISBN-13: 978-0262033848
&Rivest R.L

Ellis Horowitz,
Computer SatrajSahni 2nd Edition, Universities Press, 2014,
2
Algorithms/C++ and ISBN-13:978-8173716119
Rajasekaran

Gilles
Fundamental of 2nd Edition, PHI 1999,
3 Brassard &
Algorithms ISBN-13:978-8120311312
Paul Bratley

Course Outcomes:

Course Descriptions
outcome
CO1 Understand the basic concepts of design and analysis of algorithms.

CO2 Demonstrate various techniques for designing and developing algorithms.

Design an algorithm using various design techniques and analyze its

CO3
complexity to rank order of growth.

Solve the given problem instance using appropriate algorithm design

CO4
technique.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Operating Systems

Subject Code: CS4TH3 L-T-P-C: 4–0–0–3

Course Objectives:

Sl.No Course Objectives

To learn the classes of operating system, design architecture and system
1
calls.
To understand the concepts of process synchronization and scheduling
2
through various algorithms.
To gain knowledge on system concepts that includes Mutual exclusion
3
algorithms and deadlock detection algorithms.
4 To learn the mechanisms involved in resource management in an OS.

UNIT Description Hours

Introduction to Operating Systems and System Structures:
What operating systems do? Computer System architecture;
I Operating System structure. 8
System Structures : Operating System Services, System calls; Types
of system calls; Operating System structure; Virtual machines;
Process Management:
Process concept: Overview; Process scheduling; Operations on
processes; Interprocess communication. Multithreaded
Programming: Overview: Motivation, Benefits ;Multithreading models;
II 8
CPU Scheduling: Basic concepts; Scheduling criteria; Scheduling
algorithms: First Come, First Served Scheduling, Shortest-Job First
Scheduling, Priority Scheduling, Round-Robin Scheduling.
Case study: Linux, Windows and MacOS X.
Process Coordination:
Synchronization: Background; The Critical section problem;
Peterson’s solution; Mutex Locks; Semaphores; Classical problems of
synchronization; Monitors: Monitor usage, Dining philosophers using
III monitors. 8
Deadlocks: System model; Deadlock characterization; Methods for
handling deadlocks; Deadlock prevention; Deadlock avoidance;
Deadlock detection; Recovery from deadlock.
Case study: Linux
Memory Management:
IV 8
Memory Management Strategies: Background; Swapping;

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Contiguous memory allocation; Paging; Structure of page table;

Segmentation.
Virtual Memory Management: Background; Demand paging; Copy-
on write; Page replacement; Allocation of frames; Thrashing.
Case study: Linux, Windows.
Storage Management:
File System: File concept; Access methods; File system mounting.
Implementing File Systems: File system structure; File system
implementation; Directory implementation; Allocation methods; Free
space management.
V 7
Mass storage structures; Disk structure ; Disk attachment; Disk
scheduling; Disk management; Swap space management.
Protection: Goals of protection, Principles of protection, Domain of
protection, Access matrix.
Case study: Linux, Windows.
Note: Case study is only for internal evaluation.

Text Books:
Sl Title Author(s) Edition, Publisher, Year, ISBN
No
1 Operating System Abraham 9th edition, Wiley-India, 2016.
Principles Silberschatz, ISBN: 978-1-118—06333-0
Peter Baer
Galvin, Greg
Gagne
Reference Books:
Sl Title Author(s) Edition, Publisher, Year, ISBN
No
1 Operating systems D.M 3rd Edition, Tata McGraw- Hill,2017
Dhamdhere  ISBN: 9781259005589

2 An Introduction to P.C.P. Bhatt Concepts and Practice, 4th Edition,

Operating Systems PHI (EEE), 2013.
ISBN: 9788120348363
Course Outcomes:

Course Descriptions
outcome
CO1 Explore the fundamental concepts of various operating system services.
CO2 Describe various process management techniques to solve problems in
multi-process environment.
CO3 Select and apply suitable techniques for efficient management of system
resources.
CO4 Analyze the performance of various resource management techniques.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Programming with Python

Subject Code: CS4TH4 L-T-P-C: 4–0–0–3

Course Objectives:

Sl.No Course Objectives

1 Learn the syntax and semantics of Python programming language.

2 Learn how to use lists, tuples, dictionaries and sets in structuring the data.

3 Learn how to handle Files and Exceptions.

4 Demonstrate the use of Numpy, Pandas and Matplotlib libraries.

UNIT Description Hours

The Python programming language, What is a program?, What is 8
debugging?, Syntax errors, The first program, Comments. Values and
data types, Variables, Variable names and keywords, Statements,
Evaluating expressions, Operators and operands, Type converter
functions, Order of operations, Operations on strings, Input,
I
Composition, The modulus operator. First turtle program, Instances
— a herd of turtles, The for loop, Flow of Execution of the for loop,
The loop simplifies our turtle program, A few more turtle methods and
tricks. Conditionals, Iteration. Tips, Tricks, and Common Errors in
iterations.
Functions, Functions can call other functions, Flow of execution, 8
Functions that require arguments, Functions that return values,
Variables and parameters are local, Turtles Revisited. Return values,
II Program development, Debugging with print, Composition, Boolean
functions, Modifiers vs Pure Functions, Tips, Tricks, and Common
Errors : functions, Problems with logic and flow of control, Local
variables, Strings, Tuples
Lists, Dictionaries, Files: About files, Writing our first file, Reading a 8
file line-at-a-time, Turning a file into a list of lines, Reading the whole
III
file at once, An example, Directories, What about fetching something
from the web?,

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Modules, Mutable versus immutable and aliasing, Sets and 8

frozensets, Exceptions: Catching exceptions, Raising our own
exceptions, Revisiting an earlier example, The finally clause of the try
IV
statement. Extending Python Using NumPy, What Is NumPy?,
Creating NumPy Arrays, Array Indexing, Reshaping Arrays, Array
Math, Array Assignment.
Manipulating Tabular Data Using Pandas, What Is Pandas?, Pandas 7
Series, Pandas DataFrame.
V Data Visualization Using matplotlib, What Is matplotlib?, Plotting Line
Charts, Plotting Bar Charts, Plotting Pie Charts, Plotting Scatter Plots,
Plotting Using Seaborn.

Text Books:
Sl Title Author(s) Edition, Publisher, Year, ISBN
No
1 How to Think Like a Jeffrey Elkner, Releasing 3rd Edition (Using Python
Computer Peter 3.x), April, 2020.
Scientist: Learning with Wentworth,
Python 3 Allen B.
Documentation Downey, and
Chris Meyers
2 Python® Machine Wei-Meng Lee Wiley, 1st Edition, December 2019,
Learning ISBN-13: 9781119545637
ISBN-10: 1119545633

Reference Books:
Sl Title Author(s) Edition, Publisher, Year, ISBN
No
1 Fundamentals of Richard L. Southern Adventist University, 2019,
Python Programming Halterman E-book, ISBN:9781539530268
2 Learning Python B.NageshRao 1st Edition, A cyberplus publication,
2017, ISBN:9788193392300

Course Outcomes:

Course Descriptions
outcome
CO1 Demonstrate proficiency in handling various programming constructs of
Python.
CO2 Explicate the type of operators, built-in libraries and functions.
CO3 Illustrate the process of representation and accessing of data using various
data structures.
CO4 Analyze a given problem and develop solution for the same.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Automata Theory and Computation

Subject Code: CS4TH5 L-T-P-C: 4–0–0–3

Course Objectives:

Sl.No Course Objectives

1 Understand core concepts in Automata and Theory of Computation.
2 Identify different Formal Language Classes and their Relationships.
3 Prove or disprove theorems in Automata Theory using their properties.
Compare finite automata, Push Down Automata and Turing Machines as
4
Mathematical models of computation.

UNIT Description Hours

Regular Expressions and Languages, Properties of Regular 8
Languages
Regular Expressions, Finite Automata and Regular Expressions,
Applications of Regular Expressions: Lexical Analysis, Finding
I
Patterns in Text; Proving Languages Not to be Regular, Closure
properties of Regular Languages, Equivalence and Minimization of
Automata, Testing equivalence of states, Testing equivalence of
Regular Languages, Minimization of DFA’s
Context-Free Grammars and Languages 8
Context-Free Grammars, An informal example, Definition of Context-
Free Grammars, Derivations using a Grammar, The language of a
grammar, Sentential forms, Parse Trees, Constructing Parse Trees,
II The yield of a Parse tree, Inferences, Derivations and Parse Trees
Applications of Context-Free Grammars, Parsers, The YACC Parser-
Generator, Ambiguity in Grammars and Languages, Ambiguous
Grammars, Removing ambiguity from grammars, Leftmost derivations
as a way to express ambiguity, Inherent ambiguity.
Pushdown Automata 8
Definition of the Pushdown Automata, Informal Definition, Formal
Definition, A Graphical Notation for PDA’s, Instantaneous
Descriptions of a PDA, The Languages of a PDA, Acceptance by Final
State, Acceptance by Empty Stack, From Empty Stack to Final State,
III
From Final State to Empty stack, Equivalence of PDA’s and CFG’s,
From Grammars to PDA’s, From PDA’s to Grammars, Definition of
Deterministic PDA.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Properties of Context-Free Languages, Introduction to Turing 8

Machines
Normal Forms for CFG’s, Eliminating Useless Symbols, Computing
the Generating and Reachable Symbols, Eliminating  - Productions,
Eliminating Unit Productions, Chomsky Normal Form, The Pumping
IV
Lemma for Context-Free Languages.
The Turing Machine Notation for the Turing Machine, Instantaneous
Descriptions for Turing Machines, Transition Diagrams for Turing
Machines, The Language of a Turing Machine, Turing machines and
Halting Extensions to the basic Turing machines.
Decidability and Complexity 7
Decidability : Definition of an algorithm, decidability, decidable
languages, Undecidable languages, halting problem of TM, Post
V
correspondence problem. Complexity: Growth rate of functions, the
classes of P and NP, Quantum Computation: quantum computers,
Church Turing thesis.

Text Books:
Sl Title Author(s) Edition, Publisher, Year,
No. ISBN
1 Introduction to Automata John E Hopcroft, 3rd Edition, Pearson
Theory, Languages and Rajeev Motwani, Education Limited, 2014,
Computation Jeffery D Ullman ISBN-13:9781292039053
2 Theory of Computer Science : K L P Mishra, N 3rd Edition, PHI, 2016
Automata, Languages and Chandrasekaran ISBN – 9788120329683
Computation

Reference Books:
Sl Title Author(s) Edition, Publisher, Year,
No. ISBN
1 Introduction to Languages and John C Martin 4th Edition, Tata McGraw
Theory of Computation –Hill Education, 2013,
ISBN: 978-0-07-066048-9.
2 An Introduction to Formal Peter Linz 6th Edition, Narosa
Languages and Automata Publishing House, 2016,
ISBN: 9781284077254

Course Outcomes:

Course Descriptions
outcome
CO1 Describe the concepts of Automata Theory and prove the properties
of languages.
CO2 Design a system to accept Regular, Context Free and Recursively
Enumerable Languages.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

CO3 Demonstrate the relationship among Formal Languages, Regular

Expressions, Grammars, Automata and Turing Machines.
CO4 Apply automata skills to describe complex computations effectively.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Software Engineering

Subject Code: CS4TH6 L-T-P-C: 4-0-0-3

Course Objectives:

Sl.No Course Objectives

To gain the knowledge of systematic and disciplined approach for software
development and identification of customer requirements for the
1 development of SRS document.

To understand different software process models, architectural styles,

2 software system design approaches and their appropriate application.

Understand the agile manifesto, principles and the context of agile concrete
3 techniques of design and development that agile teams use to apply.
To appreciate the need of project management and software testing
4 methods.

UNIT Description Hours

Introduction to Software Engineering – Introduction, Professional

software development, Software engineering ethics. 8
I
Software processes - Software process models, Process activities,
Coping with changes, Process Improvement.

Requirements Engineering - Functional and non-functional

requirements, Requirements engineering processes, Requirements 8
II
elicitation, Requirements specification, Requirements validation,
Requirements change.
System Modeling – Context models, Interaction models, Structural
models, Behavioral models. 8
III
Architectural design - Architectural design decisions, Architectural
views, Architectural patterns, Application architectures.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Software Evolution – Evolution Process, Legacy Systems, Software

Maintenance. 8
IV
Agile Software Development - Agile methods, Agile development
techniques, Agile project management, Scaling agile methods.
Software Testing - Development testing, Test-driven development,
Release Testing, User Testing. 7
V
Project Management – Risk Management, Managing People,
Teamwork.

Text Books:

Sl Title Author Edition, Publisher, Year, ISBN

No
10th edition
ISBN 978-0-13-394303-0,
1 Software Engineering Ian Sommerville
By Ian Sommerville, published by
Pearson Education © 2016.

Reference Book:

Sl Title Author Edition, Publisher, Year, ISBN

No
Software Engineering - Roger .G. 7th Edition Tata McGrawhill, 2010
1 A Practitioners Pressman ISBN 978–0–07–337597–7
approach
Foundations of Aditya P Pearson Education, First Edition,
2 Software Testing Mathur 2011, ISBN-13: 978-8131759080

Course Outcomes:

Course Descriptions
outcome
Able to map client requirements into software specifications by
CO1 understanding software development life cycle.
Design and develop software models.
CO2
Able to apply the business values by adopting evolutionary approaches to
CO3 software development.
Capable of managing the project and able to assess the software for its
CO4 robustness.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Algorithms Lab

Subject Code: CS4LB1 L-T-P-C: 0-0-3-1.5

Course Objectives:

Sl.No Course Objectives

To understand different algorithms for searching, sorting and graph

1 problems and analyze the same.

2 To learn how to analyze the performance of algorithms practically.

3 To understand various Algorithm Design Techniques.

Lab Description
Cycles

Brute Force:
1. String matching.
2. Sort a given set of elements using Selection sort.

Divide and Conquer:

3. Sort a given set of elements using Merge sort.
4. Sort a given set of elements using Quick Sort.
I 5. Finding the Maximum and Minimum element in an array of
n integers.

Decrease and Conquer:

6. Print the vertices of the directed acyclic graph in topological order
using:
i. Source Removal Method
ii. DFS Method
Decrease and Conquer:
7. Sort a given set of elements using Insertion Sort.
II
Transform and Conquer:
8. Create a heap tree for a given list of n elements using:

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

i. Top-Down approach.
ii. Bottom-up approach.
Sort ‘N’ number of elements using Heap Sort.

Space and Time Tradeoffs:

9. Implement Horspool algorithm for String Matching.
Dynamic Programming:
10. Solve Knapsack problem and print the solution vector.
11. Find all pair shortest path using Floyd’s Algorithm.

Greedy Technique:
12. Find Minimum Cost Spanning Tree of a given undirected graph
using Prim’s algorithm.
13. Find Minimum Cost Spanning Tree of a given undirected graph
using Kruskal’s algorithm.
14. From a given vertex in a weighted connected graph, find the
shortest paths to other vertices using Dijkstra's algorithm.

Back Tracking:
15. Implement N Queen's algorithm.
16. Find a subset of a given set S of N positive integers whose sum is
III equal to a given positive integer D.

Branch and Bound:

17. Solve Knapsack problem and print the solution vector.
18. Solve Job Assignment Problem and print the solution.

Course Outcomes:

Course Descriptions
outcome
Identify the problem given and design the algorithm using algorithm design
CO1 technique.

CO2 Analyze the performance of various algorithms.

CO3 Compare the performance of different algorithms for same problem.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Operating Systems Lab

Subject Code: CS4LB2 L-T-P-C: 0-0-3-1.5

Course Objectives:

Sl.No Course Objectives

To implement various CPU Scheduling Algorithms

1
To implement Process Creation and Inter Process Communication.
2
To implement Deadlock Avoidance and Deadlock Detection Algorithms
3
To implement Page Replacement Algorithms File Allocation Strategies
4

Lab Description
Cycles

1. Write programs using the following system calls of UNIX operating

system fork, exec, getpid, exit, wait, close, stat, opendir, readdir and
to simulate UNIX commands like cp, ls, grep, etc.

2. Implementation of Shared memory and IPC

I 3. Write C programs to illustrate the following IPC mechanisms

a)Pipes b) FIFOs c) Message Queues d) Shared Memory

4. Write C programs to implement the various CPU Scheduling

Algorithms
a) FCFS b) SJF c) Round Robin d) priority
5. Write Implementation of Semaphores
6. Write a C program to simulate Bankers Algorithm for
II a)Deadlock Avoidance b) Deadlock Prevention.
7. Write a C program to implement the Producer – Consumer problem
using semaphores using UNIX/LINUX system calls.

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

8. Implementation of Paging Technique of Memory Management

9. Implementation of the following Page Replacement Algorithms
a) FIFO b) LRU
III
10. Implementation of the following File Allocation Strategies
a) Indexed b) Linked

Course Outcomes:

Course Descriptions
outcome
Implement various system call and API that are available in Unix operating
CO1
system for : processes, threads and IPC mechanisms.
Implement an Compare the performance of various CPU Scheduling
CO2
Algorithms
CO3 Implement Deadlock avoidance and Detection Algorithms
Demonstrate different memory management schemes , page replacement
CO4
algorithm and file allocation techniques

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Syllabus for the Academic Year – 2021 - 2022

Department: Computer Science and Engineering Semester: 4

Subject Name: Python Programming Laboratory

Subject Code: CS4LB3 L-T-P-C: 0-0-3-1.5

Course Objectives:

Sl.No Course Objectives

Understand the purpose and practical application of various Python

1
programming constructs
2 Explore the operational principles of various Python data structures
Gain hands on experience on using Python Libraries for efficient data
3
manipulation, analysis and visualization

Minimum of two lab exercises have to be conducted on each of the following

topics:
Lab Description
Cycles
 Python Data Types, Operators and Expressions
 Conditionals and Iterations
I  Functions and Modules
 Strings and Tuples

 Lists, Dictionaries and Sets

 File handling
II
 Exception Handling

 NumPy Arrays:
 Creating NumPy Arrays
 Array Indexing
 Reshaping Arrays
 Array Math
 Array Assignment
III
 Manipulating Tabular Data using Pandas:
 Pandas Series
 Pandas DataFrame
 Data Visualization using Matplotlib and Seaborn:
 Plotting Line Charts
 Plotting Bar Charts

Computer Science and Engineering

 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

 Plotting Pie Charts

 Plotting Scatter Plots
 Plotting Using Seaborn

Course Outcomes:

Course Descriptions
outcome
Demonstrate expertise in handling various Python programming
CO1
constructs
Identify and use appropriate data structures to efficiently represent and
CO2
access data
CO3 Develop Python scripts to analyze and visualize huge datasets

Computer Science and Engineering