You are on page 1of 11

Defence Institute of Advanced Technology, Girinagar, Pune

M.Tech. (Computer Science & Engineering)


Academic Year 2009-10

Semester I
Sr# Course Course Contact Hours Mark Instructor
No. L T P
1 CE 611 Data Structure and Algorithm 3 0 0 100 Mrs VS Nayak
2 CE 612 Computer Networks 3 0 0 100 Mr Mizaji Lal
3 CE 613 System Software 3 0 0 100 Mr MK Addanki
4 CE 614 Computer Architecture 3 0 0 100 Mr MM Kuber
5 Elective I 3 0 0 100
6 CE 615 Programming Laboratory 0 0 4 50
Total 15 0 4 550

Semester II
Sr# Course Course Contact Hours Mark Instructor
No. L T P
1 CE 616 System Simulation 3 0 0 100 Dr RS Deodhar
2 CE 617 Distributed Systems 3 0 0 100 Mr Shankar Lal
3 Elective II 3 0 0 100
4 Elective III 3 0 0 100
5 Elective IV 3 0 0 100
6 CE 641 Seminar 0 0 0 50
Total 15 0 0 550

Semester III
Sr# Course Course Contact Hours Mark
No. L T P
1 CE 651 M Tech Dissertation - 1 20 400
2 Audit Course (Optional) 3 0 0 Nil

Semester IV
Sr# Course Course Contact Hours Mark
No. L T P
1 CE 652 M Tech Dissertation - 2 20 500

Elective I: Instructor
CE 618: Relational Database Management System Mr SS Hardas
CE 619: Software Engineering Mr Shankar Lal
CE 620: Soft Computing ---

Version 1.36 of 26 Dec 09


Elective II, III and IV: Instructor
CE 621: Artificial Intelligence & Robotics Mr MK Addanki
CE 622: Embedded System & VLSI Design Mr MM Kuber
CE 623: Mobile Computing ---
CE 624: Data Mining Mr Shashikanth CC
CE 625: Protocol Software Engineering ---
CE 626: Web Technologies & Service Oriented Computing Mr Mizaji Lal
CE 627: High Performance Computing Mr SS Hardas
CE 628: Computer Vision ---
CE 629: Object Oriented Software Design ---
CE 630: Theoretical Computer Science ---

Contact Address of Instuctors


Mr Mizaji Lal mizajilal@diat.ac.in
Mr SS Hardas sshardas@diat.ac.in
Mr MM Kuber mmkuber@diat.ac.in
Mr CC Shashikanth ccshashikanth@diat.ac.in
Mr Shankar Lal shankarlal@diat.ac.in
Dr RS Deodhar rsdeodhar@diat.ac.in
Mrs VS Nayak vidyavatinayak@diat.ac.in
Mr MK Addanki manogna@diat.ac.in

Syllabus
CE 611 Data Structures and Algorithms (3 0 0 100)

Abstract data types, data structures, arrays, stacks, queues, linked lists, Order of algorithms, time
& space complexity, & their tradeoff, recurrence equations-iterative, Induction. Trees, traversals,
binary trees, binary search trees, AVL-trees, set representation of trees, union and find
algorithms, amortized analysis. Advanced search structures- 2-3 trees, 2-3-4 trees, Red-black
trees, B-trees, splay trees. Graphs, universal Hashing function, priority queues, Heaps, Internal &
external sorting, Searching methods, algorithm design techniques- divide & conquer, greedy
algorithms, dynamic programming, examples and analysis, NP-complete and NP-hard problems.

Version 1.36 of 26 Dec 09


Text(*)/References:
1. *Kruse, Tondo, Leung, Data Structure & Algorithm Design in C, PHI, 2nd Ed,1997
2. Aho, Hopcroft, Ullman, Data Structures & Algorithms, PEA, 2006
3. Horowitz, Sahni, Fundamentals of Computer Algorithms, Galgotia Pub, 1994
4. Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, PHI, 2nd Ed,1990

CE 612 Computer Networks (3 0 0 100)

ISO/OSI model, TCP/IP model, Mobile communication networks, usefulness of computer


