136

SDMCET: Syllabus
Computer Science & Engineering

Suggested plan of study
V SEMESTER
Course
Code
Course Title
L-T-P
(Hrs/Wee
k)
Course
Credits
4-0-0
4-0-0
CS300
Management, Entrepreneurship, Protection of

Intellectual Property, Professional Ethics
Data Communication
CS301
Operating System
3-0-2
CS303
Compiler Design
4-0-0
CS306
Data Base Management Systems
4-0-0
CS307
Software Engineering
4-0-0
CS309
System Software Laboratory
0-0-4
CS310
DBMS Laboratory
0-0-4
33
28
HU301
Total
VI SEMESTER
Course Code
Course Title
L-T-P
(Hrs/Week)
Course
Credits
CS352
Computer Networks
4-0-0
CS353
Mini Project
Computer Graphics
0-0-8
4-0-2
4-0-0
0-0-4
Elective
4-0-0
Elective
4-0-0
34
27
CS358
CS355
CS357
Object Oriented System Modeling and

Design
Network Programming Laboratory
Total
Total credits offered for the Third year: 55
III Year B.E. (CSE): 2014 - 15
SDMCET: Syllabus
Computer Science & Engineering
Inventory of Electives
Sr. No
Course Title
1
2
3
4
5
6
7
8
9
10
11
12
System Modeling and Simulation

Visual Programming
Pattern Recognition
Digital Image Processing
Advanced Data Structures and Algorithms
Computer Graphics
Artificial Intelligence
Data Compression
File Structures
Signals and System
Game Theory
Principles of Programming Languages
Semester
6th
CS370
CS371
CS373
CS374
CS375
CS376
CS377
CS378
CS379
CS380
CS381
CS382
Guidelines for Floating Electives

1) The above is the collection of the Electives belongs to Syllabi of CSE, SDMCET,
Dharwad.
2) Any elective from this inventory can be floated by an faculty of the department in
any semester (odd or even). In worst case where nobody floats electives on their
own: The HOD will pick electives and will used in the subject allotment process.
3) Every Floated elective course will have Three types of prerequisites called
a) Mandatory- Courses pre requites which are usually mentioned in the syllabus
book without which one cannot register the courses.
b) Bridgeable One can learn/build/develop these pre requisites along with
course.
c) Add-on- These are declared by the Courses Instructor of the Elective. DUGC
will have the final say on these Add-on Prerequisites.
Example: As a course instructor, he/she can allow students from different
semesters to register with justification. VBH offering Digital Image Processing
for 6 and 8 semester students. GAR offering Principles of Programming
Language for maximum of 70 students of 6th semester only
4) Any Students satisfying the prerequisites of the floated Elective can register for
the same. (Up to maximum credit as per the Regulations).
Advantage
1) These guidelines create the possibility of heterogeneity in the classrooms and
nourish autonomy in a big-way to both students and faculty.
2) Students can plan their semester well and make free in the 8th semester and take
industry opportunities for the final year projects.
3) If a student wants to AUDIT an elective offered (after fulfilling his/her electives),
will be allowed with the permission of the courses teacher.
SDMCET: Syllabus
V SEMESTER
HU301
Management, Entrepreneurship, Protection of

Intellectual Property, Professional Ethics
(4-0-0) 4
Course Objectives:
CLO1. Distinguish among patent, copyright, and trade secret protection.
CLO2. Role and importance of intellectual property rights in contemporary
business environment.
CLO3. Outline the historical development of software patents.
CLO4. Discuss the consequences of software piracy on software developers and
the role of relevant enforcement organizations.
CLO5. Role of entrepreneurship in modern economy and entrepreneurial
opportunities
Course Outcomes: At the end of the course student should be able to:
CO1. Appreciate the role of organizations in contemporary business (PO ->
A,B,C)
CO2. Understand Dynamic role played by management in organizations (PO ->
I,J)
CO3. Value entrepreneurship in current economy and evaluate entrepreneurial
opportunities for his/her organization or for himself. (PO -> I,J)
CO4. Appreciate growing importance of IPR and means to produce and protect
IPR assets (PO ->I,J)
Prerequisites: NIL
Contents:
1) Entrepreneurship:
Foundations of Entrepreneurship: Meaning of entrepreneur, functions of
entrepreneur, types of entrepreneur, concept of entrepreneurship, role of
entrepreneurs in economic development, barriers of entrepreneurship.
5 Hrs
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.
3 Hrs
Government and Institutional Support: Nature of support of government,
objectives and functions of SSI, SIDBI, DIC, single window agency, KIADB,
KSSIDC, KSFC.
3 Hrs
Preparation of Project: Meaning of project identification, project report, contents
and formulation, identification of business opportunities, feasibility studies, types
and purpose.
3 Hrs
2) Management:
Engineering and Management: Historical Development of Engineering,
Management, Engineering, Management and Engineering & Management a
synthesis.
3 Hrs
SDMCET: Syllabus
Planning, Forecasting and Decision Making: Nature of Planning, the
foundation of planning, some planning concepts, forecasting, nature of decision
making, management science, tools for decision-making.
4 Hrs
Organizing and staffing: nature of organizing, traditional organizational theory,
technology and modern organization structures, staffing technical organization,
authority and power; delegation, meeting & committees.
4 Hrs
Motivating: Motivation, leadership, motivating and leading technical
professionals.
3 Hrs
Controlling: process of control, financial controls, and non-financial controls.
3 Hrs
Intellectual Property Rights:
Introduction: Meaning and forms of intellectual property right, competing
rationale for protection, international conventions, world court.
2 Hrs
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.
2 Hrs
Patents: Concept of patent, patentable inventions, procedure for obtaining
patent, rights and obligations of patent holders, infringements and remedies,
offenses and penalties.
3 Hrs
Industrial Designs: Definition of design, procedure for registration, rights
conferred by registration, infringements Trademarks, Term Paper on
commercializing a hypothetical product/process/software, by proper evaluation of
relevant existing patents/copy rights.
3 Hrs
Professional Ethics and ACM code of Conduct
3 Hrs
Additional contents beyond the syllabi:
BOOKS:
1) Thomas W. Zimmerer- Essentials of Entrepreneurship, PHI, 2005.
2) Daniel Bobcock: Managing Engineering and Technology, 5th edition, PHI, India
2010.
3) N. K. Acharya- Text book on Intellectual Property Rights, 4th edition, Asia Law
House, Hyderabad.
SDMCET: Syllabus
CS300
Data Communication
(4-0-0) 4
Course Learning Objectives:

CLO1. Discuss the evolution of early networks and the Internet.
CLO2. Demonstrate the ability to use effectively a range of common networked
applications including e-mail, telnet, FTP, and web browsers, online web
courses, and instant messaging.
CLO3. Explain the hierarchical, layered structure of a typical network architecture.
CLO4. Describe emerging technologies in the net-centric computing area and
assess their current capabilities, limitations, and near-term potential.
CLO5. Explain different multiplexing techniques and service models to determine
different framing and date link circle.
CLO6. Describe the role of NAC protocols.
CO1. Express the Fundamentals of networks and the problems involved in the
networks. (PO->A)
CO2. Express the Fundamental functionality of the layers and protocol involved
with the case study like HTTP FTP Telnet etc.( PO->B,D)
CO3. Express the Fundamentals of digital transmission that involves different
Channel usage capacity of the channels and how to enhance the Bit rate
of such electro-magnetic waves. (PO->A,C,D)
CO4. Explain the Theory involved in the switching and enhancing the media
usage.( PO->B,C)
CO5. Perform Data correction and error detection techniques due to problems in
the medium.
( PO->A,D,E)
CO6. Peer link protocols like Go back N and Stop and wait HDLC and PPP as
case studies. ( PO->C,D)
CO7. Improving the performance in MAC using techniques like Random access
and scheduled access etc.( PO->A,B)
Prerequisites:
Data Structures
Course Contents:
1) Communication Networks and Services: Evolution of Network Architecture
and Services: Telegraph Networks and Message Switching, Telephone Networks
and Circuit Switching, and the Internet, Computer Networks and Packet
Switching
2Hrs.
2) Applications and Layered Architectures: Examples of Protocols, Services,
and Layering: HTTP, DNS, and SMTP, TCP and UDP Transport Layer Services;
The OSI Reference Model: The seven layer OSI Reference Model, Unified View
of Layers, Protocols, and Services Overview of TCP/IP Architecture: TCP/IP
Architecture, TCP/IP Protocol: How the layer work together, Protocol Overview;
Application Layer Protocols and TCP/IP Utilities
7 Hrs.
SDMCET: Syllabus
3) Digital Transmission Fundamentals: Digital Representation of Information:
Block-Oriented Information, Stream Information; Why Digital Communications ?:
Comparison of Analog and Digital Transmission, Basic properties of Digital
Transmission Systems; Digital Representation of Analog Signals: Bandwidth of
Analog Signals, Sampling of an Analog Signal, Digital Transmission of Analog
Signals; Characterization of Communication Channels: Frequency Domain
Characterization, Time Domain Characterization; Fundamental Limits in Digital
Transmission: The Nyquist Signaling Rate, The Shannon Channel Capacity;
Line Coding ;Modems and Digital Modulation: Binary Phase Modulation, QAM
and Signal Constellations, Telephone Modem Standards; Properties of Media
and Digital Transmission Systems: Twisted Pair, Coaxial Cable, Optical Fiber,
Radio Transmission, Infrared Light; Error Detection and Correction: Error
Detection, Two Dimensional Parity Checks, Internet Checksum, Polynomial
Codes, Standardized Polynomial Codes, Error Detecting Capability of a
Polynomial Code.
16 Hrs.
4) Circuit Switching Networks: Multiplexing: Frequency Division Multiplexing,
Time Division Multiplexing, Wavelength-Division Multiplexing; SONET: SONET
Multiplexing, SONET Frame Structure; Transport Networks: SONET Networks,
Optical Transport networks; Circuit Switches: Space Division Switches, Time
Division Switches; The Telephone Network: Transmission Facilities, End to End
Digital Services
8 Hrs.
5) Peer-to-Peer Protocols and Data Link Layer: Peer-to-Peer Protocols: Peer
to-Peer
Protocols and Service Models; ARQ Protocols and Reliable Data
Transfer Service: Stop-and-Wait ARQ, Go-Back-N ARQ, Selective Repeat ARQ;
Other Peer-to-Peer Protocols; Data Link Controls: Framing; Point to Point
Protocol; HDLC Data link Control; Link Sharing using Packet Multiplexers:
Statistical Multiplexing, Speech Interpolation and the Multiplexing of Packetized
Speech
12Hrs.
6) Medium Access Control Protocols and Local Area Networks: The Medium
Access Control Protocols: Multiple Access Communications; Random Access:
ALOHA, Slotted ALOHA, CSMA, CSMA-CD; Scheduling Approaches to Medium
Access Control: Reservation Systems, Polling, Token-Passing Rings;
Channelization: FDMA, TDMA, CDMA
7 Hrs.
Books:
1) Alberto Leon Garcia and Indra Widjaja- Communication Networks -Fundamental
Concepts and Key architectures, 2nd edition, Prentice Hall India.Tata McGrawHill.
2) Behrouz A. Forouzan- Data Communications and Networking, 5th edition Tata
McGraw-Hill
3) William Stallings- Data and Computer Communication, Fifth edition,
SDMCET: Syllabus
CS301
Operating Systems
(3-0-2) 4

