PDFaid.

Com
#1 Pdf Solutions

M. TECH COMPUTER SCIENCE & TECHNOLOGY

Ref: No LII(2)Syllabi/2003 dated 17-06-2003 With effect from 2003-04 admitted batch

Syllabi

Chairman Board of Studies

Dept of Computer Science and Systems Engineering College of Engineering Andhra University Visakhapatnam

M. TECH ( COMPUTER SCIENCE & TECHNOLOGY)

MTCST1.1 MTCST1.2 MTCST1.3 MTCST1.4 MTCST1.5 MTCST1.6 MTCST1.7

MTCST1.8

Theory Computation Object Oriented Analysis & Design Data Structures and Algorithms Computer Organization Database Management Systems Systems Programming Object Oriented Analysis & Design Lab Computer Organization Lab

Total 150 150 150 150 150 150 150

50

100

150

Except MTCST 1.6, other subjects are common with M.Tech (IT)

MTCST 1.1

THEORY OF COMPUTATION
External Assessment: 100marks Time: 3 Hours

Instruction: 3 Periods/week Internal Assessment: 50 Marks

1. INTRODUCTION TO FINITE AUTOMATA: 6 Periods Alphabets and languages- Finite Representation of Languages. Deterministic Finite Automata Non- deterministic Finite Automata Equivalence of Deterministic and Non-Finite Automata Properties of the Languages Accepted by Finite Automata Finite Automata and Regular Expressions Proofs those Languages Are and Are Not Regular. 2. CONTEXT FREE LANGUAGES: 9 Periods Context Free Grammar Regular Languages and Context-Free Grammar Pushdown Automata Pushdown Automata and Context-Free Grammar Properties of Context-Free Languages Closure Properties Periodicity Properties Determinism and Parsing Deterministic Pushdown Automata and Context Free Languages Top- down Parsing Bottom Up parsing. 3. TURING MACHINES: 5 Periods The Definition of Turing Machine Computing with Turing Machines Combining Turing Machines some Examples of More Powerful Turing Machines .

4. CHURCH THESIS: 6 Periods Churchs Thesis The Primitive Recursive functions Godelization The -Recursive Functions Turing Computability of the -Recursive functions Universal Turing Machines.

5. UNCOMPUTABILITY: 6 Periods The Halting Problem Turing-Enumerability, Turing Acceptability, and Turing - Decidability Unsolved problems about Turing machines and -Recursive Functions- Posts correspondence problem. 6. COMPUTATIONAL COMPLEXITY: 6 Periods Time-bounded Turing Machines Rate of Growth of functions Time-Bounded simulations The Classes P and NP NP-Completeness Some NP-complete Problems Integer Programming The Traveling Salesman Problem.

7. THE PREPOSITIONAL CALCULUS 5 Perods Introduction Syntax of the Prepositional Calculus Truth-Assignments Validity and Satisfiability Equivalence and Normal Forms resolution in Prepositional Calculus.

8 THE PREDICATE CALCULUS: 5 Periods Syntax of the Predicate Calculate Calculus Structures and Satisfiability Equivalence Unsolvability and NP-Completeness- Resolution in the Predicate Calculus.

TEXT BOOK: Harry R Lewis, CHRISTOS H. PAPADIMITRIOU, : ELEMETS OF THE THEORY OF COMPUTATION, Prentice-Hall of India Private Limited, New REFERENCE: HOPCROFT. J.E and J.D.ULLMAN. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass. 1979.

MTCST 1.2

OBJECT-ORIENTED ANALYSIS AND DESIGN

Instruction: 3 Periods/week Internal Assessment: 50 Marks

1.Introduction: 7 Periods Overview of object-oriented systems development object basics object-oriented system development life cycle 2. UML: Object-oriented methodologies. Unified modeling language 10 Periods

3. Analysis: 13Periods Object-oriented analysis process: Identifying use cases. Object analysis: classification Identifying object relationships, attributes and methods 4. Design: 13 Periods Object-oriented Design Process and Design Axioms Designing classes Access Layer: Object storage and object interoperability. View Layer: Designing interface objects. 5. QA: Soft ware Quality Assurance 5Periods