network. Physical Layer – wired & wireless media & their properties. Data Link Layer –
framing, error detection & correction, flow control, sliding window protocols, MAC layer &
channel allocation problem, Ethernet, wireless, broadband, Bluetooth, DLL switching. Network
Layer –Routing algorithms, congestion control, QoS, Various protocols like RIP, IPv4, IPv6,
ICMP, ARP, DHCP, OSPF, BGP and resource reservation protocols. Class A,B,C Networks,
Hardware like hub, repeater, switch, bridge, router. Transport Layer- TCP, UDP, RTP, Socket
Programming. Application Layer – Applications like DNS, Email, WWW. Sensor networks, IP
Telephony, Simulation of networks, optimized routing models, network Standards, monitoring of
networks and tuning, Introduction to Cryptography; Symmetric key algorithms -DES, AES,
Cryptanalysis; Public Key algorithms: RSA; Digital Signatures & Message digest; Management
of Public Keys – Digital Certificates & X.509; Network security with IPSec; System security
using Firewalls & VPN; e-Cash & secure electronic transaction, Authentication Protocols- Key
Distribution Center, Kerberos, Diffe-Hellman Key exchange; Email Security – PGP & S/MIME;
Web Security – Secure naming, SSL.

Text(*)/References:
1. *AS Tanenbaum, Computer Networks, PHI/PEA,4th Ed,2003
2. Douglas Comer, DL Stevens, Internetworking with TCP/IP (ANSI C version), Vol II,
PHI, 3rd Ed, 1995
3. BA Forouzan, Data Communication & Networking, 4/e, Tata McGraw, 2007

CE 613 System Software (3 0 0 100)

Introduction to grammars, languages, finite state machines, Introduction to Systems


Programming, Introduction to Assembly Language Programming - Introduction to Instruction
Formats, Data. Introduction to Assembler, databases used in assembler design, Design of
Assembler - Single Pass & Double Pass. Introduction to Loaders, functions of a loader, types of
Loaders, databases used in Loaders, Design of Loaders. Introduction to compilers: a brief
discussion on various phases of compilers. Introduction to Software Tools, Text editors,
Interpreters, Program Generators, Debug Monitors.

Introduction to Operating System; Architecture, Memory management, Process Management,


I/O management, Device management, Kernel, Case Studies

Version 1.36 of 26 Dec 09


Text(*)/References:
1. *DM Dhamdhere, Systems Programming & Operating Systems, 2/e, Tata Mc Graw Hill,
1996
2. *JJ Donovan ,Systems Programming, Tata Mc Graw Hill, 1991
3. LL. Beck, System Software – An Introduction to System Programming, 3/e, PEA, 1997
4. AS Tanenbaum, Modern Operating Systems, 3/e, Prentice Hall, 2007

CE 614 Computer Architecture (3 0 0 100)

Basic computer architecture, CPU building blocks, cache design & optimization, Memory
hierarchy, memory protection, memory coherency, virtual memory design, Storage Systems -
Types and uses of storage devices: DAS, NAS, SAN, Interfacing I/O to the rest of the system,
I/O buses. CPU instruction set design, formats, addressing modes, Dynamic instruction
scheduling, Branch prediction, Instruction-level parallelism, Pipelined CPU architecture, CISC,
RISC, EPIC architecture, Superscalar and VLIW architectures, CPU control unit, floating point
unit. Superscaler design, IA-64/Itanium design features, parallel processor organization trends:
SMP, MPP, CCNUMA, cache coherency. Multi core versus Single core processor architecture,
Case studies on current Microprocessor architectures.

Text(*)/References:
1. *John Hennesy, David Patterson, Computer Architecture: A Quantitative Approach,
Elsevier, 4/e, 2007
2. *Stallings W, Computer Organization & Architecture, PEA, 7/e, 2006.
3. M. Morris Mano, Computer System Architecture, Prentice Hall, 1983
4. John P Shen, Mikko Lipasti, Modern Processor Design: Fundamentals of Superscalar
Processors, McGraw-Hill Publishers, 2005.