CLO1. Explain the objectives and functions of modern operating systems.
CLO2. Analyze the tradeoffs inherent in operating system design.
CLO3. Describe the functions of a contemporary operating system with respect to
convenience, efficiency, and the ability to evolve.
CLO4. Describe the need for concurrency within the framework of an operating
system.
CLO5. Demonstrate the potential run-time problems arising from the concurrent
operation of many separate tasks.
CLO6. Explain the different states that a task may pass through and the data
structures needed to support the management of many tasks.
CLO7. Summarize the various approaches to solving the problem of mutual
exclusion in an operating system.
CLO8. Explain conditions that lead to deadlock.
CLO9. Compare and contrast the common algorithms used for both preemptive
and non-preemptive scheduling of tasks in operating systems, such as
priority, performance comparison, and fair-share schemes.
CLO10. Explain memory hierarchy and cost-performance trade-offs.
CLO11. Explain the concept of virtual memory and how it is realized in hardware
and software.
CLO12. Summarize the principles of virtual memory as applied to caching and
paging.
CLO13. Evaluate the trade-offs in terms of memory size (main memory, cache
memory, auxiliary memory) and processor speed.
CLO14. Defend the different ways of allocating memory to tasks, citing the relative
merits of each.
CLO15. Describe the reason for and use of cache memory.
CLO16. Discuss the concept of thrashing, both in terms of the reasons it occurs
and the techniques used to recognize and manage the problem.
CO1. Identify the System calls, protection, interrupts of any GOS(PO->A, C, H)
CO2. Explain Input/output, disk access, file systems facilities any GOS(PO-> A,
C)
CO3. Write
application
keeping
Concurrency
and
synchronization
Semaphores/monitors, shared memory, mutual exclusion Process
scheduling services of an GOS in the mind (PO->B, C,D, E, J)
Prerequisites: CS 100/150, CS 207
Course Contents:
1) Introduction to Operating Systems, System structures: Computer System
organization and architecture; Role of Operating System User and system
perspective, Operating System structure and basic functions.
4 Hrs.
SDMCET: Syllabus
2) Process Management: Process concept; Process scheduling; Operations on
processes; Inter process communication. Multi-Threaded Programming:
Overview; Multithreading models; Threading issues. Process Scheduling: Basic
concepts; Scheduling criteria; Scheduling algorithms; Thread scheduling.
5 Hrs.
Process Synchronization; Critical section problem; software and hardware
solution for the Synchronization; Classical problems of synchronization; Monitors.
5 Hrs.
Case Study: Creating Process, IPC, Thread Libraries as per POSIX, Changing
priorities of User Level Process, Concurrency control Tools and other Kernel
Support for Process in Linux/Windows.
4 Hrs.
Deadlocks: System model; Deadlock characterization; Methods for handling
deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and
recovery from deadlock.
6 Hrs.
3) 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 Hrs.
Case Study: Creating Shared memory, calculating page/segment size of a user
process in Linux/Windows
3 Hrs.
4) File System, Implementation of File System: File System: File concept;
Access methods; File system mounting; File sharing; Protection. Implementing
File System: File system structure; Directory structure and implementation;
Allocation methods.
6 Hrs.
Case Study: i-Node Structure in UNIX and DOS FAT File system respective
management APIs
3 Hrs.
5) Secondary Storage Structures, Protection: 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, Capability-Based systems.
8 Hrs.
Laboratory Work
Below are few sample tasks, kind of which are to be demonstrated by students of
this course and these works are assumed to be under the hours proposed for the
theoretical content given above.
1. Using the Programming Language and platform of your choice, design and
conduct the experiment stated below to demonstrate the concurrency.
a. Process P1 accepts a positive integer n from the user and creates n
threads.
b. Each Thread Ti (i=1,2,3.n) created by P1 takes two positive integers
ai and bi such that bi-ai >100 as input and generates random number
between the range.
c. Each Ti terminates after generating 10 random numbers which are
prime.
SDMCET: Syllabus
2.
3.
4.
5.
d. Each Ti after generating a number makes use of a function with

signature int prime(int k) (belongs to P1) to check whether the
generated number is prime or not.
e. int prime(int k) returns 0 if k is nor prime and returns 1 if k is prime.
Using the Programming Language and platform of your choice, design and
conduct the experiment stated below to demonstrate the Inter process
communication.
a. Process P accepts a positive integer n from the user and creates n
processes.
b. Each Process Pi (i=1,2,3.n) created by P generates random number
r.
c. Each Pi writes a structure having i and r into a pipe after generating r.
d. Each Pi terminates after generating 100 random numbers which are
prime.
e. Q is one more process created by P which reads the structures from
Pipe, processes the r to check prime-ness and leaves the response in a
shared array res[n], where res[i]=0 means that the recently generated r
by Pi is not a prime and prime other wise.
f. Each Pi will not generate the next number until it gets the response
regarding the prime-ness for recently generated one.
Write a program to find the name of a file in file system of an OS of your
choice who length is highest at that time.
Write a program (or orchestrate the scenario) to create IO queue Burst in the
OS of your choice.
Write a program (or orchestrate the scenario) to create deadlock (or
equivalent) queue Burst in the OS of your choice.
Books:
1) Abraham Silberschatz, Peter Baer Galvin, Greg Gagne- Operating System
Principles, 7th edition, Wiley-India, 2006.
2) D.M Dhamdhere- Operating systems: A concept based Approach, 2nd edition,
Tata McGraw- Hill, 2002.
3) Gary Nutt -Operating System 3rd Ed, Pearson Education 2012.
4) Harvey M Deital- Operating systems, 3rd edition, Addison Wesley, 1990.
5) Advanced Unix System Programming by Richard Stevens.
SDMCET: Syllabus
CS303
Compiler Design
(4-0-0) 4

CLO1. Describe the steps and algorithms used by language translators.
CLO2. Recognize the underlying formal models such as finite state automata,
push-down automata and their connection to language definition through
regular expressions and grammars.
CLO3. Discuss the effectiveness of optimization.
CLO4. Explain the impact of a separate compilation facility and the existence of
program libraries on the compilation process.
CO1. Understand how the design of a compiler requires most of the knowledge
acquired during their study(POa )
CO2. Develop a firm and enlightened grasp of concepts learned earlier in their
study like higher level programming, assemblers, automata theory, and
formal languages, languages, languages specifications, data structure and
algorithms, operating systems(PO ad)
CO3. Apply the ideas, the techniques, and the knowledge acquired for the
purpose of other software design(POb,c,g,j )
CO4. Working skills in theory and application of finite state machines, recursive
descent, production rules, parsing, and language semantics. (PO a, d)
CO5. Know about the powerful compiler generation tools, which are useful to
the other non-compiler applications(PO e, I, j, k)
Prerequisites:
Students must have the prerequisite knowledge on the following topics:
i) Formal Languages ii) system programming
Contents:
1) Introduction: Different Phases of Compilers, Comparison of Compilers and
Interpreters. Top-down Parsing: RDP and Predictive parsing.
10 Hrs.
2) Bottom-up Parsing: Simple LR, More powerful LR parsers ( LR(0), SLR, LALR),
ambiguous grammars.
8 Hrs.
3) Intermediate Code Generation and Optimizations: Syntax-directed translation;
Syntax-directed translation schemes, Variants of syntax trees; Three-address
code; Types and declarations; Translation of expressions; Type checking;
Control flow; Back patching; Switch statements; Intermediate code for
procedures. Various techniques of machine independent optimization.
8 Hrs.
4) Run-Time Environments: Storage Organization; Stack allocation of space;
Access to non-local data on the stack; Heap management; Introduction to
garbage collection.
6 Hrs.
5) Code Generation: Issues in the design of Code Generator; The Target language;
Addresses in the target code; Basic blocks and Flow graphs; Optimization of
basic blocks; A Simple Code Generator.
6 Hrs.
10
SDMCET: Syllabus
6) Ancillary Code Processing Techniques: Generic description of Assembler,
Loader, Linker and Macros.
Assemblers: Basic Assembler Features & Functions, Assembler Design
Operations - One-Pass Assembler, Multi-Pass Assembler.
6 Hrs.
Loaders and Linkers: Basic Loader Functions - Design of Loaders and
Linkers
5 Hrs.
Macro Processor: Design of Macro Processors.
3 Hrs.
Books:
1) Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman- CompilersPrinciples, Techniques and Tools, 2nd edition, Addison-Wesley, 2007.
2) D.M.Dhamdhere- System Programming and Operating Systems, 2nd revised
edition, Tata McGraw - Hill, 2009 reprint.
3) Charles N. Fischer, Richard J. leBlanc, Jr.- Crafting a Compiler with C, Pearson
Education, 2008.
4) Andrew W Apple- Modern Compiler Implementation in C, Cambridge University
Press, 2004.
11
SDMCET: Syllabus
CS306
Data Base Management Systems
(4-0-0) 4

