Download View Uploaded Details

SDMCET: Syllabus
College Vision and Mission
SDMCET –Vision
To be a School of Dynamic Mindset focusing on Research,
Innovation & Development and emerge as Central hub of
Engineering Talents.
SDMCET – Mission
 Committed towards continuous improvement in teaching
& learning, Research in engineering and technology.
 Encouraging intellectual, quality, ethical and creative
pursuits amongst teaching and students fraternity.
 Striving to be an enabler for reaching the unreached.
SDMCET- Quality Policy
 In its quest to be a role model institution, committed to meet or exceed
the utmost interest of all the stake holders.
SDMCET- Core Values





Competency
Commitment
Equity
Team work and
Trust
III Year B. E. (ISE): 2015 –16
1
SDMCET: Syllabus
INFORMATION SCIENCE AND ENGINEERING
Vision:
To create Information Technology Engineers having the best
knowledge and skills in contemporary Information
Technology practices.
Mission:
 To provide state-of-art facilities and knowledge to help
create the best-in-class Information Technology
Engineers.
 To expose the students to the finest Information
Technology practices and ethics.
Program Educational Objectives:
 Excel as IT Professional with proficiency in designing
solutions to Information Engineering problems.
 Pursue higher studies with the sound knowledge of
basic concepts and skills in science and IT disciplines.
 Exhibit professionalism, team work and exposure to