CE 615 Programming Laboratory (0 0 4 50)

Experiments/Assignments/Small projects based on core subjects e.g. Implementation of abstract


data types and various algorithms, Socket Programming, Simulation of computer networks using
simulators etc. The Lab-in-charge, in collaboration with respective instructors, should frame
three to six assignments on each core subject.

CE 616 System Simulation (3 0 0 100)

Basic Probability & Statistics, Generation of Random numbers, Discrete event simulation,
Stochastic processes & Markov chains, Variance reduction techniques, Queuing theory models,
System performance evaluation & metrics with stress on computer systems & computer
Version 1.36 of 26 Dec 09
networks, Petri nets, Modelling & analysis of LAN, satellite networks, dependability analysis of
multistage interconnection networks, multiprocessor performance analysis, simulation of cache,
memory banks.

Text(*)/References:
1. *Sheldon M Ross, Simulation, Academic Press, 3/e, 2002.
2. *Hamdy Taha, Operations Research: An Introduction, 6/e, Prentice Hall, 2002.
3. Thomas G. Robertazzi, Computer Networks and Systems: Queueing Theory and
Performance Evaluation, Springer-Verlag, 1990
4. Gunter Bolch, Stefan Greiner, Hermann de Meer, KS Trivedi, Queueing Networks and
Markov Chains: Modeling and Performance Evaluation with Computer Science
Applications, 2/e, Wiley, 2006.
5. Paul J. Fortier, HE Michael, Computer Systems Performance Evaluation and Prediction,
Elsevier Scienc, 2003

CE 617 Distributed Systems (3 0 0 100)

Introduction, basic concepts, client-server model, communication-layered protocols, remote


procedure call, remote object invocation, message-oriented communication, processes-threads,
clients, servers, code migration and software agents, Naming: naming entities, example, locating
mobile entities, synchronization-clock synchronization, synchronization algorithms, mutual
exclusion, mutual exclusion algorithms, distributed transactions-transaction model,
classification, concurrency control, consistency and replication, distributed commit protocols,
Grid Computing. Service Oriented architecture, DCOM, CORBA, Case Studies.

Text(*)/References:
1. *Tanenbaum A, Steen MV, Distributed Systems Principles & Paradigm, PHI, 2002.
2. Sinha PK, Distributed Operating Systems: Concepts & Design, PHI, 2007.
3. Coulouris, Dollimore, Kindberg, Distributed Systems – Concepts & Design, Addison-
Wesley, 2005.

CE 618 Relational Database Management System (3 0 0 100)

Introduction to database design, Relational data model, Relational algebra & calculus, Schema
refinement & normal forms, SQL queries, constraints & triggers, File storage, tree structured
indexing, hash based indexing, Query evaluation & optimization, Transaction management,
concurrency control & crash recovery, Application development using JDBC. Introduction to
parallel databases & object oriented database systems.

Text(*)/References:
1. *Ramkrishnan, Gehrke, Database Management Systems, 3rd ed,McGraw Hill,2003

Version 1.36 of 26 Dec 09


2. Desai BC, An Introduction to Database Systems, Galgotia, 1994.
3. Korth HF, A Silberschatz, Database Systems Concepts, McGraw Hill,4th ed, 2004

CE 619 Software Engineering (3 0 0 100)

Software life cycle models, software architecture, software requirements analysis, Formal
Methods, software design, software implementation, various software testing methods, Software
Verification & Validation, Software Metrics, Software Risk Assessment, Software Configuration
management, Software Quality Assurance, Software Process Standards like CMM, software
costing, Software Project Management.

Text(*)/References:
1. *Ian Sommerville, Software Engineering, PEA,7th Ed, 2004.
2. R Pressman, Software Engineering A Practioner’s Approach, McHraw Hill, 2005.
3. Len Bass, Paul Clements, Rick Kazman, Software Architecture in Practice, PEA, 2/e,
2003.
4. Jeff Garland, Richard Antony, Large Scale Software Architecture : A Practical Guide
Using UML, Wiley Dreamtech, 2003.

CE 620 Soft Computing (3 0 0 100)