CLO1. Explain the characteristics that distinguish the database approach from
the traditional approach of programming with data files.
CLO2. Cite the basic goals, functions, models, components, applications, and
social impact of database systems.
CLO3. Describe the components of a database system and give examples of
their use.
CLO4. Identify major DBMS functions and describe their role in a database
system.
CLO5. Explain the concept of data independence and its importance in a
database system.
CLO6. Use a declarative query language to elicit information from a database.
Categorize data models based on the types of concepts that they provide
to describe the database structurethat is, conceptual data model,
physical data model, and representational data model.
CLO7. Describe the modeling concepts and notation of the entity-relationship
model and UML, including their use in data modeling.
CLO8. Describe the main concepts of the OO model such as object identity, type
constructors, encapsulation, inheritance, polymorphism, and versioning.
CLO9. Define the fundamental terminology used in the relational data model.
CLO10. Describe the basic principles of the relational data model.
CO1. Design and model a design scenario using relational data modeling .(PO>B)
CO2. Analyze the design anomalies.(PO->C, A, H)
CO3. Construct Entity Relationship Diagram.(PO->C, A, H)
CO4. Analyze and Construct Functional Dependencies for the business rules.
.(PO->A, B)
CO5. Analyze Functional Dependencies to identify Primary keys. .(PO->A, B)
CO6. Analyze and Perform Normalization and Normal Forms. .(PO->A, B)
CO7. Define referential integrities. .(PO-> B)
CO8. Create relational database design schemas in 3-NF/BCNF for a design
scenario of the size of 8-10 tables.(PO->C,A,D)
CO9. Solve abstract relational language, such as relational algebra
problems.(PO->E,H)
CO10. Solve database transactions by using Structured Query Language
(SQL),usedby DBMSs.(PO->D,C, K)
CO11. Explain the general concept of the additional topics such as: Query
Optimizations(PO->H,G, K)
Prerequisites:
1. Relational algebra
12
SDMCET: Syllabus
2. Set theory
3. Data structure
Course Contents:
1) Introduction: Introduction; An example; Characteristics of Database approach;
Actors on the screen; 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; Classification of
Database Management systems.
4 Hrs.
2) Entity-Relationship 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; Relationship types of degree higher than two.
4 Hrs.
3) Relational Model and Relational Algebra: Relational Model Concepts;
Relational Model Constraints and Relational Database Schemas; Update
Operations, Transactions and dealing with constraint violations; Unary Relational
Operations: SELECT and PROJECT; Relational Algebra Operations from Set
Theory; Binary Relational Operations: JOIN and DIVISION; Examples of Queries
in Relational Algebra; Relational Database Design ER- to-Relational Mapping.
9 Hrs.
4) SQL 1: SQL Data Definition and Data Types; DDL statements like creation and
specification od table, DCL statements for Schema change, alter, delete etc;
DML statements like Insert, Delete and Update statements in SQL etc and more
complex statements for Basic queries Nested sub queries, Correlated sub
queries.
8 Hrs.
5) SQL 2: PL/SQL; Specifying constraints as Assertion and Trigger; Views (Virtual
Tables) in SQL; Additional features of SQL; Database programming issues and
techniques; Embedded SQL, Dynamic SQL; Database stored procedures and
SQL.
8 Hrs.
6) 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.
6 Hrs.
7) Database Design 2: Properties of Relational Decompositions; Algorithms for
Relational Database Schema Design; Multivalued Dependencies and Fourth
Normal Form; Join Dependencies and Fifth Normal Form; Inclusion
Dependencies; Other Dependencies and Normal Forms.
6 Hrs.
8) 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, Serializability and Recoverability; Lock Management; Introduction
to ARIES; The log; Other recovery-related structures; The write-ahead log
protocol; Check pointing.
7 Hrs.
13
SDMCET: Syllabus

Refreshing the fundamentals used in data structures and algorithms. (PO
B)
Providing sufficient information about set theory. (PO B)
Providing certification from agencies like IBM. (PO E, F ,H)
Books:
1) Elmasri and Navathe- Fundamentals of Database Systems, 5th edition, AddisonWesley, 2009
2) Raghu Ramakrishnan and Johannes Gehrke- Database Management Systems,
3rd edition, McGraw-Hill, 2003.
3) Silberschatz, Korth and Sudharshan- Data base System Concepts, 6th edition,
Mc-GrawHill, 2010.
4) C.J. Date, A. Kannan, S. Swamynatham- A Introduction to Database Systems,
8th edition, Pearson education, 2006.
14
SDMCET: Syllabus
CS307
Software Engineering
(4-0-0) 4
Course Learning Objectives: This course is at undergraduate level for 48 contact

hours with focus on following learning perspectives:
CLO. 1. Need for a process of software development, complexity of system
development, types of systems and quality requirements.
CLO. 2. Analysis of any problem domain and formulation of requirements and
assessment of quality.
CLO. 3. Contemporary modeling, designing, development & verification and
validation techniques.
CLO. 4. Software project management issues like cost estimation, resource
requirements and project scheduling and tracking, Risk mitigation plan.
Course Outcomes: At the end of the course the student should have an ability to:
CO. 1. Identify various system requirements and build System specification reports
to solve real life problems in various domains and develop domain
expertise.(PO,E,G, Strength of correlation 2/11)
CO. 2. Conceptualize the system through Design and modelling the systems
architecture, components, and processes with quality and standards.
.(PO B,C Strength of correlation 2/11)
CO. 3. Estimate cost and plan resources required to meet desired needs within
realistic constraints. .(PO C Strength of correlation 1/11)
CO. 4. Validate and verify the system. .(PO B Strength of correlation 1/11)
CO. 5. Use the industry relevant tools and properties of programming languages
and engineering techniques of software system development for analysis,
design, development and testing. .(PO K Strength of correlation 1/11)
Prerequisites:
Students must have the knowledge of the following topics:
i. Basics of computer systems and its usage.
ii. Any Computer Programming Language.
Contents:
1) Overview: Introduction: FAQ's about software engineering, Professional and
ethical responsibility. Socio-Technical systems: Emergent system properties;
Systems engineering; Organizations, people and computer systems; Legacy
systems.
2 Hrs.
2) Critical Systems, Software Processes: Critical Systems: A simple safety
critical system; System dependability; Availability and reliability. Software
Processes: Models, Process iteration, Process activities; The Rational Unified
Process; Computer Aided Software Engineering.
4 Hrs.
3) Requirements: Software Requirements: Functional and Nonfunctional
requirements; User requirements; System requirements; Interface specification;
The software requirements document. Requirements Engineering Processes:
15
SDMCET: Syllabus
Feasibility studies; Requirements elicitation and analysis; Requirements
validation; Requirements management.
7 Hrs.
4) System models: System Models: Context models; Behavioral models; Data
models; Object models; Structured methods.
5 Hrs.
5) Software Design: Architectural Design: Architectural design decisions; System
organization; Modular decomposition styles; Control styles. Object-Oriented
design: Objects and Object Classes; An Object-Oriented design process; Design
evolution. UI Design Issues
8 Hrs.
6) Development: Rapid Software Development: Agile methods; Extreme
programming; Rapid application development. Software Evolution: Program
evolution dynamics; Software maintenance; Evolution processes; Legacy system
evolution.
3 Hrs.
7) Verification and Validation: Verification and Validation: Planning; Software
inspections; Automated static analysis; Verification and formal methods. Software
testing: System testing; Component testing; Test case design; Test automation.
Testing Techniques: Equivalence Partitioning, Boundary Value Analysis,, Cause
Effect Graphing,, Test Generation from Predicates, Statement testing, Branch
Testing, Condition Testing, Path Testing, Procedural Call Testing, Data Flow
Testing.
13 Hrs.
8) Project Management: Project Management: Management activities; Project
planning; Project scheduling; Risk management. Configuration Management,
Managing People: Selecting staff; Motivating people; Managing people; The
People Capability Maturity Model. Software Cost Estimation: Productivity;
Estimation techniques; Algorithmic cost modeling, Project duration and staffing.
6 Hrs.
Scope for Self Learning activities:
Guidelines:
Self learning components , if included in teaching learning process by course
teacher, may be based on the following but not limited to the topics listed below
i. Working experience / learning of any industry popular tools through case studies
in understanding software development phases in part or full.
i. Case studies on real-life problem issues.
ii. Solving real-life problems based on design principles.
Books:
1) Ian Sommerville- Software Engineering, 8th Edition, Person Education Ltd.,
2009.
2) Roger.S.Pressman- Software EngineeringA Practitioners approach, 7th Edition,
McGraw-Hill, 2010.
3) Shari Lawrence P fleeger, Joanne M. Atlee- Software Engineering Theory and
Practice, 3rd Edition, Pearson Education, 2009.
4) Waman S Jawadekar- Software Engineering Principles and Practice, Tata
McGraw Hill, 2004.
16
SDMCET: Syllabus
CS309
System Software Laboratory
(0-0-4) 2

CLO1. To acquire the implementation knowledge of System Software concepts
and FAFL grammar concepts through UNIX supported tools Lex and
Yacc.
CLO2. To acquire the knowledge of retrieval of the information in the static files
and manipulate the contents of files using scripting languages
CLO3. Implementation of file handling concepts and process concepts
CLO4. Implement the Concept of Parsers
CLO5. Implement the concepts of System software
CO1. To simulate the different modules of compiler (POb, i)
CO2. To demonstrate the system software module (POb)
CO3. Integration of different system or compiler tasks to produce workable
system model. (PO c, d, e)
CO4. Verify and validate the simulated modules against the existing once.
(POe)
CO5. To implement the concept using existing tools (PO k)
Prerequisites:
1. i) Knowledge of Unix System & Shell Programming ii) C/C++ languages
Course Contents:
1) At least three scripts in Lex and three scripts in Yacc
9 Hrs.
2) At least two shell scripts covering the administrative files handling in UNIX like
knowing number of users in the system and displaying the some user attributes
6 Hrs.
3) At least 2 programs on files using C/C++ and 2 programs on process using
C/C++.
9 Hrs.
4) Any two parser implementation
6 Hrs.
5) Any two concept of operating system.
.
6 Hrs.
17
SDMCET: Syllabus
CS310
DBMS Laboratory
(0-0-4) 2