Text Book: Ali Bahrami: Object-oriented systems Development, McGrawHill, 1999 Reference Books: 1. Craig Larman : Applying UML and Patterns, Pearson Education, 2002 2. Grady Booch: Object-oriented analysis and design, Addison Wesley, 1994.

MTCST 13

DATA STRUCTURES AND ALGORITHMS

Instruction: 3 Periods/week Internal Assessment: 50 Marks

1. INTRODUCTION: 4 Periods. Overview of C++ classes, pointers, parameters passing, templates, using Matrices. 2. ALGORITHM ANALYSIS: 3 Periods Basics of time complexity estimates, General norms for running time calculation 3. LISTS, STACKS & QUEUES: 10 Periods Abstract Data Types, Representation & implementation of ADT list, Doubly linked list, Circular linked lists, Representation, Implementation and applications of ADT stack and Queue. 4. TREES: 10 Periods Implementation and traversal of trees, Binary Trees and Binary search trees in C++, Concepts of AVL Trees, Splay Trees and B-Trees. 5. HASHING: 4 Periods. Hash Function, Separate chains, Open addressing, rehashing, Extendible Hashing. 6. INTERNAL SORTING ALGORITHMS: 7 Periods. Sorting like insertion Sort, shell Sort, Heap Sort, Merge Sort, Quick Sort and Simple external Sorting algorithm. 7. GRAPH ALGORITHMS: 10 Periods. Representation of graph Topological Sort, shortest-path Algorithm, Network flow problem, Minimum spanning tree algorithm, Applications of Depth First search. Introduction to NPCompleteness.

TEXT BOOK: Data Structures & Algorithm Analysis in C++ , Mark Allen Weiss. Second edition, Pearson Edition. Asia. REFERENCE BOOKS: 1. Data Structures & Algorithm in C++, Adam Drozdek. Vikas publication House. 2. Data Structure, Algorithm and OOP, Gregory L. Heileman ( Tata Mc Graw Hill Edition)

MTCST 1.4

COMPUTER ORGANISATION
External Assessment: 100marks Time: 3 Hours

Instruction: 3 Periods/week Internal Assessment: 50 Marks

1. Digital Logic Circuits and Components: 6 Periods Digital Computers - Logic gates - Boolean Algebra - Map Simplifications Combinational Circuits: Half-Adder, Full-Adder, decoders, Encoders, Multiplexers Sequential Circuits: Flip flops, Registers, Shift Registers, Binary Counters - Memory Unit. 2. Data Representation : 4 Periods Data Types - Complements - Fixed Point Representation - Floating Point Representation - Other Binary Codes - Error detection Codes 3. Processor Organisation : 8 Periods General Register Organisation - ALU - Instruction codes - Instruction Formats - Stack Organisation - Addressing modes 4. Control Unit : 8 Periods Register transfer and micro operations, Timing and Control, Control Memory, micro programming, Hard wired control 5. 8085 Microprocessor : 6 Periods Internal Architecture, Instruction Set, Assembly Language programming 6. Input/Output Organisation : 8 Periods I/O interface, Asynchronous data transfer, Modes of transfer, priority Interrupt, Direct memory access. 7. Memory Organisation 8 Periods Memory Hierarchy, Main memory, Auxiliary memory, Associate Memory, Cache Memory, and Virtual memory. Text Book: 1). Computer System Architecture , M. Morris Mano, Prentice Hall of India Pvt. Ltd., Eastern Economy Edition, Third Edition, Sept. 2002 2). Micro processor Architecture, Programming & Applications with the 8085, Ramesh S Goankar, Penram International Publishing(India) Pvt. Ltd., Fourth Edition, 2002 Reference Book : Computer Architecture and Organization, Eastern Economy Edition, Sixth Edition, 2003

William

Stallings,

PHI

Pvt.

Ltd.,

MTCST 1.5

DATABASE MANAGEMENT SYSTEMS

Instruction: 3 Periods/week Internal Assessment: 50 Marks

1. Introduction: 6 Periods Data, storing data in dbms, relational model, levels of abstraction, data independence, queries in dbms, transaction management, structure of dbms and people who work with dbms

