SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY, TUMAKURU sem syllabus.pdf · 2019-11-07 · SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU (A constituent College of Siddhartha Academy of

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

Computer Science and Engineering

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

DEPARTMENT OF COMPUTER SCIENCE& ENGINEERING

CURRICULUM AND SYLLABUS OF V -VI SEMESTER

2016-17 BATCH

V SEMESTER

Sl.

No Sub. Code Name of the subject L T P S C

1 CS5T01 Operating Systems 4 0 0 0 4

2 CS5T02 Data Communication 4 0 0 0 4

3 CS5T03 Finite Automata and Formal Languages 3 2 0 0 4

4 CS5T04 Data Base Management System 3 0 0 1 4

5 CS5T05 Advanced JAVA and J2EE 3 0 0 0 3

6 CS5OE6Y/

IS5OE6Y

Open Elective-I* 3 0 0 0 3

7 CS5L01 JAVA and J2EE Lab 0 0 3 0 1.5

8 CS5L02 Data Base Management System

Laboratory with Mini Project

0 0 3 0 1.5

Total 20 2 6 1 25

Open Electives offered by CSE/ISE Board:

Open

Elective – I

Credits: 3-0-0-0-3

Sub. Code Subject Title

CS5OE611 Data Structures and Algorithms

CS5OE612 Data Base Management Systems

CS5OE613 Operating Systems

* Students are expected to study Open Electives offered by other branches of Engineering

(except CSE/ISE Board).



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2019 2019 2019 2019 ---- 2020202020202020

Department: Computer Science and Engineering Semester: 5 Subject Name: Operating Systems

Subject Code: CS5T01 L-T-P-C: 4-0-0-0-4

Course Objectives:

Course Outcomes:

Sl. No Course Objectives

1 Learn the fundamentals of Operating Systems.

2 Understand what a process is and how processes are synchronized

and scheduled using various algorithms.

3 Gain knowledge on system concepts that includes Mutual exclusion

algorithms, deadlock detection algorithms.

4 Learn the mechanisms involved in memory management in an OS.

Course Outcome

Descriptions

CO1 Explain the structures and functional components of operating systems

CO2 Apply appropriate process management techniques to solve machine-

critical problems in multi-process environment.

CO3 Select suitable techniques for efficient memory management.

CO4 Outline the concepts of file and storage management.



UNIT Description Hours

I

Introduction to Operating Systems and System Structures:

What operating systems do? Computer System architecture; Operating System

structure; Storage structure, Cache memory, Distributed system; Open source

Operating System, Computing environments. Operating System Services:

System calls; Types of system calls; System programs; Operating System

structure; Virtual machines;

9

II

Process Management:

Process concept: Overview; Process scheduling; Operations on processes;

Inter process communication. Multi Thread Programming: Overview;

Multithreading models; Operating System Examples Threading issues.

Process Scheduling: Basic concepts; Scheduling criteria; Scheduling

algorithms, Multi-Processor Scheduling.

9

III

Process Synchronization:

Synchronization: Background; The Critical section problem; Peterson’s

solution; Synchronization hardware; Semaphores; Classical problems of

synchronization; Monitors.

Deadlocks: System model; Deadlock characterization; Methods for handling

deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and

recovery from deadlock.

11

IV

Memory Management:

Memory Management Strategies: Background; Swapping; Contiguous

memory allocation; Paging; Structure of page table; Segmentation. Virtual

Memory Management: Background; Demand paging; Copy-on write; Page

replacement; Allocation of frames; Thrashing. File System: File

concept; Access methods; Directory structure; File system mounting;

Protection. Implementing File System: File system structure; File system

implementation; Directory implementation; Allocation methods; Free space

management.

12

V

Secondary Storage Structures:

Mass storage structures; Disk structureS; Disk attachment; Disk scheduling;

Disk management; Swap space management. Protection: Goals of protection,

Principles of protection, Domain of protection, Access matrix, Implementation

of access matrix, Access control, Revocation of access rights.

11

Question paper Pattern:

From each unit, two questions of 20 marks each have to be given. The student has to

answer one full question of his/her choice.



Text Books:

Sl No

Text Book title Author Volume and Year of Edition

1 Operating System Principles, Abraham

Silberschatz, Peter

Baer Galvin, Greg

Gagne

8th

edition, Wiley-

India, 2009.

Reference Book:

Sl No


1 Operating systems - A concept based

Approach D.M Dhamdhere 3

rd Edition, Tata

McGraw- Hill,2008

2 Operating Systems

P.C.P. Bhatt 2nd Edition, PHI,

2006.




Department: Computer Science and Engineering Semester: 5

Subject Name: DATA COMMUNICATION


Course Objectives:

Course Outcomes:

Sl. No

Course Objectives

1

Comprehend the transmission technique of digital data between two

or more computers and a computer network that allows computers to

exchange data.

2 Explain with the basics of data communication and various types of

computer networks.

3 Illustrate TCP/IP protocol suite and switching criteria

4 Medium Access Control protocols for reliable and noisy channels.

5 Expose wireless and wired LANs.

Course Outcome

Descriptions

CO1 Explain the structure of layered approach and its standards in computer

networks.

CO2 Demonstrate the different data formats, transmission and conversions.

CO3 Identify the errors in data communication and apply appropriate methods

for correction.

CO4 Solve problems to improve the performance of computer networks.




I

Data Communications and Network Models:

Introduction: Data communications: Components, Data Representation, Data

Flow, Networks: Network Criteria, Physical structure, Network Types, Local

Area Network, Wide Area Network, switching, The Internet, Standards and

Administration: Internet Standards, Internet Administration.

Network Models: Protocol Layering: Scenarios, Principles of layering,

Logical Connection, TCP/IP Protocol Suite: Layered architecture, Layers in

the TCP/IP Protocol Suite, Description of each layer, Encapsulation and

Decapsulation, Addressing, Multiplexing and Demultiplexing, The OSI

Model, OSI versus TCP/IP.

9

II

Physical Layer and Media:

Data and Signals: Analog and digital Data, Analog and Digital Signals,

Periodic and Nonperiodic, Digital Signals,: Bit rate , Bit Length, Digital Signal

as a composite Analog signal, Transmission of Digital Signals. Transmission

impairment: Attenuation, Distortion, Noise. Data rate limits: Noiseless

Channel-Nyquist Bit Rate, Noisy Channels-Shannon Capacity, Using both

limits. Performance: Bandwidth, Throughput, Latency, Bandwidth Delay

Product, Jitter. Digital Transmission: Digital-to-Digital conversion; Analog-to-

Digital conversion; Transmission modes.

11

III

Physical Layer and Media Contd...:

Analog Transmission: Digital - to - Analog conversion; Analog - to - Analog

conversion.

Bandwidth Utilization: Multiplexing; Spread spectrum. Transmission media:

Guided media, unguided media

Switching: Three Methods of Switching, Switching and TCP/IP Layer, Circuit

switched networks, Packet Switching: Data gram networks Virtual-circuit

networks, Structure of a switch.

11

IV

Data Link layer:

Introduction: Link-Layer Addressing, Error Detection and Correction:

Introduction, Block coding; Cyclic Codes: Cyclic Redundancy Check,

Polynomials, Cyclic Code Encoder using Polynomials, Cyclic Code Analysis,

Advantages of Cyclic Codes, Other Cyclic Codes, Hardware Implementation,

Checksum, Forward Error Correction,

Data Link Control: DLC Services, Data-Link Layer Protocols, HDLC, Point-

to-Point Protocol, Media Access Control: Random Access, Controlled Access,

Channelization.

11



V

Data Link layer Contd..:

Wired LANs: Ethernet, Ethernet Protocol, Standard Ethernet, Fast Ethernet,

Gigabit Ethernet.

Wireless LAN’s: Introduction, IEEE 802.11 Project, Bluetooth. -

Architecture, Bluetooth Layers, Connecting Devices and Virtual LANs:

Connecting Devices, Virtual LANs,

ATM: Design goals, problems, architecture.

10




Text Books:

Sl No


1

Data Communications and Networking Behrouz A.

Forouzan

5th Edition, Tata

McGraw Hill, 2006

Reference Book:

Sl No


1 Communication Network – Fundamental

Concepts and Key Architectures Alberto Leon-Garcia

and Indra ,Widjaja 2nd Edition, Tata

McGraw-Hill, 2004.

2 Data and Computer Communication William Stallings 8th Edition, Pearson

Education,2007

3 Computer and Communication

Networks Nader F. Mir Pearson Education,

2007.

4 Computer Networks

Andrew S.

Tanenbaum

4th Edition,Pearson

Education, 2008.





Subject Name: FINITE AUTOMATA AND FORMAL LANGUAGES


Course Objectives:

Course Outcomes


I

Introduction to Finite Automata:

Why study Automata Theory?, Structural representations, Grammars, Regular

Expressions, The Central Concepts of automata theory , Alphabets, Strings,

Languages, Problems, Set-Formers as a way to define languages, Definition of

DFA, How a DFA processes strings, Simpler notations for DFA’s, Extending

the transition function to strings, The language of a DFA, Nondeterministic

8


1 Understand core concepts in Automata and Theory of Computation.

2 Identify different Formal language Classes and their Relationships.

3 Design Grammars and Recognizers for different formal languages.

4

Prove or disprove theorems in automata theory using their

properties.

5

Compare finite automata, push down automata and turing machines

as Mathematical models of computation.

Course outcome

Descriptions

CO1 Explain the concepts of automata theory and prove the properties of

languages.

CO2 Design a system to accept Regular and Context Free Languages.

CO3 Demonstrate the relationship among formal languages, regular

expressions, grammars, automata and Turing machines.

CO4 Design Push Down Automata (PDA), Turing Machine to accept a

language.



Finite Automata(NFA),An informal view of NFA, Definition of NFA, An

Extended Transition Function, The language of NFA, Equivalence of DFA and

NFA, Finite Automata with Epsilon-transitions.

II

Regular Expressions and Languages, Properties of Regular Languages:

Regular Expressions, Finite Automata and Regular Expressions, Applications

of Regular Expressions: Lexical Analysis, Finding 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.

7

III

Context-Free Grammars and Languages:

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, 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.

8

IV

Pushdown Automata:

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, 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.

8

V

Properties of Context-Free Languages, Introduction to Turing 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 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.

8






Text Books:

Sl No


1 Introduction to Automata Theory,

Languages, and Computation

John E Hopcroft,

Rajeev Motwani,

Jeffery D Ullman

3rd Edition, Pearson

Education, 2013

Reference Book:

Sl No


1 Introduction to Languages and Theory

of Computation

John C Martin 4th Edition, Tata

McGraw –Hill

Publishing Company

Limited, 2011

2 “An Introduction to Formal Languages

and Automata”

Peter Linz 6th Edition, Narosa

Publishing House,

2007.



Syllabus for the ASyllabus for the ASyllabus for the ASyllabus for the Academic Year cademic Year cademic Year cademic Year –––– 2019 2019 2019 2019 ---- 2020202020202020


Subject Name: DATABASE MANAGEMENT SYSTEMS


Course Objectives:

Course Outcomes


1

Gain knowledge of the architecture and functioning of Database

Management Systems.

2

Understand and apply the principles of data modeling using Entity

Relationship and develop a good database design.

3

Understand the use of Structured Query Language (SQL) , PL/SQL and

its syntax.

4

Apply normalization techniques to normalize a database and understand

the need of database transaction and controlling the consequences of

concurrent data access.

Course outcome

Descriptions

CO1 Explain the different issues involved in the design and implementation of a

database system.

CO2 Apply data modeling techniques to design a suitable database for a given

application.

CO3 Create, maintain, normalize and modify databases using query languages.

CO4 Describe the characteristics of database transactions and analyze their

effects on database integrity and consistency.




I

Introduction: An example; Characteristics of Database approach; Actors on the scene;

Workers behind the scene; Advantages of using DBMS approach; A brief

history of database applications; 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;

7

II

Entity-Relationship Model and Relational Model: Using High-Level Conceptual Data Models for Database Design; An Example

Database Application; Entity Types, Entity Sets, Attributes and Keys;

Relationship types, Relationship Sets, Roles and Structural Constraints; Weak

Entity Types; Refining the ER Design; ER Diagrams, Naming Conventions

and Design Issues;. Relational Model Concepts; Relational Model Constraints

and Relational Database Schemas; Update Operations, Transactions and

dealing with constraint violations; Relational Database Design Using ER- to-

Relational Mapping.

8

III

Relational Algebra, SQL and PL/SQL: Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory;

Binary Relational Operations : JOIN and DIVISION; Additional Relational

Operations; Examples of Queries in Relational Algebra; SQL Data Definition

and Data Types; Specifying basic constraints in SQL; Schema change

statements in SQL; Basic queries in SQL; More complex SQL Queries. Insert,

Delete and Update statements in SQL; Views (Virtual Tables) in

SQL;.PL/SQL: Learning the basics of PL/SQL, Writing Declarations and

blocks with Examples.

9

IV

Database Design – 1: 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.

Database Design -2: Multivalued Dependencies and Fourth Normal Form; Join Dependencies and

Fifth Normal Form;

7

V

Transaction Management: The ACID Properties; Transactions and Schedules; Concurrent Execution of

Transactions; Lock- Based Concurrency Control; Performance of locking;

Transaction support in SQL; Introduction to crash recovery; 2PL, Introduction

to ARIES; The write-ahead log protocol; Checkpointing; Recovering from a

System Crash; Media Recovery.

8






Text Books:

Sl No


1 Fundamentals of

Database Systems Elmasri and Navathe

5th Edition,

Pearson

Education, 2007.

2 Database Management

Systems Raghu Ramakrishnan and

Johannes Gehrke

3rd Edition,

McGraw-Hill,

2003.

3 Teach Yourself

PL/SQL 2nd Edition Sams

Publishing,2000

Reference Book:

Sl No


1 Data base System Concepts Silberschatz,

Korth and

Sudharshan

5th Edition,

Mc-GrawHill,

2006.

2 A Introduction to Database

Systems

C.J. Date, A.

Kannan, S.

Swamynatham

8th Edition,

Pearson

education,

2006.



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2019 2019 2019 2019 –––– 2020202020202020


Subject Name: ADVANCED JAVA AND J2EE


Course Objectives:

Course Outcomes:

Sl. No

Course Objectives

1 Know multi-threading and event handling concepts.

2 Understand console based, GUI based and web based applications.

3 To familiarize the Data Base and connectivity through the Java

database connectivity (JDBC) and to introduce the basics of J2EE.

4 Learn to create, debug and run multi-tier and enterprise-level

applications.

Course outcome

Descriptions

CO1 Apply Java thread libraries for Multithread models to solve real word

problem.

CO2 Design applications with graphical user interface and integrate with event

handling.

CO3 Implement three-tier architecture applications.

CO4 Invoke and develop sever side objects.




I

Multi-Threaded Programming:

The Java Thread Model; The Main Thread; Creating a Thread; Creating

Multiple Threads; Using is Alive() and join(); Thread Priorities;

Synchronization; Inter-thread Communication; Suspending, Resuming and

Stopping Threads; Obtaining a Thread’s state.

8

II

APPLETS AND STRING HANDLING

Applets:

Two Types of Applet; Applet Basics; Applet Architecture; An Applet

Skeleton; Simple Applet Display Methods; Requesting Repainting; Using the

Status Window; The HTML Applet Tag; Passing Parameters to Applets;

getDocumentBase( ) and getCodeBase( ); AppletContext and showDocument(

);

String Handling:

The String Constructors; Modifying a String; String Buffer(till substring( ).

7

III

EVENT HANDLING

Event Handling: Two event handling mechanisms; The delegation event model; Event classes

(only the keyEvent Class); Sources of events; Event listener interfaces; Using

the delegation event model: Handling Mouse Event; Adapter classes; Inner

classes.

7

IV

JAVA DATABASE ACCESS

JDBC: The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief

Overview of the JDBC process; Database Connection; Associating the JDBC /

ODBC Bridge with the Database; Statement Objects; ResultSet; Transaction

Processing; Metadata, Data types; Exceptions.

8

V

SERVLETS, JSP, RMI

Servlet: Background; The Life Cycle of a Servlet; Servlet Development Options, Using

Tomcat; A simple Servlet; The Servlet API; The javax.servlet Package;

Reading Servlet Parameter; The javax.servlet.http package; Handling HTTP

Requests and Responses, Using Cookies, Session Tracking.

JSP:

Java Server Pages: JSP, JSP Tags, Request string User Sessions, Cookies,

Session Objects.

RMI: Java Remote Method Invocation: Remote Method Invocation concept; Server

side, Client side.

9






Text Books:

Sl No


1 Java - The Complete Reference Herbert Schildt 9th

Edition, Tata

McGraw Hill, 2014

2 J2EE - The Complete Reference Jim Keogh, th

Edition Tata McGraw Hill,

2011.





Subject Name: DATA STRUCTURES AND ALGORITHMS

Subject Code: CS5OE611 L-T-P-C: 3-0-0-0-3

Course Objectives:

Course Outcomes


1 Know efficient storage mechanisms of data for an easy

access.

2 Design and implementation of various basic data

structures.

3 Introduce various techniques for representation of the data

in the real world.

4 Develop application using data structures.

Course outcome

Descriptions

CO1 Define the basics of algorithms and data structures.

CO2 Explain the working principle of linear data structures and non-linear Data

structures.

CO3 Classify the Applications of data structures and illustrate different

operations on data structures.

CO4 Develop algorithms for linear data structures and non-linear data

structures.




I

Introduction: History of Algorithms, Definition, Structures and Properties of Algorithms,

Development of an Algorithm, Data Structures and Algorithms, Data

Structures - Definition and Classification.

Analysis of Algorithms: Efficiency of Algorithms, Asymptotic Notations.

Arrays: Introduction, Array Operations, Number of Elements in an Array,

Representation of Arrays in Memory.

7

II

Stacks

Introduction, Stack Operations: Stack Implementation, Implementation of push

and pop operations, Applications: Recursive programming, Infix, Prefix and

Postfix Expressions, Evaluation of postfix expressions.

8

III

Queues

Introduction, Operations on Queues:

Insert and Delete operations.

Queue Implementation:

Implementation of insert and delete operations on a queue, Limitations of

linear queues.

Circular Queues: Operation on a circular queue.

8

IV

Linked Lists

Introduction, Singly Linked List:

Representation of a singly linked list, Insertion and deletion in a singly linked

list.

Doubly Linked List:

Representation of a doubly linked list, Advantages and disadvantages of a

doubly linked list, Operations on doubly linked lists.

8

V

Trees

Introduction.

Trees: Definition and Basic Terminologies, Representation of Trees

Binary Trees: Basic Terminologies and types, Representation of Binary Trees, Binary Tree

Traversals.

8






Text Books:

Sl No


1 Data Structures and Algorithms:

Concepts, Techniques and

Applications

G. A. Vijayalakshmi

Pai

Published by Mcgraw

Hill Education (2015)

ISBN 10: 0070667268

ISBN 13: 9780070667266

Reference Book:

Sl No


1 Data Structures A Pseudocode approach

with C Richard F. Gilberg

and Behrouz A.

Forouzan

Thomson, 2005.

2 Data Structures & Program Design in C Robert Kruse &

Bruce Leung Pearson Education,

2007

3 Data Structures and Algorithms Alfred V. Aho, John

E. Hopcroft and

Jeffrey D. Ullman

Addison-Wesley

Publishing Company.





Subject Name: DATABASE MANAGEMENT SYSTEMS


Course Objectives:

Course Outcomes

Sl. No

Course Objectives

1 Knowledge of the architecture and functioning of Database

Management Systems

2

Understand and apply the principles of data modeling using

Entity Relationship and develop a good database design.

3 Understand the use of Structured Query Language (SQL)

and its syntax.

4 Apply normalization techniques to normalize a database

and understand the need of database transaction.

Course outcome

Descriptions

CO1 Explain the different issues involved in the design and implementation of a

database system.

CO2 Apply data modeling techniques to design a suitable database for a given

application.

CO3 Create, maintain, normalize and modify databases using query languages.

CO4 Describe the characteristics of database transactions and analyze their

effects on database integrity and consistency.




I

Introduction:

Introduction; An example; Characteristics of Database approach; Actors on

the scene; Workers behind the scene; Advantages of using DBMS approach; A

brief history of database applications; 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;

8

II

Entity-Relationship Model and Relational Model: Entity Types, Entity Sets, Attributes and Keys; Relationship types,

Relationship Sets, Roles and Structural Constraints; Weak Entity Types;

Refining the ER Design; ER Diagrams, Naming Conventions and Design

Issues;

7

III

SQL : SQL Data Definition and Data Types; Specifying basic constraints in SQL;

Schema change statements in SQL; Basic queries in SQL; More complex SQL

Queries. Insert, Delete and Update statements in SQL; Views (Virtual Tables)

in SQL;

9

IV

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.

7

V

Transaction Management: The ACID Properties; Transactions and Schedules; Concurrent Execution of

Transactions; Lock- Based Concurrency Control; Performance of locking;

Transaction support in SQL;

8






Text Books:

Sl No


1 Fundamentals of Database

Systems Elmasri and Navathe 5th Edition, Pearson

Education, 2007

2 Database Management Systems

Raghu Ramakrishnan

and Johannes Gehrke 3rd Edition,

McGraw-Hill, 2003.

Reference Book:

Sl No


1 Data base System Concepts

Silberschatz, Korth

and Sudharshan 5th Edition, Mc-

GrawHill, 2006.

2 A Introduction to Database Systems

C.J. Date, A.

Kannan, S.

Swamynatham

8th Edition, Pearson

education, 2006.





Subject Name: OPERATING SYSTEMS


Course Objectives:

Course Outcomes

Sl. No

Course Objectives

1 Learn the fundamentals of Operating Systems.

2 Understand what a process is and how processes are

synchronized and scheduled using various algorithms.

3 Gain knowledge on system concepts that includes Mutual

exclusion algorithms, deadlock detection algorithms

4 Learn the mechanisms involved in memory management in an

OS.

Course outcome

Descriptions

CO1 Explain the structures and functional components of operating systems.

CO2 Apply appropriate process management techniques to solve machine-

critical problems in multi-process environment.

CO3 Select suitable techniques for efficient memory management.

CO4 Outline the concepts of file and storage management.




I

Introduction to Operating Systems and System Structures

What operating systems do? Computer System architecture; Operating System

structure; Storage structure, Cache memory

Operating System Services: System calls; Types of system calls; System programs; Operating System structure;

Virtual machines;

7

II

Process Management Process concept:

Overview; Process scheduling; Operations on processes; Inter process

communication.

Multi Thread Programming:

Overview; Multithreading models; Threading issues.

Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms,

8

III

Process Synchronization Synchronization:

Background; The Critical section problem; Peterson’s solution; Synchronization

hardware; Semaphores;

Deadlocks:

System model; Deadlock characterization; Methods for handling deadlocks; Deadlock

prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

8

IV

Memory Management

Memory Management Strategies:

Background; Swapping; Contiguous memory allocation; Paging; Structure of page

table; Segmentation.

Virtual Memory Management: Background; Demand paging; Copy-on write; Page replacement; Allocation of

frames; Thrashing.

8

V

Secondary Storage Structures

Mass storage structures;

Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space

management.

Protection:

Goals of protection, Principles of protection, Domain of protection, Access matrix,

Implementation of access matrix, Access control, Revocation of access rights.

8






Text Books:

Sl No


1 Operating System Principles Abraham Silberschatz,

Peter Baer Galvin,

Greg Gagne

8th edition, Wiley-

India, 2009.

Reference Book:

Sl No


1 Operating systems - A concept based

Approach

D.M Dhamdhere 3rd Edition, Tata

McGraw- Hill,

2008

2 Operating Systems P.C.P. Bhatt 2nd Edition, PHI, 2006.

3 Operating systems Harvey M Deital 3rd Edition, Addison

Wesley, 1990.





Subject Name: JAVA AND J2EE LAB

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

Course Objectives:

Course Outcomes

Sl. No

Course Objectives

1 Appreciate the handling of console, GUI and Web based

applications.

2 Know multi-threading and event handling concept.

3 Understand integration of application like JDBC and JSP

4 Learn to create, debug and run multi-tier and enterprise-

level applications.

Course outcome

Descriptions

CO1 Design and implementation of Multithread models.

CO2 Design applications with graphical user interface and integrate with event

handling.

CO3 Design, implement and Deploy three-tier architecture applications.

CO4 Implement, invoke and develop sever side objects.



Lab cycles

Description

I

1. 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 subclass that each one of the

classes extends the Class Shape. Each one of the classes contains only the

method printArea() that prints the area of Shape. Note: Read the input from the

keyboard using Scanner Class.

2. 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.

3. Write a Java program which has: (i) An interface for Stack Operations that

defines push() and 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.

4. Write a Java program that correctly implements producer consumer problem

using the concept of inter-thread communication.

II

5. 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.

6. Write a Java program to create simple Banner Applet.

7. Write a Java program for handling mouse events that demonstrates the various

operations like mouse clicked, entered, exited, pressed, released, dragged,

moved. Display the appropriate message in applet window at current location.

8. Write a (i) HTML program called AddCookie.html that allows a user to specify a

value for the cookie named MyCookie. (ii) Servlet program called

AddCookieServlet.java that processes the submission of AddCookie.html. (iii)

Servlet program called GetCookiesServlet.java that displays cookie values.

III

9. Write a java servlet program which accepts the user name, address and phone

number from the client (HTML) and stores the value into the database, retrieve

the user name / address / phone number from the database and display the same

on the web browser. Note: Build three tier architecture. (HTML, Servlet, and

Database).

10. Write a JSP application to get access using login credentials and shows the type

of error using ErrorPage if the user inputted incorrectly.

11. Write a client-server java program using RMI: (i) to find, the area of a Triangle

on server side. (ii) A client sends a request along with given length and breadth.

(iii) Display the result on the client side.

12. Write a Java program for creating multiple threads using isAlive( ) and join( )

methods.



Pattern for practical exam conduction:

a. Experiment Distribution:

• For laboratories having only one part: Students are allowed to pick one experiment

from the lot with equal opportunity.

• For laboratories having PART A and PART B: Students are allowed to pick one

experiment from PART A and one experiment from PART B, with equal

opportunity.

b. Change of experiment is allowed only once and 20% of the maximum marks to be

deducted.




Department: Computer Science and Engineering Semester: 5 Subject Name: Data Base Management System Lab with Mini Project

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

Course Objectives:

Course Outcomes:

Lab cycles

Description

I

A. Consider the following schema for a Library Database:

BOOK (Book_id, Title, Publisher_Name, Pub_Year)

BOOK_AUTHORS (Book_id, Author_Name)

PUBLISHER (Name, Address, Phone)

BOOK_COPIES (Book_id, Branch_id, No-of_Copies)

CARD(Card_No)

BOOK_LENDING (Book_id, Branch_id, Card_No, Date_Out, Due_Date)

LIBRARY_BRANCH (Branch_id, Branch_Name, Address)

Sl. No

Course Objectives

1 To understand how a real world problem can be mapped to

schemas

2 To solve different industry level problems & to learn its

applications

Course outcome

Descriptions

CO1 Design database schema for a given problem-domain and enforce different

constraints on a database using RDBMS.

CO2 Populate and query a database using SQL DML/DDL commands.

CO3 Build and demonstrate a GUI application.



Write SQL queries to

1. Retrieve details of all books in the library – id, title, name of publisher,

authors, number of copies in each branch, etc.

2. Get the particulars of borrowers who have borrowed more than 3 books, but

from Jan 2017 to Jun 2017

3. Delete a book in BOOK table. Update the contents of other tables to reflect

this data manipulation operation.

4. Partition the BOOK table based on year of publication. Demonstrate its

working with a simple query.

5. Create a view of all books and its number of copies that are currently

available in the Library.

B. Consider the following schema for Order Database:

SALESMAN (Salesman_id, Name, City, Commission)

CUSTOMER (Customer_id, Cust_Name, City, Grade, Salesman_id)

ORDERS (Ord_No, Purchase_Amt, Ord_Date, Customer_id, Salesman_id)


1. Count the customers with grades above Bangalore’s average.

2. Find the name and numbers of all salesmen who had more than one customer.

3. List all salesmen and indicate those who have and don’t have customers in

their cities (Use UNION operation.)

4. Create a view that finds the salesman who has the customer with the highest

order of a day.

5. Demonstrate the DELETE operation by removing salesman with id 1000. All

his orders must also be deleted.

II

C. Consider the schema for Movie Database:

ACTOR (Act_id, Act_Name, Act_Gender)

DIRECTOR (Dir_id, Dir_Name, Dir_Phone)

MOVIES (Mov_id, Mov_Title, Mov_Year, Mov_Lang, Dir_id)

MOVIE_CAST (Act_id, Mov_id, Role)

RATING (Mov_id, Rev_Stars)


1. List the titles of all movies directed by ‘Hitchcock’.

2. Find the movie names where one or more actors acted in two or more

movies.

3. List all actors who acted in a movie before 2000 and also in a movie

after



2015 (use JOIN operation).

4. Find the title of movies and number of stars for each movie that has at

least one rating and find the highest number of stars that movie

received. Sort the result by movie title.

5. Update rating of all movies directed by ‘Steven Spielberg’ to 5.

D. Consider the schema for Company Database:

DEPARTMENT (DNo, DName, MgrSSN, MgrStartDate)

EMPLOYEE (SSN, Name, Address, Sex, Salary, SuperSSN, DNo)

DLOCATION (DNo,DLoc)

PROJECT (PNo, PName, PLocation, DNo)

WORKS_ON (SSN, PNo, Hours)


1. Make a list of all project numbers for projects that involve an employee

whose last name is ‘Scott’, either as a worker or as a manager of the

department that controls the project.

2. Show the resulting salaries if every employee working on the ‘IoT’

project is given a 10 percent raise.

3. Find the sum of the salaries of all employees of the ‘Accounts’

department, as well as the maximum salary, the minimum salary, and the

average salary in this department

4. Retrieve the name of each employee who works on all the projects

controlled by department number 5 (use NOT EXISTS operator). For each

department that has more than five employees, retrieve the department

number and the number of its employees who are making more than

Rs.6,00,000.

5. For each project, retrieve the project number, the project name, and the

number of employees who work on that project.

Instructions:

� The exercises are to be solved in an RDBMS environment like Oracle or

DB2.

� Suitable tuples have to be entered so that queries are executed correctly.

� The results of the queries may be displayed directly.

Relevant queries other than the ones listed along with the exercises may also be

asked in the examination.



III

PART B: Mini-Project

Consider any one of the following applications:

1. Library Management System

2. Hospital Management System

3. College Management System

4. Bank Management System

5. Railway Ticket Booking Management System

6. Gas Booking Management System

7. Retail Shop Management System

8. Hostel Management System

9. Boat Reservation Management System

10. Online Cricket ticket booking Management System

11. Personal Information System

12. Time Table Management System

13. Hotel Management System

14. Super Market Management System

15. Student Information System

Instructions:

� The database can be created using Oracle, SQL-Server, MS-Access, DB2

etc.,

� The front end can be created using VB, VAJ or any other similar tool.

� For Database connectivity any suitable programming language can be

used. (Java, Python etc.,)

� The student must demonstrate their Mini-Project at the time of

examination.



Pattern for practical exam conduction:

The allotment of marks is detailed as below.

Sl. No. Activity Max. Marks

1 SQL Programming Part-A 30

2 Mini-Project Part-B 15

3 Viva-Voce 05

Total Max. Marks 50

Minimum Passing Marks (40% of Max. Marks) 20

Documents

SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY, TUMAKURU sem syllabus.pdf · 2019-11-07 · SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU (A constituent College of Siddhartha Academy of