This action might not be possible to undo. Are you sure you want to continue?
DEGREE COMPUTER SCIENCE
SYLLABUS FOR CREDIT BASED CURRICULUM (2009 -2010)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING NATIONAL INSTITUTE OF TECHNOLOGY TIRUCHIRAPPALLI – 620 015, INDIA.
. Distributed Systems Advanced Digital Design Elective . National Institute of Technology. 1 .4 Elective .M.5 Seminar SEMESTER III Code CS747 L 3 3 3 0 3 3 17 T 0 0 0 0 0 0 0 P 0 0 0 3 0 0 3 C 3 3 3 2 3 3 17 L 3 3 3 3 3 3 2 20 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 0 0 C 3 3 3 3 3 3 2 20 Course of Study Project Work – Phase I SEMESTER IV L 0 T 0 P 24 C 12 Code CS748 Course of Study Project Work – Phase II L 0 T 0 P 24 C 12 Department of Computer Science and Engineering. Tiruchirappalli – 620 015. (Computer Science) M. Tech. SEMESTER I Code CS701 CS703 CS705 CS707 Course of Study Advanced Concepts in Operating Systems Parallel Computer Architecture Advanced Data Structures And Algorithms Software Systems Laboratory Elective .3 Elective . Tech (Transportation Engineering and Management) Course is 61.1 Elective .2 SEMESTER II Code CS702 CS704 CS706 Course of Study Advanced Concepts in Database Systems. Tech. (Computer Science) The total minimum credits required for completing the M.
. 2 .M. (Computer Science) ELECTIVES (I Semester) Code CS711 CS713 CS715 Course of Study Fault tolerant computing systems Design and analysis of parallel algorithms Advanced network principles and protocols Any Elective from the other department L 3 3 3 3 T 0 0 0 0 P 0 0 0 0 C 3 3 3 3 ELECTIVES (II Semester) Code CS714 CS716 CS718 CS720 Course of Study Real-time systems Network security Mobile network systems Wireless sensor networks L 3 3 3 3 T 0 0 0 0 P 0 0 0 0 C 3 3 3 3 Department of Computer Science and Engineering. National Institute of Technology. Tech. Tiruchirappalli – 620 015.
(Computer Science) CS701. resource reservation. Pearson Education Asia.Distributed File system Distributed shared memory.CISC & RISC processors -Virtual Memory . Caching. Case studies: Open source software. processor scheduling and allocation. Distributed operating system. Review of the ABCs of Cache Performance issues . Distributed Operating system. Instruction set architecture .Multiple Issue . Interrupts. Operating System Concepts. I/O & networking.Distributed scheduling .Dynamic Hardware Prediction . Process Scheduling. 2001.Dynamic Scheduling: Examples and Algorithm . File System. File placement. Disk Scheduling. Instruction Level Parallelism .M. Open SOLARIS TEXT BOOK 1.the VLIW Approach Department of Computer Science and Engineering. structure.Design considerations .clock synchronization . Tiruchirappalli – 620 015.Performance metrics .characteristics . Shared-memory and distributed memory architectures . Memory management. Advanced Concepts in Operating Systems. ADVANCED CONCEPTS IN OPERATING SYSTEMS (3-0-0) 3 Multiprocessor operating system .Main Memory and Organization for Improving Performance . memory management.Speedup performance laws.S. Real Time Operating System: Scheduling mechanisms.Design issues communication models .. A.Memory Technology. SILBERSCHATZ and P. Tech.Harware Based Speculation. REFERENCE BOOK 1. Distributed Deadlocks detection .Measuring and Reporting PerformanceQuantitative Principles of Computer Design.Concepts and Challenges . CS703. 3 . Tata McGraw Hill Inc.. PARALLEL COMPUTER ARCHITECTURE (3-0-0) 3 Task of a Computer Designer . Addison Wesley 2004.Mutual exclusion Election Algorithms.Multiprocessor system architecture.Cache memory organization. M Singhal and NG Sivaratri. Video compression. Basic Complier Techniques for Exposing ILP-Static Branch Prediction . LINUX. VI edition. 2001 2. Tanenbaum. GALVIN. National Institute of Technology. Multimedia Files.Taxonomy of MIMD computers Parallel processing applications .
Brassard and Bratley.Operations on Binary Trees -height balanced trees . Storage structures for arrays-Stacks. "Advanced UNIX-A Programmer's Guide ". MAKE.Operations on Polynomials Dynamic storage management . L. R. Insertion. Leiserson. Allen Van Gelder. T.graphs and representive graph algorithms. D. Linked lists .. System calls. Divide and Conquer method .Garbage collection and compaction. Network Programming . Bubble. Concepts. 1993 ". REFERENCE BOOKS 1. ADVANCED DATA STRUCTURES AND ALGORITHMS (3-0-0) 3 Development of Algorithms . Chris H.Notations. 2. Steven Prata.Client Server Programming Using Sokets Web Programming. Tiruchirappalli – 620 015. TEXT BOOK 1. National Institute of Technology. Hall 1996. Trees . 1992. Addison Wesley. Stein. Design of Object oriented Software. Lab exercises in shell programming. MFCS. Merge. C.Related analysis -Some advanced data structures. Tech. Heap.Pappas & William Murray-Hill. CS707.Linear and Binary Searching .Advanced Compiler Support of Exposing ILPHardware Support for Exposing More Paralleslism at Compile Time Hardware Vs Software Speculation. CS705. Rivest. 2001. REFERENCE BOOK 1. (Computer Science) . Scalability. 4 . Quick. Prentice. Game Trees. "Introduction to Algorithms ". "McGraw Hill. 2.Dynamic Programming – Backtracking Branch and Bound Techniques for Lower Bound. Radix and address calculation . LINUX Tools: Grep. 31 Edition. Queues: Representations and applications. G. TMH Publishers.Greedy Method . Sara Baase. 2001. Selection. TR. BPB Publications. TEXT BOOK 1. "Computer Architecture : A Quantitative approach" Elsevier 3rd Edition 2003.E. H Cormen. Prentice Hall of India. JL. Programmability. AWK. "Visual C++ 6 The Complete Reference ". C.Tree Traversing . Fundamentls of Algorithmics. Patterson. SOFTWARE SYSTEMS LABORATORY (0-0-3) 2 Object-Oriented Programming: Lab exercises in C++/Visual C++. "Computer Algorithms: Introduction to design and Analysis ". Department of Computer Science and Engineering.M.Linked stacks and queues .Hennessy. Parallelism. K. 2. 2000. Advanced Computer Architecture.A..Hwang.
Layered protocols. UNIX. Distributed File Systems .R. Transaction concept . CODA file system. Data warehousing. DISTRIBUTED SYSTEMS (3-0-0)3 Distributed Systems: Goal. Stevens. Prentice Hall of India. HF.SUN network file system. Comparision of CORBA.Lock based . The Benjamin /Cummings Publishing Co. CS704. Guidelines for index selection . Korth. Vol-3.M. Distributed Coordination based systems – Introduction. "Database System Concepts ".Cost Estimations. Communication . 5 . Message oriented communication. Comer. Networking Programming. Web databases. Tuning queries and views. Servers. Lotus notes. (Computer Science) 3. RMI. Stream oriented communication..media recovery. Elmasri and S. 2nd edition.Algorithms. Conceptual Schema tuning. R. Concurrency control techniques: Timestamp based . Advantages. and GLOBE. Query optimization Use of Heuristics . TEXT BOOKS 1. Clients.E. Stevens.logging .Schedules . Tech.Shadow paging . ADVANCED CONCEPTS IN DATABASE SYSTEMS (3-0-0)3 Memory hierarchy .external sorting. Tiruchirappalli – 620 015. McGraw Hill.Serializability. National Institute of Technology. JINI and their comparison. Prentice Hall of India 1999. Software agents. removing unreferenced entities Security.Word Wide Web. Distributed GLOBE.entities. B.Sudarshan. Client Sover Programming and Application. redo. other distributed file systems and their comparison. RPC.Data formats . 4. locating mobile entities. DCOM. "Database an Introduction to Database Systems ". TIB / RENDEZVOUS. 1997 2. "Fundamentals of Database System".Index tuning.Indexes -B-trees Hash tables . S. CS702. undo/redo . Addison Wesley. Organization of Multiprocessor Systems and related Hardware and Software Concepts. Evaluation of relational operators . A.CORBA. 3rd edition. 1994. Department of Computer Science and Engineering.Threads. 8th edition. CJ Date. REFERENCE BOOK 1. 2000. W.Clustering and indexing . Process .undo. D. Distributed COM. Design Issues. 2003. Internetworking with TCP / IP. Naming .file structures . Distributed document based systems. Code Migration. I.Silberschaiz. Applications: Data Mining.Optimistic . David. Navathe.. Log based recovery .Multiversion. Distributed database systems .
Behavioral Modeling. Design example: Binary counter. 4th Edition. A comparison of styles for behavioral modeling. (Computer Science) Case Studies : From the Internet . Design and synthesis of a RISC stored-program machine. Programmable Logic and Storage Devices-Programmable logic devices. Functional units for division. G Coulouris. Algorithms. Synthesis of gated clocks and clock enables. Storage devices. Programmability of PLDs. Design and Synthesis of Datapath Controllers. 2005. J. Circular buffers. State encoding. 2003. Samir Palnitkar "Verilog HDL ". Tiruchirappalli – 620 015. 1988. Nested loop programs. "T. 2002.M. Synthesis of three-state devices and bus interfaces. Tech. Department of Computer Science and Engineering. Kindberg. 2003. Programmable Logic Array (PLA).Functional units for addition and subtraction. Andrew S. Programmable Array Logic (PAL). "Advanced Digital Design with the Verilog HDL. Anticipating the results of synthesis. Synthesis of loops. National Institute of Technology. and data flow graphs. Michael ciletti. Synthesis of combinational logic. "Distributed System Concepts and Design. Pearson Education. FIFOs and Synchronization across clock domains. REFERENCE BOOK 1. Dollimore. Tanenbaum.UART. Synthesis of sequential logic with flip-flops. Design documentation with functions and tasks Synthesis of Combinational and Sequential logic . Comparision of CORBA. Maarten Van Steen. Addison Wesley. 2. Rests. Structural models of combinational logic. Design traps to avoid. Distributed database systems. Distributed COM. TEXT BOOK 1. and GLOBE TEXT BOOK 1. Design example . Architectures for Arithmetic Processors . Registered logic.Introduction to synthesis. Pipelined Architectures. John Wiley. Divide and Conquer: partitioning a design. Complex PLDs.Partitioned sequential machines. GLOBE. "Distributed Algorithms and Protocols". Distributed database systems CORBA. Synthesis of sequential logic with latches. "Distributed System Principles and Paradigms". REFERENCE BOOK 1. DCOM. Pearson Education. Functional units for multiplication. CS706: ADVANCED DIGITAL DESIGN (3-0-0)3 Review of Combinational and Sequential logic design. Boolean equation based behavioral models of combinational logic.OPEN SOURCE Security. 6 .. Multiplication of fractions. M. Introduction to Altera and Xilinx FPGAs. Multiplication of signed binary numbers. Propagation delay. CORBA. Cyclic behavioral model of flip-flop and latches. Pearson education. Reynal.
Synthesis. "Fault Tolerant computing . they should give a minimum of two presentations. "Modeling.Friedman. Tiruchirappalli – 620 015. The Students will be required to submit a summary report / paper on the topic. CS713. Test generation for combinational circuits. 2007. "A Verilog HDL Primer" Star Galaxy Publishing.Design of fault Tolerant software . 1976. and Rapid Prototyping with the Verilog HDL " Prentice Hall. Fault detection techniques.Theory and Techniques "Prentice Hall. ELECTIVES FOR FIRST SEMESTER CS711. and by surveying the research done on that topic. Graph Network and in Binary cube interconnection. CREW SM-SIMD algorithms . Press. Tree and mesh interconnection computers.shared memory SIMD. TEXT BOOKS 1. J. Tech. Tree Networks. validation of Fault tolerant software. Computer Sci. loop architectures.. Bhasker. 7 .Recovery in time. Fault Tolerant Software . National Institute of Technology. "Diagnosis and Reliable design of Digital Systems".tolerant computers generalpurpose commercial systems . Fault Tolerant in Real time Systems . 2.High availability systems .Architecture of Fault . 1999 4. Stephenbrown. Modeling Faulttolerant systems . DESIGN AND ANAL YS1S OF PARALLEL ALGORITHMS (3-0-0) 3 Introduction to Parallel computers .Inc.Reliability Models. 3.SIMD . Fault Tolerance Concepts. FAULT TOLERANT COMPUTING SYSTEMS (3-0-0) 3 Introduction: Computer and Computation Distribution.D. Department of Computer Science and Engineering. D. 1986.Critical computations Fault Tolerant multiprocessor . Breuer and A. Pradhan. Levi & Agrawala. (Computer Science) 2. 1994. 2. 1999 SEMINAR Students are required to take up a topic of their choice.M. "Fault Tolerant Systems" Elsevier Publications. MA. Israel & Krishnan. "Fault Tolerant Systems Design. REFERENCE BOOKS 1.EREW. Construction of acceptance tests. sequential circuits and Fault simulation. K. System models and Fault models. Ciletti.Communication Architectures. Shared memory Interconnections.Rollback modular redundancy and Exception Handling. "Fundamentals of Digital Logic with Verilog " Tata McGraw-Hill-2003. McGraw hill. Michael D.
4. Bridges. 1994. Tanenbaum. DHCP -Sub net Addressing. Department of Computer Science and Engineering.Linear.Mesh. Storage requirements. Akl.Matrix by vector Multiplication Tree Multiplication.IP datagram . "Analysis and Design of Parallel Algorithms Arithmetic and Matrix Problems ". 2. S. The protocols ". (Computer Science) Sorting . Sorting on other Networks.User Datagram Protocol (UDP). Address Masking.Telnet . MIMD Quick sort. REFERENCE BOOKS 1. Address Learning Bridges. IEEE 802. RARP.. REFERENCE BOOK 1. EREW transpose . TEXT BOOKS 1. MIMD Enumeration Sort. multiplication.M.Design issues. Gateway. Lakshmivarahan and S.computing the connectivity matrix. W Richard Stevens. Third Edition. RIP. OSPF. Tech.5 Network Layer Issues.G.SIMD algorithm. RIPV2. 802. Prentice Hall of India. Equations . CS715. Addition-Wesley Professional Computing Series. 1989. "TCP/IP Illustrated -Volume I. Bootstrap Network Time Protocol. Congestion control. TEXT BOOK 1.SMTP . S. Traversing.Architecture Topology Switching SLIP. "Computer Networks ".Sorting on a Linear Array.hop by hop routing. National Institute of Technology. Matrix operations .Routing. 1985. Sorting on EREW SIMD computer. Numerical problems.FTP . DNS. Routers. "Parallel Sorting Algorithms ".Issues.Internetworking .Mesh Transpose. 802. LAN and WAN Multicast. ARP. 1997. Network Protocol. Transport Layer.3. S.partial Differential Equations. Cube multiplication . 1990.TFTP . computing Eigen values. The minimal Alpha-Beta Tree. Shuffle Transpose. McGraw Hill. Tiruchirappalli – 620 015. Source routing. Sorting on a Mesh. Finding connected components. ADVANCED NETWORK PRINCIPLES AND PROTOCOLS (3-0-0) 3 Introduction to Networks -Application of Networks .SNMP. Academic Press. G. CSMA/CD. Application Layer Protocol. Graph Theoretical Problems . 8 . PPP -ALOHA protocols. "The Design and Analysis of Parallel Algorithms".Ping Finger. Transmission Control Protocol (TCP) . Akl. Prentice Hall India.Kdhall.Roots of Nonlinear Equations MIMD algorithm. Spanning tree. ICMP. Connection Management. S.
Task Assignment and Scheduling.Backups.Fault Tolerant Scheduling. Tech. classical encryption techniques. NETWORK SECURITY (3-0-0) 3 Introduction to Classical and Modem techniques . TEXT BOOK 1. Pearson Education Asia Publishers (Low priced Edition).Uniprocessor scheduling Algorithms . CM Krishna and Kang G Shin. Block cipher design principles and modes of operation. 2000 REFERENCE BOOK 1. William Stallings. DES.Protection against eavesdropping. Network Security . Simson Garjainkal.. services and mechanisms. "Practical UNIX and Internet Security" 2nd edition Oreilly Pule Pvt.Protocols Contention-based. Token-based. Real-Time Databases . Tiruchirappalli – 620 015. TEXT BOOKS 1.Concurrency control Issues Scheduling Algorithms . 11 Edition. 1997 CS716. 2000. viruses and worms. Inc. National Institute of Technology. Department of Computer Science and Engineering. System Security . REAL-TIME SYSTEMS (3-0-0) 3 Introduction to Real-time computing .Timing specification .Structure of a Real-Time System Characterization of Real-Time Systems and tasks . RC5.M. integrity management. Steve Burnett and Stephene Paine. Encryption Algorithms and Hash Functions . personnel security. denial of service attacks and solutions. Real-Time Communication . Programming Languages and Tools . New York. authentication applications. McGraw Hill Companies. RSA Press. IP security. polled bus and Fault Tolerant routing. 2001. Public key.RunTime error handling Overloading .Task Assignment Mode Changes . "Real-Time Systems". protecting against programmed threats. key management.Triple DES. Ltd.Transaction Priorities and Aborts .Two-phase approach to improve predictability. Security tools . electronic mail security.Hierarchical decomposition . 9 .Network topologies and Architecture Issues . SSH. proxies. ISBN-007114243-6.Performance measures. International Editions.Recent trends and developments. SRP. discovering a break-in. security for modems. "Cryptography and Network Security Principles and Practice ". OPIE. 2. wrappers. and Gene Spafford. Digital signatures and authentication protocols. (Computer Science) ELECTIVES FOR SECOND SEMESTER CS714.Attacks.. Tata McGraw Hill Edition. web security.Firewalls. Ch 1 to 16. Cryptographic security tools: KERBEROS. PGP. "RSA Security 's official guide to cryptography". Cryptography RSA Algorithm. physical security.
Bluetooth. and MANs. classification of routing protocols. Mobile transport and application layer protocol . LEO and MEO. CTEO. Hand offs and dropped calls-initiation of handoff. file systems. S-MAC. classification. MOBILE NETWORK SYSTEMS (3-0-0) 3 Introduction to wireless. and system power management schemes. PANs. Tech. mobile assisted cell-site and Intersystem handoff.GSM. co-channel interference.cellular mobile telephone systems. functions. mobile and cellular mobile systems. issuess in adhoc wirelesss networks.Review of traditional TCP. Wireless Internet. Introduction to adhoc/sensor networks: Key definitions of adhoc/ sensor networks. . W W W. data dissemination and gathering. sensor network archeitecture. classification of MAC protocols. transmission/timeout freezing. W AP. and power aware routing protocols. modulation techniques. 10 . radio access layer. TDMA. Medium access control . flooding. table-driven.IEEE 802. CDMA. Wireless ATM-W ATM services. SDMA. hierarchical. multiple access techniques. Jochen Sciiiller. Ch 1. Mobile Telecommunication standards. McGraw Hill International 'Editions.11. quality. on-demand. MAC Protocols : Issues in desiging MAC protocols for adhoc wireless networks. driving applications. IEEE 802. TEXT BOOK 1. reverse tunneling. National Institute of Technology.M. fast retransmit/fast recovery. characteristics of wireless channels. 1995. QoS and Energy Management : Issues and Challenges in providing QoS.Cellular analog. battery. unique constraints and challenges. MAC. MAC protocols for sensor network. "Mobile Cellular Telecommunications ". satellite and broadcast systems . network layer solutions. need for energy management. Tiruchirappalli – 620 015. issues in design of sensor network. IMT-2000.15.MAC.quency reuse.. FDMA. Ch 1 to 11. classifications. design goals. 8. TETRA. Routing Protocols : Issues in designing a routing protocol. MTSO interconnection. REFERENCE BOOK 1. the electro magnetic spectrum radio propagation. other issues. Pearson Education Asia Publications (Low Price Edition). transmission power. advantages of ad-hoc/sensor network.. IPV6. (Computer Science) CS718. wireless LANs. hybrid. analog and digital cellular systems. DHCP.4. William C. 11. CS720: WIRELESS SENSOR NETWORKS (3-0-0)3 Introduction : Fundamentals of wireless communication technology.fre. QoS frameworks. Network support for mobile systems . power difference. 2. 2000. DECT.. HIPERLAN. Department of Computer Science and Engineering. 9. WANs. "Mobile Communications ".Y Lee. location discovery.
Pearson Education. "Wireless sensor networks ". Elsevier publication 2004. 2. Tech. 11 .M. Jochen Schiller. Siva Ram Murthy. National Institute of Technology.2004 Department of Computer Science and Engineering. and B. Pearson Education . "AdHoc Wireless networks ". (Computer Science) TEXT BOOK 1. Tiruchirappalli – 620 015. S. Manoj. 2003.. Feng Zhao and Leonides Guibas. William Stallings. "Wireless Communications and Networks ". REFERENCE BOOK 1. 2nd Edition. C. pearson Education 2008. "Mobile Communications ". 3.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.