Contribution to Outcomes:
Preparedness to study independently different application domain, Technology and
programming languages and apply to variety of real time problem scenarios.
( PO A,B,C,D,E & G,H )
Prerequisites: Relation algebra, set theory, data structure.
Course Contents:
Executing minimum ten queries covering all the SQL statements mentioned below:
1)
2)
3)
4)
5)
6)
7)
8)
9)
Drawing E-R diagrams for a given scenario

Mapping E-R model to relational model
Normalising the relational schema to required/desired normal form
Create table
Inserting data
Delete, Drop, Update, Alter table and creating views
Joins and correlated sub queries.
SQL operators & built in functions
PL/SQL: cursors, stored procedures and triggers.
18
SDMCET: Syllabus
VI Semester
CS352
Computer Networks
(4-0-0) 4
Course Learning Objectives: The learning objects of the computer networks are
CLO1. To know various network services and switching networks.
CLO2. To know packet switching and TCP/IP/ATM implementations.
CLO3. To know various network management issue and possible remedies.
CLO4. To know VPN, MPLS operations.
CLO5. To know the overview of adhoc networks and wireless sensor networks.
Course Outcomes: Student should be able to demonstrate:
CO1. The operation of datagram and virtual circuit transmissions.
CO2. Functioning of TCP/IP protocol suit.
CO3. Through knowledge of DHCP, IP protocols, multicast Routing NAT and
mobile IP allocation.
CO4. Functioning of ATM networks
CO5. Operational issues in mobile Adhoc Networks, security sensor networks
and VPNS.
Prerequisites:
Knowledge of data communications
Contents:
1) Packet-Switching Networks 1: Network services and internal network
operations; Packet network topology; Datagrams and virtual circuits; Routing in
packet networks; Shortest-path routing; ATM networks.
8 Hrs.
2) Packet-Switching Networks 2, TCP / IP 1: Traffic management at the
packet level; Traffic management at the flow level; Overview of QOS; Integrated
services QoS; Differentiated services QoS Traffic management at the flowaggregate level. The TCP / IP architecture; The Internet protocol.
12 Hrs.
3) TCP / IP 2 IPv6: User datagram protocol; Transmission control protocol;
Internet routing protocols; Multicast routing; DHCP, NAT, and Mobile IP. 7 Hrs.
4) ATM Networks: Why ATM? BISDN reference model; ATM layer; ATM
adaptation layer; ATM signaling; PNNI routing; Classical IP over ATM.
6 Hrs.
5) Network Management, Security: Network management overview; SNMP;
Structure of Management information; MIB; Remote network monitoring. Security
and cryptographic algorithms; Security protocols; Cryptographic algorithms.
7 Hrs.
6) VPNs, Tunneling, Overlay Networks: Virtual Private Networks; Multiprotocol
Label switching; Overlay networks.
6 Hrs.
7) Mobile Ad-Hoc Networks, Wireless sensor Networks: Overview of wireless
adhoc networks; Routing in adhoc networks; routing protocols for adhoc
networks; security of adhoc networks. Sensor networks and protocol structures;
Communication energy model; Clustering protocols; Routing protocols.
6 Hrs.
19
SDMCET: Syllabus
Refreshing the fundamentals used in data communication and algorithms.
(PO B)
Industry visit to an ISP. (PO C)
Books:
1) Alberto Leon-Garcia and Indra Widjaja- Communication Networks Fundamental
Concepts and Key architectures, 2nd edition, Tata McGraw-Hill, 2004.
2) Nader F. Mir- Computer and Communication Networks, Pearson Education,
2009.
3) Behrouz A. Forouzan- Data Communications and Networking, 4th edition, Tata
McGraw-Hill, 2006.
4) William Stallings- Data and Computer Communication, 8th edition, Pearson
Education, 2007.
20
SDMCET: Syllabus
CS357
Network Programming Laboratory
(0-0-4) 2

CLO1. Understand the Network programming concepts like: IPCs, RPC and RMI.
CLO2. Understand the working of RFC based Application Protocols.
CLO3. Understand the real time network based applications at System level. Ex:
Packet Filters.
Course Outcomes: At the end of this course the student should be able to
CO1. Conceptualize any given network related problem. (PO B,D)
CO2. Students should be able to understand the technical details given in RFCs
for any application. (PO C,D,E)
CO3. Independently implement any application protocol. (PO D,E)
Prerequisites: Knowledge of Computer Networks, C programming language and
Linux OS.
Contents:
Part A
Network observations using tcpdump / wireshark (3 to 4 experiments):
Packet capturing, observing the headers, noting the IP address within and outside
the LANs, ping services, ICMP packets etc.,
Part B
Designing and implementing networks using NS2/NS3 Simulators (5 to 6
experiments):
Designing a network with various node and line properties and observing the
network behavior, buffer capacity designs, flow and congestion control experiments.
Part C
Socket programming (IPC/RPC) and implementation of any ONE network protocols
Based on RFCs.
Evaluation Procedure:
i. Continuous Internal Assessment is based correct implementation of the
algorithms given above in the regular laboratory slots.
ii. End Semester examination is based on the proper understanding of all
implementation during regular laboratory slots and demonstration of all
applications implemented.
Exposure to network simulators. (PO D,E)
Books:
W. Richard Stevens, Bill Fenner, Andrew M Rudoff Unix Network Programming
21
SDMCET: Syllabus
CS353
Mini Project
(0-0-8) 4

Though the Specific objectives of this course depends on the Project chosen, below
the generic objectives of this course;
CLO1. Demonstrate through involvement in a team project the central elements
of team building and team management.
CLO2. Prepare a project plan for a software project that includes estimates of
size and effort, a schedule, resource allocation, configuration control,
change management, and project risk identification and management.
CLO3. Indicate an approach to risk that will help to secure the on-time delivery of
software.
CLO4. Compare and contrast the different methods and techniques used to
assure the quality of a software product.
Contribution to Outcomes:
CO1. Preparedness to study independently any other Domain, Technology and
programming languages and apply to variety of real time problem
scenarios. PO A,B,C,D,E & G,H )
Prerequisites: CS208, CS210, CS205, CS259, CS307, CS306

Guidelines for Conduction
Spirit of The Course: To ensure that graduates can successfully apply the
knowledge they have gained through a project demonstrates the practical
application of principles learned in different courses and forces students to integrate
material learned at different stages of the curriculum up to the 6th semester; also
appreciating the need for domain knowledge for certain applications, and that this
may necessitate study within that domain.
1. Student Form a Team. Size f the team can vary from 2 to 3. With genuine
explanation bigger or smaller is team is allowed.
2. Guide for this course is must and will be chosen by team itself by interacting
with faculty.
3. In consultation with Guide, Team will prepare the project plan and its specific
outcomes, which Team promises/declares to accomplish.
4. Grading is done by the Guide; which are to be justified to the DUGC's Grade
Committee.
5. It is Non Vacation Course, with willingness of Guide and Team; it can be
extended during vacations. But this course is mandatory prerequisite for
CS451, hence the results to be declared by the beginning of the 7th Semester.
6. Project Report; A Course closure document outlining the problems,
specifications, including the survey of literature, various results obtained,
solutions and the problems faced deviation from the promised milestones,
22
SDMCET: Syllabus
testing report, user manual, appendix reference etc is expected to be
produced by each team of project.
7. Demonstration, seminar, quiz, tests, Viva-Voce, publications, Reports can be
used for the evaluation. If the Guide wishes, he can form his own examination
body for evaluation.
8. There can be designated Committee to monitor this process of Mini Project.
23
SDMCET: Syllabus
CS358
Computer Graphics
(4-0-2) 5

CLO 1. Understand the basics of Computer Graphics and its Architecture
CLO 2. Identify the challenges that exist in moving from 2D to 3D and vice-versa.
CLO 3. Understand how transformations of objects are carried out in graphics.
CLO 4. Identify good design principles and solve the challenges involved in simulating
real world objects/ conditions using graphics.
CLO 5. Learn and apply the aspects of interaction with computer.
CLO 6. Exposure to open sources like OpenGL.
CO 1. Apply the principles of Computer Graphics Architecture PO->A, C, E
for good design.
CO 2. Use OpenGL API and understand the importance of PO-> I, K
Open sources.
CO 3. Understand and apply various input interaction PO->B, K
strategies.
CO 4. Understand the various implementation strategies for PO->A, B, C, E
2D and 3D primitives to solve the challenges involved in
simulating real world objects/ conditions using graphics.
CO 5. Understand how transformations of objects are carried PO->A, B, E
out in graphics and application of the same in
simulating real world objects/conditions.
CO 6. Discriminate the views of object in parallel and PO->A, B, K
perspective projections in various lighting conductions.
CO 7. Understand and implement various scan conversion PO->A, B
algorithms.
Prerequisites:
1. Basic knowledge of Engineering Graphics
2. Knowledge of Scalars, Vectors, Matrices(Linear Algebra)
3. Knowledge of Algorithms and basic programming.
Course Contents:
1) Introduction : Applications of computer graphics; A graphics system; Images:
Physical and synthetic; Imaging systems; The synthetic camera model; The
programmers interface; Graphics architectures; Programmable pipelines;
Performance characteristics. Graphics Programming: The Sierpinski gasket;
Programming two dimensional applications.
6 Hrs.
2) The OpenGL : The OpenGL API; Primitives and attributes; Color; Viewing;
Control functions; The Gasket program; Polygons and recursion; The three
dimensional gasket; Plotting implicit functions.
7 Hrs.
3) Input and Interaction: Interaction; Input devices; Clients and servers; Display
lists; Display lists and modeling; Programming event-driven input; Menus;
24
SDMCET: Syllabus
4)
5)
6)
7)
Picking; A simple CAD program; Building interactive models; Animating