current trends towards continuous learning.
III Year B. E. (ISE): 2015 –16
2
SDMCET: Syllabus
Program Outcomes
a) An ability to use and apply knowledge of Basic sciences including
Mathematics and core computing fundamentals for solving computer
based problems.
b) An ability to develop logical reasoning, coding skills, analysis and
mathematical modeling.
c) An ability to design a computer based system, component or process to
meet the desired needs.
d) An ability to design, conduct experiments, analyze, interpret data and
provide valid conclusions based on the results of experimentation.
e) To develop the skill to understand and solve complex problems related to
everyday situations by leveraging IT capabilities and tools.
f) To demonstrate creative capability to optimize the use of IT based
solutions for societal cause.
g) An ability to assess the impact of the IT solution created in short term and
long term on immediate neighborhood and society at large.
h) An ability to design comprehensive solutions in the IT domain with high
standards of morality and ethics.
i) Capability to work and lead cohesive teams in information technology
related areas.
j) An ability to have smooth and successful interaction with other
professionals and stake holders through the use of good verbal and nonverbal communication skills.
k) An ability to demonstrate project management and financial skills in finding
IT solutions.
l) An ability to absorb, assimilate and master rapid changes in technology
and apply them to real life problems by engaging in lifelong learning.
III Year B. E. (ISE): 2015 –16
3
SDMCET: Syllabus
Scheme for V Semester
Teaching
Course
Code
Course Title
Management, Entrepreneurship and
Intellectual Property Rights
11UISC501 Operating Systems
11UISC502 Database Management System
11UISC503 Web Technology
11UISL504 Database Management System Lab
11UISL505 Web Technology Lab
Elective – I
Elective – II
Total
CIE
Credits
Max.
Marks
*Max.
Marks
Duration
in hours
4-0-0-0
4
50
100
3 Hrs.
4-0-0-0
4-0-0-0
4-0-0-0
0-0-2-0
0-0-2-0
4-0-0-0
4-0-0-0
24-0-4-0
4
4
4
1
1
4
4
26
50
50
50
50
50
50
50
400
100
100
100
3 Hrs.
3 Hrs.
3 Hrs.
(Hrs/Week)
11UISC500
Code
L-T-P-S
Examination
Theory (SEE)
Practical (SEE)
Elective – I
100
100
600
3 Hrs.
3 Hrs.
18 Hrs.
Elective – II
Code
11UISE520
Advanced Data Structures & Algorithms
11UISE523
System Software
11UISE521
Multimedia Communication
11UISE524
Embedded system
11UISE522
Cyber Law and Ethics
11UISE525
Android –Mobile Application
CIE: Continuous Internal Evaluation
SEE: Semester End Examination
L: Lecture
T: Tutorials
P: Practical
S: Self-study
*SEE for theory courses is conducted for 100 marks and reduced to 50 marks.
III Year B. E. (ISE): 2015 –16
4
Max. Duration
Marks in hours
50
50
3 Hrs.
3 Hrs.
100
6 Hrs.
SDMCET: Syllabus
Scheme for VI Semester
Teaching
Course
Code
11UISC600
11UISC601
11UISC602
11UISC603
11UISL604
11UISL605
Course Title
L-T-P-S
(Hrs/Week)
Unix Systems Programming
Computer Networks
Software Engineering
Object Oriented Modeling and Design
Systems Lab
Mini Project-I
Elective – III
Elective – IV
Total
CIE
Credits
3-0-0-0
4-0-0-0
4-0-0-0
4-0-0-0
0-0-2-0
0-0-8-0
4-0-0-0
4-0-0-0
23-0-10-0
Elective – III
Code
Examination
Theory (SEE) Practical (SEE)
Max.
*Max. Duration Max. Duration
Marks Marks in hours Marks In hours
3
4
4
4
1
4
4
4
28
50
50
50
50
50
50
50
50
400
100
100
100
100
100
100
600
3 Hrs.
3 Hrs.
3 Hrs.
3 Hrs.
3 Hrs.
3 Hrs.
18 Hrs.
50
50
3 Hrs.
3 Hrs.
100
6 Hrs.
Elective –IV
Code
11UISE620
Computer Graphics
11UISE623
File Structures
11UISE621
Advanced Computer Architecture
11UISE624
Simulation and Modeling
11UISE622
Advanced Data Base Management System
11UISE625
Parallel algorithms
CIE: Continuous Internal Evaluation
SEE: Semester End Examination
L: Lecture
T: Tutorials
P: Practical
S: Self-study
*SEE for theory courses is conducted for 100 marks and reduced to 50 marks.
Total Credits offered for the Third year: 54
III Year B. E. (ISE): 2015 –16
5
SDMCET: Syllabus
11UISC500
Detailed Syllabus
V Semester
Management, Entrepreneurship and
Intellectual Property Rights
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: Management, Entrepreneurship and Intellectual Property
Rights is a core theory course at undergraduate V semester level. The objective
of this course is for the students to learn and understand the spirit of
entrepreneurship, management, the significance and relevance of intellectual
property rights and also the various agencies involved in funding of startup
companies.
Course Outcomes: Upon the completion of the course, the student should be able
to:
CO-1 Illustrate the connection between entrepreneurship, liberalization, and
globalization. (POi)
CO-2 Describe the various methods involved in managerial aspects of corporate
life.(POg)
CO-3 Discuss the Government, IPR and Institutional support for
entrepreneurship.(POh)
CO-4 Use the techniques, skills necessary for Engineering practices.
(POh)
Contents:
1) Entrepreneurship
a. Foundations of Entrepreneurship: Meaning of entrepreneur, functions of
entrepreneur, types of entrepreneur, concept of entrepreneurship, role of
entrepreneurs in economic development, barriers of entrepreneurship. 4 Hrs.
b. Small Scale Industry: Definition, characteristics, objects, role of SSI in
economic development, advantages of SSI, steps to start as SSI, impact of
liberalization, privatization, globalization on SSI, definition of ancillary and tiny
industry.
4 Hrs.
c. Government and Institutional Support: Nature of support of government,
Objectives and functions of SSI, SIDBI, DIC, single window agency, KIADB,
KSSIDC, KSFC.
4 Hrs.
d. Preparation of Project Report: Meaning of project identification, project
report, contents and formulation, identification of business opportunities,
feasibility studies, types and purpose.
6 Hrs.
2) Management
a. Planning: Forecasting and Decision Making: Nature of Planning, the
foundation of planning, some planning concepts, forecasting, nature of
III Year B. E. (ISE): 2015 –16
1
SDMCET: Syllabus
decision making, management science, tools for decision-making. 5 Hrs.
b. Organizing and staffing: nature of organizing, traditional organizational
theory, technology and modern organization structures, staffing technical
organization, authority and power; delegation, meeting & committees.5 Hrs.
c. Motivating: Motivation, leadership, motivating and leading technical
professionals.
3 Hrs.
d. Controlling: process of control, financial controls, and non-financial controls.
3 Hrs.
e. Achieving Effectiveness as an Engineer: Getting off to the Right Start,
Charting your career, and communicating your ideas, staying technically
competent, Professional Activity.
4 Hrs.
f. Managerial and International Opportunities for Engineers: Management
and the Engineer, International Management.
2 Hrs.
3) Intellectual Property Rights
a. Introduction: Meaning and forms of intellectual property right, Copyright,
Meaning of copyright, content of copy right, ownership and rights, Period of
copyright, assignment and relinquishment of copyright, license, infringement
of copy right, fair use, offenses and penalties.
3 Hrs.
b. Patents: Concept of patent, patentable inventions, procedure for obtaining
patent, rights and obligations of patent holders, infringements and remedies,
offenses and penalties.
5 Hrs.
c. Industrial Designs: Definition of design, procedure for registration, rights
conferred by registration, infringements.
2 Hrs.
d. Trademarks:
2 Hrs.
References:
1) N.V.R. Naidu, T. Krishna Rao, ”Management and Entrepreneurship”,1/e, Ik
International Pvt. Ltd., 2008
2) Lucy C. Morse, Daniel L Babcock, “Managing Engineering and Technology”, 6/e,
PHI learning, 2013.
3) N.K. Acharya, “Text book on Intellectual Property Rights”, 4/e, Asia Law
House, Hyderabad, 2008
4) P.C Tripathi, P N Reddy, “Principles of Management”, 5/e, Tata McGrawHill, 2012.
5) Stephan Robbins,” Management”, 17/e, Pearson Education, PHI, 2003.
11UISC501
Operating Systems
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: Student should identify the concepts, principles and services of
operating system, all fundamentals of operating system abstractions and
III Year B. E. (ISE): 2015 –16
2
SDMCET: Syllabus
demonstrate them, to explain protection and security requirements of operating
systems analyze basic resource management techniques in job and process
scheduling compare different memory management techniques and apply
concurrency and synchronization techniques to write concurrent programs.
Course Outcomes: Upon the completion of the course, the student should be able
to:
CO-1 Apply knowledge of fundamentals of operating system abstractions and
demonstrate them.(POb)
CO-2 Illustrate knowledge of designing Protected and secured operating
systems. (POc)
Prerequisites:
1. Computer organization,
2. The different parts of computer system
3. High level languages such as C.
Contents:
1) Introduction to operating systems & their classification: What is an
operating system, Mainframe systems, Desktop systems, Multiprocessor
system, Distributed system, Clustered system, Real time system, Handheld
system, Feature migration, Computing environments, Operating system
structures: System components, OS Services, System calls, System programs,
System structure, Virtual machines.
6 Hrs.
2) Process, Inter process Communication, Threads & CPU Scheduling :
Process concept, Process scheduling, Operation on processes, Cooperating
processes, Inter process communication. Threads - Overview, Multithreading
models, Threading issues, Pthreads, Java threads. CPU scheduling - Basic
concepts, Scheduling criteria, Scheduling algorithms, Multiple processor
scheduling, Real time scheduling.
8 Hrs.
3) Process Synchronization and handling Deadlocks: The Critical section
problem, Synchronization hardware, Semaphores, Classical problems of
synchronization, Critical regions, monitors. Deadlock - System model, Deadlock
characterization, Methods for handling deadlocks - Deadlock prevention,
deadlock avoidance, Deadlock detection and recovery from deadlock. 10 Hrs.
4) Storage Management :Main memory management - Background, Swapping,
Contiguous allocation, Paging, Segmentation, Segmentation with paging. Virtual
memory - Background, Demand paging, Process creation, Page replacement
algorithms, Allocation of frames, Thrashing. File System interface - File concept,
Access methods, Directory structure, File system mounting, File system
implementation, Directory implementation, Allocation methods, and Free space
III Year B. E. (ISE): 2015 –16
3
SDMCET: Syllabus
management. Mass storage structures – Disk structure, Disk scheduling
methods, Disk management, Swap space management.
17 Hrs.
5) Protection and Security : Goals of protection , Domain of protection, Access
matrix , implementation of access matrix, Revocation of access rights, The
security problem, Authentication, Program threats, System threats, Securing
systems and facilities, Intrusion detection, Cryptography.
6 Hrs.
6) Case Study - Linux operating system : Design principles, Kernel modules,
Process management, Scheduling, Memory management, File systems, Input
and output, Inter-process communication.
5 Hrs.
References:
1) Abraham silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System
Concepts”, 8/e, Jhonwiley& Sons, 2012.
2) Milan Milankovic, “Operating system concepts and design”; 2/e,Mcgrawhill 2008.
3) Harvey M Deital,”Operating systems”,1/e, Addison wesley ,1990.
4) D.M Dhamdhere, “Operating systems - A concept based Approach”, 1/e, Tata
Mcgrawhill ,2002.
11UISC502
Database Management System
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: The main objective of this course is to provide students with the
background to design, implement, and use database management systems.
Course outcome: Upon the completion of the course, the student should be able to:
CO-1 Illustrate the basics of DBMS.(PO->a)
CO-2 Design Entity Relationship Diagrams.(PO->c)
CO-3 Analyze the basics of relational model and Formulate data retrieval queries
in relational algebra.(PO->b)
CO-4 Analyze and Formulate data retrieval queries in Structured Query
Language (SQL).(PO->b)
CO-5 Design a database using the normal forms.(PO->c)
Explain the concepts of Deadlocks, Transaction Processing and
CO-6
Concurrency Control. (PO->a)
Pre-requisites:
1.Discrete Mathematics Structures
2. Some Programming language
III Year B. E. (ISE): 2015 –16
4
SDMCET: Syllabus
Contents:
1) Introduction to Database Systems: Introduction, File System Vs. DBMS,
Advantages of DBMS, Storage of Data in a DBMS, People who work with DBMS.
5 Hrs.
2) Entity Relationship Model: Database Design Entity Type, Attributes, keys,
Relationship types, Roles and Structural Constraints, Weak Entity Types, ER
diagrams and Naming conventions, ER diagrams examples.
6 Hrs.
3) Relational Model and Relational Algebra: Relational Model Concepts;
Relational Model Constraints and Relational Database Schemas; Update
Operations and Dealing with Constraint Violations; 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; Relational Database Design Using.
12 Hrs.
4) SQL Structured Query Language: Definition and Data types, Basic Queries,
Complex Queries,
12 Hrs.
5) 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;
11 Hrs.
6) Transaction Management: ACID properties, schedule locking crash recovery, 2
phase locking, deadlocks, ARIES, LOG, WAL protocol, check pointing recovery
and concurrency control.
6 Hrs.
Beyond the Syllabus Coverage(Suggestive):
1. Seminar
2. Case Study
References:
1) Raghu Ramakrishnan and Johannes Gehrke,“Database Management
Systems”,3/e, McGraw-Hill, 2008
2) Elmasri and Navathe: “Fundamentals of Database Systems”,6/e, Pearson
Education, 2011.
3) Silberschatz, Korth and Sudharshan, “Data Base System Concepts”, 5/e, McGrawHill, 2006.
4) C.J.Date, A. Kannan, S. Swamynatham, “An Introduction to Database Systems”
,8/e, Pearson Education, 2006.
III Year B. E. (ISE): 2015 –16
5
SDMCET: Syllabus
11UISC503
Web Technology
(4-0-0-0) 4 : 52Hrs.
Course Objectives: Student should understand the Object Oriented Principles, able
to program Java classes and methods using a subset of data types and using
assignment, method calls, while loops, for loops, and conditionals and
experiencing the importance of Object Oriented 4G languages like Java &PHP in
developing complex software systems.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Illustrate the use of Core Java,J2EE and PHP concepts. (POa)
CO-2 Develop Object Oriented and platform independent web applications.
(POc)
Pre-requisites:
1. Object -Oriented Programming
2. Basic programming skills
Contents:
1) Introduction to Java : Java and Java applications; Java Development Kit (JDK);
Java is interpreted, Byte Code, JVM; Object-oriented programming; Simple Java
programs. Data types and other tokens: Boolean variables, int, long, char,
operators, arrays, whitespaces, literals, assigning values; Creating and
destroying objects; Access specifiers. Operators and Expressions: Arithmetic
Operators, Bitwise operators, Relational operators, The Assignment Operator,
The ? Operator; Operator Precedence; Logical expression; Typecasting; Strings.
Control Statements: Selection statements, iteration statements, Jump
Statements.
8 Hrs.
2) Classes, Inheritance, Exceptions : Classes: Classes in Java; Declaring a class;
Class name; Super classes; Constructors; Creating instances of class; Inner
classes. Inheritance: Simple, multiple, and multilevel inheritance; Overriding,
overloading. Exception handling in Java: Exception Handling-Exception Types,
Uncaught Exceptions, Try and catch, Multiple catch Clauses, Nested try
Statements, Exception sub Classes, Packages and Interfaces: Packages,
Interfaces.
10 Hrs.
3) Multi Threaded Programming :Multi Threaded Programming: What are
threads? How to make the classes threadable; Extending threads; Implementing
runnable; Thread priority; Thread exception; Synchronization;
6 Hrs.
4) HTML and Applets : The Applet Class: Two types of Applets; Applet basics;
Applet Architecture; An Applet skeleton; Simple Applet display methods;
Requesting repainting; Using the Status Window;The HTML APPLET tag;
III Year B. E. (ISE): 2015 –16
6
SDMCET: Syllabus
Passing parameters to Applets; getDocumentbase() and getCodebase();
ApletContext and showDocument(); The AudioClip Interface; The AppletStub
Interface; Output to the Console.
8 Hrs.
Web Technology/ Web Programming:
5) MySQL and 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; Metadata,.
6 Hrs.
6) Servlets : Background; The Life Cycle of a Servlet; Using Tomcat for Servlet
Development; 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.
6 Hrs.
7) PHP :PHP Introduction, Embedding PHP into HTML, Configuration, Quick
Examples, Language Syntax, Built-In PHP Functions, PHP and MySQL,Project.
8 Hrs.
References:
1) Herbert Schildt, “Java The Complete Reference”, 7/e ,Tata McGraw Hill 2012.
2) Jim Keogh, “J2EE The Complete Reference”, 7/e, Edition Tata McGraw Hill,
2012.
3) James Lee and Brent Ware, “Open Source Web Development with LAMP- Using
Linux,Apache, MySQL, Perl and PHP”, 5/e, Addison – Wesley/Person Education
2010
4) Robert W.Sebesta, “Programming the World Wide Web”, 4/e, Pearson Education,
2012
11UISL504
Database Management System Lab
(0-0-2-0) 1
Course Objectives: The major objective of this lab is to provide a strong formal
foundation in database concepts, technology and practice to the participants ,to
groom them into well-informed database application developers. Rather than
imparting isolated knowledge/experience fragments in each of concepts,
technology and practice, the course will aim at achieving a good blend of the
three. The overriding concern, therefore, is to include just enough concepts and
theory to motivate and enrich the practical component, and to include technology
component to maximize the relevance of the course to the industry without
sacrificing the long-term objectives of rigor and foundational strength that can
withstand the vagaries of technological advance.
Course outcome: Upon the completion of the course, the student should be able to :
III Year B. E. (ISE): 2015 –16
7
SDMCET: Syllabus
CO-1 Design and implement a database schema for a given problemdomain.(PO->c)
CO-2 Analyze the given database and apply the normalization.(PO->c)
CO-3 Demonstrate SQL DML/DDL commands.(PO->b)
CO-4 Use PL/SQL for writing stored procedures, stored functions, cursors,
packages.(PO->b)
CO-5 Design and build a GUI using a GUI building tool.(PO->e)
CO-6 Develop solutions for real life problems by working in teams.(PO->i)
Pre-requisites:
1.Some programming language
2. Logical reasoning
Contents:
PART-A
 Analyze the given data and implement the following,
 Create the database design
 Create ER models and tables
 Create constraints/ inserting the records
 Write queries in SQL using DDL,DML commands
 Write