2. ER Model, Relational Model and Relational algebra: 12 Periods ER model, entities, attributes & entity sets; relationship & relationship sets, ER diagrams, key and participation constraints, weak entities, class hierarchies, aggregation, conceptual design with ER model, case study: requirement analysis and conceptual design, Relational algebra, relational calculus 3. SQL: 6 Periods Basic SQL query, nested queries, aggregate operators, null values, integrity constraints, Triggers 4. Database Design: 12 Periods Schema refinement, Functional dependencies, closure of set of FDs and attribute, Third & Boyce-code normal forms, properties of decomposition, Decomposition into 3NF and BCNF, Schema refinement in database design 5. Transaction Processing: 12 Periods ACID properties, Transaction & schedule, Concurrent execution of transaction, Lock-based concurrency control, crash recovery, Serializability and recoverability, Lock management, lock conversions, dealing with dead locks, Optimistic concurrency control, timestamp-based concurrency, multiversion concurrency control, ARIES, logs, the write-ahead log protocol, checkpointing, recovering from a system crash, media recovery

Text Book Database Management Systems; Raghu Ramakrishnan, Johannes Gehrke 4th Edition, McGraw-Hill Reference: Database System Concepts; A. Silberschatz, H. Korth 5th Edition, McGraw-Hill

MTCST 1.6

SYSTEMS PROGRAMMING
External Assessment: 100marks Time: 3 Hours

Instruction: 3 Periods/week Internal Assessment: 50 Marks

1. Introduction to Systems Programming: 8 Periods Introduction to Assembly Language Programming - Introduction to Instruction Formats, Data formats - Role of Base Register, Index Register. 2. Introduction to Assembler 12 Periods Databases used in assembler design, Design of Assembler - Single Pass & Double Pass. 3. Introduction to Macros 11 Periods Various types of Macros, Design of Macro Processor - Single Pass & Double Pass. 4. Introduction to Loaders: 11 Periods Types of Loaders, databases used in Loaders, Design of Loaders - Absolute & DLL. 5. Introduction to Software Tools 6 Periods Text editors, Interpreters, Program Generators, Debug Monitors. TextBook: Systems Programming, Donovan, Tata Mc Graw Hill Reference: System Programming, Dhamdhere (IInd Revised Edition), Tata Mc Graw Hill

MTCST 1.7

OBJECT ORIENTED ANALYSIS & DESIGN LAB

Practical: 3 Periods/week Internal Assessment: 50 Marks

External Assessment: 100marks Time: 3 Hours

The student is expected to take up about five mini-projects and model them and produce Use Cases, Analysis Documents - both static & dynamic aspects, Sequence Diagrams and StateCharts, Database Design using Rational Products A sample collection of ideas is given. Numerous other ideas can be found in the pages from the list of references given below. Mini-Project - I: A Point-of-Sale (POS) System A POS system is a computerized application used to record sales and handle payments; it is typically used in a retail store, it includes hardware components such as a computer and bar code scanner, and software to run the system. It interfaces to various service applications, such as a third-party tax calculator and inventory control. These systems must be relatively fault tolerant; that is, even if remote services are temporarily unavailable they must still be of capturing sales and handling at least cash payments. A POS system must support multiple and varied client-side terminals and interfaces such as browser, PDAs, touch-screens. Mini-Project - II: Online Bookshop Example Following the model of amazon.com or bn.com, design and implement an online bookstore. Mini-Project - III: A Simulated Company Simulate a small manufacturing company. The resulting application will enable the user to take out a loan, purchase a machine, and over a series of monthly production runs, follow the performance of their company. Mini-Project - IV: A Multi-Threaded Airport Simulation Simulate the operations in an airport. Your application should support multiple aircrafts using several runways and gates avoiding collisions/conflicts. Landing: an aircraft uses the runway, lands, and then taxis over to the terminal. Take-Off: an aircraft taxies to the runway and then takes off Mini-Project -V: An Automated Community Portal Business in the 21st Century is above all BUSY. Distractions are everywhere. The current crop of "enterprise intranet portals" are often high noise and low value, despite the large capital expenditures it takes to stand them up. Email takes up 30 - 70% of an employee's time. Chat and Instant Messaging are either in the enterprise or just around the corner. Meanwhile, management is tasked with unforseen and unfunded leadership and change-agent roles as well as leadership development and succession management. What is needed is a simplified, repeatable process that enhances communications within an enterprise, while allowing management and peers to self-select future leaders and easily recognize high performance team members in a dynamic way. Additionally, the system should function as a general-purpose confent management, business intelligence and peer-review application. Glasscode's goal is to build that system. The software is released under a proprietary license, and will have the following features: Remote, unattended moderation of discussions However, it will have powerful discovery and business intelligence features, and be infinitely extendable, owing to a powerful API and adherence to Java platform standards. Encourages peer review and indicates for management potential leaders, strong team players and reinforces enterprise and team goals seamlessly and with zero administration.