Introduction of Soft-computing tools , Fuzzy sets, Fuzzy Logic & Fuzzy Inference, Genetic
Algorithm, Neural Networks and Probabilistic Reasoning; Applications of Fuzzy Logic concepts
in Engineering Problems; Engineering optimization problem solving using genetic algorithm;
Neural network approaches in engineering analysis, design and diagnostics problems;
applications of probabilistic reasoning approaches
Text(*)/References:
1. *RA Aliev, RR Aliev, Soft Computing & Its Applications, World Sci Pub, 2001.
2. *Timothy J Ross, Fuzzy logic with Engineering Applications, McGraw Hills, 1997.
3. FO Karray, CW DeSilva, Soft Computing & Intelligent Systems, Addison Wesley, 2005
4. Cordon, Herrera, Hoffman, Magdalena, Genetic Fuzzy Systems, World Sci Pub, 2001

CE 621 Artificial Intelligence & Robotics (3 0 0 100)

Introduction, intelligent agents, learning, state space search, problem solving by search, heuristic
search, reasoning, first order logic, knowledge representation, constraint satisfaction, planning
with algorithms and agents, rule based systems, uncertainty and probabilistic reasoning, making
decisions and learning from observations, finding optimal solutions, goal trees, AND/OR graphs,
AO*, game theory, Min Max algorithm, Alpha-Beta pruning, SSS*.

Introduction, Classification, Specifications, notation-Direct Kinematics, Co-ordinate frames,


Rotations, Homogeneous coordinates, Inverse Kinematics problem, Workspace analysis and

Version 1.36 of 26 Dec 09


trajectory planning, work envelope of different robots, Jacobian matrix, Robot Arm dynamics,
Control of Robot Manipulators, Robot applications, Sensing, Low level and High level vision,
Path planning, Human machine interaction.

Text(*)/References:
1. *E Rich & K Knight, Artificial Intelligence, Addison Wesley/TMH, 1990
2. *Mark W Spong, M Vidyasagar, Robot Dynamics & Control, wiley, 1989.
3. Stuart Russell, Peter Norvig, Artificial Intelligence- A Modern Approach, PEA,2/e,2003.
4. E Charniak, D McDermott, Introduction to Artificial Intelligence, PEA, 2006.

CE 622 Embedded System & VLSI Design (3 0 0 100)

Introduction to Embedded System - definitions and constraints; hardware and processor


requirements e.g. ARM, PowerPC, micro-controllers; special purpose processors; input-output
design and I/O communication protocols; co-design approach; example system design; Formal
approach to specification; specification languages; specification refinement and design

Introduction to real time system, embedded systems and reactive systems; Hard and Soft Real
Time Systems; Specification and Modeling; Interprocess communication, scheduling, Real Time
operating system.

Overview of digital logic design, Combinational and sequential circuit concepts, Introduction to
VLSI Technology, Full custom and Semicustom design, Complexity of Design, Need of Design
Automation, Physical Design and Verification, Design Rules, Basic Structure of CPLD and
FPGA cells, Hardware Description Languages, Levels of description, Behavioral and structural
descriptions, FPGA Design flow, Design, simulation, synthesis and Implementation using FPGA
tools.

Text(*)/References:

1. *J. Bhaskar, Verilog HDL primer, BSP publisher, 2001


2. Douglass BP, Real time UML : Developing Efficient Objects for Embedded Systems,
Addison Wesley, 2000
3. Qing Li , Real Time Concept for Embedded Systems ,CMP Books, 2003
4. C Mead, L Conway, Introduction to VLSI Systems, Addition Wesley, 1980
5. DI Perry, VHDL, Tata McGraw Hill, 1998

CE 623 Mobile Computing (3 0 0 100)

Wireless Technologies: Land mobile versus Satellite versus in-building communication systems,
Mobile channel characterization : Fading and shadowing, communication issues, review of
cellular schemes, model and methodology, Cellular telephony, Personal Communication
Systems/Networks, Wireless architecture for mobile computing, Applications, Wireless LANs,
Version 1.36 of 26 Dec 09
Wireless networking, Hand-off Media access method, Mobile IP, unicast & multicast
communication, wireless TCP, security issues, Mobile computing models, system-level support,
disconnected operations, mobility, failure recovery, Information management, Broadcast,
caching, Querying location data, Location & Data management for Mobile computing,
Hierarchial schemes, Performance evaluation & case studies.