interactive programs; Design of interactive programs; Logic operations.
8 Hrs.
Geometric Objects and Transformations -1: Scalars, points, and vectors;
Three-dimensional primitives; Coordinate systems and frames; Modeling a
colored cube; Affine transformations; Rotation, translation and scaling.
6 Hrs.
Geometric Objects and Transformations 2: Transformations in
homogeneous coordinates; Concatenation of transformations; OpenGL
transformation matrices; Interfaces to three-dimensional applications.
6 Hrs.
Viewing and Lighting : Classical and computer viewing; Viewing with a
computer; Positioning of the camera; Simple projections; Projections in OpenGL;
Hidden surface removal; Parallel-projection matrices; Perspective-projection
matrices; Lighting and Shading: Light and matter; Light sources; The Phong
lighting model; Light sources in OpenGL; Specification of materials in OpenGL.
7 Hrs.
Basic Raster Graphics Algorithms for drawing 2D primitives : Scan
converting lines, circles, ellipses; Filling Rectangles, Polygons, Ellipse arcs;
Pattern Filling; Thick Primitives; Clipping in a raster world; Clipping lines, ellipses,
circles, polygons; Anti-aliasing.
8 Hrs.

Use of case tools like Open GL and X windows systems. (PO B, D)
Books:
1) Edward Angel- Interactive Computer Graphics A Top-Down Approach with
OpenGL, 5th edition, Addison-Wesley, 2008.
2) James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes- Computer
Graphics, Addison-Wesley 1997.
Reference Books:
1) F.S. Hill,Jr.- Computer Graphics Using OpenGL 2nd edition, Pearson education,
2001.
2) Donald Hearn and Pauline Baker- Computer Graphics- OpenGL Version, 2nd
edition, Pearson Education, 2003.
25
SDMCET: Syllabus
CS355
Object Oriented System Modeling and Design
(4-0-0) 4

This course is at undergraduate level for 48 contact hours with focus on following
learning perspectives:
CLO 1. Object-oriented paradigm: Sound understanding of fundamental concepts
and historical evolution of object model.
CLO 2. Design notations, principles, analysis and design of system using Object
Models, standard architecture and patterns:
CLO 3. Applications of object-oriented analysis and design concepts and principles:
Course Outcomes: At the end of the course the student should have ability to:
CO 1. Understand and apply the fundamental object oriented (OO) concepts. (PO
A, Strength of correlation COPO is 1/11)
CO 2. Map and realize the OO model in any OO language. (PO K, Strength of
correlation COPO is 1/11)
CO 3. Analyze given any problem scenario and identify: classes/ Objects, their
properties and associations. (PO C, E, Strength of correlation COPO is
2/11)
CO 4. Analyze given any problem scenario and design / model using UML: Use case
diagram, activity diagram for all basic and alternative flow for each use case,
Class diagram with properties, Sequence diagram and state diagrams. (PO
C, E, Strength of correlation COPO is 2/11)
CO 5. Analyze a given any problem scenario and design / model using other
traditional design strategies. (PO C, E, Strength of correlation COPO is
2/11)
CO 6. Assess the quality of OO system in-terms of: Cohesion, coupling, sufficiency,
completeness and primitiveness and other traditional quality dimensions
(PO B, C , Strength of correlation COPO is 2/11)
CO 7. Use various architecture and design patterns in system development. (PO E
, Strength of correlation COPO is 1/11)
Prerequisites:
1. Exposure to any object oriented Programming Language.
2. Software Engineering
Contents:
1) Introduction, modeling concepts, class modeling: Object Orientation,
developments themes; Evidence for usefulness of developments; 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.
6 Hrs.
26
SDMCET: Syllabus
2) Advanced class modeling, state modeling: Advanced object and class
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.
6 Hrs.
3) Advanced state modeling, interaction modeling: advance 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.
8 Hrs.
4) Architectural patterns -1: introduction;layers, pipes and filters,blackboard.
4 Hrs.
5) Architectural patterns - 2: distributed systems: broker; interactive systems: mvc,
presentation-abstraction-control.
6 Hrs.
6) Architectural patterns - 3: adaptable systems: microkernel; reflection. 6 Hrs.
7)Design patterns: structural decomposition: whole - part; organization of work:
master - slave; access control: proxy. Management: Command Processor, View
Handler; Communication: Forward-Receiver, Client-Dispatch-Server, PublishSubscriber
6 Hrs.
8)Quality: functionality and architecture; architecture and quality attributes; system
quality attributes; Quality attribute scenarios in practice; Other system quality
attributes; Business qualities; Architecture qualities. Achieving Quality:
Introducing tactics; Availability tactics; Modifiability tactics; Performance tactics;
Security tactics; Testability tactics; Usability tactics; Relationship of tactics to
architectural patterns; Architectural patterns and styles.
6 Hrs.
Scope for Self Learning activities:
Guidelines:
Self-learning components, if included in teaching learning process by course
teacher, may be based on the following but not limited to the topics listed below
1) Working experience / learning of any industry popular tools through case
studies in understanding software development phases in part or full.
2) Case studies on real-life problem issues.
3) Solving real-life problems based on design principles.
Books:
1) Grady Booch et ai- Object-Oriented Analysis and Design with Applications, 3'd
2) Ali Bahrami- Object oriented systems development, McGrawHill, 1999.
3) Michael Blaha, James Rumbaugh- Object-Oriented Modeling and Design with
UML, 2nd Edition, Pearson Education, 2005.
4) Len Bass, Paul Clements, Rick Kazman- Software Architecture in Practice, 2nd
5) Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael
Stal- Pattern-Oriented Software Architecture, A System of Patterns Volume 1,
27
SDMCET: Syllabus
John Wiley and Sons, 2006.
6) Mary Shaw and David Garlan- Software ArchitecturePerspectives on an
Emerging Discipline, Prentice-Hall of India, 2007.
28
SDMCET: Syllabus
ELECTIVES
CS370
System Modeling and Simulation
(4-0-0) 4

CLO1. Developing numeracy and quantitative skills including data analysis,
interpretation and extrapolation.
CLO2. Modeling dynamic aspects of business for assisting in the process of
strategic change.
CLO3. Ability to extract external key features of business situation into a model.
CLO4. Using simulation to model business process.
CO1. Outline the usefulness of system modeling of simulation. (POA, C)
CO2. Describe and apply the mathematical equations for modeling the behavior
of the given system in different business processes. (PO A, B, C, E)
CO3. Use a range of manual process to model and simulate the given systems.
(PO A, B, C, E)
CO4. Demonstrate understanding of the underlying assumptions and
implications of simulation approaches (PO A, C, K)
CO5. Create dynamic models of processes in a case study based organizational
context (PO A, C, K)
CO6. Verify, validate and optimize a system via simulation (PO A, B, C, H)
Prerequisites:
Knowledge of Probability and statistics
Course Contents:
1) Introduction: 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; Discrete-Event
System Simulation; Steps in a Simulation Study. Simulation examples:
Simulation of queuing systems; Simulation of inventory systems; other examples
of simulation.
10Hrs.
2) General Principles, Simulation Software: Concepts in Discrete-Event
Simulation: The Event-Scheduling I Time-Advance Algorithm, World Views,
Manual simulation Using Event Scheduling; List processing.
6Hrs.
3) Statistical Models In Simulation: Review oftenninology and concepts; Useful
statistical models; Discrete distributions; Continuous distributions; Poisson
process; Empirical distributions.
6Hrs.
4) Queuing Models: Characteristics of queuing systems; Queuing notation; Longrun measures of performance of queuing systems; Steady state behavior of MlGII
queue; Networks of queues.
5Hrs.
5) Random-Number Generation, Random-Variate Generation: Properties of
random numbers; Generation of pseudorandom numbers; Techniques for
generating random numbers; Tests for Random Numbers. Random- Variate
29
SDMCET: Syllabus
Generation: Inverse transfonn technique; Acceptance-Rejection technique;
Special properties.
8 Hrs.
6) Input Modeling: Data Collection; Identifying the distribution with data; Parameter
estimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process;
selecting input models without data; Multivariate and Time-Series input models.
5 Hrs.
7) Output Analysis For A Single Model: Types of simulations with respect to
output analysis; stochastic nature of output data; Measures of performance and
their estimation; Output analysis for terminating simulations; Output analysis for
steady-state simulations.
6 Hrs.
8) Verification and Validation of Simulation Models, Optimization: Model
building, verification and validation; Verification of simulation models; Calibration
and validation of models. Optimization via Simulation.
6 Hrs.
Exposure to some Network simulators and the use of results produced by them.
(PO B)
Books:
1) Banks, John S. Carson II, Barry L. Nelson- David M. Nicol, Discrete-Event
System Simulation, Jerry 4th edition, Pearson Education, 2009.
2) Lawrence M. Discrete - Event Simulation: A First Course
3) Leemis, Stephen K. Park, Pearson Education! Prentice-Hall India, 2006.
4) Simulation - Sheldon M. Ross, 4th edition, Elsevier, 2006.
30
SDMCET: Syllabus
CS373
Pattern Recognition
(4-0-0) 4

