Cs Engg III Year Syllabus 2015
Cs Engg III Year Syllabus 2015
Cs Engg III Year Syllabus 2015
Dear Students,
Since it started in the year 1946, NIE is promoting excellence
in education through highly qualified faculty members and
modern infrastructure. The Board of Directors believes in
continuous improvement in delivery of technical education.
Thanks to Karnataka government that designed and
developed a seamless admission process through CET,
many highly meritorious pre-university passed students are
joining NIE, which has become a brand name among
hundreds of colleges in the country. Infact, NIE is one of the
top ten preferred colleges where all the seats got filled-up in
the first round of 2015 admissions.
The concerted efforts of stake holders at NIE have made it
get autonomous status, prestigious TEQIP-I & II and get
accreditation from National Board of Accreditation, New
Delhi. NIE has been granted permanent affiliation by VTU to
all its courses.
Today NIE has of 7 UG, 13 PG and 5 Post-graduate Diploma
programmes and 13 Centres of Excellence with overall
student strength of over 3500. NIE's journey to excellence,
with the main objective of continuous improvements of
administrative and academic competence, is envisioned
through three major pillars: intellectual infrastructure,
courses/services offerings and institution building.
Our curriculum is designed to develop problem-solving skill in
students and build good academic knowledge.
July 2015
Dear Students,
From the academic year 2014-15 there is a slight change in
the syllabus structure and question paper pattern. This
change is due to the philosophy of Outcome Based
Education and requirement as per the National Board of
Accreditation (NBA), Government of India, New Delhi.
Sixteen countries including New Zealand, Australia,
Singapore, Russia and India are the signatories of the
Washington Accord, which has come out with the new
process of accreditation. This would enable every institution,
including NIE to attain high standards of technical education
in the respective countries and to create level playing
ground. The outcome based education is one of the
important components of NBA.
NIE is making sincere efforts in meeting the global standards
through new formats of NBA and timely World Bank-MHRD
initiative TEQIP (Technical Education Quality Improvement
Program). Efforts are being made to design the curriculum
based on Blooms Taxonomy framework, to meet the
challenges of the current technical education.
Dr. B. K. Sridhara
July 2015
VISION
Department will offer, through best-in-class faculty and
infrastructure, globally acceptable education in computer science,
and produce highly competent and value-based computer
engineers
MISSION
To evolve into an outstanding department contributing significantly
to teaching, research and consultancy in computer science in an
integrated manner
To develop start-of-the art infrastructure and advanced computing
facility in tune with requirement of industry and national projects
To promote innovation and entrepreneurship to enhance
competence of graduates of computer science
GRADUATE ATTRIBUTES
1. Engineering Knowledge: Apply the knowledge of mathematics,
science, engineering fundamentals, and an engineering
specialization to the solution of complex engineering problems.
2. Problem Analysis: Identify, formulate, research literature, and
analyze complex engineering problems reaching substantiated
conclusions using first principles of mathematics, natural sciences,
and engineering sciences.
3. Design/development of Solutions: Design solutions for
complex engineering problems and design system components or
processes that meet t h e specified needs with appropriate
consideration for the public health and safety, and the cultural,
societal, and environmental considerations.
4. Conduct Investigations of Complex Problems: Use researchbased knowledge and research methods including design of
experiments, analysis and interpretation of data, and synthesis of
the information to provide valid conclusions.
5. Modern Tool usage: Create, select, and apply appropriate
techniques, resources, and modern engineering and IT tools
including prediction and modeling to complex engineering activities
with an understanding of the limitations.
6. The Engineer and Society: Apply reasoning informed by the
contextual knowledge to assess societal, health, safety, legal, and
PROGRAM OUTCOMES
At the time of graduation, our students will have
PO1 : A sound knowledge of the fundamentals of computer
science to enable them to pursue higher studies at any of the
leading institutions of the world.
PO2: The ability to analyze real world /scientific problems and
convert them to computable algorithms.
PO3: The ability to make a comparative study of the complexities
of the various approaches to solve such algorithms.
PO4: The ability to evaluate the available technological alternatives
(like client server, cloud, mobile, stand-alone etc) to implement the
same.
PO5: The ability to evaluate the various hardware
/software/networking/financial requirements for the solution.
PO6: The ability to articulate the issues effectively with fellow
members as well as end users.
PO7: The ability to code the solutions using appropriate languages,
port them to different platforms and operate & maintain them
effectively.
PO8 : Ability to ensure safety of systems/transactions from
malicious attacks from outside as well as from within the
organization.
PO9: The ability to stay acquainted with the current status of
technologies/ practices.
PO10: The ability to continuously innovate on the current practices.
PO11: Willingness to remain bounded by ethical and moral
constraints while making the choices.
PO12: The ability to analyze the managerial and commercial
dimensions of the problem on hand.
2.
2.
CIE
Hrs/ Week
: 04
SEE
SEE Hrs
: 3 Hrs
Maximum Marks:
50%
50%
100
10
11
: CS0413
CIE
: 50 %
Hrs / week
: 05
SEE
: 50 %
SEE Hrs
: 3 Hrs
Max. Marks
: 100
Course Outcome
On successful completion of the course the students will be able to
1.
Explain the difference between processes and threads and
Analyze issues of scheduling user-level processes/threads.
2.
Analyze the issues and use of locks, semaphores and
monitors for synchronizing multithreaded systems and implement
them in multithreaded programs.
3.
4.
Analyze the design and implementation issues in virtual
memory management.
5.
6.
Explain concepts of deadlock in operating systems and
analyze how they can be
managed / avoided.
UNIT 1
INTRODUCTION, PROCESSES AND THREADS
WHAT IS AN OPERATING SYSTEM? : The Operating system as
an extended machine, The Operating system as a resource
manager.
PROCESSES: The process model, Process creation, Process
termination, Process hierarchies, Process states. THREADS: The
thread model, Thread usage, implementing threads in user space,
Implementing threads in the kernel, Hybrid implementations,
Scheduler activations. SCHEDULING: Introduction to scheduling,
Scheduling in interactive systems,
SLE:Thread scheduling.
9 Hours
12
UNIT 2
INTERPROCESS COMMUNICATION
Race conditions, Critical regions, Mutual exclusion with busy
waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors,
Message passing. CLASSICAL IPC PROBLEMS: The dining
philosophers problem, The readers and writers problem.
MEMORY MANAGEMENT
BASIC MEMORY MANAGEMENT: Monoprogramming without
swapping or paging, Multiprogramming with fixed partitions,
Modeling multiprogramming, Relocation and protection.
SLE: Analysis of multiprogramming system performance
8 Hours
UNIT 3
MEMORY
MANAGEMENT,
ALGORITHMS & DESIGN ISSUES
PAGE
REPLACEMENT
13
mechanism.
SEGMENTATION:
Implementation
segmentation, Segmentation with paging.
of
pure
14
2.
REFERENCE BOOKS:
3.
4.
5.
6.
7.
15
: CS0414
CIE
: 50 %
Hrs / week
: 05
SEE
: 50 %
SEE Hrs
: 03 Hrs
Max. Marks
: 100
2.
3.
Write the SQL query to interact with the database and illustrate
transaction concepts.
4.
5.
6.
UNIT 1
Introduction:
Advantages of using a DBMS approaches,
Definition of schema, data model and instances, Three-schema
architecture and data independence, Different Database Models,
Interfacing with a Database, The Mechanics, Disk versus MainMemory,
An Example Database: The Everest Books Database
Relational Databases(with a MySQL Flavor): MySQL Database
System, Database Organization, Creating and using the Database,
SLE: Steps in Designing a Database.
9 Hours
UNIT 2
Manipulating the Database: Example Tables, Relational Algebra.
16
17
18
CIE
: 50 %Marks
Hrs / week : 04
SEE
: 50 %Marks
SEE Hrs
: 03 Hours
Max. Marks
: 100
2.
3.
4.
5.
6.
UNIT 1
Hardwired Control Design: Introduction, General structure of a
hardwired control unit, Complete Design of a Hardwired Control
Unit- An accumulator based CPU, Organization, Instruction Set,
flowchart, control points and control signal definition. (Excluding
GCD Processor and Multiplier control)
SLE: Comparison of micro programmed and hardwired control unit.
8 Hours
UNIT 2
8086/8088 Hardware Specifications: Pin-Outs and Pin Functions,
Clock Generator (8284A), Bus Buffering and Latching, Bus Timing,
Ready and the Wait State.
SLE: Minimum Mode Verses Maximum Mode.
9 Hours
19
UNIT 3
Memory Interface: Memory Devices, Address Decoding, 8088 and
80188 (8-bit) Memory Interface, 8086, 80186, 80286, and 80386SX
(16-bit) Memory Interface, 80386DX and 80486 (32-bit) Memory
Interface, Pentium, (Decoding logic is to be developed using
decoder and/or gates)
SLE: Pentium Pro, and Pentium II (64-bit) Memory Interface.
9 Hours
UNIT 4
I/O Interface: Introduction to I/O Interface, I/O Port Address
Decoding, The Programmable Peripheral Interface: Basic
description of 8255Mode 0 operation, mode 1 strobed output,
Mode 2 Bidirectional operation.
SLE: Bidirectional I/O port.
(For I/O interface- Decoding logic is to be developed using decoder
and/or gates)
9 Hours
UNIT 5
Interrupts: Basic interrupt processing, Hardware Interrupts,
Expanding the interrupt structure, Interrupt Example-Interrupt
Process keyboard.
Direct Memory Access and DMA-Controlled I/O: Basic DMA
Operation, Basic DMA Definition, Pin Functionality of 8237 DMA
controller.
SLE: Transparent DMA
8 Hours
UNIT 6
The 80386,80486 : Introduction to protected mode memory
addressing-selectors and descriptors, Memory paging, Page
directory and page table, Special 80386 Registers, 80386 Memory
Management-Descriptors and Selectors Descriptor tables, Moving
to Protected Mode, Virtual 8086 Mode ,The Memory Paging
Mechanism, Page directory, Page table. Introduction to the 80486
Microprocessor-
20
th
21
Hrs / week : 03
Course Outcome
On successful completion of the course the students will be able to
a.
Implement assembly language
microprocessor for the given applications.
programs
for
8086
b.
Implement assembly language interfacing applications for
Elevator, Stepper Motor, Keypad, logic controller Display interface.
22
: CS0107
Hrs / week : 03
Course Outcome
On successful completion of the course the students will be able to
1.
2.
Design and implement system level programs using lex
and yacc.
23
CIE : 50%
Hrs / Week : 04
SEE : 50%
3.
Explain about process environment and process control in
UNIX.
4.
5.
Apply thread concepts and POSIX thread functions for
multi-threaded programming in UNIX
6.
Use inter-process communication mechanisms in UNIX for
achieving process interaction.
UNIT 1
UNIX System Overview: Introduction, Unix architecture, Logging
in, Files and Directories, Input and Output, Programs and
Processes, User Identification, System calls and Library Functions.
File I/O Introduction, File Descriptors, open Function, creat
Function, close Function, lseek Function, read Function, write
Function, File Sharing, Atomic Operations, dup and dup2.
SLE: UNIX Standardization, UNIX System Implementations
9 Hours
UNIT 2
Files and Directories Introduction, stat, fstat, and lstat Functions,
Set-User-ID and Set-Group-ID, Ownership of New Files and
Directories, access Function, umask Function, chmod and fchmod
Functions, Sticky Bit, chown, fchown, and lchown Functions, File
24
25
UNIT 6
Interprocess Communication: Introduction, Pipes, popen and
pclose Functions, Coprocesses, FIFOs, XSI IPC, Message
Queues, Semaphores, Shared Memory, Client-Server Properties.
Network IPC: Sockets Introduction,
Addressing, Connection Establishment.
Socket
Descriptors,
26
SOFTWARE ENGINEERING(4:0:0)
Sub Code : CS0417
CIE : 50%
Hrs / Week : 04
SEE : 50%
Course Outcome
On successful completion of the course the students will be able to
1. Describe the fundamental knowledge of Software Engineering
Process.
2. Discuss the development guidelines for Agile View of Process
and System Engineering.
3. Determine the key steps in gathering requirement for a problem
and building an Analysis Model.
4. Provide the set of design principles and practices to build a high
quality system.
5. Validate System functions using various Testing Skills
6. Identify an effective estimation model for Software Project
Management.
UNIT 1
Introduction To Software Engineering: The Evolving Role of
Software, Software, Key points about software, Legacy Software,
Software Myths.
The Software Process: Software Engineering - A Layered
Technology, Process Frame Work, Framework, Capability Maturity
Model Integration (CMMI),Process Assessment, Personal and
Team Process Models, Process Technology, Product & Process
Process Models: Prescriptive Models, The Waterfall Model,
Incremental Process Models, Evolutionary Process Models,
Specialized Process Models, Unified Process.
SLE: The changing nature of Software.
9 Hours
27
UNIT 2
Agile View of Process : Agility, Agile Process, Agile Process
Model.
System Engineering: Computer Based Systems, The System
Engineering Hierarchy,
Business Process Engineering, Product Engineering, System
Modeling.
SLE: Computer Based Systems.
8 Hours
UNIT 3
Requirement Engineering: Requirement Engineering Tasks,
Requirement Engineering Process, Eliciting Requirements,
Developing USE-CASE, Building Analysis Model.
Building The Analysis Model: Requirement Analysis, Analysis
Modeling Approach, Data Modeling concept, Object Oriented
Analysis, Scenario Based Modeling, Flow Based Modeling, Class
Based Modeling, Behavioral Modeling.
SLE: Validating requirements.
9 Hours
UNIT 4
Design Engineering: Design within the Context of Software
Engineering, Design Process and Design Quality, Design
Concepts.
Creating An Architectural Design: Software Architecture, Data
Design, Architectural Styles and Patterns, Architectural Design.
SLE: The Design Model.
9 Hours
UNIT 5
Testing Strategies: A Strategic Approach to Software Testing,
Test Strategies for Conventional Software, Test Strategies for
Object Oriented Software, System Testing, Validating Testing.
28
29
CIE : 50%
Hrs / Week : 04
SEE : 50%
30
31
32
: CS0420
CIE : 50 %
Hrs / week : 05
SEE : 50 %
SEE Hrs
: 3 Hours
1.
2.
3.
4.
5.
6.
33
34
th
2.
Programming the World Wide Web, Robert W. Sebesta,
4th Edition, Pearson Education, 2008.
3.
Open Source Web Development with Lamp, James Lee
and Brent Ware, Pearson Education, 2009
35
REFERENCE BOOKS
1.
2.
3.
st
36
Hrs/week : 03
Course Outcome:
At the end of this course the student will be able to
1.
Explain his/her knowledge of database technology, its
importance, its architectures, and the central role Database
technology plays in Information Systems.
2.
Apply appropriate development methodologies of data
analysis, design and use appropriate modeling techniques for
databases.
3.
Demonstrate query facilities to formulate queries and
manipulate the database e.g. Structured Query Language (SQL)
4.
Appreciate the issues underlying database implementation
in any database
5.
Concentrate on a methodology for good database design
and practical experience in designing and implementing standalone
database system.
37
Hrs/week : 03
Course Outcome:
At the end of this course the student will be able to
(a)
38
ELECTIVES
COMPILER DESIGN (4:0:0)
Sub code
: CS0425
Hrs / Week
: 04
SEE Hrs
: 3 Hours
CIE : 50%
SEE : 50%
Max Marks : 100
Course Outcome
On successful completion of the course the students will be able to
1.
Explain Translation Process and Scanning Process of a
Compiler
2.
3.
Describe top down parsing techniques for different
languages
4.
5.
Compare memory organization of different run-time
environments
6.
UNIT 1
INTRODUCTION AND SCANNERS
The Translation Process, The Scanning Process, The TINY
Language, Implementation of a TINY Scanner.
SLE:Finite Automata.
9 Hours
UNIT 2
CONTEXT-FREE GRAMMARS AND PARSING
The Parsing Process, ParseTrees and Abstract Syntax Trees,
Extended Notations: EBNF and Syntax Diagrams, Syntax of the
TINY language.
SLE : context free grammar, Ambiguity.
8 Hours
39
UNIT 3
TOP-DOWN PARSING
Top-Down Parsing by Recursive-Descent , LL(1) Parsing , First
and Follow Sets,A Recursive-Descent Parser for the TINY
Language.
SLE: Implementation of Recursive-Descent Parser for the TINY
Language.
9 Hours
UNIT 4
SEMANTIC ANALYSIS
Attributes and Attribute Grammars , The Symbol Table , Data
Types and Type Checking , A Semantic Analyzer for the TINY
Language .
SLE: Algorithms for Attribute Computation
9 Hours
UNIT 5
RUNTIME ENVIRONMENTS
Memory Organization During Program Execution , Fully Static
Runtime Environments ,Stack-Based Runtime Environments,
Parameter Passing Mechanisms ,Runtime Environment for the
TINY Language
SLE: Dynamic Memory Runtime Environment.
8 Hours
UNIT 6
CODE GENERATION
Intermediate Code and Data Structures for Code Generation ,
Code Generation of Data Structure References , Code Generation
of Control Statements and Logical Expressions ,Code Generation
of Procedure and Function Calls, TM: A simple Target Machine , A
Code generator for the TINY Language
SLE: Basic Code Generation Techniques.
9 Hours
40
41
: CSO429
CIE
: 50% Marks
Hrs/week
: 04
SEE
: 50% Marks
SEE Hrs
: 03 Hours
Course Outcomes
On Successful completion of the course, the students will be
able to:
1.
2.
3.
4.
5.
6.
UNIT 1
Hard Versus Soft Real-Time Systems: Jobs and Processors,
Release Times, Deadline and Timing Constraints, Hard and Soft
timing Constraints, Hard Real-Time Systems, Soft Real-Time
Systems.
SLE: Application of RTS.
8 Hours
UNIT 2
A Reference model of Real-Time systems: Processors and
Resources, Temporal Parameters of Real-Time Work load,
Periodic task model, Precedence Constraints and Data
dependency, other types dependencies. Functional parameters of
resources .
SLE: Scheduling hierarchy.
9 Hours
42
UNIT 3
Approaches to Real-Time Scheduling: Clock-Driven approach,
Weighted Round-Robin approach. Priority driven approach.
Dynamic Versus Static Systems, Effective Release times and
deadlines, optimality of the EDF and LST algorithms, NonOptimality of the EDF and LST algorithms
SLE: off-Line versus on-line scheduling.
9 Hours
UNIT 4
Clock-driven Scheduling: Notations and assumptions, static,
Timer-Driven Scheduler, General Structure Cyclic Schedulers
Cyclic executives, Improving the average response time of a
periodic jobs
SLE: Scheduling Sporadic Jobs.
8 Hours
UNIT 5
Priority-Driven Scheduling of Periodic Tasks: Static
assumption, Fixed Priority Versus Dynamic Priority algorithms,
Maximum Scheduling utilization, Optimality of the RM and DM
algorithms,
SLE: A schedulability test for fixed-Priority tasks with arbitrary
response times.
9 Hours
UNIT 6
Resources and Resources Access Control: Assumptions on
resources and their usage, Effects of resources contention and
resources access control Non preemptive critical section, Basic
Priority Ceiling Protocol, Stack-Based priority Ceiling Protocol,
Use of priority-ceiling protocol in Dynamic-Priority Systems,
Preemption-Ceiling Protocol, Model of Real-time Communication,
Priority-Based Service Disciplines for switched Networks,
SLE:Real time protocol.
9 Hours
43
TEXT BOOK
1.
Real Time Systems Jane W.S. Liu Pearson Education
Asia, First Indian Reprint-2001.
REFERENCE BOOK
1.
Real Time Systems Design and Analysis: An Engineers
Hand book Second Edition, Lapante.
44
: CS0427
Hrs / Week
: 04
SEE Hrs
: 3 Hours
CIE : 50%
SEE : 50%
Max Marks : 100
Course Outcome:
On successful completion of the course the students will be able to
1.
2.
3.
4.
5.
6.
UNIT 1
Introduction: Server Centric IT Architecture and its Limitations.
Storage Centric IT Architecture and its advantages;
Intelligent Disk Subsystems -1: Architecture of Intelligent Disk
Subsystems; Hard disks and Internal I/O Channels, JBOD.
SLE: Case study: Replacing a server with Storage Networks
8 Hours
UNIT 2
Intelligent Disk Subsystems -2, I/O Technologies -1: Storage
virtualization using RAID and different RAID levels; Caching:
Acceleration of Hard Disk Access; Intelligent disk subsystems
SLE: Availability of disk subsystems
9 Hours
45
UNIT 3
I/O Technologies- 2: SCSI.
Network Attached Storage: Fibre Channel Protocol Stack; Fibre
Channel SAN; IP Storage
SLE: The Physical I/O path from the CPU to the Storage System
9 Hours
UNIT 4
File System And NAS: Local File Systems; Network file Systems
and file servers; Shared Disk file systems; Comparison of fibre
Channel and NAS.
Storage Virtualization-1: Definition of Storage virtualization;
Implementation Considerations; Storage virtualization on Block or
file level; Storage virtualization on various levels of the storage
Network.
SLE: Case Studies: Direct Access File System, General Parallel
File System.
9 Hours
UNIT 5
Storage Virtualization-2: Symmetric and Asymmetric storage
virtualization in the Network.
SAN Architecture and Hardware devices: Overview, creating a
Network for storage; SAN Hardware devices, The fibre channel
switch, Host Bus adaptors; Fabric operation from a Hardware
perspective.
SLE: Hardware devices:- Putting the storage in SAN
9 Hours
UNIT 6
Software Components of SAN: The switchs Operating system,
Device Drivers, The Supporting the switchs
components,
Configuration options for SANs.
SLE: Configuration options for SANs -.The Evolving Network
Connections
8 Hours
Text Books:
46
1.
2.
Robert
Reference Books:
1.
2.
3.
47
CIE : 50 %
Hrs / week : 04
SEE : 50 %
Course Outcome
On successful completion of the course the students will be able to
1.
the Explain Linux Operating System basics, Kernel.,
booting process
2.
3.
Describe Inter process Communication and compare File
Systems in Linux
4.
5.
6.
UNIT 1
Linux-The Operating System: Main Characteristics, Linux
Distributions: Compiling the kernel, Where is everything?,
Compiling , Additional Configuration facilities
Introduction to kernel: important data structures, main algorithms,
implementation of system Calls The Booting process: Carrying
out the booting processes,
SLE: LILO-the Linux Loader, GRUB, Etc.,
9 Hours
UNIT 2
Memory Management: The Architecture-independent Memory
model, The Virtual address space of a process, Block device
caching, Paging under Linux
SLE: paging under linux
8 Hours
UNIT 3
Interprocess communication: Synchronization in the kernel,
Communication via files, Pipes, System V IPC
48
49
: CS0431
CIE
: 50 %Marks
Hrs / week
: 04
SEE
: 50 %Marks
SEE Hrs
: 03 Hours
Max. Marks
: 100
Course Outcome
On successful completion of the course the students will be able to
1. IIustrate sequential programming paradigm and concurrent
programming model with an example. Acquainted with Pascal-FC
compiler.
2. Demonstrate process life cycle and process scheduling and
how it is handled in Pascal-FC
3. Discuss various ways of process synchronization such as
message passing model, mutual exclusion, shared variables.
4. Explain in detail message passing model and remote
invocation.
5. Discuss semaphores - a synchronization primitive.
6. Point Out the advanced synchronization constructs such as
critical regions and Monitors. Also analyze concurrency
architecture in embedded systems.
UNIT 1
The Nature and Uses of Concurrent Programming: Introduction,
Sequential Programming as a total ordering, Breaking away from
the sequential paradigm, Concurrent programming as a partial
ordering, The motivation for concurrent programming, An inherently
concurrent problem domain, Problems in concurrent programming,
hardware architectures for supporting concurrent programming,
SLE: Introducing Pascal-FC
8 Hours
UNIT 2
Process Representation and Life-cycle: The concept of process,
Process Structures, The process model in Pascal-FC, Process
states and transitions, Process management and the run-time
50
51
Programming:
M.
Ben-Ari,
52
: CS0432
CIE
: 50 %Marks
Hrs / week
: 04
SEE
: 50 %Marks
SEE Hrs
: 03 Hours
Max. Marks
: 100
Course outcome:
On successful completion of the course the students will be able to
1.
2.
3.
4.
5.
6.
UNIT 1
Introduction: The Operating System, Knowing your machine, Linux
and GNU.
The Unix Architecture and Command Usage: The Unix
Architecture, Features of Unix, POSIX and Single Unix
Specifications, Locating Commands, Internal and External
Commands, Command Structure, Flexibility of command usage.
General Purpose Utilities: cal, date, echo, printf, bc, script, mailx,
passwd, who, uname, tty, stty.
SLE: POSIX and the Single Unix Specifications.
8 Hours
UNIT 2
The Filesystem: The file, What is a File?, The Parent-Child
Relationship, The HOME variable, pwd, cd, mkdir, rmdir, absolute
pathname, relative pathnames, cat, cp, rm, mv, more, the lp
subsystem, file, wc, od, cmp, comm, diff.
Basic File Attributes: ls-l: Listing file attribute, the - d option, File
owner ship, File permission, chmod, Directory permission,
changing File ownership. The Vi editor Basic.
53
54
2.
3.
4.
5.
6.
55
: CS0433
CIE
: 50 %Marks
Hrs / week
: 04
SEE
: 50 %Marks
SEE Hrs
: 03 Hours
Max.
Marks
: 100
Course Outcome:
On successful completion of the course the students will be able to
Compute models such as RAM, PRAM were discussed.
1.
2.
3.
4.
5.
UNIT 1
Models of Computation:
RAM (Random Access Machine),PRAM (Parallel Random Access
Machine),Fundamental
Terminology
Interconnection Networks, Matrix Multiplication.
SLE: Additional Terminology.
9 Hours
56
UNIT 2
Parallel Prefix
Parallel Prefix, Application: Maximum Sum Subsequence, Array
Packing, Interval (Segment)
Broadcasting,(Simple) Point Domination Query.
SLE: Computing Overlapping Line Segments.
9 Hours
UNIT 3
Pointer Jumping and divide and Conquer:
List Ranking Linked List Parallel Prefix , Merge Sort (Revisited)
Selection, Quick Sort (Partition Sort) Improving Quick Sort , Bitonic
Sort (Revisited) , Concurrent Read/Write.
SLE: Modifications of Quick Sort for Parallel Models.
9 Hours
UNIT 4
Computational Geometry:
Convex Hull, Smallest Enclosing Box, Architecture-Independent
Algorithm Development Line Intersection Problems.
SLE: All-Nearest Neighbour Problem
9 Hours
UNIT 5
Graph Algorithms:
Fundamental PRAM Graph Techniques ,List Ranking via Pointer
Jumping ,Euler Tour Technique ,Tree Contraction, Computing the
Transitive Closure of an Adjacency Matrix, Connected Component
Labeling, RAM ,PRAM Mesh, .
SLE: Shortest-Path Problems RAM,PRAM and Mesh.
9 Hours
UNIT 6
Numerical Problems:
Primality, Greatest Common Divisor, Lames Theorem , Integral
Powers, Approximation by Taylor Series, Trapezoidal Integration.
57
58
: CS0435
Hrs / week : 04
SEE Hrs
: 3 Hrs
CIE
SEE
: 50 %
: 50 %
Course Outcome:
On successful completion of the course the students will be able to
1. Describe Hashing Technique and Red Black Trees
2. Design algorithm using Dynamic programming and Greedy
3. Compare different algorithms fusing Amortized Analysis
4. Describe B trees and Fibonacci heaps
5. Interpret max flow and multi threaded algorithm
6. Interpret number-theoretic algorithms
Prerequisite: Analysis and Design of Algorithms.
UNIT 1
Hash tables: Direct-address tables, Hash tables, Hash functions,
open addressing : Hash insert.
Red Black Trees: Properties, Rotations, Insertion.
SLE: Hash Search and Deletion of Red Black Trees.
8 Hours
UNIT 2
Dynamic Programming: Rod Cutting, Longest Common
Subsequence.
Greedy Algorithms: Activity selection problem, Huffman codes,
Matroids and Greedy methods,
SLE: a task scheduling problem as a matroid.
9 Hours
UNIT 3
Amortized Analysis: Aggregate analysis, The accounting method,
59
60
Edition.
REFERENCE BOOKS:
1. Computer Algorithms- Ellis Horowitz, Sartaj Sahni and
Sanguthevar Rajasekaran, Computer Science Press, 1998
2. The Design and Analysis of Computer AlgorithmsAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman,
Addison Wesley, 1974.
61
CIE : 50 %
Hrs / week: 05
SEE : 50 %
4.
Apply different types of protocol verification and validation
techniques
5.
Identify efficient procedure for generating a conformance
test suite for a given protocol implementation, compare different
types of protocol testing methods and to get familiarize with
concepts of performance, interoperability and scalability testing of a
protocol
6.
Discuss methods for interactive building of correct protocol
specification and handling its implementation issues
UNIT 1
Introduction: Communication model, Communication Software,
Communication
Subsystems,
Communication
Protocol
Definition/Representation,
Formal
and
Informal
Protocol
Development Methods, Protocol Engineering Phases
Network Reference Model: Layered Architecture, Network
Services and Interfaces, Protocol Functions: Encapsulation,
Segmentation, Reassembly, Multiplexing, Addressing, OSI Model
Layer Functions, TCP/IP Protocol Suite, Application Protocols.
SLE: Informal representation of TCP protocol
8 Hours
UNIT 2
Protocol Specification: Components of specification, Service
62
63
architecture (QOS).
SLE: Conformance testing with Tree and Tabular Combined
Notation (TTCN )
9 Hours
UNIT 6
Protocol performance testing: Performance Test methods, SDL
Based Performance Testing of TCP, Interoperability testing,
Scalability testing protocol synthesis problem
Protocol Synthesis and Implementation: Synthesis methods,
Interactive Synthesis Algorithm, Automatic Synthesis Algorithm,
Automatic Synthesis of SDL from MSC, Protocol Re-synthesis,
Requirements of Protocol Implementation, Objects Based
Approach To Protocol Implementation, Protocol Compilers. Code
generation from Estelle, LOTOS, SDL and CVOPS.
SLE: SDL based performance testing of OSPF
9 Hours
TEXT BOOKS:
1. Pallapa Venkataram and Sunilkumar S.
Communication Protocol Engineering, PHI, 2004.
Manvi:
REFERENCE BOOKS:
1. Mohammed G. Gouda: Elements of Protocol Design, Wiley
Student Edition, 2004.
64
: CS0437
CIE
: 50 %
Hrs / week : 04
SEE
: 50 %
SEE Hrs
Max. Marks
: 100
: 3 Hrs
Course Outcome
On successful completion of the course the students will be able to
1. Categorize different cloud computing models.
2. Describe basic cloud architecture and cloud services
3. Use the concepts of abstraction and virtualization to plan a
cloud environment
4. Explain cloud management using Google web services
5. Discuss cloud security issues
6. Determine the relationship between SOA and cloud computing
by moving application to Cloud.
UNIT 1
Introduction
Defining Cloud Computing, Cloud Types: NIST Model, Cloud Cube
Model, Deployment models, Service Models. Characteristics of
Cloud Computing: Paradigm shift, Benefits of Cloud computing,
Disadvantages of cloud computing, Role of Open Standards,
Assessing the Value Proposition: Measuring the Cloud's Value,
Avoiding Capital Expenditures, Computing the Total Cost of
Ownership, Specifying Service Level Agreements, Defining
Licensing Models.
SLE: Measuring Cloud Computing cost
8 Hours
UNIT 2
Understanding Cloud Architecture
Exploring
the
Cloud
Computing
Stack:
Infrastructure, Platforms, Virtual Appliances,
65
Composability,
Communication
Services,
Applications,
Abstraction
and
66
UNIT 6
Understanding Service Oriented Architecture and Moving
Applications to the Cloud
Introducing Service Oriented Architecture: Event-driven SOA or
SOA 2.0, Enterprise Service Bus, Service catalogs. Defining SOA
Communications: Business Process Execution Language,
Business Process modeling. Managing and Monitoring SOA: SOA
Management tools, SOA security, The Open Cloud Consortium.
Moving Applications to the Cloud: Applications in the Clouds.
SLE: Relating SOA and Cloud Computing, Applications and
Cloud APIs, Development of Cloud applications using SOA.
10 Hours
TEXT BOOK:
1. Cloud Computing Bible by Barrie Sosinsky, Wiley India.
REFERENCE BOOKS:
1. Cloud Computing for Dummies by Judith Hurwitz, R. Bloor,
M. Kanfman, F. Halper (Wiley India Edition).
2. Cloud Security by Ronald Krutz and Russell Dean Vines,
Wiley-India.
3. Cloud Computing : A Practical Approach, Anthony T Velte.
4. Google Apps by Scott Granneman,Pearson
5. A Brief Guide to Cloud Computing: An Essential
Introduction to the Next Revolution in Computing,
Christopher Barnatt.
67
: CS0438
CIE
: 50 %Marks
Hrs / week
: 05
SEE
: 50 %Marks
SEE Hrs
: 03 Hours
Max. Marks
: 100
Course outcome
On successful completion of the course the students will be able to
1.
2.
3.
Identify and illustration of Interactive Programs and
Animating Interactive Programs. Design of Interactive Programs.
4.
Explain and identify basics of Geometric Objects and
Transformations
5.
Explain, identify and illustrate Geometric Objects and
Transformations in Homogeneous Coordinates using OpenGL.
6.
UNIT 1
Introduction: Applications of computer graphics; A graphics
system; Images: Physical and synthetic; Imaging Systems; The
synthetic camera model; The programmers interface; Graphics
architectures; Graphics Programming: The Sierpinski gasket.
SLE: Programming Two Dimensional Applications.
9 Hours
UNIT 2
The OpenGL: The OpenGL API; Primitives and attributes; Color;
Viewing; Control functions; The Gasket program; Polygons and
recursion; The three-dimensional gasket;
Input: Interaction; Input devices; Clients and Servers; Display
Lists.
SLE: Display Lists and Modeling;
9 Hours
68
UNIT 3
Interaction: Programming Event Driven Input; Menus; Picking;
Building Interactive Models;
Animating Interactive Programs; Design of Interactive Programs.
SLE: Logic Operations
8 Hours
UNIT 4
Geometric Objects and Transformations-I: Scalars, Points, and
Vectors; Three-dimensional Primitives; Coordinate Systems and
Frames; Modeling a Colored Cube; Affine Transformations;
Rotation.
SLE: Translation and Scaling;
8 Hours
UNIT 5
Geometric Objects and Transformations-II: Geometric Objects
and
Transformations;
Transformation
in
Homogeneous
Coordinates; Concatenation of Transformations; OpenGL
Transformation Matrices.
SLE: Interfaces to three-dimensional applications;
9 Hours
UNIT 6
Viewing: Classical and computer viewing; Viewing with a
Computer; Positioning of the camera; Simple projections;
Projections in OpenGL; Hidden-surface removal; Interactive Mesh
Displays; Parallel-projection matrices; Perspective-projection
matrices.
SLE: Projections and Shadows.
9 Hours
Text Books:
1.
Edward Angel: Interactive Computer Graphics A Top-Down
th
Approach with OpenGL, 5 Edition, Pearson Education, 2008.
(Chapters 1 to 7)
69
Reference Books:
1.
Donald Hearn and Pauline Baker: Computer Graphicsrd
OpenGL Version, 3 Edition, Pearson Education, 2004.
2.
F.S. Hill Jr.: Computer Graphics Using OpenGL, 2
Edition, Pearson education, 2001.
nd
3.
James D Foley, Andries Van Dam, Steven K Feiner, John
F Hughes, Computer Graphics, Addison-Wesley 1997.
70
INTRODUCTION TO C# PROGRAMMING
AND .NET CONCEPTS(4:0:0)
Sub code : CS0426
CIE
:50%Marks
Hrs/week : 04
SEE
:50%Marks
SEE Hrs
Max.Marks :100
:03 Hours
Course Outcome
On successful completion of the course the students will be able to
1.
Explain the basics of .Net platform and the role of base
class libraries, role of common intermediate language and
namespaces and also to Define and deploy the different command
line compiler options.
2.
Discuss the fundamentals of c# and to build the basic c#
program using different constructs.
3.
Review the basic pillars of object oriented programming
concepts and apply the exception handling technique to handle
different types of errors.
4.
Provide the knowledge about basics of object lifetime and
to define the use of interfaces and collections.
5.
Explain the callback interfaces, delegates , advanced C#
keywords and its implementation .
6.
UNIT 1
THE PHILOSOPHY OF .NET: Understanding the Previous State of
Affairs, The .NET Solution, The Building Block of the .NET Platform
(CLR,CTS, and CLS), The Role of the .NET Base Class Libraries,
What C# Brings to the Table, An Overview of .NET Binaries ( aka
Assemblies ), the Role of the Common Intermediate Language ,
The Role of .NET Type Metadata, The Role of the Assembly
Manifast, Compiling CIL to Platform Specific Instructions,
Understanding the Common Type System, Intrinsic CTS Data
Types, Understanding the Common Languages Specification,
Understanding the Common Language Run-time A tour of the
.NET Namespaces, Increasing Your Namespace Nomenclature.
BUILDING C# APPLICATIONS: The Role of the Command Line
71
Interesting
Aside
The
9 Hours
UNIT 2
C# LANGUAGE FUNDAMENTALS: The Anatomy of a Basic C#
Class, Creating objects: Constructor Basics, The Composition of a
C# Application, Default Assignment and Variable Scope, The C#
Member Initialization Syntax, Basic Input and Output with the
Console Class, Understanding Value Types and Reference Types,
The Master Node System.Object, The System Data Types (and C#
Aliases), Converting Between Value Types and Reference Types
Boxing and Unboxing, Defining Program Constants, C# Iteration
Constructs, C# Controls Flow Constructs, The Complete Set of C#
Operators, Defining Custom Class Methods, Understating Static
Methods, Methods Parameter Modifies, Array Manipulation in C #,
String Manipulation in C#, C# Enumerations, Defining Structures in
C#, Defining Custom Namespaces.
SLE: Programming using basic constructs of c#
9 Hours
UNIT 3
OBJECT- ORIENTED PROGRAMMING WITH C#: Forms Defining
of the C# Class, Definition the "Default Public Interface" of a Type,
Recapping the Pillars of OOP, The First Pillars: C#'s Encapsulation
Services, Pseudo- Encapsulation: Creating Read-Only Fields, The
Second Pillar: C#'s Inheritance Supports, keeping Family Secrets:
The "Protected" Keyword, Nested Type Definitions, The Third
Pillar: C #'s Polymorphic Support, Casting Between. EXCEPTIONS
: Ode to Errors, Bugs, and Exceptions, The Role of .NET Exception
Handing, the System. Exception Base Class, Throwing a Generic
Exception, Catching Exception, CLR System Level Exception
(System. System Exception), Custom Application-Level Exception
(System. System Exception), Handling Multiple Exception, The
Family Block, the Last Chance Exception Dynamically Identifying
72
73
VS.NET
9 Hours
UNIT 6
UNDERSTANDING .NET ASSEMBLES: Problems with Classic
COM Binaries, An Overview of .NET Assembly, Building a Simple
File Test Assembly, A C#. Client Application, A Visual Basic .NET
Client Application, Cross Language Inheritance, Exploring the
CarLibrary's, Manifest, Exploring the CarLibrary's Types, Building
the Multifile Assembly, Using Assembly, Understanding Private
Assemblies, Probing for Private Assemblies (The Basics), Private A
Assemblies XML Configurations Files, Probing for Private
Assemblies ( The Details), Understanding Shared Assembly,
Understanding Shared Names, Building a Shared Assembly,
Understanding Delay Signing, Installing/Removing Shared
Assembly, Using a Shared Assembly.
SLE: Building a custom assemblies.
8 Hours
TEXT BOOKS
1. C# and the .NET platform - Andrew Troelsen, Special Edition,
Dream Tech Press, India, 2003.
REFERENCE BOOKS:
1. Inside C# - Tom Archer, WP Publishers, 2001.
74
: CS0439
CIE
50 %Marks
Hrs / week
: 04
SEE
50 %Marks
SEE Hrs
: 03 Hours
Max. Marks :
100
Course outcome
On successful completion of the course the students will be able to
1.
Discuss types of multimedia networks and multimedia
applications
2.
3.
4.
Apply different types of compression techniques on audio
and images
5.
Analyze the different types of video compression
techniques
6.
Compare the different standards for the multimedia
communications
UNIT 1
Multimedia communications
Introduction; Multimedia information representation; Multimedia
networks: Telephone networks, Data networks, Broadcast
television networks, Integrated services digital networks,
Broadband multiservice networks; Multimedia applications :
Interpersonal communications, Interactive applications over the
Internet, Entertainment applications; Application and networking
terminology : Media types, Communication modes, Network types,
Multipoint conferencing, Network QoS, Application QoS.
SLE: Applications of Multimedia Communications
8 Hours
UNIT 2
Multimedia information representation
Introduction; Digitization principles: Analog signals, Encoder
75
76
77
: CS0428
CIE
: 50 %Marks
Hrs / week
: 05
SEE
: 50 %Marks
SEE Hrs
: 03 Hours
Max. Marks :
100
Course Outcome
On successful completion of the course the students will be able to
1.
2.
3.
4.
5.
6.
UNIT 1
Custom single-purpose processor: Hardware; Introduction,
Combinational Logic, Sequential Logic, Custom Single-Purpose
Processor Design, RT-level custom single-purpose processor
design; Optimizing custom single-purpose processors: optimizing
the FSMD, Optimizing the data-path, optimizing the FSM.
SLE : Optimizing the Original Program.
9 Hours
UNIT 2
Timers, counters, and watchdog timers.
State machine models: Introduction;
finite-state machines
(FSM); Finite-state machines with data path model (FSMD); Using
state machines: Describing a system as a state machine,
Comparing state machine and sequential program models,
78
79
UNIT 6
Embedded Software Development Tools: Host and Target
Machines, Linker/Locator for Embedded Software, getting
embedded software into the Target System
An example system: What the program does
SLE: Environment in which the program operates.
8 Hours
TEXT BOOKS
1. Embedded System Design: A Unified Hardware/
Software Introduction - Frank Vahid, Tony Givargis, John
Wiley & Sons, Inc.2002 ( Articles: 2.4, 2.5, 2.6; 3.8; 4.2)
2. An Embedded Software Primer - David E. Simon:
Pearson Education, 1999. (Chapters: 4,5,6,7,8,9,10 and
11)
REFERENCE BOOKS
1. Embedded C: Michael J. Pont, Pearson Education (2002).
2. Real-Time Systems and Programming Languages: Alan
Burns and Andy Wellings, Addison-Wesley-longman
(1997).
3. Real-Time Programming: A Guide to 32-Bit Embedded
Development: Grehan, Moore and Cyliax, AddisonWesley-longman (1998).
4. The Art of Programming Embedded Systems: Jack G.
Ganssle, San Diego:
Academic Press (1992).
5. Programming Embedded Systems in C and C++:
st
Michael Barr, O'Reilly Media, 1 Edition (1998).
6. Real-Time Concepts for Embedded Systems: Qing Li
with Caroline Yao, CMP Books (2003).
7. Embedded Systems Building Blocks, Second Edition Complete and Ready-to-Use Modules in C: Jean J.
Labrosse, CMP; 2nd edition (1999)
80
CIE
: 50% Marks
Hrs/Week : 03
SEE
: 50% Marks
SEE Hrs : 03
Course outcomes:
On successful completion of the course the students will be able to
1. Discuss the different applications that use pervasive
computing and also compare the different device
technology available.
2. Assess the different device connectivity using the protocols
3. Use the voice technology in the hand held devices
4. Design and demonstrate some applications using the
programming languages
5. Create the user interfaces for a given application
6. Apply the concepts to PDA and to compare the connected
devices
UNIT 1
Past, present, future: The vine and fig tree dream, Pervasive
computing, the pervasive computing market, m-Business
Conclusions and challenges. Email access via WAP and voice.
Device technology: Hardware, Human-machine
interfaces,
Biometrics, Operating systems,Java for pervasive devices
SLE: Application examples: Airline check-in and booking,
7 Hours
UNIT 2
Device connectivity: Protocols, Security, Device management.
WAP and beyond: Introduction, Components of the WAP
architecture, WAP infrastructure, WAP security issues, i-Mode
SCCCC
SLE: Wireless Markup Language, WAP push, Products
7 Hours
81
UNIT 3
Voice technology: Basics of speech recognition, Voice standards
Speech applications, Speech and pervasive computing, Security.
Personal digital assistants: History, Device categories,.
SLE: Personal digital assistant operating systems
7 Hours
UNIT 4
Server-side programming in Java: Java 2 Enterprise Edition:
overview, Servlets, Enterprise Java Beans, Java Server pages,
Web services, Model-view-controller pattern
SLE: Extensible Markup Language,
7 Hours
UNIT 5
Example application: Introduction, , Architecture, Implementation
Access from PCs: Smart-card-based authentication via the
Internet. Access via WAP: WAP functionality.
SLE: User interfaces overview, implementation
7 Hours
UNIT 6
Access from personal digital assistants: Extending the example
application to personal digital assistants, Implementation for
connected devices.
SLE: Comparison of PDAs, connected devices and different
implementations
7 Hours
TEXT BOOK
1. Pervasive Computing: Technology and Architecture of
Mobile Internet Applications, Jochen Burkhardt,
Thomas Schaeck, Horst Henn, Stefan Hepper, Klaus
Rindtorff, Pearson Education, April 2002.
REFERENCE BOOK
1. Pervasive Computing: the mobile
nd
Hansmann, springer, 2 edition, 2003
82
world,
Uwe
: CS0440
CIE
: 50% Marks
Hrs/Week
: 04
SEE
: 50% Marks
SEE Hrs
: 03
Course Outcome
On successful completion of the course the students will be able to
1.
Familiarize with basics of game theory-actions,
preferences, payoffs. Apply game theory to different scenarios,
examine and evaluate different situations using game theoretic
approach.
2.
Compare applications of deterministic outcome and
applications of probabilistic outcome (mixed strategy)
3.
Construct sub-games under extensive game with perfect
information and illustrates how to find subgame perfect equilibrium.
4.
Compute Nash equilibrium for situations which can be
modeled as Bayesian games.
5.
Test the theory of Nash equilibrium in strictly competitive
games and analyze rationalizability of a game.
6.
Acquire knowledge on monomorphic and polymorphic
evolutionary games and analyze repeated games.
UNIT 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.
SLE: Find Nash equilibrium for BOS and Stag -Hunt game
8 Hours
UNIT 2
MIXED STRATEGY EQUILIBRIUM: Introduction; Strategic games
in which players may randomize; Mixed strategy Nash equilibrium;
83
84
UNIT 6
EVOLUTIONARY
EQUILIBRIUM,
ITERATED
GAMES:
Monomorphic pure strategy equilibrium; 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;
Repeated games: Nash equalibria of general infinitely repeated
games, finitely repeated games.
SLE: Nash equilibrium of an infinitely repeated Prisoners dilemma.
9 Hours
TEXT BOOK
1. An Introduction to Game Theory Martin Osborne,
Oxford University Press, Indian Edition, 2004.
REFERENCE BOOKS
1. Game Theory: Analysis of Conflict Roger B. Myerson,
Harvard University Press, 1997.
2. Microeconomic Theory Andreu Mas-Colell, Michael D.
Whinston, and Jerry R. Green, Oxford University Press,
New York, 1995.
3. Game Theory and Strategy Philip D. Straffin, Jr., The
Mathematical Association of America, January 1993.
85
: CS0442
CIE
: 50 %
Hrs / week
: 04
SEE
: 50 %
SEE Hrs
: 04 Hours
Max.Marks
: 100
Course Outcome
On successful completion of the course the students will be able to
1.
2.
3.
4.
5.
6.
Identify the issues in designing Security Protocols for Adhoc networks focusing on the working performance of
Various protocols.
UNIT 1
INTRODUCTION: Cellular and Ad Hoc Wireless networks,
Applications of Ad Hoc wireless networks; Issues in Ad hoc
wireless networks: Medium Access Scheme, Routing, Multicasting,
Transport Layer Protocols, Pricing Scheme, Quality of service
positioning, Self-organization, Security, Addressing and Service
Discovery, Energy Management, Scalability, Deployment
Considerations;
SLE : Ad hoc wireless Internet.
9 Hours
86
UNIT 2
MAC PROTOCOLS: MAC Protocols for Ad hoc wireless Networks:
Introduction, Issues in designing a MAC protocol for Ad hoc
wireless Networks, Design goals of a MAC protocol for Ad-hoc
wireless Networks, Classification of MAC Protocols, Contention
based
protocols
with
reservation
mechanisms:
DPRMA,CATA,SRMA/PA,FPRP, HRMA
SLE : MACA/PR Protocol
9 Hours
UNIT 3
ROUTING PROTOCOLS-I : Routing protocols for Ad-hoc Wireless
Networks: Introduction, Issues in Designing a Routing Protocol for
Ad-hoc Wireless Networks, Classification of Routing Protocols.
TABLE DRIVEN ROUTING PROTOCOLS: DSDV, WRP, CGSR
SLE: STAR protocol
8 Hours
UNIT - 4
ROUTING PROTOCOLS- II: On-Demand Routing Protocols:
Dynamic source Routing Protocol DSR, AODV, TORA, LAR, ABR,
and FORP.
SLE: SSA protocol
9 Hours
UNIT - 5
TRANSPORT LAYER: Transport Layer Protocols for Ad-hoc
wireless Networks: Introduction, Issues in Designing a Transport
Layer Protocol for Ad-hoc wireless Networks, Design Goals of a
Transport Layer Protocol for Ad hoc wireless Networks,
Classification of Transport Layer Solutions, TCP over Ad-hoc
wireless Networks: Feedback-Based TCP, TCP with Explicit Failure
Notification, TCP-BUS, Ad-hoc TCP, Split TCP.
SLE : Other Transport layer Protocols for Ad-hoc wireless
Networks: ACTP and ATP.
9 Hours
87
Unit 6
SECURITY: Security in wireless Ad hoc wireless Networks,
Network security requirements, Issues & Challenges in Security
Provisioning, Network security Attacks, Key Management:
Symmetric and Asymmetric key Algorithms, key Management
Approaches, key management in Ad-hoc Wireless Networks:
Secure routing in Ad hoc wireless Networks: Requirements, SAR
protocol, Security-Aware AODV protocol
SLE : ARAN Protocol
8 Hours
TEXT BOOK
1. Ad hoc Wireless Networks C. Siva Ram Murthy & B. S.
nd
Manoj, 2 Edition, Pearson Education, 2005.
REFERENCE BOOKS
1.
2.
3.
88
: CS0445
CIE
: 50% Marks
Hrs/week
: 03
SEE
: 50% Marks
SEE
: 03 Hrs
Max. Marks
: 100
Course Outcome:
On successful completion of the course the students will be able to
1.
2.
3.
4.
5.
6.
of
Election
Algorithms
and
mechanisms
and
UNIT 1
Introduction to distributed systems
What is a distributed system? Goals, disadvantages over
centralized and independent PCs. Bus-based, switched multiprocessors and multi-computers. Networking, true distributed and
multi-processor time sharing systems.
SLE : Advantages of distributed systems
8 Hours
UNIT 2
89
90
Text Books
1. Distributed Operating systems Andrew S. Tanenbaum ,
1st edition, Pearson publication
Reference Books:
1. Distributed systems, concepts and design, G. Colouris, J.
Dollimore and Tim Kinderg, 3rd edition, pearson publications.
91
: CS0446
CIE
: 50 %
Hrs / week
: 04
SEE
: 50 %
SEE Hrs
: 4 Hours
Max. Marks
: 100
Course Outcome
On successful completion of the course the students will be able to
1.
2.
3.
4.
5.
6.
UNIT 1
Introduction to Wireless Communication Systems &
Networking: Evolution of Mobile Radio Communication, examples
of Wireless Communication Systems, Paging System, Cordless
Telephone System. Cellular Telephone Systems,
SLE: Comparison of Common Wireless Communications Systems.
8 Hours
UNIT 2
Modern Wireless Communications Systems: Second generation
(2G), Cellular Networks, evolution of 2.5G, TDMA Standards, Third
92
93
94
Networks,
William
: CS0443
CIE
: 50 %
Hrs / week
: 04
SEE
: 50 %
SEE Hrs
: 4 Hours
Max. Marks
: 100
95
96
97
98
99
: CS0444
CIE
: 50 %
Hrs / week
: 04
SEE
: 50 %
SEE Hrs
: 4 Hours
Max. Marks
: 100
Course Outcome
On successful completion of the course the students will be able to
1. Analyze several key technologies used in manipulating, storing
and analyzing big data.
2. Experiment with R & Hadoop.
3. Acquire clear understanding of Integrating R & Hadoop
4. Acquire clear understanding of Hadoop Streaming and its
importance.
5. Manage Big Data and analyze Big Data.
6. Apply tools and techniques to analyze Big Data.
UNIT 1
INTRODUCTION TO BIG DATA
Big Data and its Importance Four Vs of Big Data Drivers for
Big Data Introduction to Big Data Analytics..
SLE: Big Data Analytics Applications
8 hrs
UNIT 2
INTRODUCTION TO R & HADOOP
Getting Ready to Use Rand Hadoop, Installing R, Understanding
the features of R language, Installing Hadoop, Understanding
Hadoop features ,Learning the HDFS and Map Reduce
architecture ,Writing Hadoop Map Reduce Programs, Introducing
Hadoop Map Reduce ,Understanding the Hadoop Map Reduce
fundamentals, Writing a Hadoop Map Reduce example ,Learning
the different ways to write Hadoop Map Reduce in R
SLE: Installing R Studio
10 hrs
100
UNIT 3
INTEGRATION OF R & HADOOP
Integrating R and Hadoop, Introducing RHIPE ,Understanding the
architecture of RHIPE Understanding RHIPE samples,
Understanding the RHIPE function reference, Introducing RHadoop
,Understanding the architecture of RHadoop, Understanding
RHadoop examples, Understanding the RHadoop function
reference.
SLE : Installation of RHadoop
8 hours
UNIT 4
HADOOP STREAMING WITH R
Using Hadoop Streaming with R - Introduction, Understanding the
basics of Hadoop streaming, Understanding how to run Hadoop
streaming with R ,Understanding a Map Reduce application.
SLE: Hadoop Streaming Packages.
8 hours
UNIT 5
DATA ANALYTICS WITH R AND HADOOP
Understanding the data analytics project life cycle Introduction,
Identifying
the
problem,
Designing
data
requirement
,Preprocessing data ,Performing analytics over data ,Visualizing
data, Understanding data analytics problems ,Exploring web pages
categorization Case Study: Predicting the sale price of blue book
for bulldozers.
SLE: Case Study: Stock Market exchange
10 hours
UNIT 6
UNDERSTANDING BIG DATA ANALYSIS WITH MACHINE
LEARNING
Introduction to machine learning ,Types of machine-learning
algorithms, Supervised machine-learning algorithms, Recommen-
101
in
102
: CS0201
CIE
: 50% Marks
Hrs/week
: 02
SEE
: 50% Marks
SEE Hrs
: 02 Hours
Max. Marks
: 50
Course Outcome
On successful completion of the course the students will be able to
1.
Understand Data Mining concepts and applications of Data
Mining Applications.
2.
3.
UNIT 1
Introduction to Data Mining:
Motivation and importance, What is Data Mining, Relational
Databases, Data Warehouses, Transactional Databases,
Advanced Database Systems and Advanced Database
Applications, Data Mining Functionalities, Interestingness of a
pattern Classification of Data Mining Systems.
SLE: Major issues in Data Mining.
9 Hours
UNIT 2
Data Warehouse and OLAP Technology for Data Mining
What is a Data Warehouse? Multi-Dimensional Data Model, Data
Warehouse Architecture, Data Warehouse Implementation,
Development of Data Cube Technology.
SLE: Data Warehousing to Data Mining
9 Hours
UNIT 3
Data Preprocessing
Why Pre-process the Data? Data Cleaning, Data Integration and
Transformation Data Reduction, Discretization.
103
104
: CSO202
CIE
: 50% Marks
Hrs/week
: 02
SEE
: 50% Marks
SEE Hrs
: 02 Hours
Max. Marks :
50
Course Outcome
On successful completion of the course the students will be able to
1.
Explain the Types of Ad hoc Networks and the challenges
facing Ad hoc Networks.
2.
3.
Different Energy Management Schemes in Ad hoc
Networks.
UNIT 1
Ad hoc Wireless Networks
What is an Ad Hoc Network? Heterogeneity in Mobile Devices
;Wireless Sensor Networks ; Traffic Profiles ; Types of Ad hoc
Mobile Communications ;Types of Mobile Host Movements;
Challenges Facing Ad hoc Mobile Networks ;
SLE: Ad hoc wireless Internet.
8 Hours
UNIT 2
QoS
Introduction; Issues and Challenges in Providing QoS in Ad hoc
Wireless Networks; Classifications of QoS Solutions ;MAC Layer
Solutions ; Network Layer Solutions ; QoS
Frameworks for Ad hoc Wireless Networks.
SLE: Classification of QoS Solutions
10 Hours
UNIT 3
Energy Management in Ad hoc Wireless Networks
Introduction; Need for Energy Management in Ad hoc Wireless
Networks; Classification of Energy Management Schemes; Battery
105
Management
Schemes.
Schemes;
Transmission
Power
Management
106
: CS0203
CIE
: 50% Marks
Hrs/Week
: 02
SEE
SEE Hrs
: 02 Hours
Max.Marks : 50
: 50% Marks
Course Outcome
On successful completion of the course the students will be
able to
1.
Explain fundamentals of client-server programming and
socket interface.
2.
Demonstrate various aspects of Client Software design
and implementation.
3.
Illustrate the issues of Server Software design and
implementation.
UNIT-1
The Client Server Model and Software Design: Introduction,
Motivation, Terminology and Concepts Concurrent Processing in
Client-Server software: Introduction, Concurrency in Networks,
Concurrency in Servers, Terminology and Concepts, An example
of Concurrent Process Creation, Executing New Code, Context
Switching and Protocol Software Design, Concurrency and
Asynchronous I/O.
Program Interface to Protocols: Introduction, Loosely Specified
Protocol Software Interface, Interface Functionality, Conceptual
Interface Specification, System Calls, Two Basic Approaches to
Network Communication, The Basic I/O Functions available in
UNIX, Using UNIX I/O with TCP/IP.
The Socket Interface: Introduction, Berkley Sockets, Specifying a
Protocol Interface, the Socket Abstraction, Specifying an End Point
Address, A Generic Address Structure, Major System Calls used
with Sockets, Utility Routines for Integer Conversion, Using Socket
Calls in a Program,
SLE:
107
UNIT-2
Algorithms and Issues in Client Software Design: Introduction,
Learning Algorithms instead of Details, Client Architecture,
Identifying the Location of a Server, Parsing an Address Argument,
Looking up a Domain Name, Looking up a well-known Port by
Name, Port Numbers and Network Byte Order, Looking up a
Protocol by Name, The TCP Client Algorithm, Allocating a Socket,
Choosing a Local Protocol Port Number, A fundamental Problem in
choosing a Local IP Address, Connecting a TCP Socket to a
Server, Communicating with the Server using TCP, Reading a
response from a TCP Connection, Closing a TCP Connection,
Programming a UDP Client, Connected and Unconnected UDP
Socket, Using Connect with UDP, Communicating with a Server
using UDP, Closing a Socket that uses UDP, Partial Close for
UDP, A Warning about UDP Unreliability.
Example Client Software: Introduction, The Importance of Small
Examples, Hiding Details, An Example Procedure Library for Client
Programs, Implementation of Connect TCP, Implementation of
Connect UDP, A Procedure that Forms Connections, Using the
Example Library, The DAYTIME Service, Implementation of a TCP
Client for DAYTIME, Reading from a TCP Connection, The Time
Service, Accessing the TIME Service, Accurate Times and Network
Delays, A UDP Client for the TIME Service, The ECHO Service.
SLE: A TCP Client for the ECHO Service, A UDP Client for the
ECHO Service.
9 hours
UNIT-3
Algorithm and Issues in Server Software Design: Introduction, The
Conceptual Server Algorithm, Concurrent Vs Iterative Servers,
Connection-Oriented Vs Connectionless Access, ConnectionOriented Servers, Connectionless Servers, Failure, Reliability and
Statelessness, Optimizing Stateless Servers, Four Basic Types of
Servers, Request Processing Time, Iterative Server Algorithms, An
Iterative Connection-Oriented Server Algorithm, Binding to a Well
Known Address using INADDR_ANY, Placing the Socket in
Passive Mode, Accepting Connections and using them. An Iterative
Connectionless Server Algorithm, Forming a Reply , Address in a
Connectionless Server, Concurrent Server Algorithms, Master and
108
109
: CS0204
CIE
: 50% Marks
Hrs/Week
: 02
SEE
: 50% Marks
SEE Hrs
: 02 Hours
Max.Marks : 50
Course Outcome
On successful completion of the course the students will be
able to
1.
Explain
the
Internet
fundamentals
HTML/XHTML/CSS for web page creation.
and
use
2.
Demonstrate the usage of JavaScript for web page
development.
3.
XML.
Unit-1
Fundamentals: Introduction To The Internet, The World Wide
Web, Web Browsers, Web Servers, Uniform Resource Locators,
Multipurpose Internet Mail Extensions, The Hypertext Transfer
Protocol, The Web Programmers Toolbox.
Introduction To XHTML: Origin And Evolution Of HTML And
HTML, Basic Syntax, Standard XHTML Document Structure, Basic
Text Markup, Images, Hypertext Links, Lists, Tables, Forms,
Frames, Syntactic Differences Between HTML And XHTML.
Cascading Style Sheets: Introduction, Levels Of Style Sheets,
Style Specification Formats, Selector Forms, Property Value
Forms, Font Properties, List Properties, Color, The Box Model,
Background Images, The <Span> And <Div> Tags, Conflict
Resolution.
SLE: Alignment of text, conflict resolution
8 hours
Unit-2
The Basics Of JavaScript: Overview Of JavaScript, Object
Orientation And JavaScript, General Syntactic Characteristics,
110
111
112