Text(*)/References:
1. *Jochen Schiller, Mobile Communication, 2/e, PEA, 2003
2. Abdlsalam A Helal et. al, Any Time Any Where Computing – Mobile Computing
Concepts & Technology, Kluwer International Series in Engineering & Computer
Science, 1999
3. Evaggelia Pitoura, Geaorge Samaras, Data Management for Mobile Computing, Kluwer
International Series in Database Management, 1997

CE 624 Data Mining (3 0 0 100)

Introduction to data mining, various data mining models, Data preprocessing, cleaning,
clustering, visualization, analysis, various data mining techniques & performance evaluation,
enabling data mining through data warehouse, multidimensional data, applications & case
studies.

Text(*)/References:
1. *Gupta, Introduction to Data Mining with Case studies, PHI, 2006
2. Pujari AK, Data Mining Techniques, Universities press (India), 2001
3. Jianei Han, M Kamber, Data Mining Concepts & Techniques, Elsevier,2/e,2006
4. Paulraj Ponnaiah, Data Warehousing Fundamentals, Wiley, 2001

CE 625 Protocol Software Engineering (3 0 0 100)

Introduction to Network Protocols. Fundamentals of protocol implementation: protocol design,


specification, verification and testing as well as implementation issues including packet
classification and filtering, retransmissions and efficiency. SDL, Linux traffic control, kernel
threads and implementation of TCP/IP. Network Protocol STACK.

Text(*)/References:
1. *Sharp, Robin, Principles of Protocol Design, Springer, 2008
2. Mohamed G. Gouda, Elements of Network Protocol Design, Wiley-Interscience, 1/e,
1998
3. Gerard J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1991

Version 1.36 of 26 Dec 09


CE 626 Web Technologies & Service Oriented Computing (3 0 0 100)

XML, XSL, XSLT, XPATH, XQUERY, XLink, XPointer, XForms, Web Services, SOAP,
WSDL, RDF, RSS

Introduction to Service Oriented Computing;Web Services Architectures and Standards:


SOAP,WSDL,UDDI;Modeling and representation of Web Services using XML, RDF, RDFS,
OWL etc.; Engagement of services: Messaging, Transactions, Process specification and
standards such as BPEL4WS, WSCI, WS-C, ebXML; Collaboration: Describing collaborations,
Agents, Multiagent systems, Agent communication languages, Protocols, Commitments and
contracts, Planning, Consistency maintenance, standards such as : FIPA, OWL-S, Economic
models, Organizational models; Selection: Quality of service, Application-level trust, Reputation
mechanisms, Referral systems; Compliance, Trust, Privacy; Common threads, Open problems,
Status and trends

Text(*)/References:
1. *Munindar P. Singh, Michael N. Huhns, Service-Oriented Computing: Semantics,
Processes, Agents by, John Wiley & Sons, 2005
2. Andres Moller, Michael Schwartzbach, An Introduction to XML & Web Technologies,
Addison Wesley, 2006.
3. J. Jackson, Web Technologies: A Computer Science Perspective, PEA, 1/e, 2006

CE 627 High Performance Computing (3 0 0 100)

Introduction & motivation for parallel computing, Parallel architectures & interconnection
network topologies, Concurrency, data clustering, various techniques for parallelization , Parallel
architecture, Interconnection networks, processor arrays, multiprocessors, multicomputers,
Flynn’s taxonomy, Parallel algorithm design, The task/channel model, Fosters design
methodology for parallelization & its applications to various problems, Message passing
programming, Message passing model & its interface, Performance analysis, Speedup,
efficiency, Amdhal’s law, Gustafson – Barsis’s law, the Karp – Flatt metric, isoefficiency metric,