The objective of this course is to enable the students to understand the
fundamentals of
CLO1. Pattern recognition. The students should learn to choose an appropriate
feature.
CLO2. pattern classification algorithm for a pattern recognition problem, properly
implement the algorithm using modern computing tools such as Matlab,
OpenCV, C, C++.
CLO3. Analyze, and report the results using proper technical terminology
CO1. Understand the nature and inherent difficulties of the pattern recognition
problems. (PO A)
CO2. Understand concepts, trade-offs, and appropriateness of the different
feature types and classification techniques such as Bayesian, maximumlikelihood, etc. (PO B)
CO3. Select a suitable classification process, features, and proper classifier to
address a desired pattern recognition problem. (PO C)
CO4. Demonstrate algorithm implementation skills using available resources
and be able to properly interpret and communicate the results clearly and
concisely using pattern recognition terminology.(PO D,G)
Prerequisites:
Student should have the knowledge of Algorithms
Course Contents:
1) Introduction: Machine perception, an example; Pattern Recognition System;
The Design Cycle; Learning and Adaptation.
6 Hrs.
2) Bayesian Decision Theory: Introduction, Bayesian Decision Theory;
Continuous Features, Minimum error rate, classification, classifiers, discriminant
functions, and decision surfaces; The normal density; Discriminant functions for
the normal density.
6 Hrs.
3) Maximum-Likelihood And Bayesian Parameter Estimation: Introduction;
maximum-likelihood estimation; Bayesian Estimation; Bayesian parameter
estimation: Gaussian Case, general theory; Hidden Markov Models.
6 Hrs.
4) Non-Parametric Techniques: Introduction; Density Estimation; Parzen
windows; kn Nearest- Neighbor Estimation; The Nearest- Neighbor Rule; Metrics
and Nearest-Neighbor Classification.
6 Hrs.
5) Linear Discriminant Functions: Introduction; Linear Discriminant Functions and
Decision Surfaces; Generalized Linear Discriminant Functions; The TwoCategory Linearly Separable case; Minimizing the Perception Criterion Functions;
Relaxation Procedures; Nonseparable Behavior; Minimum Squared-Error
procedures; The Ho-Kashyap procedures.
6 Hrs.
31
SDMCET: Syllabus
6) Stochastic Methods: Introduction; Stochastic Search; Boltzmann Learning;
Boltzmann Networks and Graphical Models; Evolutionary Methods.
6 Hrs.
7) Non-Metric Methods: Introduction; Decision Trees; CART; Other Tree Methods;
Recognition with Strings; Grammatical Methods.
6 Hrs.
8) Unsupervised Learning And Clustering: Introduction; Mixture Densities and
Identifiably; Maximum-Likelihood Estimates; Application to Normal Mixtures;
Unsupervised Bayesian Learning; Data Description and Clustering; Criterion
Functions for Clustering.
6 Hrs.
Books:
1) Richard O. Duda, Peter E. Hart, and David G.Stork- Pattern Classification, 2nd
Edition, Wiley-Interscience, 2001.
2) Earl Gose, Richard Johnsonbaugh, Steve Jost- Pattern Recognition and Image
Analysis - Pearson Education, 2007.
32
SDMCET: Syllabus
CS374
Digital Image Processing
(4-0-0) 4

CLO1. To learn fundamental theories and techniques of digital image processing.
CLO2. Have the skill base necessary to further explore advanced topics of digital
image processing.
CO1. Appreciate the fundamentals of DIP including filtering, transforms,
morphology, image analysis. (POA, B, E)
CO2. Implement basic image processing algorithms using different tools such as
MATLAB, Java.(PO->K)
CO3. Explore advanced topics of Digital Image Processing.(PO->A, B, E)
CO4. Make a positive professional contribution in the field of Digial Image
Processing.(PO->F)
Prerequisites:
Basics of statistics, Linear Algebra
Course Contents:
1) Digital Image Fundamentals - Introduction, Applications, Fundamental Steps
in Digital Image Processing, Elements of visual perception, Image sensing and
acquisition, Image Sampling and Quantization, Basic relationships between
pixels.
8 Hrs.
2) Intensity Transformations and Spatial Filtering - Basic Intensity
Transformation Functions, Histogram Processing; Fundamentals of Spatial
Filtering., Smoothing and Sharpening Spatial filters.
8 Hrs.
3) Filtering in the Frequency Domain - The Discrete Fourier Transform ( one
variable and two variables), Basics of Filtering in the Frequency Domain, Image
Smoothing and Sharpening Using Frequency Domain Filters.
8 Hrs.
4) Morphological Image Processing - Erosion and Dilation, Opening and Closing,
Hit or Miss Transforms, Basic Morphological Algorithms, Gray Scale
Morphology.
8 Hrs.
5) Image Segmentation - Point, Line, and Edge Detection, Thresholding, RegionBased Segmentation, Segmentation Using Morphological Watersheds.
8 Hrs.
6) Representation and Description - Image Representation, Boundary and
Regional Descriptors.
8 Hrs.
Books:
1) Rafel C Gonzalez and Richard E Woods, Digital Image Processing, 3rdEdition,
Pearson Education, 2009
2) Rafel C Gonzalez and Richard E Woods, Digital Image Processing Using
Mathlab, 2rd Edition, Pearson Education,
33
SDMCET: Syllabus
3) Milan Sonka, Vaclav Hlavac and Roger Boyle, Image Processing, Analysis and
Machine Vision, 2nd Ed, Thomoson Learning, Brooks/Cole, 2001
4) Anil K Jain, Fundamentals of Digital Image Processing, Prentice-Hall of India
Pvt. Ltd., 1997.
5) B.Chanda ,DDuttaMajumder, Digital Image Processing and Analysis, PrenticeHall, India, 2002.
34
SDMCET: Syllabus
CS375
Advanced Data Structures and Algorithms
(4-0-0) 4

CLO1. Use the potential method to provide an amortized analysis of previously
unseen data structure, given the potential function.
CLO2. Explain why competitive analysis is an appropriate measure for online
algorithms.
CLO3. Explain the use of randomization in the design of an algorithm for a
problem where a deterministic algorithm is unknown or much more
difficult.
CLO4. Design and implement a dynamic programming solution to a problem.
CO1. Visualize and interpret the domain of problem (POACD)
CO2. Appling the concepts learnt in different domains like networking and in the
heterogeneous systems. (POACD)
CO3. Comparison and Validations by adopting different algorithms using more
complex data structures for heterogeneous applications (POE)
Prerequisites: CS100/150, CS207, CS200
Course Contents:
1) Complexity Analysis & Elementary Data Structures: Asymptotic notations,
Properties of big oh notation, asymptotic notation with several parameters,
conditional asymptotic notation, amortized analysis, Npcompleteness, NP-hard.
5 Hrs.
2) Sorting revisited: Shell sort, Bucket Sort, Radix Sorting with Analysis for all
algorithms.
6 Hrs.
3) Heap Structures: Binomial heaps, Fibonacci heaps, skew heaps, Lazy-binomial
heaps.
6 Hrs.
4) Search Structures 2-3 trees, 2-3-4 trees, Red-black trees, Btrees, splay trees,
Multi way Search trees.
7 Hrs.
5) Hashing: Hashing Functions and Record Distribution, Usage of Extra Memory.
Collision resolution by progressive overflow Buckets, Making deletions, other
collision resolution techniques, Patterns of record access. Skip List
6 Hrs.
6) Extendable Hashing: Working of Extendible Hashing, Implementation, Deletion,
Extendible Hashing Performance, Alternative Approaches.
6 Hrs.
7) String Matching: Naive algorithm; Robin-karp algorithm; String matching with
Finite automata, Knuth-Morris-Pratt algorithms. Pattern Matching Algorithms with
Tries.
6 Hrs.
8) Applications: Huffman coding, Garbage collection and compaction, Topological
sort, Mincut maxflow algorithm, Activity networks, Set representation, Set union
and find operations, Counting binary trees.
7 Hrs.
35
SDMCET: Syllabus
Exposure to various design patterns used in the algorithmic techniques used in the
real time. (PO-> C, D)
Books:
1) E. Horowitz, S.Sahni and Dinesh Mehta- Fundamentals of Data structures in
C++, Galgotia, 2006.
2) Adam Drozdex- Data Structures and algorithms in C++, Third edition, Thomson
learning Vikas publishing house, 2005.
3) G. Brassard and P. Bratley, Algorithmics- Theory and Practice, Printice Hall,
1988.
4) Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest-Introduction
toAlgorithms, Second edition, PHI 2003.
36
SDMCET: Syllabus
CS377
Artificial Intelligence
(4-0-0) 4

Course Learning Objective
CLO. 1. To provide a strong foundation of fundamental concepts in Artificial
Intelligence
CLO. 2. To enable the student understand and appreciate the different agents and
their environments and decision making.
CLO. 3. To Provide different line of thoughts in decision making in presence of
uncertainty.
CLO. 4. To enable the student to have verity techniques with respect to reasoning
and learning.
1) Introduction: Intelligent Agents Agents and environments - Good behavior
The nature of environments structure of agents - Problem Solving - problem
solving agents searching for solutions uniformed search strategies - avoiding
repeated states searching with partial information.
6 Hrs.
2) Knowledge Representation: First order logic representation revisited
Syntax and semantics for first order logic Using first order logic Knowledge
engineering in first order logic - Inference in First order logic prepositional
versus first order logic unification and lifting forward chaining backward
chaining - Resolution
6 Hrs.
3) Uncertainty: Acting under Uncertainty, Handling uncertain knowledge, Design
for a decision-theoretic agent, Basic Probability Notation, Prior probability,
Conditional probability, The Axioms of Probability, Why the axioms of probability
are reasonable, Joint probability distribution to represent the knowledge.
Inferences in Joint probability distribution and its complexity. Bayes' Rule and Its
Use, Applying Bayes' rule, Normalization, Using Bayes' rule: Combining
evidence.
10 Hrs.
4) Probabilistic Reasoning Systems: Representing Knowledge in an Uncertain
Domain, Semantics of Bayesian Networks Efficient Representation of Conditional
Distributions, Exact Inference in Bayesian Networks Approximate Inference in
Bayesian Networks, Relational and First-Order Probability Models Other
Approaches to Uncertain Reasoning.
10 Hrs.
5) Probabilistic Reasoning over Time: Time and Uncertainty, Inference in
Temporal Models, Hidden Markov Models, Kalman Filters, Dynamic Bayesian
Networks.
6 Hrs.
6) Learning: Learning from observations - forms of learning - Inductive learning Learning decision trees - Ensemble learning - Knowledge in learning Logical
formulation of learning Explanation based learning Learning using relevant
information Inductive logic programming - Statistical learning methods Learning with complete data - Learning with hidden variable - EM algorithm Instance based learning - Neural networks - Reinforcement learning Passive
reinforcement learning - Active reinforcement learning - Generalization in
reinforcement learning.
10 Hrs.
37
SDMCET: Syllabus
Books:
1. Stuart Russell, Peter Norvig, Artificial Intelligence A Modern Approach, 2nd
Edition, Pearson Education / Prentice Hall of India, 2004.
2. Nils J. Nilsson, Artificial Intelligence: A new Synthesis, Harcourt Asia Pvt.
Ltd.,
2000.
Elaine Rich and Kevin Knight, Artificial Intelligence, 2nd Edition, Tata
McGraw-Hill, 2003.
3. George F. Luger, Artificial Intelligence-Structures And Strategies For
Complex Problem Solving, Pearson Education / PHI, 2002
38
SDMCET: Syllabus
CS378
Data Compression
(4-0-0) 4