Mini-Project -VI: A Content Management System The goal is to enable non-technical end users to easily publish, access, and share information over the web, while giving administrators and managers complete control over the presentation, style, security, and permissions. Features: ? Robust Permissions System ? Templates for easy custom site designs ? Total control over the content ? Search engine friendly URL's ? Role based publishing system ? Versioning control ? Visitor profiling Mini-Project-VII: An Auction Application Several commerce models exist and are the basis for a number of companies like eBay.com, pricellne.com etc. Design and implement an auction application that provides auctioning services. It should clearly model the various auctioneers, the bidding process, auctioning etc. Mini-Project -VIII: A Notes and File Management System In the course of one's student years and professional career one produces a 1 lot of personal notes and documents. All these documents are usually kept 1 on papers or individual files on the computer. Either way the bulk of the I information is often erased corrupted and eventually lost. The goal of this 1 project is to build a distributed software application that addresses this "| problem. The system will provide an interface tocreate, organize and manage I personal notes through the Internet for multiple users. The system will also allow users to collaborate by assigning permissions for multiple users to view and edit notes. Mini-Project - IX: A Customizable Program Editor A programmer's editor which will be focused on an individual programmer's particular needs and style. The editor will act according to the specific language the current source file is in, and will perform numerous features, such as auto-completion or file summarization, on the file. These features will be able to be turned on or off by the programmer, and the programming style of the user will be used to create as efficient an editing environment as possible. Mini-Project - X: A Graphics Editor Design and implement a Java class collection that supports the construction of graph editing applications, i.e., applications that include the ability to draw structured and unstructured diagrams. E.g., The goal of the GEF project is to build a graph editing library that can be used to construct many, highquality graph editing appications. Some of GEF's features are: A simple, concrete design that makes the framework easy to understand and extend. Node-Port-Edge graph model that is powerful enough for the vast majorityof connected graph applications. Model-View-Controller design based on the Swing Java Ul library makes GEF able to act as a Ul to existing data structures, and also minimizing learning time for developers familiar with Swing. High-quality user interactions for moving, resizeing, reshaping, etc. GEF also supports several novel interactions such as the broom alignment tool and secltion-action-buttons. Generic properties sheet based on JavaBeans introspection. XML-based file formats based on the PGML standard

Text Book(s): "Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and the Unified Process", Craig Larman, Pearson Education Asia, 2002, 2nd Edition Reference(s): "Object Oriented Systems Analysis and Design using UML", Simon Sennet, Steve McRobb, and Ray Farmer, McGraw Hill, 2002, 2nd Edition "Object-Oriented Analysis & Design," Andrew Haigh, Tata McGraw-Hill, 2001, Various Net Resources and projects: http://user-mode-linux.sourceforge.net/case-studies.html http://www.onesmartclick.com/programming/case-studies.html http://www.tigris.org/sarvlets/ProjectList?type=P rejects http://hotscripts.com/ http://www.developingwebs.net/ http://sourceforge.net/projects/ http://governing.com/gpp/gponline.htm http://www.cio.com/research/government/gov.html http://www.whitehouse.gov/omb/inforeg/egovstrategy.pdf http://www.andhrapradesh.com/ http://www.ap-lt.com/ http://www.aponline.gov.in

MTCST 1.8

COMPUTER ORGANISATION LAB

Practical: 3 Periods/week Internal Assessment: 50 Marks

External Assessment: 100marks Time: 3 Hours

List Of Experiments: TTL Characteristics TTL IC Gates Flip-Flops Counters Shift Registers Multiplexers Decoders Binary Adders: Half Adder, Full Adder 8085 Assembly Language Programming Using MPS-85 KIT P.C. Architecture Familiarization Note: 1 Week for Lab. Instruction, 1 Week for Repeat Expts, 8 Week for expts. 1 to 8 4 Weeks for expt. 9, 2 Weeks for expt. 10