Escolar Documentos
Profissional Documentos
Cultura Documentos
Syllabus for
I-Semester
II-Semester
01 CT 416 Elective II 3 - - 3
02 CT 417 Elective Lab II - - 2 1
03 CT 418 Project - - 28 14
Total 3 - 30 18
Elective I:
1. Storage and Virtualization
2. Advanced Unix Programming
3. Subjects In association with Industries
Elective II
1. Multimedia Techniques
2. Advanced Computer Graphics
3. Service Oriented Architecture
4. Subjects In association with Industries
CT 401: COMPILER CONSTRUCTION
UNIT II [4 hrs]
Lexical Analysis
Concept of Lexical Analysis, Regular Expressions, Deterministic finite automata (DFA), Non-
Deterministic finite automata (NFA), Converting regular expressions to DFA, Converting NFA to DFA,
Hand coding of Lexical analyzer, Introduction to LEX Tool and LEX file specification, Error detection and
recovery in LEX.
UNIT IV [7 hrs]
Semantic Analysis & Intermediate Representation
Need of semantic analysis, Abstract Parse trees for Expressions, variables, statements, functions and
class declarations, Syntax directed definitions, Syntax directed translation schemes for declaration
processing, type analysis, scope analysis , Symbol Tables (ST),Organization of ST for block structure
and non block structured languages, Symbol Table management, Type Checkers : type checking
for expressions, declarations ( variable, type, function, recursive), statements, Intermediate code
generation: Intermediate languages, Design issues, Intermediate representations: three address, postfix
& abstract syntax trees, Intermediate code generation for declaration, assignment, iterative
statements, case statements, arrays, structures, conditional statements, Boolean expressions,
procedure/function definition and call.
UNIT V [6 hrs]
Run-Time Memory Management & Code generation
Model of a program in execution, Stack and static allocation, Activation records , Issues in the design of
code generation, Target machine description, Basic blocks & flow graphs, Expression Trees, Unified
algorithms for instruction selection and code generation., Sethi Ullman algorithm for expression trees ,
Aho Johnson algorithm, Different models of machines , order of evaluation, register allocation , Code
generator-generator concept.
UNIT VI [4 hrs]
Code Optimization
Introduction, Principal sources of optimization, Machine Independent Optimization, Machine dependent
Optimization, Various Optimizations: Function preserving transformation, Common Sub-expressions,
Copy propagation, Dead-code elimination, Loop Optimizations, Code Motion, Induction variables and
reduction in strength, Peephole Optimization, Redundant –instruction elimination
Text Books:
1. Alfred V. Aho, A. V. R. Sethi and J.D. Ullman “Compiler Principle, Techniques and Tools”
Addison Wesley
Reference Books:
1. Barrent W. A., J. D. Couch, “Compiler Construction Theory and Practice”, Computer Science series,
Asian student edition.
2. Dhamdhere D.M., “Compiler Construction Principle and Practice”, Mac. Millan India, New Delhi
3. Manish Kumar Jhas, “Compiler Construction –An advance course”.
4. Ravendra Singh, Vivek Sharma, Manish Varshney, ”Design and Implementation of Compiler” , New
Age Publications.
5. Holub, A.J., “Compiler design in C” –Prentice Hall.
6. John Levine, Tony Mason & Doug Brown, “Lex and Yacc”, O’Reilly.
CT 402: Design and Analysis of Algorithms
Unit I [3 Hrs]
Introduction
Objectives of time and space analysis of algorithms; Order notations (O, Θ, Ω notations) with reference
to the following algorithms: bubble sort, selection sort, insertion sort, Recurrences
Unit II [3 Hrs]
Data Structures
Arrays, Linked lists, Stacks and Queues. Binary search trees, Red-Black trees, Hash tables, Basics of
graphs and their representations, Heaps and Heapsort
Design Techniques
Divide and Conquer : Merge-sort, Strassen’s Matrix Multiplication, Quick-sort with average case analysis
Greedy Algorithms: Fractional Knapsack, Huffman Coding Dynamic Programming : 0/1 Knapsack,
Longest common subsequence, Matrix chain multiplication or Optimal search trees Backtracking : N-
Queens Problems, Sum of subsets problem, Branch-and-bound : 0/1 Knapsack problem, Assignment
Problem
Unit V [6 Hrs]
Unit VI [4 Hrs]
Complexity Theory
Lower-bound arguments, NP-completeness, Introduction to NP-Complete, Reducibility (SAT,
Independent_Set, 3VC, Subset Sum & Partition ,Hamiltonian Circuit)
Text Books:
1. Thomas Cormen, Charles Leiserson, Ronald Rivest and Cliford Stein, “Introduction to
Algorithms”, PHI
Reference Books:
1. E. Horowitz and S. Sahni. “Fundamentals of Computer Algorithms” , Galgotia, 1991
2. V. Aho, J. E. Hopcroft, and J. D. Ullman, “The Design and Analysis of Computer Algorithms”,
Addison Wesley, 1974
CT 403: INFORMATION SECURITY
Unit I [5 Hrs]
Introduction
Need of security, security services, Active vs. Passive attacks, OSI Security Architecture, one time
passwords, A Model for Network security, Classical Encryption Techniques like substitution ciphers,
Transposition ciphers, Steganography and digital Watermarking
Unit II [6Hrs]
Symmetric Key Encryption
Modular Arithmetic, Euclid’s Algorithm, Block ciphers, Stream ciphers, RC4 Stream cipher, Data
Encryption Standard, AES, Triple DES, RC5, IDEA
Unit IV [6 Hrs]
Authentication and Email Security
Digital Signatures, Digital Signature Standards, Authentication Protocols, Kerberos, X.509 Digital
Certificate Standard, Authentication service, Pretty Good Privacy, S/MIME
Unit V [6 Hrs]
IP and Web Security
Internetworking and Internet protocols: IPv4, IPv6, IP security Architecture, Authentication Header,
Encapsulating Security Payload, Key Management, Web Security Considerations, Secure Socket Layer
and Transport Layer Security, Secure Electronic Transaction.
Unit VI [6 Hrs]
System Security
Intruders, Intrusion Detection, Password Management, Worms, viruses, Trojans, Virus
Countermeasures, Firewalls, Firewall Design Principles, Trusted Systems.
Cyber Security
India IT act 2000, Penalties & Offences under the Information Technology Act, 2000, cyber forensics
Text Books:
2. William Stallings, “Cryptography and Network Security, Principles and Practices”, Pearson
Education, Third Edition
3. Charlie Kaufman, Radia Perlman and Mike speciner, “Network security, Private communication
in a Public World”
4. V. K. Pachghare “Cryptography and Information Security”, PHI
Reference Books:
3. Christopher M. King, “Security architecture, design deployment and operations”, Curtis patton
and RSA Press.
4. Stephen Northcatt, Leny Zeltser, “INSIDE NETWORK Perimeter Security”, Pearson Education
Asia.
5. Robert Bragge, Mark Rhodes, Heith straggberg, “Network Security the Complete Reference”,
Tata McGraw Hill Publication.
CT 404: ADVANCED COMPUTER ARCHITECTURE
UNIT I [6 Hrs]
Overview of Parallel Processing and Pipelining Processing
Necessity of high performance, Constraints of conventional architecture, Parallelism in uniprocessor
system, Evolution of parallel processors, future trends, Architectural Classification, Applications of
parallel processing, Instruction level Parallelism and Thread Level Parallelism, Explicitly Parallel
Instruction Computing (EPIC) Architecture, Case study of Intel Itanium Processor, Principles of scalable
performance: Performance Metrics and Measures, Speedup Performance Laws.
UNIT II [8 Hrs]
Pipeline Architecture
Principles and implementation of Pipelining, Classification of pipelining processors, General pipelining
reservation table, Design aspect of Arithmetic and Instruction pipelining, Pipelining hazards and
resolving techniques, Data buffering techniques, Job sequencing and Collision, Advanced pipelining
techniques, loop unrolling techniques, out of order execution, software scheduling, trace scheduling,
Predicated execution, Speculative loading, Register Stack Engine, Software pipelining, VLIW (Very Long
Instruction Word) processor, Case study: Superscalar Architecture- Pentium, Ultra SPARC, Recent
advances in pipelining
UNIT IV [8 Hrs]
Multiprocessor Architecture
Loosely and Tightly coupled multiprocessors, Processor characteristics of multiprocessors, Inter
Processor communication network, Time shared bus, Crossbar switch, Multiport Memory Model,
Memory contention and arbitration techniques, Cache coherency and bus snooping, Massively Parallel
Processors (MPP), COW’s and NOW’s Cluster and Network of Work Stations), Chip Multiprocessing
(CMP), Case Study of IBM Power4 Processor, Inter Processor Communication and Synchronization
UNIT V [7 Hrs]
Multithreaded Architecture
Multithreaded processors, Latency hiding techniques, Principles of multithreading, Issues and solutions,
Parallel Programming Techniques: Message passing program development, Synchronous and
asynchronous message passing, Message passing parallel programming, Shared Memory Programming,
Data Parallel Programming
UNIT VI [8 Hrs]
Parallel Software Issues
Parallel algorithms for multiprocessors, classification of parallel algorithms, performance of parallel
algorithms, Operating systems for multiprocessors systems, Message passing libraries for parallel
programming interface, PVM (in distributed memory system), Message Passing Interfaces (MPI),
pThreads (in shared memory system), Parallel Programming Languages : Fortran 90, Occam, C-Linda,
CCC etc., Issues towards cluster computing. Introduction to Neuro Computing and Grid Computing
Study: Study of dual core and multi core architecture, comparatively advances.
Text Books:
1. Kai Hwang, Faye A. Briggs, “Computer Architecture and Parallel Processing” McGrawhill
international Edition
2. Kai Hwang, “Advanced Computer Architecture”, Tata McGrawhill Edition
References:
1. V. Rajaraman, L Sivaram Murthy, “Parallel Computers”, PHI.
2. William Stallings, “Computer Organization and Architecture, Designing for
performance” Prentice Hall, Sixth edition
3. Kai Hwang, Scalable Parallel Computing
4. Harrold Stone, High performance computer Architecture
5. Richard Y. Kain , Advanced Computer Architecture
CT 405: ELECTIVE- I
I) STORAGE AND VIRTUALISATION
Teaching Scheme Examination Scheme
Lectures : 3 hrs/week Mid-sem. Exam –30 marks
Assignment/Quizzes – 20 marks
End Sem Exam - 50 marks
UNIT I [8 Hrs]
Basic Concepts for Systems and Storage
OS and Device Driver Concepts- Kernel, device drivers, firmware, RDMA, boot sector, device
partitioning, UNIX flavors File System Concepts- File system, virtual memory, namespace, metadata,
buffer cache, defragmentation Storage Challenges and Issues- Data sources, challenges of data
growth, availability, performance and managability requirements, data virtualization
UNIT II [6 Hrs]
Storage Hardware and SCSI Protocol
Storage Hardware Building Blocks - Device Types (Magnetic Disks, JBOD, SSD, Optical, WORM), HBA,
switches, hubs, routers, GBIC Introduction to various Storage Protocols- Serial, Parallel protocols.
Overview of IDE, SAS, SATA, SCSI, FC, FCoE, iSCSI, Infiniband, FCP, FC-IP, iFCP, Various standards
SCSI Protocol- SCSI-2, SCSI-3, SAM, SPC, SBC, Common commands, PGR
UNIT IV [6 Hrs]
Storage Virtualization Concepts
Data Center End to End View- Overview of complete stack including Storage, Network, Host, Clustering,
High Availability, Applications, Virtual Machines, Cloud Storage Storage Virtualization Basics- RAID
levels, I/O stack, OS abstraction, Storage Pooling, Storage Provisioning, Online Grow/Shrink Storage
Virtualization Advanced topics- Metadata management, Transaction consistency, I/O maps, I/O path
considerations, Data consistency, Crash recovery, Application interfaces
Unit V [8 Hrs]
Applications and Use Cases for Storage Virtualization
Data Replication- Off-host processing, RPO/RTO, Replication (sync, async, periodic, continuous),
Snapshots Data Protection- Backup (full, incremental, differential, continuous), Restore, Archival,
Compliance considerations Capacity Management- Storage provisioning, De-duplication, Thin
provisioning, Storage Tiering, ILM, Data classification, Storage grid
UNIT VI [6 Hrs]
High Availability, Clustering and Performance Considerations
Device Multipathing and Path Virtualization- Device discovery, Device types (A/A, A/P), Device
abstraction, Path failover, Load balancing High Availability- Server/data/application availability,
Replication, Data consistency Clustering- Cluster types, Failover models, Distributed systems, Locking
and data consistency, High speed interconnects, Application integration Performance- Concepts (IOPS,
Latency, Throughput, Throttling, Writeback), Bottlenecks, Tools, Techniques and Considerations
Text Books:
UNIT I [8 Hrs]
Files & Directories
File system Layout, Inode structure, types of inode,Internal Representation of files , file descriptors,
open, create, close, lseek, read & write functions, File Sharing, Atomic operations , File access
permissions , Buffering
UNIT II [6 Hrs]
Process management
Process Control, System Boot and INIT process, Process Scheduling
UNIT IV [6 Hrs]
Memory Management
Data Structures for Process, Swapping algorithms, Belady's anomaly, Swapping, Demand Paging,
Daemon Processes
Unit V [8 Hrs]
Signals
Unix kernel supports of signals, process termination and awaiting process termination, invoking other
programs, signal mask, sigaction, SIGCHLD signals and wait pid, kill, alarm
UNIT VI [6 Hrs]
Inter-Process Communications, Shared Memory, Semaphores
Inter-process communications, Stream Pipe, Sockets.
Text Books:
1. “The Design of Unix Operating System”, by Maurice J. Bach, PHI.
2. “Advance Programming in the Unix Environment”, by W. Richard Stevens, Addison Wessley.
CT 406: INFORMATION SECURITY LAB
Laboratory Assignments:
1. Remote Copy:
Take two hosts. One both hosts create ram disks of 10MB each. Create synchronous remote
replication functionality from host1 to host2.
Remote copy for a data is used for disaster recovery. A copy of data is kept on a remote m/c
which can be used for recovery in case of disaster of local site. Following are key properties of
remote copy:
Implementation:
1. Implement ram disk driver and corresponding driver interfaces. Use open source ram disk
for reference
2. Source m/c:
- Create a kernel thread to setup a connection with target m/c
3. Target m/c
- Write a kernel thread to accept a connection from source m/c
- Receive write request from source m/c
- Write data to local ram disk and acknowledge
4. Source m/c:
- Handle code to write to local as well as remote disk.
2. Writing a simple File System which provide functionality of "ls -lR, touch, cat" posix comm
ands".Apart from that it should support mmap operation . Please also write a application
programme to test mmap functionality.
Hints: use strace to find out what all the operation should be implemented to support "ls -lR"
and other posix commands.
Snapshot:
A snapshot is a point in time image of any device. Once a snapshot is taken, the content of the
snapshot should be what existed before snapshot was taken. No new I/O should go to
snapshot.
To support snapshot while I/Os are still running on original disk, a mapping has to be
preserved which identifies which blocks are copied into snapshot device. Any new I/O on
original device should check for the map and if data has not been copied to snapshot, it should
be first read from original disk, written to snapshot disk and then new I/O should be allowed
on source disk.
The snapshot should be preserved in a flat file on local disk.
Recovery:
A recovery involves restoring data from a previously taken backup. In our example, an
interface should be provided to read data from backup (flat file) and put into ramdisk.
Implementation:
1. Implement ram disk driver and corresponding driver interfaces. Use open source ram disk
for reference
2. Write utility to start a snapshot (using ioctl). As part of this ioctl, a file should be open to be
used for backup. Initialize bitmap.
3. For every incoming write check in bitmap if source data is already copied to snapshot. If not,
read from source and copy to file and then allow i/o to source disk.
4. Periodically, copy data source to backup for areas which are yet to be copied.
4. Write a "Examination data server" which is using PostGreSQL open source database for storing
students examination report, which is a snapshot of all present students's report of college.The
report consist of six field :
Name Id Branch Grade{ in each semester} Final Grade Papers Uncleared
A client programme{ please also write client programme to support it } can query on various
parameter and this server should generate a report for same {e.g. The no of students having
CGPA(final grade) 7.0 and above in all branches/particular branches., The No. of students not
cleared in Mathematics yet , Name of topper in every branch etc..}. Please user pthreads to
support multiuple client queries.Please also implement write functionality {update in case of old
students / addition (new students)/delition(final semester students who has passed out } and
use reader/writer lock.
I) COMPILER CONSTRUCTION:
1. Calculator (text or graphics) using LEX and YACC or Document Editor (find, replace, macro)
using LEX and YACC, or Similar kind of assignment using LEX and YACC.
2. Lexical Analyzer for extracting noun and verb phrases from the input English text
document.
3. Syntax Analyzer along with Intermediate code generation (Triple, Quad) for a subset of
English language.
4. Interpreter for an expression grammar.
5. Design English to Hindi Converter for a subset of English language using LEX and YACC.
6. Code generator for a Hypothetical Machine.
7. Any two optimization techniques on Intermediate Code Generation
Constant expression evaluation.
Local copy propagation.
Common sub expression elimination.
Loop invariant code movement.
8. Pseudo language compiler (for 8085 machine) using LEX and YACC.
[Assignment number 2,3,6,7 are compulsory and from the remaining any one]
1. Recursive and Iterative (Non Recursive ) algorithm for specific problem and their
complexity measures (Comparison Expected)
2. Verification of (worst and average) complexity measures of following sorting techniques
3. Selection sort, Bubble sort, Heap sort, Merge sort and Quick sort
4. Minimum Spanning tree as an example of Greedy approach [Prim’s VS. kruskal]
5. Implementation of Single Source and All Pairs Shortest algorithms
6. Finding longest common subsequence of given two sequences using Dynamic Programming
7. 8-Queens Problem – Iterative and Recursive versions
8. Pattern Matching Algorithms: Naïve, Robin-Karp and KMP
9. Finding closest pair of points
CT 409: PROJECT
Students in a group of not more than FOUR will work under the guidance of the faculty member on the
project work undertaken by them. Submission of a report of partially completed work and the
assessment will be done at the end of Semester
CT 416: ELECTIVE- II
I) Multimedia Techniques
UNIT I [6 Hrs]
Introduction:
Multimedia basic concepts, Multimedia building blocks, multimedia applications design considerations,
goals and objectives, architectural support for multimedia processing.
Multimedia Authoring Fundamentals: authoring fundamentals, card/page based, time based, icon
based, theatrical-frame based and object based authoring, interactive multimedia software authoring
basics
UNIT II [8 Hrs]
Multimedia audio: Basic sound concepts, audio capture, sound processor, VOC, WAV file format for
sound, MIDI standard, Basic audio compression technique: ADPCM in speech coding. MPEG audio
compression Technique MP3 encoder and decoder
UNIT IV [4 Hrs]
Augmented and virtual reality
Concept, VR devices: Hand gloves, head mounted tracking system, VR chair, CCD, VCR, 3D, sound
system, Head mounted displays and rendering software setup, Virtual objects, VRML
UNIT V [4 Hrs]
Multimedia devices
Mass storage system for multimedia- requirements, Magnetic devices, Optical devices, CDROM, DVD
Scanners: Types and classification
Text book
1 Ralf Steinmetz, Klara Nahrstedt, Multimedia: Computing, communication and applications
PH-PTR Inovative Technology series
2 Ze nian Li, Marks S. Drew , Fundamentals of Multimedia, PHI india
References:
1 Durano R. Begault, Virtual Reality and Multimedia, AP Professionals
SOA Fundamentals
Defining SOA, Business Value of SOA, Principles of SOA, Evolution of SOA, SOA
characteristics, concept of a service in SOA, Stages of the SOA lifecycle. Enterprise Service Bus, SOA
runtime pattern family.
Unit II [6 Hrs]
SOA programming model, Service Component Architecture (SCA), Service component overview, Service
component definition, Service module, support for QoS within SCA
Unit IV [8 Hrs]
Introduction and evolution of Portals, Portal concepts, Portal Application Development, Overview of JSR
168 API, Developing sample JSR 168 portlet, Pervasive and Workplace Mobility ,Design & Develop
Applications (Composite, Portal, Web Services, Rich Client, Synchronization) & Application Management.
Unit V [7 Hrs]
Web Applications
Introduction to Web Applications, Various Tiers in Web Apps: Presentation, Business Tier, Persistence
Tier, Web Technologies: J2EE : Servlets, JSP, EJBs, HTML, XML, MVC architecture.
Unit VI [6 Hrs]
Web Services
Introduction to Web Services, WSDL, UDDI, SOAP, JAX-RPC , Web 2.0, Creating and Deploying web
services on AXIS, Introduction to Ajax, Ajax Design Basics.
Text Books:
5. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”, Prentice Hall
Publication, 2005
6. Eric Newcomer, Greg Lomow, “Understanding SOA with Web Services”, Addison Wesley
Publication, 2004
Reference Books:
1. Norbert Bieberstein, Sanjay Bose, Marc Fiammante, Keith Jones, Rawn Shah, “Service-Oriented
Architecture Compass: Business Value, Planning,and Enterprise Roadmap”, IBM Press
Publication, 2005.
2. Sandy Carter, “The New Language of Business: SOA & Web 2.0”, IBM Press, 2007.
3. Thomas Erl, “Service-Oriented Architecture: A Field Guide to Integrating XML and Web
Services”, Prentice Hall Publication, 2004
4. Dave Chappell, “Enterprise Service Bus”,O'Reilly Publications, 2004
5. Sanjiva Weerawarana, Francisco Curbera, Frank Leymann, Tony Storey, Donald F.Ferguson,
“Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WS- Addressing, WS-BPEL, WS-
Reliable Messaging, and More”, Prentice Hall Publication, 2005
6. IBM Redbooks on SOA
7. IBM Redbooks on Portal
8. IBM Redbooks on WED / Expeditor / WCTME
CT 417: ELECTIVE LABORATORY -II
List of Assignments:
1. Parsing WAV and VOC sound files and reading those by programming in C/VC++
2. Write a program to convert WAVE file to VOC and vise versa
3. Designing Media player using MCI commands to play sound – WAV, VOC, MIDI, AVI files etc.
4. Understanding standard Image file formats e.g. BMP, TIFF,
Displaying Image, in any of the above mentioned format, on screen
5. Write a program to convert BMP file to TIFF and vise versa
6. Implement the compression algorithm and find out the compression ratio
7. Understanding audio visual information stored in AVI file format and displaying the same as a
sequence of images/frames on the screen
8. Developing presentation package which will enable to integrate text, image and sound media
(trivialized version of Power Point like application development package)
9. Create a web interface for displaying images from your image database
10. Creation of virtual scene using VRML
11. Study of authoring tool – Director 8, to create presentation using multimedia files.
12. Study of 3D Animator – 3D Studio, to create 3D world
Students worked in a group in the first semester will complete the project work under the guidance of
the faculty member. Deliverables of the project undertaken along with a report of the work done will be
submitted at the end of Semester. The assessment of the project will comprise of demonstration and
oral examination.