CLO1. Summarize the basic characteristics of sampling and quantization for digital
representation.
CLO2. Select, giving reasons that are sensitive to the specific application and
particular circumstances, the most appropriate compression techniques for
text, audio, image, and video information.
CLO3. Explain the asymmetric property of compression and decompression
algorithms.
CLO4. Illustrate the concept of run-length encoding.
CO 1. Understand the mathematical model and algorithms for compression
(PO>A,E)
CO 2. Understand the basic concepts of Compression on lossless and lossy
(PO-> B)
CO 3. Applying engineering techniques, transforming the raw data for engineering
solutions. (PO->H, J)
CO 4. An ability to use the techniques like video compression in communication.
(CO->I, K)
CO 5. The compression on image and video can be applied to communication that
can solve the communication issues like bandwidth usage, packetloss.
(PO->C,D)
Prerequisites:
Course Contents:
1) Introduction, Lossless Compression -1: Compression techniques; Modeling
and coding. Mathematical preliminaries for lossless compression: Minimum
description length principle. Huffman coding: Overview; the Huffman coding
algorithm, Minimum variance Huffman codes; Application of Huffman coding for
text compression.
6 Hrs.
2) Lossless Compression 2: Dictionary Techniques: Overview; Introduction;
Static dictionary; Adaptive dictionary; Applications: UNIX compress, GIF, PNG,
V.42. Lossless image compression: Overview; Introduction; Basics; CALIC;
JPEG-LS; Multiresoution approaches; Facsimile encoding: Run-length coding,
T.4 and T.6.
5 Hrs.
3) Basics of Lossy Coding: Some mathematical concepts: Overview; Introduction;
Distortion criteria; Models. Scalar quantization: Overview; Introduction; The
quantization problem; Uniform quantizer; Adaptive quantization.
5 Hrs.
4) Vector Quantization, Differential Encoding: Vector quantization: Overview;
Introduction; Advantages of vector quantization over scalar quantization; The
LBG algorithm. Differential Encoding: Overview; Introduction; The basic
39
SDMCET: Syllabus
5)
6)
7)
8)
algorithm; Prediction in DPCM; Adaptive DPCM; Delta modulation; Speech

coding; Image coding.
6 Hrs.
Some Mathematical Concepts, Transform coding: Discrete Fourier transform;
Z-transform. Transform coding: Overview; introduction; the transform; Transforms
of interest; Quantization and coding for transform coefficients; Application to
image compression JPEG; Application to audio compression MDCT. 7 Hrs.
Subband Coding, Audio Coding: Subband Coding: Overview; introduction;
Filters; The basic Subband coding algorithm; Bit allocation; Application to speech
coding G.722; Application to audio coding MPEG audio; Application to image
compression. Audio Coding: Overview; Introduction; MPEG audio coding; MPEG
advanced audio coding; Dolby AC3; Other standards
6 Hrs.
Wavelet-Based Compression :Overview; Introduction; Wavelets; Multiresoution
and the scaling function; Implementation using Filters; Image compression;
Embedded zero tree coder; Set partitioning in hierarchical trees; JPEG 2000.
6 Hrs.
Video Compression 7: Overview; Introduction; Motion compensation; Video
signal representation; H.261; Model-based coding; Asymmetric applications;
MPEG-1 and MPEG-2; H.263; H.264, MPEG-4 and advanced video coding;
Packet video.
7 Hrs.
Books:
1) Khalid Sayood- Introduction to Data Compression, 3rd edition, Elsevier, 2006.
2) D. Salomon- Data Compression: The Complete Reference, Springer, 4th edition
2007.
40
SDMCET: Syllabus
CS379
File Structures
(4-0-0) 4

CLO1. Summarize the full range of considerations that support file systems.
CLO2. Compare and contrast different approaches of file organization,
recognizing the strengths and weaknesses of each.
CLO3. Explain the concepts of records, record types, and files, as well as the
different techniques for placing file records on disk.
CLO4. Give examples of the application of primary, secondary, and clustering
indexes.
CLO5. Distinguish between a nondense index and a dense index.
CLO6. Implement dynamic multilevel indexes using B-trees.
CLO7. Explain the theory and application of internal and external hashing
techniques.
CLO8. Describe the relationships among hashing, compression, and efficient
database searches.
CLO9. Evaluate costs and benefits of various hashing schemes.
CO1. Explain the importance of file structures in the Data Storage and
Manipulation. (PO A,B)
CO2. Show how, various kinds of secondary storage devices store data. (PO
B,C,D)
CO3. Show how the File Structure approach differs from the data base
approach. (PO B,C)
CO4. Know the low level aspects of file manipulation. (PO B)
CO5. Know the importance of data compression. (PO B)
CO6. Know some of the high-level file structures tools and recognize the
difference between various indexing techniques. (PO B,E)
CO7. Implement some of the learned techniques and concepts using C++ for
solving various file management problems. (PO B,C)
Prerequisites: Students must have the prerequisite knowledge on the following
topics:
Knowledge of C++ to implement the basic file operations.

Course Contents:
1) Introduction: File Structures: The Heart of the file structure Design, A
Conceptual Toolkit; Fundamental File Operations: Physical Files and Logical
Files, Opening Files, Closing Files, Reading and Writing, Seeking, Special
Characters, The Unix Directory Structure, Physical devices and Logical Files,
File-related Header Files, UNIX file System Commands; Buffer Management,
Input /Output in UNIX.
6 Hrs.
2) Fundamental File Structure Concepts, Managing Files of Records: Field and
Record Organization, Using Classes to Manipulate Buffers, Using Inheritance for
Record Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An ObjectIII Year B.E. (CSE): 2014 - 15
41
SDMCET: Syllabus
3)
4)
5)
6)
7)
8)
Oriented Class for Record Files, Record Access, More about Record Structures,
Encapsulating Record Operations in a Single Class, File Access and File
Organization.
6 Hrs.
Organization of Files for Performance, Indexing: Data Compression,
Reclaiming Space in files, Internal Sorting and Binary Searching, Key sorting;
Index: Introduction, A Simple Index for Entry- Sequenced File, Object-Oriented
support for Indexed, Entry-Sequenced Files of Data Objects, Indexes that are too
large to hold in Memory, Indexing to provide access by Multiple keys, Retrieval
Using Combinations of Secondary Keys.
6 Hrs.
Consequential Processing and The Sorting of Large Files: A Model for
Implementing Consequential Processes, Application of the Model to a General
Ledger Program, Extension of the Model to include Multi-way Merging, A Second
Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk.
6 Hrs.
Multilevel indexing and B-Trees: The invention of B-Tree, Statement of the
problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees,
Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees, BTree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case
Search Depth, Deletion, Merging and Redistribution, Redistribution during
insertion; B* Trees.
7 Hrs.
Indexed Sequential File access and Prefix B + Trees: Indexed Sequential
Access, Maintaining a Sequence Set, Adding a Simple Index to the Sequence
Set, The Content of the Index: Separators Instead of Keys, The Simple Prefix B+
Tree and its maintenance, Index Set Block Size, Internal Structure of Index Set
Blocks: A Variable-order B- Tree, Loading a Simple Prefix B+ Trees, B-Trees, B+
Trees and Simple Prefix B+ Trees in Perspective.
6 Hrs.
HASHING: Introduction, A Simple Hashing Algorithm, Hashing Functions and
Record Distribution, Collision resolution by progressive overflow, Buckets. 6 Hrs.
Case Studies on Win X-32 and EXT4
5 Hrs.

Refreshing the fundamentals used in data structures and algorithms. (PO B)
Working of Hard disks and other storage devices.
Books:
1) Michael J. Folk, Bill Zoellick, Greg Riccardi- File Structures-An Object Oriented
Approach with C++ -, 3rd edition, Addison-Wesley.
2) K.R. Venugopal, K.G. Srinivas, P.M. Krishnaraj- File Structures Using C++, Tata
McGraw-Hill, 2009.
3) Scot Robert Ladd- C++ Components and Algorithms, BPB Publications, 1993.
4) Raghu Ramakrishan and Johannes Gehrke- Database Management Systems,
3rd edition, McGraw Hill, 2003.
42
SDMCET: Syllabus
CS380
Signals And Systems
(4-0-0) 4