queries
using
aggregate
functions,groupby,having
clause/union,intersect,minus
 Subqueries returning single/multiple rows
 Co-related sub queries
 Joins,
 views
PART-B
 Design and implement a real-world database application in the form of a project
References:
1) Raghu Ramakrishnan and Johannes Gehrke,“Database Management
Systems”,3/e, McGraw-Hill, 2011
2) Elmasri and Navathe: “Fundamentals of Database Systems”,4/e, Pearson
Education, 2008.
3) Silberschatz, Korth and Sudharshan, “Data Base System Concepts”, 5/e, McGrawHill, 2008.
4) C.J.Date, A. Kannan, S. Swamynatham, “An Introduction to Database
Systems”8/e, Pearson Education, 2006.
III Year B. E. (ISE): 2015 –16
8
SDMCET: Syllabus
11UISL505
Web Technology Lab
(0-0-2-0) 1
Course Objectives: Student should understand the Object Oriented Principles, able
to program Java classes and methods using a subset of data types and using
assignment, method calls, while loops, for loops, and conditionals and
experiencing the importance of Object Oriented 4G languages like Java &PHP in
developing complex software systems.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Apply the use of Core Java,J2EE and PHP concepts (PO b)
CO-2 Develop Object Oriented and platform independent web applications
(POc)
Pre-requisites:
1.Object -Oriented Programming
2. Basic programming skills.
Contents:
1) Programs on Classes, Inheritance, Exceptions:
2) Programs on Multi Threaded Programming
3) Programs on Html and Applets
4) Programs on MySQL and JDBC
5) Programs on Servlets
6) Programs on PHP
References:
1) Herbert Schildt: “Java The Complete Reference”, 7/e ,Tata McGraw Hill 2012.
2) Jim Keogh: “J2EE The Complete Reference”, 7/e Edition Tata McGraw Hill, 2012.
3) James Lee and Brent Ware “Open Source Web Development with LAMP- Using
Linux, Apache, MySQL, Perl and PHP” 5/e Addison – Wesley/Person Education
2010
4) Robert W.Sebesta “Programming the World Wide Web”, 4/e edition, Pearson
Education,
11UISE520
Advanced Data Structures & Algorithms
(4-0-0-0) 4 : 52Hrs.
Course Objectives: Students should understand mathematical skills for algorithm
design, analysis, evaluation and computational cost; and also identify the skills to
design and implement efficient programming solutions to various problems;
develop application knowledge of dynamic programming, graphs, hash tables,
sorting, and searching and tree structures.
III Year B. E. (ISE): 2015 –16
9
SDMCET: Syllabus
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Analyze algorithms and determine algorithm correctness and compare the
time efficiency.(PO-> b)
CO-2 Apply algorithm design techniques and advanced data structures to solve
problems. (PO->b)
Pre-requisites:
1. Data Structure
2. Discrete Mathematical and Graphical Structures
Contents:
1) Binary Search Trees: Definition, Insertion, Deletion
4 Hrs.
2) Hash Tables: Hash functions, Open Addressing, Perfect Hashing
6 Hrs.
3) B-Trees: Introduction, Definition, Basic Operations, Deleting a key from B-tree
6 Hrs.
4) Binomial Heaps: Binomial trees and binomial heaps, operations on binomial
heaps.
5 Hrs.
5) Fibonacci Heaps: Structure of Fibonacci heaps, Mergeable – heap operations,
Decreasing a key and deleting a node, Bounding the maximum degree.7 Hrs.
6) Data Structures for Disjoint Sets: Disjoint Set Operations, Linked list
representation of disjoint sets, Disjoint-set forests, Analysis of union by rank with
path compression.
4 Hrs.
7) Graph Algorithms: Maximum Flow: Flow Networks, The Ford-Fulkerson
method.
6 Hrs.
8) Sorting Networks: Comparison Networks, The zero-one principle, Abitonic
sorting network, A merging network, A sorting network
7 Hrs.
9) String Matching: The naïve string matching algorithm, The Rabin –Karp
algorithm, String matching with finite automata, The Knuth-Morris-Pratt
algorithm.
7 Hrs.
Beyond the Syllabus Coverage(Suggestive):
1. Case study
References:
1) Cormen T.H et al, “Introduction to Algorithms”, 2/e, PHI, 2001.
2) S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, “Algorithms”,3/e,McgrawHill, 2006
3) J. Kleinberg and E. Tardos,” Algorithm Design”, 2/e, Addison-Wesley, 2006.
III Year B. E. (ISE): 2015 –16
10
SDMCET: Syllabus
11UISE521
Multimedia communication
(4-0-0-0) 4 : 52Hrs.
Course Objectives: student should understand the Multimedia Communication
Models, study the Multimedia Transport in Wireless Networks also they are able
to solve the Security issues in multimedia networks, explore real-time multimedia
network applications.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Discuss the appropriate multimedia communication models.(PO->a)
Apply QoS to multimedia network applications with efficient routing
CO-2
techniques (PO->b)
CO-3 Solve the security threats in the multimedia networks. (PO->b)
CO-4 Discuss the real-time multimedia network applications.(PO->a)
Prerequisites
1. Data Communication
Contents:
1) Introduction to Multimedia Communications: Introduction, Human
communication model, Evolution and convergence, Technology framework,
Standardization framework.
10 Hrs.
2) Framework for Multimedia Standardization: Introduction, Standardization
activities, Standards to build a new global information infrastructure,
Standardization processes on multimedia communications, ITU-T mediacom2004
frame work for multimedia, ISO/IEC MPEG-21 multimedia framework, IETF
multimedia Internet standards.
10 Hrs.
3) Application Layer: Introduction, ITU applications, MPEG applications,
Mobileservers and applications, Universal multimedia access.
10 Hrs.
4) Middleware Layer: Introduction to middleware for multimedia, Media coding,
Media Streaming, and Infrastructure for multimedia content distribution.
10 Hrs.
5) Network Layer: Introduction, QoS in Network Multimedia Systems. 12 Hrs.
References:
1) K.R. Rao, Zoran S. Bojkovic, Dragorad A. Milovanovic, ”Introduction to
Multimedia Communications – Applications, Middleware, Networking”, 2/e, Wiley
India, 2006.
2) Fred Halsall, “Multimedia Communications – Applications, Networks, protocols,
and Standards”, 2/e, Pearson, 2001.
3) Nalin K Sharad, “Multimedia information Networking”, 1/e,PHI, 2002.
III Year B. E. (ISE): 2015 –16
11
SDMCET: Syllabus
11UISE522
CYBER LAW AND ETHICS
(4-0-0-0) 4 : 52Hrs.
Course Objectives: This course is designed to educate students in the foundations
of cyber law ethical practices and to guide them in exploring topics of current
concern to law enforcement, government, and business. This course covers
issues, practices, and controversies in the emerging field of cyber law ethical
practices and recent court cases interpreting uses of emerging and converging
technologies to fight cybercrime.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Discuss application of proposed legislation to solve legal problems with
information systems.(POh)
CO-2 Describe methods for avoiding legal liability in with computer systems
internally and externally.(POh)
CO-3 Illustrate legal standards to compliance standards.(POh)
CO-4 Review the problems and propose solutions to system security deficiencies
that comply with appropriate federal and state laws and
regulations .(POh)
Contents:
1) Computer ethics and philosophical ethics: Vacuum of policies, conceptual
muddles, social context, moral and legal issues, uniqueness of ethical issues,
role of analogy, descriptive and normative claims, ethical relativism,
utilitarianism, other theories. Professional Ethics: Characteristics, the system of
professions, computing as a profession, professional relationships,
responsibilities, code of ethics and professional conduct. Privacy: Computers
and privacy issue, reframing this issue, legislative background, better privacy
protection.
12Hrs.
2) Intellectual property issues in cyberspace: Introduction to intellectual property
Protections via Copyright, Trade Secrets, Trademarks, Patents, Contracting to
protect intellectual property.
10Hrs.
3) Protection options –Encryption, copyright on web-content, copyright on
software. Ethical Decision Making: Types of ethical choices, Making defensible
decisions, Ethical dilemmas, law and ethics, Guidelines for dilemma (Informal
and Formal), Four-step analysis process of solving dilemma Case studies: i) A
stolen password ii) Recovery of data leads to Discovery of confidential files iii)
Do copyright ethics change overseas?
10Hrs.
4) Crime incident Handling Basics: Hacking, cyber activism, Tracking hackers,
clues to cyber crime, privacy act, search warrants, common terms, organizational
roles, procedure for responding to incidents, reporting procedures, legal
III Year B. E. (ISE): 2015 –16
12
SDMCET: Syllabus
considerations, Information Technology Act 2000:Scope, jurisdiction, offense and
contraventions, powers of police, adjudication.
10 Hrs
5) Cyber Forensics: Cyber forensics, cyber crime examples, forensics casework,
investigative incident response actions, computer forensics tools, Threats in
cyberspaces, Blended attacks Sample Policy Documents: i) Antivirus Guidelines
Policy ii) Internal Lab Security Policy iii) Server Security Policy iv) Wireless
Communications Policy. Information Security Certifications, CISSP and SSCP,
CISA and CISM, SCP, GIAC, certification weaknesses, Role of these certified
professionals, Windows Server 2003 Security Fundamentals.
10 Hrs.
References:
1) Deborah G Johnson, “ Computer Ethics”, 4/e, Pearson Education Publication,
2008
2) Earnest A. Kallman, J.P Grillo, “Ethical Decision making and IT: An Introduction
with Cases”, 3/e, McGraw Hill Publication, 2008
3) John W. Rittinghouse, William M. Hancock, “Cyber security Operations
Handbook”,3/e, ElsevierPublications, 2003
4) Michael E. Whitman, Herbert J. Mattord, “Principles of Information Security”,
2/e, Cengage Learning Publications, 2012
5) Randy Weaver, Dawn Weaver, “Network Infrastructure Security”, 2/e, Cengage
Learning Publications, 2006
11UISE523
SYSTEM SOFTWARE
(4-0-0-0) 4 : 52Hrs.
Course Objectives: To view some of the major tasks of the system software of a
computer system, focusing on internal working of the hardware and software
interface of a typical system.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the features of hypothetical machine and various system
software.(POa)
CO-2 Analyze different system software for machine dependent and independent
features. (POb)
CO-3 Illustrate the structure of a Text Editor.(POb)
Pre-requisites:
1. Basic programming knowledge in C/C++.
2. Computer Science concepts: e.g. operating systems,
structures, memory structures, processes and threads.
III Year B. E. (ISE): 2015 –16
file
and
13
I/O
SDMCET: Syllabus
Contents:
1) Machine Architecture: Introduction, System Software and Machine Architecture,
Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE
Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines,
RISC Machines.
6 Hrs.
2) Assemblers : Basic Assembler Function - A Simple SIC Assembler, Assembler
Algorithm and Data Structures, Machine Dependent Assembler Features Instruction Formats & Addressing Modes, Program Relocation, Machine
Independent Assembler Features – Literals, Symbol-Definition Statements,
Expression, Program Blocks, Control Sections and Programming Linking,
Assembler Design Operations - One-Pass Assembler, Multi-Pass Assembler,
Implementation Examples.
14 Hrs.
3) Loaders And Linkers : Basic Loader Functions - Design of an Absolute Loader,
A Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation,
Program Linking, Algorithm and Data Structures for a Linking Loader, MachineIndependent Loader Features - Automatic Library Search, Loader Options,
Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders,
Implementation Examples.
10 Hrs.
4) Macro Processor: Basic Macro Processor Functions - Macro Definitions and
Expansion, Macro Processor Algorithm and Data Structures, MachineIndependent Macro Processor Features - Concatenation of Macro Parameters,
Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro
Parameters.
8 Hrs.
5) Text editors: Overview of the Editing Process - User Interface – Editor Structure.
Interactive debugging systems - Debugging functions and capabilities
Relationship with other parts of the system – User-Interface Criteria. 14 Hrs.
References:
1) Leland.L.Beck, “System Software”, 3/e, Addison-Wesley, 2011.
2) D.M.Dhamdhere, “System Programming and Operating Systems”, 2/e, TMH,
2010.
3) John.R.Levine,Tony Mason and Doug Brown, “Lex and Yacc”, 2/e, O'Reilly, SPD,
2002.
11UISE524
Embedded Systems
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: At the end of the course, student should understand the basics,
describe what makes a system a real-time system, explain the presence of and
describe the characteristics of latency in real-time systems, summarize special
concerns that real-time systems present and how these concerns are addressed.
III Year B. E. (ISE): 2015 –16
14
SDMCET: Syllabus
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe various features of Embedded systems, their applications and
design considerations. (POa)
CO-2 Demonstrate the skills in embedded C programming for problem solving.
(PO b)
CO-3 Describe features of Real Time Operating Systems. (PO->a)
Pre-requisites:
1. Digital Electronics, Study of microprocessors with assembly language
programming,
2. Programming skills in C, Operating Systems, Microcontrollers 8051
Contents:
1) Introduction To The Embedded Systems: An embedded system, Processor
embedded into a system, Embedded hardware units and devices in a system,
Embedded software in a system, Examples of embedded systems, Embedded
system-on-chip (soc) and use of VLSI circuits design technology, Complex
systems design and processors, Design process in embedded system,
Formalism of system design, Design process and design examples, Classification
of embedded systems, Skills required for an embedded system designer. Over
view of 8051 microcontrollers.
8 Hrs.
2) Devices and Communication Buses for Devices Network I/O Types and
Examples, Serial Communication Devices , Parallel Port Devices , Sophisticated
Interfacing Features in Device Ports, Wireless Communication Devices, Timer
and Counting Devices , Watchdog Timers , Real Time Clocks, Networking of
Embedded Systems, Serial Bus Protocols, Internet Enabled Systems Network
Protocols, Parallel bus device protocols parallel communication network using the
isa, pci, pci-x and advanced buses, Wireless and Mobile System Protocols.8 Hrs.
3) Device Drivers And Interrupts Servicing Mechanism Port or device access
without interrupt servicing mechanism, Interrupt service routine, Thread and
device driver concept, Interrupt sources, Interrupt servicing (handling)
mechanism, Multiple interrupts, Context and the periods for context switching,
interrupt latency and deadline, Classification of processors interrupt service
mechanism from context saving angle
8Hrs
4) Direct memory access. Device driver programming, Parallel port device drivers
in a system. Serial port device drivers in a system, Timer devices and devices
interrupts, Context and the periods for context switching, interrupt latency and
deadline, Classification of processors interrupt service mechanism from context
saving angle, Direct memory access, Device driver programming,Parallel port
device drivers in a system, Serial port device drivers in a system, Timer devices
and devices interrupts.
8 Hrs.
III Year B. E. (ISE): 2015 –16
15
SDMCET: Syllabus
5) Programming Concepts and Embedded Programming in C, C++ and Java:
Software programming in assembly language (alp) and in high level language 'C',
'C' program elements: header and source files and preprocessor directives,
Program elements: macros and functions, Program elements: data types, data
structures, modifiers, statements, loops and pointers. Object oriented
programming, embedded programming in C++, Embedded programming in java,
Optimization of memory needs.
8 Hrs.
6) Program Modeling Concepts Program models, Data flow graph models,
State machine programming models for event controlled programs, Modelling of
multiprocessor systems, UML modeling.
4 Hrs.
7) Real Time Operating Systems: Introduction to Real Time Operating System,
Basic Design Using a Real Time Operating System, RTOS Task Scheduling
Models, Latency, Response Times, Deadline as Performance Metric, Latency
and Deadlines as Performance Metric in Scheduling Models For Periodic,
Sporadic and A periodic Tasks, CPU Load as Performance Metric, Sporadic Task
Model Performance Metric. OS SECURITY ISSUES, IEEE Standard POSIX
1003.1b Functions for Standardization of RTOS and Inter Process
Communication Functions.
6 Hrs.
8) RTOS Programming MicroC/OS-II and VxWorks, Types of real time operating
systems, RTOS C/OS-II, RTOS VxWorks.
2 Hrs.
References:
1) Raj Kamal, “Embedded Systems: Architecture, Programming, and Design”, 2/e.
TMH, 2010.
2) John Wikey& Sons Bank Vahid “Embedded System Design, A certified Hardware
/ Software Introduction”,3/e, Pearson edition ,2009.
3) David E Simon, “An embedded Software Primer”, 4/e, Pearson edition, 2007.
11UISE525
Android Mobile Application
(4-0-0-0) 4 : 52 Hrs.
Course Objectives:The student should understand the basics of, Android Operating
system.Alsostudent should develop android applications using Android SDK and
Java API‟s.Releasing the Android Apps in Google Play market.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the architecture and components of Android operating
system.(POa)
CO-2 Use the Android software development tools, frameworks, and
documentation for the application development. (POe)
CO-3 Apply best-practice software design principles to the creation of Android
III Year B. E. (ISE): 2015 –16
16
SDMCET: Syllabus
applications.(POb)
CO-4 Apply various techniques for testing the android applications.(PO b)
Pre-requisites:
1. Java Programming
2. Exposure to use of Smart phones/devices.
Contents:
1) Introduction to Android: Introduction to Android Architecture: Introduction,
History, Features and Android Architecture. Android Application Environment,
SDK, Tools: Application Environment and Tools, Android SDK. Programming
paradigms and Application Components - Part 1: Application Components,
Activity, Manifest File, Programming paradigms and Application Components Part
2: Intents, Content providers, Broadcast receivers, Services.
8 Hrs.
2) UserInterface Design :User Interface Design part 1: Views &View Groups,
Views : Button, Text Field, Radio Button, Toggle Button, Checkbox, Spinner,
Image View, Image switcher, Event Handling, Listeners, Layouts : Linear,
Relative, List View, Grid View, Table View, Web View, Adapters. User Interface
Design part 2: Menus, Action Bars, Notifications : Status, Toasts and Dialogs,
Styles and Themes, Creating Custom Widgets, Focus, Touch Mode, Screen
Orientation. Designing for Tablets – Working with tablets: Developing for the
Honeycomb and Ice Cream Sandwich platforms, Manipulating objects with drag
and drop, Optimizing applications for high screen resolution, combining
fragments into a multilane UI. Resources, Assets, Localization: Resources and
Assets, Creating Resources, Managing application resources and assets,
Resource-Switching in Android. Localization, Localization Strategies, Testing
Localized Applications, Publishing Localized Applications
12 Hrs.
3) Data : Content Providers: Contents provider, Uri, CRUD access, Browser,
CallLog, Contacts, Media Store, and Setting. Data Access and Storage: Shared
Preferences, Storage External, Network Connection. SQLite - SQLite Databases
12 Hrs.
4) Native Capabilities : Camera, Audio, Sensors and Bluetooth: Android Media
API: Playing audio/video, Media recording. Sensors - how sensors work, listening
to sensor readings. Bluetooth. Maps & Location: Android Communications: GPS,
Working with Location Manager, Working with Google Maps extensions, Maps
via intent and Map Activity, Location based Services. Location Updates, locationbased services (LBS), Location Providers, Selecting a Location Provider, Finding
Your Location, Map - Based Activities, How to load maps, To finding map API
key.
13 Hrs.
5) Testing : Testing: Testing and Commercializing Applications - Basics of Testing,
Testing from an IDE (Eclipse), Activity testing, Service testing, Content provider
testing, Test Classes, Debugging using DDMS, How to get your app on the app
III Year B. E. (ISE): 2015 –16
17
SDMCET: Syllabus
store.
7 Hrs.
References:
1) Reto Meier, John Wiley and Sons „Professional Android 4 Development‟,3/e,
2012
2) W. Frank Ableson, RobiSen, Chris King,C.„Enrique Ortiz Android in Action‟, 3/e,
2012
3) Wei-Meng Lee, John Wiley and Sons „Android Application Development
Cookbook‟, 2013
4) Grant Allen „Beginning Android 4‟, Apress, 2011
11UISC600
VI Semester
Unix System Programming
(3-0-0-0) 3 : 42 Hrs.
Course Objectives: In this course, students will learn to develop complex systemlevel software in the C programming language while gaining an intimate
understanding of the UNIX operating system and its programming environment,
topics covered will include the user/kernel interface, fundamental concepts of
UNIX, user authentication, basic and advanced I/O, file systems, signals, process
relationships, and inter-process communication. Fundamental concepts of
software development and maintenance on UNIX systems.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the role of systems programming and standardization.(PO->a)
CO-2 Demonstrate the use of Unix system calls.(PO->b)
CO-3 Describe how UNIX supports -Unix file system, Process, process
control.(PO->a)
CO-4 Illustrate Unix Signals and Daemon Processes.(PO->b)
Pre-requisites:
1. This course requires programming in C/C++.
2. Operating system fundamentals and UNIX shell commands.
Contents:
1) Introduction: UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO
C++ Standards, Difference between ANSI C and C++, The POSIX Standards,
The POSIX.1 FIPS Standard, The X/Open Standards. UNIX and POSIX APIs:
The POSIX APIs, The UNIX and POSIX Development Environment, API
Common Characteristics.
6 Hrs.
2) UNIX Files: File Types, The UNIX and POSIX File System, The UNIX and POSIX
III Year B. E. (ISE): 2015 –16
18
SDMCET: Syllabus
File Attributes, Inodes in UNIX System V, Application Program Interface to Files,
UNIX Kernel Support for Files, Relationship of C Stream Pointers and File
Descriptors, Directory Files, Hard and Symbolic Links.UNIX File APIs: General
File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO
File APIs, Symbolic Link File APIs.
12 Hrs.
3) UNIX Processes : The Environment of a UNIX Process: Introduction, main
function, Process Termination, Command-Line Arguments, Environment List,
Memory Layout of a C Program, Shared Libraries, Memory Allocation,
Environment
Variables,
setjmp
and
longjmp
Functions,
getrlimit,
setrlimitFunctions, UNIX Kernel Support for Processes.
6 Hrs.
4) Process Control: Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid,
wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and
Group IDs, Interpreter Files, system Function, Process Accounting, User
Identification, Process Times. Process Relationships: Introduction, Terminal
Logins, Network Logins, Process Groups, Sessions, Controlling Terminal,
tcgetpgrp and tcsetpgrp Functions, Job Control, Orphaned Process Groups.
10 Hrs.
5) Signals and Daemon Processes : Signals: The UNIX Kernel Support for
Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid
Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers,
POSIX.lb Timers. Daemon Processes: Introduction, Daemon Characteristics,
Coding Rules, Error Logging, Client-Server Model.
8 Hrs.
Beyond the Syllabus Coverage:
1. Linux command implementation / Demonstrator of open source software from
students
References:
1) W. Richard Stevens, Stephen A. Rago,” Advanced Programming in the UNIX
Environment”, 2/e,Addison-Wesley, 2005.
2) Terrence Chan,” Unix System Programming Using C++”, Prentice Hall India,
1999.
3) Maurice.J.Bach,” The Design of the UNIX Operating System”, Prentice Hall of
India,1988.
4) UreshVahalia,” Unix Internals”, Pearson Education,2001.
III Year B. E. (ISE): 2015 –16
19
SDMCET: Syllabus
11UISC601
Computer Networks
(4-0-0-0) 4 : 52 Hrs.
Course Objectives:The course is designed to expose the students to build an
understanding of the fundamental concepts of computer networking. The course
focuses on to Familiarize the student with the basic taxonomy and terminology of
the computer networking area. It also introduces the student to advanced
networking concepts, preparing the student for entry Advanced courses in
computer networking.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe various network layer protocols. (PO-> a)
CO-2 Apply the concept of IP address for a given networking scenario. (PO->b)
CO-3 Apply routing algorithms for a given network. (PO->b)
CO-4 Illustrate the various applications of Transport layer. (PO-> b)
CO-5 Illustrate the importance of application layer and its components.(PO->b)
Pre-requisites:
1. Data Communication
Contents:
1) Network Layer: Introduction: Logical Addressing: IPV4 address,IPv6 Address,
Internet Protocols: Internetworking, IPv4, IPV6,
8 Hrs.
2) Network layer: Address Mapping: Address Mapping, ICMP, IGMP, and
ICMPv6.
6 Hrs.
3) Network Layer: Routing: Delivery, forwarding, Unicast routing Protocols, Multi
cast routing protocols
6 Hrs.
4) Transport Layer: Congestion Control and QOS: Process –to –process
delivery, UDP, TCP, SCTP.
6 Hrs.
5) Transport Layer: Congestion Control and QOS: Data Traffic, Congestion,
Congestion Control, Congestion Control in TCP, Quality of Service, and
Techniques of improve QOS, Integrated Services and Differentiated Services.
7 Hrs.
6) Application Layer: HTTP, FTP, SMTP and DNS: Principles of Application-Layer
Protocols, The World Wide Web: HTTP, File Transfer: FTP Electronic Mail in the
Internet, The Internet's Directory Service: DNS
7 Hrs.
7) Network Management: SNMP: Network management system, SNMP 5 Hrs.
8) Security: Cryptography: Introduction, Symmetric key cryptography, Asymmetric
key cryptography
7 Hrs.
III Year B. E. (ISE): 2015 –16
20
SDMCET: Syllabus
Beyond the Syllabus Coverage (Suggestive):
1. NS2 Simulation of different network protocols
References:
1) BehrouzForouzan, “Data Communications and Networking”, 4/e, McGraw
Hill,2006
2) Fred Halsall ,”Computer Networking and the Internet” 5/e, Addison Wesley,2005
3) Andrew Tanenbaum ,”Computer Networks” ,4/e, Prentice Hall, 2006
4) BehrouzForouzan ,”TCP/IP Protocol Suite”, 3/e, McGraw Hill, 2005
11UISC602
Software Engineering
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: Student should understand the need for a process of software
development, complexity of system development, types of systems and quality
requirements, analysis of any problem domain and formulation of requirements
and assessment of quality, contemporary modeling, designing, development and
validation techniques. software project management issues like cost estimation,
resource requirements and project scheduling and tracking
Course Outcomes: Upon the completion of the course,the student should be able
to :
CO-1 Design systems, components and processes required to meet desired
needs(POc)
CO-2 Solve real life problems in various domains and develop domain
expertise.(POb)
CO-3 Use the engineering techniques of software system development, industry
relevant tools for system analysis, design, development and testing.(PO
e)
Prerequisites:
1. Basics of Computer programming.
2. Any Computer Programming Language.
Contents:
1) Introduction: The Software Engineering Discipline-Evaluation and Impact,
Programs vs. Software Products, Why study of Software Engineering?
Emergence of Software Engineering, Notable Changes In software
Development Practice, Computer System Engineering. Software Life Cycle:
Why Use a life Cycle Model? Classical Waterfall Model, Iterative Waterfall
III Year B. E. (ISE): 2015 –16
21
SDMCET: Syllabus
2)
3)
4)
5)
6)
7)
8)
9)
Model, Prototype Model, Evolutionary Model, Spiral Model, Compression of
Different Life Cycle Models.
9 Hrs.
Software Project Management: Responsibilities of Software Project
Manager, Project Planning, Metrics For Project Size Estimation, Project
Estimation Techniques, Empirical Estimation Techniques, COCOMO- A
Heuristic Estimation Techniques, Halstead‟s Software Science-An Analytical
Technique, Staffing Level Estimation, Scheduling, Organization And Team
Structure, Staffing, Risk Management, Software Configuration Management,
Miscellaneous Plans.
6 Hrs.
Requirements Analysis and Specification: Requirements Gathering and
Analysis, Software Requirement Specification (SRS), Formal System
Development Techniques, Axiomatic Specification, Algebraic Specification.
7Hrs.
Software Design: What is good software design, Cohession and coupling,
Next arrangement, Software design approaches, Object oriented vs function
oriented design.
5 Hrs.
Function-Oriented Software Design: Overview of SA/SD Methodology,
Structured analysis, Data flow diagram, Extending DFD technique to real life
systems, Structured design, detailed design, Design review.
5 Hrs.
Object Modeling Using UML: Overview of object-oriented concepts, Unified
modeling language (UML), UML diagram, Use case model, Class diagram,
Interaction diagram, Activity diagram, State chart diagram. Object-Oriented
Software Development: Design patterns, A generalized object-oriented
analysis and design, Examples, OOD goodness criteria.
6 Hrs.
Coding and Testing: Coding, Code review, Testing, Testing in the large vs
testing in the small, Unit testing, Black-box testing, Debugging, Program
analysis tools, Integration testing, System testing, Some general issues
associated with testing.
5 Hrs.
Software Reliability and Quality Management: Software reliability,
Statistical testing, Software quality management system, ISO 9000, SEI
capability maturity model, Personal software process (PSP), Six sigma.
Computer Aided Software Engineering: Case and its scope, Case
environment, Case support in software life cycle, Other characteristics of
case tools, Towards second generation case tool, Architecture of a case
environment.
5 Hrs.
Software Maintenance: Characteristics of software maintenance, Software
reverse engineering, Software maintenance processes model, Estimation
maintenance cost. Software Reuse: What can be rescued?, Why almost no
reuse so far, Basics issues in any reuse program, A reuse approach, Reuse
at organization level.
4 Hrs.
III Year B. E. (ISE): 2015 –16
22
SDMCET: Syllabus
References:
1) Rajib Mall, “Fundamentals of software engineering” ,2/e,PHI publication,2013
2) JalotePankaj, “An integrated approach to Software Engineering” , 2/e, Narosa
2005
3) Pressman R, “Software Engineering. Practioner Approach” ,3/e,TMH, 2010
4) Jacobson I,”Object Oriented Software Engineering”, 2/e,Addison Wesley,
2005
11UISC603
Object Oriented Modeling and Design
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: Object oriented modeling and design is a core theory course at
undergraduate VI semester level. Basic knowledge of Object-oriented paradigm
concepts: Need, Definitions, Advantages and Disadvantages. Design Notations,
Principles: Fundamental concepts of the Object Model and mastery of the
notations and process of object-oriented analysis and design: Modeling class,
Associations, State, Interactions. Applications of Design concepts: Realistic
application of object-oriented development within a variety of problem domains
using OO principles and standards like modeling techniques.
Course outcomes: Upon the completion of the course, the student should be able
to :
CO-1 Design various class models using notations of object oriented
concepts.(PO->c)
CO-2 Analyze concepts of object-oriented development using case studies.
(PO->b)
CO-3 Solve real-life problems based on Design principles. (PO->b)
Prerequisites:
1. Exposure to basics of object oriented Programming Terminologies
2. Exposure to modern programming language
Contents:
1) Introduction, Modeling Concepts, class Modeling: What is Object
Orientation? What is OO development? OO themes; Evidence for usefulness of
OO development; OO modeling history. Modeling as Design Technique:
Modeling; abstraction; The three models. Class Modeling: Object and class
concepts; Link and associations concepts; Generalization and inheritance; A
sample class model; Navigation of class models; Practical tips.
10Hrs.
2) Advanced Class Modeling, State Modeling: Advanced object and class
III Year B. E. (ISE): 2015 –16
23
SDMCET: Syllabus
concepts; Association ends; N-ary associations; Aggregation; Abstract classes;
Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages;
Practical tips. State Modeling: Events, States, Transitions and Conditions; State
diagrams; State diagram behavior; Practical tips.
10 Hrs.
3) Advanced State Modeling, Interaction Modeling: Advanced State Modeling:
Nested state diagrams; Nested states; Signal generalization; Concurrency; A
sample state model; Relation of class and state models; Practical tips.
Interaction Modeling: Use case models; Sequence models; Activity models. Use
case relationships; Procedural sequence models; Special constructs for activity
models.
10 Hrs.
4) Process Overview, System Conception, Domain Analysis: Process
Overview: Development stages; Development life cycle. System Conception:
Devising a system concept; Elaborating a concept; Preparing a problem
statement Domain Analysis: Overview of analysis; Domain class model; Domain
state model; Domain interaction model; Iterating the analysis.
6 Hrs.
5) Application Analysis, System Design: Application Analysis: Application
interaction model; Application class model; Application state model; Adding
operations. Overview of system design; Estimating performance; Making a reuse
plan; Breaking a system in to sub-systems; Identifying concurrency; Allocation of
sub-systems; Management of data storage; Handling global resources; Choosing
a software control strategy; Handling boundary conditions; Setting the trade-off
priorities; Common architectural styles; Architecture of the ATM system as the
example.
8Hrs.
6) Class Design, Implementation Modeling, Legacy Systems: Class Design:
Overview of class design; Bridging the gap; Realizing use cases; Designing
algorithms; Recursion downwards, Refactoring; Design optimization; Reification
of behavior; Adjustment of inheritance; Organizing a class design; ATM example.
Implementation Modeling: Overview of implementation; Fine-tuning classes;
Fine-tuning generalizations; Realizing associations; Testing. Legacy Systems:
Reverse engineering; Building the class models; Building the interaction model;
Building the state model; Reverse engineering tips; Wrapping; Maintenance.
8Hrs.
Additional contents beyond the syllabi:
1. Case studies on real time problem issues
References
1) Michael Blaha, James Rumbaugh,“Object-Oriented Modeling and Design with
UML”, 2/e, Pearson Education, 2005.
2) Ali Bahrami,”Object oriented systems development”, 2/e ,McGrawHill, 1999.
3) Booch, G., Rumbaugh, Jacobson I, “The Unified Modeling Language User
Guide”, 2/e, Pearson, 2005
III Year B. E. (ISE): 2015 –16
24
SDMCET: Syllabus
11UISL604
Systems Lab
(0-0-2-0) 1
Course Objectives:Students are trained to write and implement system programs
like assemblers, design compilers and also to understand the working of
operating system.
Course outcome: Upon the completion of the course, the student should be able to
:
CO-1 Design a parser for the given specifications.(PO->c)
CO-2 Implement assemblers for the given specifications.(PO->b)
CO-3 Demonstrate
various
process
scheduling
and
memory
managementalgorithms.(PO->b)
Pre-requisites:
1. Systems software
2. Operating Systems
3. Formal Language and Finite Automata
Contents:
1) Pass-1 Assembler: Write a C program to Implement Pass-1 Algorithm of a 2
pass assembler. Create intermediate source file which includes the Program
Counter values along with the program given and Tables like SYMTAB, LITTAB.
The input file consists of following SIC machine code.
(Each column is separated by a TAB)
Example:
Source statement
COPY
START
1000
FIRST
STL
RETADR
CLOOP
JSUB
RDREC
LDA
LENGTH
COMP
ZERO
JEQ
ENDFIL
JSUB
WRREC
J
CLOOP
ENDFIL
LDA
EOF
STA
BUFFER, X
LDA
THREE
STA
LENGTH
JSUB
WRREC
LDA
DEVICE
III Year B. E. (ISE): 2015 –16
25
SDMCET: Syllabus
LDL
RETADR
RSUB
LTORG
THREE
WORD
3
ZERO
WORD
0
RETADR RESW
1
DEVICE
BYTE
X„654321‟
EOF
BYTE
C‟EOF‟
LENGTH RESW
4
BUFFER
RESB
4096
(Given Address of RDREC – 2039 and WRREC – 2061)
(Use various functions to read from file, write into file)
2) Pass-2 Assembler
Generate the Object program for the above given program using the results obtained
from the pass1 and store the Opcodes in the proper format.
3) Lex Programs
a) Write a LEX Program to count the no of comment line in a given C
program
also eliminate them and copy that program into separate file
b) Write a LEX Program to recognize whether a given sentence is simple or
compound.
4) YACC Programs
a) Write a YACC Program to test the validity of a simple expression
involving operators +, -, * and /.
b) Write a YACC Program to recognize strings „aaab‟, „abbb‟, „ab‟ and „a‟ using
grammar (anbn, n>=0).
5) Operating systems Programs
a) Write a C Program to implement Process Scheduling algorithm using i. FCFS ii.
SJF iii Priority iv. Round robin
b) Write a C program to implement Page replacement algorithms using:i.FIFO
ii. LRU iii Optimal
References:
1) Leland Bebeck, "Systems Software- An introduction to systems programming ",
3/e, Pearson,2011
2) Silberschatz , Galvin, Gagne "Operating System principles" ,7/e, Willey, 2006
III Year B. E. (ISE): 2015 –16
26
SDMCET: Syllabus
11UISL605
Mini Project-I
(0-0-8-0) 4
Course Objectives:Understand programming language concepts, particularly Java
and object-oriented concepts. Plan, analyze, design and implement a software
project. Demonstrate independent learning. Demonstrate the ability to locate and
use technical information from multiple sources. Demonstrate an understanding
of professional ethics. Participate in a class or project team. Demonstrate the
ability to communicate effectively in speech. Demonstrate the ability to
communicate effectively in writing.Learn to work as a team and to focus on
getting a working project done on time with eachstudent being held accountable
for their part of the project. Learn about and go through the software development
cycle with emphasis on different processes - requirements, design, and
implementation phases.Gain confidence at having conceptualized, designed, and
implemented a working, medium sized project with their team.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Apply problem solving and programming skills for identified problem
statement.(POb)
CO-2 Designthe system for an identified requirement.(POc)
CO-3 Analyze andIncorporate the changes in the development cycle. (PO->d)
CO-4 Use modern tools for realizing the solution.(POe)
CO-5 Demonstrate an ability to work in a team. (PO->i)
CO-6 Demonstrate an ability to present the work carried out both in written and
oral form. (PO->j)
Prerequisites:
1. Software Engineering
2. Database Management Systems
3. Web Technology
11UISE620
Computer Graphics
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: Student should understand the basics of ,Interactive computer
graphics architecture, Modeling and Geometric transformations of 2D/3D objects,
Graphics API programming.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the significant features and basic elements of computer
graphics.(PO a)
CO-2 Demonstrate 2D/3D graphics primitives, transformations and views for a
given geometric object. (PO a)
III Year B. E. (ISE): 2015 –16
27
SDMCET: Syllabus
CO-3 Use OpenGL APIs to implement interactive computer graphics programs.
(PO b)
CO-4 Apply various clipping algorithms on primitive objects.(POb)
CO-5 Discuss lighting and shading effects on given objects. (PO a)
Pre-requisites:
1.Fundamental knowledge in linear algebra and Coordinate geometry.
2. Data structures and any programming language.
Contents:
1) Introduction: Introduction to Computer Graphics and Basics of OpenGL:
Applications of computer graphics, A graphics system, Images: Physical and
synthetic, Imaging systems, the synthetic camera model, the programmer‟s
interface, Graphics architectures, Graphics Programming: The Sierpinski gasket.
04 Hrs.
2) OpenGL Basics :The OpenGL API, Primitives and Attributes, Color, Viewing,
Control Functions, The two dimensional gasket program, Polygons and recursion,
the three dimensional gasket.
08 Hrs.
3) Input and Interaction: Interaction, Input devices, Programming Event-Driven
input: Menus, Picking, Building interactive models, Animating interactive
programs, Design of interactive programs.
07 Hrs.
4) Basic Raster Algorithms: Overview, Rasterization, Bresenham‟s algorithm: line
and circles, Filling rectangles, Filling polygons, Antialiasing, Clipping a line,
Clipping polygon, Polygon mesh and Parametric curves.
09 Hrs.
5) Geometric Objects and Transformations: Scalars, Points, and Vectors, Threedimensional Primitives, Coordinate Systems and Frames, Frames in OpenGL,
Modeling a Colored Cube, Affine Transformations, Rotation, Translation and
Scaling, Transformations in Homogeneous Coordinates, Concatenation of
Transformations, OpenGL Transformation Matrices.
12 Hrs.
6) Viewing:SimpleProjections, Viewing with a computer, Positioning of camera,
Projections in OpenGL, Hidden Surface removal.
06 Hrs.
7) Lighting and Shading : Light and matter, Light sources, The Phong lighting
model, Light sources in OpenGL , Polygon Shading , Approximation of sphere by
recursive subdivision , Specification of matrices in OpenGL, Shading of the
sphere model.
06 Hrs.
Beyond the Syllabus Coverage(Suggestive):
1. Implementation and seminar on all the techniques (algorithms) covered in theory
using C/C++/ OpenGL.
III Year B. E. (ISE): 2015 –16
28
SDMCET: Syllabus
References:
1) Edward Angel, “Interactive Computer Graphics: A Top-down Approach Using
OpenGL”, 5/e, Addison-Wesley, 2012.
2) Donald D. Hearn, M. Pauline Baker, Warren Carithers, “Computer Graphics with
OpenGL”, 4/e, Addison-Wesley, 2010.
3) John Hughes, A. V. Dam, M. McGuire, David F., James D. Foley, Steven K.F.,
Kurt A.” Computer Graphics: Principles and Practice “, 3/e, Pearson, 2013.
4) Edward Angel, “OpenGL : A Primer “, 3/e, Addison-Wesley, 2007.
11UISE621
Advanced Computer Architecture
(4-0-0-0) 4 : 52 Hrs.
Course Objectives:Discuss the concept of parallel processing and the relationship
between parallelism and performance.Appreciate that multimedia values (e.g., 8/16-bit audio and visual data) can be operated on in parallel in 64-bit registers to
enhance performance.Explain the concept of branch prediction its use in
enhancing the performance of pipelined machines.Understand how speculative
execution can improve performance.Provide a detailed description of superscalar
architectures and the need to ensure program correctness when executing
instructions out-of-order.Explain speculative execution and identify the conditions
that justify it.Discuss the performance advantages that multithreading can offer
along with the factors that make it difficult to derive maximum benefits from this
approach.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the fundamentals of computer design. (POa)
CO-2 Apply Instruction and Thread Level Parallelism to enhance the
performance of computer. (POb)
CO-3 Apply the concept of memory design for the given constraints.(POb)
CO-4 Describe multicore architecture. (POa)
Prerequisites:
1. Digital Electronics
2. Study of microprocessors with assembly language programming
3. Computer Organization
Contents:
1) Fundamentals of Computer Design: Introduction Defining computer
architecture; Performance; Quantitative Principles of computer design. Pipeline
III Year B. E. (ISE): 2015 –16
29
SDMCET: Syllabus
2)
3)
4)
5)
6)
7)
hazards; Implementation of pipeline.
7 Hrs.
Instruction –Level Parallelism – 1: ILP: Concepts and challenges; Basic
Compiler Techniques for exposing ILP; Reducing Branch costs with prediction;
Overcoming Data hazards with Dynamic scheduling; Hardware based
speculation.
8 Hrs.
Instruction –Level Parallelism – 2: Exploiting ILP using multiple issue and
static scheduling; Non linear pipeline scheduling; Exploiting ILP using dynamic
scheduling, multiple issue and speculation; The Intel Pentium 4 as example.
7 Hrs.
Multiprocessors and Thread –Level Parallelism: Introduction; Symmetric
shared memory architectures; Performance of symmetric shared memory
multiprocessors; Distributed shared memory and coherence; Basics of
synchronization; Models of Memory Consistency.
8 Hrs.
Review Of Memory Hierarchy: Introduction; Cache performance; Cache
Optimizations,Virtualmemory.
8 Hrs.
Memory Hierarchy Design: Introduction; Memory technology and optimizations;
Protection:Virtualmemory and virtual machines.
7 Hrs.
Multi core Architecture: Design Challenges; role of compilers and software
development; Intel tools for software developer; Case study on Intel core
processors (Core 2 duo/i3/i5/i7)
7 Hrs.
References:
1) John L. Hennessey and David A. Patterson, “Computer Architecture, A
Quantitative Approach”, 4/e, Elsevier, 2007.
2) Kai Hwang, “Advanced Computer Architecture Parallelism, Scalability,
Programmability”, 2/e,Tata McGraw Hill, 2003.
3) David E. Culler, Jaswinder Pal Singh, Anoop Gupta, “Parallel Computer
Architecture, A Hardware / Software Approach”,1/e, Morgan Kaufman, 1999
11UISE622
Advanced Database Management
System
(4-0-0-0) 4 : 52 Hrs.
Course Objectives:The course is designed to expose the students to build an
understanding of the fundamental concepts of computer networking. The course
focuses on to Familiarize the student with the basic taxonomy and terminology of
the computer networking area. It also introduces the student to advanced
networking concepts, preparing the student for entry Advanced courses in
computer networking.
III Year B. E. (ISE): 2015 –16
30
SDMCET: Syllabus
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the indexing process for storage of data. (PO->a)
CO-2 Use hashing to enhance the performance of indexing(PO->b)
CO-3 Apply various query optimization techniques(PO->c)
CO-4 Describe physical database design, tuning and recent applications.(PO->a)
Pre-requisites:
1. Data Base Management Systems concepts.
2. Advanced data structures concepts
Contents:
1) Overview of Storage and Indexing, Disks and Files: Data on external storage;
File organizations and indexing; Index data structures; Comparison of file
organizations; Indexes and performance tuning. Memory hierarchy; RAID; Disk
space management; Buffer manager; Files of records; Page formats and record
formats.
7 Hrs.
2) Tree Structured Indexing: Intuition for tree indexes; Indexed sequential access
method; B+ trees, Search, Insert, Delete, Duplicates, B+ trees in practice.8 Hrs.
3) Hash-Based Indexing: Static hashing; Extendible hashing, Linear hashing,
comparisons.
5 Hrs.
4) Overview of Query Evaluation, External Sorting: The system catalog;
Introduction to operator evaluation; Algorithms for relational operations;
Introduction to query optimization; Alternative plans: A motivating example; What
a typical optimizer does. When does a DBMS sort data? A simple two-way merge
sort; External merge sort.
7 Hrs.
5) Evaluating Relational Operators: The Selection operation; General selection
conditions; The Projection operation; The Join operation; The Set operations;
Aggregate operations; The impact of buffering.
4 Hrs.
6) A Typical Relational Query Optimizer: Translating SQL queries in to Relational
Algebra; Estimating the cost of a plan; Relational algebra equivalences;
Enumeration of alternative plans; Nested sub- queries; Other approaches to
query optimization.
7 Hrs.
7) Physical Database Design and Tuning: Introduction; Guidelines for index
selection, examples; Clustering and indexing; Indexes that enable index-only
plans; Tools to assist in index selection; Overview of database tuning; Choices in
tuning the conceptual schema; Choices in tuning queries and views; Impact of
concurrency; DBMS benchmarking.
8 Hrs.
8) More Recent Applications: Mobile databases; Multimedia databases;
Geographical Information Systems; Genome data management.
6 Hrs.
III Year B. E. (ISE): 2015 –16
31
SDMCET: Syllabus
Beyond the Syllabus Coverage (Suggestive):
1. Projects on different file structures.
References:
1) Raghu Ramakrishnan and Johannes Gehrke: “Database Management Systems”,
3/e, McGraw-Hill,2009,
2) Elmasri and Navathe , ”Fundamentals of Database System”,5/e, Pearson
Education, 2011
3) Conolly and Begg, “Database Systems”,4/e, Pearson Education,2008.
11UISE623
File Structures
(4-0-0-0) 4 : 52 Hrs.
Course Objectives:Studentshould understand the basics ofFile manipulation
techniques, storage devices, compression techniques, storing the data in a
proper format which is used for indexing and tree building for enhanced
searching.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the fundamental concept of file structures, data storage and
compression techniques. (PO a)
CO-2 Analyze the concepts of file manipulation for data storage using
various storage devices. (PO b)
CO-3 Apply various compression techniques on data. (PO b)
CO-4 Apply the concepts of B-trees and Hashing for indexing the given data
sets.(POb)
Pre-requisites:
1. Database Management System
2. Basic programming skills.
Contents:
1) File Processing Operations : Physical and logical files, opening, reading &
writing and closing files in C, seeking and special characters in files, physical
devices and logical files, file-related header files in C
6 Hrs.
2) Secondary Storage Disks: organization, tracks, sectors, blocks, capacity, nondata overhead, cost of a disk access,Magnetic Tape – types, performance,
organization estimation of tape length and data transmission times, disk vs tape,
CD-ROM – CD-ROM as a file structure, physical organization, strengths and
weakness of cd-roms, storage hierarchy
6 Hrs.
3) Byte Journey and buffer Management: File manager, I/O buffer, I/O
III Year B. E. (ISE): 2015 –16
32
SDMCET: Syllabus
processing, buffer strategies and bottlenecks.
5 Hrs.
4) File Structure Concepts: A stream file, field structures, reading a stream of
fields, record structures and that uses a length indicator, Mixing numbers and
characters – use of a hex dump, reading the variable length records from the
files.
5 Hrs.
5) Managing records in C files: Retrieving records by keys, sequential search,
direct access, choosing a record structure and record length, header records, file
access and file organization.
5 Hrs.
6) Organizing files for performance: Data compression, reclaiming space –
record deletion and storage compaction, deleting fixed-length records for
reclaiming space dynamically, deleting variable-length records, space
fragmentation, replacement strategies.
5 Hrs.
7) Indexing: Index, A simple index with an entry sequenced file, basic operations
on an indexed, entry sequenced file, indexes that are too large to hold in
memory, indexing to provide access by multiple keys, retrieval using combination
of secondary keys, improving the secondary index structure – inverted lists.5 Hrs.
8) Indexed sequential file access and prefix B+ Trees: Indexed sequential
access, maintaining a sequence set, adding a simple index to the sequence set,
the + tree, simple prefix B+ content of the index: separators instead of keys, the
simple prefix B tree maintenance, index set block size, internal set block size,
internal structure of index set blocks: a variable B+ treeorder B-tree, loading a
simple prefix.
5 Hrs.
9) Hashing: Hashing, Collisions in hashing, a simple hashing algorithms, hashing
functions and record distributions, memory requirements, collision resolution by
progressive overflow, buckets, deletions.
5 Hrs.
10) Extendable hashing: Working of extendable hashing, implementation, deletion,
extendable hashing performance Designing file structure for CD-ROM Tree
structure on CD-ROM, hashing files on CD-ROM, CD-ROM file structure.5 Hrs.
References:
1) Michael J. Folk, Bill Zoellick and Greg Riccardi, “File Structures – An Object
Oriented Approach with C++”, 3/e, Pearson, 2006
2) A. A. Putambekar, “Data and File Structures” , 3/e, Technical Publications, 2009
11UISE624
Simulation and Modeling
(4-0-0-0) 4 : 52 Hrs.
Course Objectives:The purpose of this course is to provide students with an
opportunity to develop skills in modeling and simulating a variety of managementrelated problems. After learning the simulation techniques, the students are
expected to be able to solve real world problems which cannot be solved strictly
III Year B. E. (ISE): 2015 –16
33
SDMCET: Syllabus
by mathematical approaches.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the basics of simulations and modeling. (PO a)
CO-2 Construct a model for a given set of data and motivate its validity. (POc)
CO-3 Apply random number generation for simulation models. (PO b)
CO-4 Analyze output data produced by a model and test validity of the model.
(POb)
CO-5 Explain parallel and distributed simulation methods. (PO a)
Prerequisites:
1. Discrete mathematical structures
2. Probability
Contents
1) Introduction to Simulation: When simulation is the appropriate tool and when it
is not appropriate; Advantages and disadvantages of Simulation; Areas of
application; Systems and system environment; Components of a system;
Discrete and continuous systems; Model of a system; Types of Models; DiscreteEvent System Simulation; Steps in a Simulation Study
5 Hrs.
2) Simulation Examples: Characteristics of Queueing Systems; Queueing
Notation; Simulation of Queueing Systems; Simulation of Inventory Systems
6 Hrs.
3) General Principles: Concepts in Discrete-Event Simulation: The EventScheduling / Time-Advance Algorithm, World Views, Manual simulation Using
Event scheduling; List processing.
5 Hrs.
4) Statistical Models in Simulation: Review of terminology and concepts; Useful
statistical models; Discrete distributions; Continuous distributions; Poisson
process; Empirical distributions
6 Hrs.
5) Random-Number Generation: Properties of Random Numbers; Generation of
Pseudo-Random Numbers; Techniques for Generating Random Numbers; Tests
for Random Numbers.
6 Hrs.
6) Random-Variate Generation: Inverse Transform technique: Exponential
Distribution, Uniform Distribution, Discrete Distributions; Acceptance-Rejection
Technique: Poisson Distribution.
5 Hrs.
7) Input Modeling: Data Collection; Identifying the distribution with Data; Parameter
Estimation; Goodness of Fit Tests; Selecting Input Models without Data;
Multivariate and Time-Series Input Models.
7 Hrs.
8) Verification and Validation of Simulation Models: Model Building, Verification
and Validation; Verification of Simulation Models; Calibration and Validation of
III Year B. E. (ISE): 2015 –16
34
SDMCET: Syllabus
Models
6 Hrs.
9) Simulation of Computer Systems: Introduction; Simulation Tools; Model Input;
High-Level Computer-System Simulation; CPU Simulation; Memory Simulation.
6 Hrs.
References:
1) Jerry Banks, John S. Carson, Barry L. Nelson, David M. Nicol, “Discrete-Event
System Simulation”,5/e, Prentice-Hall India, 2009
2) Averill M. Law, W. David Kelton, “Simulation Modeling and Analysis”,5/e,
McGrawHill,2014
3) Bernard P. Zeigler, “Guide to modeling and Simulation of systems”, 1/e, Springer
publications,2012
11UISE625
Parallel Algorithms
(4-0-0-0) 4 : 52 Hrs.
Course Objectives: Student should understand the basics of ,Parallel programming
paradigm,memory constraints for parallel architectures, OpenMP programming.
Course outcome: Upon the completion of the course, the student should be able to :
CO-1 Describe the basics and various techniquesof parallel programming
paradigm. (PO a)
CO-2 Analyze distributed memory programming by using parallel algorithms.
(PO b)
CO-3 Apply OpenMP programming principles to parallelize the algorithms.(POb)
Pre-requisites:
1. Programming languages like C/C++/Java.
2. Exposure to multi core architectures.
Contents:
1) Introduction to Parallel Computing: Need of Performance, Building Parallel
Systems, Why to Write Parallel Programs? How to Write Parallel Programs?
Approach : Concurrent, Parallel, Distributed
2 Hrs
2) Parallel Hardware and Parallel Software: Background, Modifications to the von
Neumann Model,Parallel Hardware, Parallel Software, Input and Output,
Performance, Parallel Program Design and Writing and Running Parallel
Programs.
4 Hrs
3) Distributed Memory Programming with MPI: Getting Started, The Trapezoidal
Rule in MPI, Dealing with I/O, Collective Communication, MPI Derived Data
types, A Parallel Sorting Algorithm
10 Hrs.
4) Shared Memory Programming with Pthreads: Processes, Threads and
Pthreads, Hello, World program ,Matrix-Vector Multiplication, Critical Sections
III Year B. E. (ISE): 2015 –16
35
SDMCET: Syllabus
Busy-Waiting, Mutexes, Producer-Consumer Synchronization and Semaphores,
Barriers and Condition Variables, Read-Write Locks, Caches, Cache-Coherence,
and False Sharing and Thread-Safety
12 Hrs.
5) Shared Memory Programming with OpenMP: Introduction to OpenMP, The
Trapezoidal RulemScopeof Variables, The Reduction Clause, The Parallel For
Directive, More About Loops in OpenMP: Sorting, Scheduling Loops, Producers
and Consumers, Caches, Cache-Coherence, and False Sharing and ThreadSafety.
18 Hrs
6) Parallel Program Development and Parallel Algorithms: Two N-Body Solvers,
Tree Search and Case Studies.
6 Hrs.
References:
1) Peter s. Pacheco,” An introduction to parallel programming”,1/e, Morgan
Kaufmann Publishers, 2011
2) Barbara Chapman, Gabriele Jost and Ruud van der Pas, “Using OpenMP:
Portable Shared Memory Parallel Programming” , 3/e, The MIT Press, 2007
3) William Gropp and Ewing Lusk, “Using MPI: Portable Parallel Programming with
the Message Passing Interface”, 3/e, MIT Press, 2014
III Year B. E. (ISE): 2015 –16
36