Parallel processing applications in linear algebra, matrices, image processing, Monte Carlo
simulations, solving system of linear algebraic equations, solving partial differential equations
using Finite Difference methods, Sorting, and Combinatorial Search

Text(*)/References:
1. *Quinn MJ, Parallel Programming in C with MPI & OpenMP, Tata McGRAW-HILL ,
2004.
2. Barry Wilkinson, Micheal Allen, Parallel Programming: Techniques & Applications
using Networked Workstations & Parallel Computers, PEA, 2/e, 1999
3. Chandra, Rohit, Teonardo Dagum, Dave Kohr, Dror Maydan, Jeff McDonald, Ramesh
Menon, Parallel Programming in OpenMP, Morgan Kaufmann, 2001.

Version 1.36 of 26 Dec 09


CE 628 Computer Vision (3 0 0 100)

Image processing – notations, matrix theory, kronecker products, random signalsm, spectral
density functions, estimation theory; Traditional & hierarchical data structures – matrices,
chains, topological, relational, pyramids, QUAD trees; Image preprocessing & segmentation
techniques; Discrete geometry and quantization, length estimations, automated visual inspection,
Edge/feature extraction, correspondence and tracking, object recognition and matching, Scene
and activity interpretation depth perception problems, stereo geometry and correspondence,
motion analysis, optical flow, applications of Computer Vision, remote sensing, document
processing, target tracking

Text(*)/References:
1. *Forsyth DA, Jean Ponce, Computer Vision : A Modern Approach, Prentice Hall, 2003
2. Gonzalez, Woods, Digital Image Processing, Prentice Hall, 3/e, 1998.
3. Burger W, Burge MJ, Digital Image Processing: An algorithmic Approach using JAVA,
Springer, 2007.
4. A Low, Introductory Computer Vision and Image Processing, McGraw Hill, 1991.

CE 629 Object Oriented System Design (3 0 0 100)

Object orientation concepts, theories and principles; fundamental concepts of the object model:
classes, objects, methods and messages, polymorphism, encapsulation and inheritance, interface
and implementation, reusability, UML for object-oriented system requirement specification,
analysis and design; case studies and application using some object oriented programming
languages. Design Patterns & Frameworks.

Text(*)/References:
1. *George, Batra, Valacich, Hoffer, Object Oriented System Analysis & Design, Prentice
Hall, 2004.
2. Gamma, Helm, Johnson, Vlissides, Design Patterns, Addison Wesley,1995
3. G Booch et.al., The UML User Guide, Addison Wesley,1999
4. Blaha M, Rambaugh J, Object Oriented Modelling & Design with UML, PEA, 2nd Ed,
2005

CE 630 Theoretical Computer Science (3 0 0 100)

Concept of basic machine mathematical preliminaries, alphabets, strings, language states, graph
and trees. Finite state Machine as an example, finite state model, adjacency matrix, moore and
Mealy FSM capabilities and limitations. Deterministic and Non- Deterministic FSM’s State
equivalence machine. Properties of Regular sets, behavioral description, alphabets, words,
regular expressions FSM associated transition graph, closed regular sets and pumping lemma,

Version 1.36 of 26 Dec 09


decision algorithms for regular sets. FSM properties and limitations. Turning Machine (TM) an
introduction, definitions, formulation of TM model, power of TM over FSM, TM examples,
Universal TM, Church;s- Turing hypothesis, multistack machines, TM limitation, halting
problem, incompleteness and undesirability, Total and partial recursive functions. Production
system, post canonical system acceptors and generators, Markov algorithm. Context free
grammar, rules, formalization, reduced form, derivation trees, simplification of context free
grammar. Chomsky hierarchy. Derivation graphs. Existence of inherently ambiguous context
free languages. Push down stack memory machine (PDM). Definitions push down automata and
context free languages, Properties of context free languages.

Texts/References :
1. *Hopcroft, Motwani, Ullman, Introduction to Automata Theory, Languages and
Computation, 3/e, Narosa, 2006
2. E.V. Krishnamurthy, Introductory Theory of Computer Science, East West Press, 2/e,
2004.

Version 1.36 of 26 Dec 09