CLO1. Systems and their properties
CLO2. Signals and basic operations on signals
CLO3. Time domain representations of systems
CLO4. Fourier Representation of Signals.
CLO5. Applications of FT and Z Transformations for signal processing
CO1. Characterize a system and a signal.(PO A,B)
CO2. Mathematical modeling of signals and systems. (PO B,C)
CO3. Helps in transforming the representations from one model to another
model. (PO C)
Prerequisites:
Knowledge of series and signal
Course Contents:
1) Introduction: Definitions of a signal and a system; Classification of signals;
Basic operations on signals; Elementary signals.
6 Hrs.
2) Systems, Time-domain representations: Systems viewed as interconnections
of operations; Properties of systems; Convolution; Impulse response
representation; Properties of impulse response representation.
6Hrs.
3) Time domain representation: Differential and difference equation
representations; Block diagram representations.
6 Hrs.
4) Fourier Representation: Fourier representation: Introduction; Fourier
representations for four signal classes; Orthogonality of complex sinusoidal
signals.
6 Hrs.
5) Fourier Representation: DTFS representations; Continuous-tine Fourierseries representations; DTFT and FT representations; Properties of Fourier
representations.
6 Hrs.
6) Application of Fourier representations: Frequency response of LTI systems;
Solution of differential and difference equations using system function.
6 Hrs.
7) Applications of Fourier Representations, Z-Transforms: Fourier transform
representations for periodic signals; Sampling of continuous time signals and
signal reconstruction. Introduction to Z-transform; Properties of ROC; Properties
of Z-transforms; Inversion of Z-transforms.
6 Hrs.
8) Z Transforms: Transforms analysis of LTI systems; Transfer function; Stability
and causality; Unilateral Z-transforms and its application to solve difference
equations.
6 Hrs
Knowledge exposure of Fourier and Laplace Transform (PO B)
Books:
43
SDMCET: Syllabus
1) Simon Haykin and Barry Van Veen- Signals and Systems, John Wiley and Sons,
2001, Reprint 2002.
2) Alan V. Oppenheim, Alan S. Willsky and S. Hamid Nawab- Signals and Systems,
Pearson Education Asia, 2nd edition, 1997, Indian reprint 2002.
3) Dr. D.ganesh Rao and Satish Tunga- Signals and Systems - A Simplified
Approach, Sanguine Technical Publishers, 2003-04.
44
SDMCET: Syllabus
CS381
Game Theory
(4-0-0) 4
Course Learning Objectives: At the end of the course, the student should
understand:
CLO1. Various basic group-theoretic concepts and application in various
domains.
CLO2. The strategic behavior among parties having opposed, mixed or similar
interests.
CLO3. To recognize and model strategic situations, to predict when and how
actions of one person will influence the decisions of others and to exploit
strategic situations for the benefit.
CLO4. To apply game-theoretic analysis, formally and intuitively, to negotiation
and bargaining situations.
CLO5. To identify open problems and opportunities for future research, as well as
potential, novel application domains.
CO1. Model many real-life situations using game theory and design solutions
(mechanisms, algorithms, protocols etc) that are robust even in the
presence of self-centered entities. (PO->C,A)
CO2. To construct strategic game with soft information on a market or a
situation.((PO->A,E))
CO3. To find the equilibrium of outcomes of simple games including the use of
backward induction.
CO4. Use their knowledge of game theory in a wide variety of economics
applications.(PO->G,H)
Prerequisites:
Knowledge of algorithms and strategies
Course Contents:
1) Introduction; Strategic Games: What is game theory? The theory of rational
choice; Interacting decision makers. Strategic games; Example: The prisoners
dilemma; Nash equilibrium; Examples of Nash equilibrium; Best-response
functions; Dominated actions; Equilibrium in a single population: symmetric
games and symmetric equilibria.
6 Hrs.
2) Mixed Strategy Equilibrium: Introduction; Strategic games in which players
may randomize; Mixed strategy Nash equilibrium; Dominated actions; Pure
equilibria when randomization is allowed, illustration; Equilibrium in a single
population, illustration; The formation of players beliefs; Extensions;
Representing preferences by expected payoffs.
6 Hrs.
3) Extensive Games: Extensive games with perfect information; Strategies and
outcomes; Nash equilibrium; Subgame perfect equilibrium; Finding subgame
perfect equilibria of finite horizon games.
5 Hrs.
4) Extensive Games: Extensions, Coalitional Games And The Core:
Extensions: Allowing for simultaneous moves, illustration: entry in to a
45
SDMCET: Syllabus
5)
6)
7)
8)
monopolized industry; Discussion: subgame perfect equilibrium and backward

induction.Coalition games; The core; Illustration: ownership and the distribution of
wealth; Other solution concepts.
7 Hrs.
Bayesian Games: Motivational examples; General definitions; Two examples
concerning information; Illustration: auctions; Auctions with an arbitrary
distribution of valuations. Extensive games with imperfect information; Strategies;
Nash equilibrium; Beliefs and sequential equilibrium; Signaling games;
Illustration: strategic information transmission.
6 Hrs.
Strictly Competitive Games, Rationalizability:Strictly competitive games and
maximization; Maximization and Nash equilibrium; Strictly competitive games;
Maximization and Nash equilibrium in strictly competitive games.
Rationalizability; Iterated elimination of strictly dominated actions; Iterated
elimination of weakly dominated actions; Dominance solvability.
6 Hrs.
Evolutionary Equilibrium, Iterated Games: Monomorphic pure strategy
eulibrium; Mixed strategies and polymorphic equilibrium; Asymmetric contests;
Variations on themes: Sibling behavior, Nesting behavior of wasps, the evolution
of sex ratio. Repeated games: The main idea; Preferences; Repeated games;
Finitely and infinitely repeated Prisoners dilemma; Strategies in an infinitely
repeated Prisoners dilemma; Some Nash equilibria of an infinitely repeated
Prisoners dilemma.
6 Hrs.
Repeated Games: General Results, Bargaining: Nash equilibria of general
infinitely repeated games; Subgame perfect equilibria of general infinitely
repeated games; Finitely repeated gazmes; Imperfect observability. Bargaining
as an extensive game; Trade in market as an illustration; Nashs axiomatic
model; Relation between strategic and axiomatic models.
6 Hrs.

Refreshing the fundamentals used in data structures and strategies used in
algorithms. (PO B)
Books:
1) Martin Osborne- An Introduction to Game Theory, Indian edition, Oxford
University Press, 2004.
2) Roger B. Myerson- Game Theory: Analysis of Conflict, Harvard University Press,
1997.
3) Andreu Mas-Colell, Michael D. Whinston, and Jerry R. Gree-, Microeconomic
Theory, Oxford University Press, New York, 1995.
4) Philip D. Straffin, Jr.,- Game Theory and Strategy.
46
SDMCET: Syllabus
CS382
Principles of Programming languages
(4-0-0) 4

CLO1. Explain the value of declaration models, especially with respect to
programming-in-the-large.
CLO2. Identify and describe the properties of a variable such as its associated
address, value, scope, persistence, and size.
CLO3. Evaluate tradeoffs in lifetime management (reference counting vs.
garbage collection).
CLO4. Demonstrate different forms of binding, visibility, scoping, and lifetime
management.
CLO5. Defend the importance of types and type-checking in providing abstraction
and safety.
CLO6. Justify the philosophy of object-oriented design and the concepts of
encapsulation, abstraction, inheritance, and polymorphism.
CLO7. Identify at least one distinguishing characteristic for each of the
programming paradigms covered in this unit.
CLO8. Evaluate the tradeoffs between the different paradigms, considering such
issues as space efficiency, time efficiency (of both the computer and the
programmer), safety, and power of expression.
CLO9. Design, code, test, and debug programs using the functional paradigm.
CLO10. Outline the strengths and weaknesses of the logic programming paradigm.
CO1. Apply principles of language design towards requirements. (PO A,B)
CO2. Understand the differences between data and control. (PO B,C)
CO3. Understand and appreciate the different paradigms of programming
languages. (PO B,D)
CO4. Write the formal syntax for a specification.(PO A,B)
CO5. Understand data typing and control structures. (PO B).
Prerequisites:
CS100/150, CS207,CS251, CS 254
Course Contents:
1) Introduction: Toward higher-level languages, Programming paradigms,
Language implementation: Bridging the gap, Expression notations, and Abstract
syntax trees.
5 Hrs.
2) Types: Data Representation: Elementary data types Data objects, Variables
and Constants, Data types, Declarations, Type checking and type conversion.
Numeric data types, Enumerations, Booleans, Characters. Structured data types
- Structured data objects and data types, Specification of data structure types,
Implementation of data structure types, Vectors and arrays, Records. Type
equivalence.
8 Hrs.
3) Imperative Programming: Basic Statements, structured sequence control,
handling special cases in loops, programming with variants, proof rules for partial
47
SDMCET: Syllabus
correctness. Procedure activations Simple call-return subprograms, Parameter
passing methods, Scope rules for names, Nested scopes in the source text,
Activation records, Lexical scope: Procedures as in C.
10 Hrs.
4) Object-Oriented Programming: Object-oriented design, Encapsulation and
information-hiding, Separation of behavior and implementation, Classes and
subclasses, Inheritance (overriding, dynamic dispatch), Polymorphism (subtype
polymorphism vs. inheritance)
8 Hrs.
5) Functional Programming: Lamda Calculus,Elements of functional programming
A Little language of expressions, Types: values and operations, Approaches to
expression evaluation, Lexical scope, Type checking. Functional programming in
a typed language -Exploring a list, Function declaration by cases, Function as
first-class values, ML: Implicit types, Data types, Exception handling in ML.
Functional programming with lists - Scheme, a dialect of lisp, The structure of
lists, List manipulation.
12 Hrs.
6) Logic Programming: Predicate Logic: FOL, Computing with relations,
Introduction to prolog, Data structures in prolog, Programming techniques,
Control in prolog.
8 Hrs.
Hands on experience in Meta Language
Books:
1) Programming languages-Ravi sethi Addison Wesley 2nd edition,2009
2) Terrence W.Pratt- Programming languages Design and Implementation Pearson
Education 4th edition, 2008
3) Robert W Sebesta- Concept of Programming language Pearson Education 6th
edition.
48

136

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

136

Загружено:

Авторское право:

Доступные форматы

SDMCET: Syllabus

Computer Science & Engineering

Management, Entrepreneurship, Protection of

Data Base Management Systems

System Software Laboratory

Object Oriented System Modeling and

Total credits offered for the Third year: 55

III Year B.E. (CSE): 2014 - 15

System Modeling and Simulation

Guidelines for Floating Electives

Management, Entrepreneurship, Protection of

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

d. Each Ti after generating a number makes use of a function with

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

III Year B.E. (CSE): 2014 - 15

Data Base Management Systems

Course Learning Objectives:

Additional contents beyond the syllabi:

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives: This course is at undergraduate level for 48 contact

III Year B.E. (CSE): 2014 - 15

System Software Laboratory

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives:

Drawing E-R diagrams for a given scenario

III Year B.E. (CSE): 2014 - 15

III Year B.E. (CSE): 2014 - 15

Network Programming Laboratory

Course Learning Objectives:

Course Learning Objectives:

Prerequisites: CS208, CS210, CS205, CS259, CS307, CS306

III Year B.E. (CSE): 2014 - 15

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives:

Picking; A simple CAD program; Building interactive models; Animating

Additional contents beyond the syllabi:

III Year B.E. (CSE): 2014 - 15

Object Oriented System Modeling and Design

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

System Modeling and Simulation

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

III Year B.E. (CSE): 2014 - 15

Digital Image Processing

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

III Year B.E. (CSE): 2014 - 15

Advanced Data Structures and Algorithms

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15

III Year B.E. (CSE): 2014 - 15

Course Learning Objectives:

III Year B.E. (CSE): 2014 - 15