Showing posts with label 3rd IT syllabus. Show all posts
Showing posts with label 3rd IT syllabus. Show all posts
Monday, 2 July 2012

5th semester syllabus for Information Technology



ANNA UNIVERSITY :: CHENNAI 600 025 
UNIVERSITY DEPARTMENTS 
REGULATIONS – 2008 
 B.TECH. INFORMATION TECHNOLOGY 


SEMESTER V 
    
CODE NO  COURSE TITLE  L  T  P  C 
THEORY 
IT9301  Software Project Management  3  0  0  3
CS9301  Object Oriented Analysis and Design  3  0  0  3
IT9302  Multimedia Systems  3  0  0  3
IT9303  Computer Networks  3  0  0  3
IT9304  Distributed Systems  3  0  0  3
  Elective I  3  0  0  3
PRACTICAL
CS9306  Computer Networks Laboratory  0  0  3  2
CS9307  Case Tools Laboratory  0  0  3  2
GE9371  Communication Skills and Soft Skills lab  0  0  2  1
  TOTAL  18  0  8  23


IT9301    SOFTWARE PROJECT MANAGEMENT           L T P C 
                                                                                                                             3  0  0 3 

AIM
This course aims at the role of software developers in getting exposure on planning
and controlling aspect of software development
OBJECTIVES 
  To understand the roles of the project manager
 To understand the threats and opportunities in project management
 To gain Expertise in size, effort and cost estimation techniques
  To understand the techniques available with which a project's aims and
objectives, timetable, activities, resources and risks can be kept under control
 To understand the social and political problems a project will encounter--
against which the technical problems pale into insignificance--and to begin to
understand how to approach non-technical problems
  To Appreciate of other management issues like team structure, group
dynamics
 To understand communication

UNIT I    INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT       9
Project Definition  –  Contract Management  – Activities Covered by Software Project
Management – Overview Of Project Planning – Stepwise Project Planning.

UNIT II   PROJECT EVALUATION                        9
Strategic Assessment – Technical Assessment – Cost Benefit Analysis – Cash Flow
Forecasting – Cost Benefit Evaluation Techniques – Risk Evaluation. – software effort
estimation

UNIT III   ACTIVITY PLANNING                       9
Objectives  –  Project Schedule  –  Sequencing and Scheduling Activities  –  Network
Planning Models  –  Forward Pass  –  Backward Pass  –  Activity Float  –  Shortening
Project Duration – Activity on Arrow Networks – Risk Management – Nature Of Risk –
Types Of Risk  –  Managing Risk  –  Hazard Identification  –  Hazard Analysis  –  Risk
Planning and Control.

UNIT IV   MONITORING AND CONTROL                       9
Resource allocation  -  identifying and scheduling resources – publishing resource and
cost schedule – scheduling sequence  - Creating Framework – Collecting The Data –
Visualizing Progress  –  Cost Monitoring  –  Earned Value  –  Priortizing Monitoring  –
Getting Project Back To Target – Change Control – Managing Contracts – Introduction
– Types Of Contract – Stages In Contract Placement – Typical Terms Of A Contract –
Contract Management – Acceptance.

UNIT V   MANAGING PEOPLE AND ORGANIZING TEAMS         9
Introduction  –  Understanding Behavior  –  Organizational Behaviour  -  Selecting The
Right Person For The Job  –  Instruction In The Best Methods  –  Motivation  –  The
Oldman  – Hackman Job Characteristics Model  – Working In Groups  – Becoming A
Team – Decision Making – Leadership – Organizational Structures – Stress – Health
And Safety – Case Studies.
TOTAL:45 PERIODS 
TEXT BOOK:

1. Bob Hughes, Mikecotterell, “Software Project Management”, Third Edition,
    Tata McGraw Hill, 2004.   22
REFERENCES: 
1. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill,
    2001.
2. Royce, “Software Project Management”, Pearson Education, 1999.
3. Jalote, “Software Project Management in Practice”, Pearson Education,
2002.
4. Robert T. Futrell, Donald F. Shefer and Linda I. Shefer, “Quality Software    
Project Management”, Pearson Education, 2003.

CS9301            OBJECT ORIENTED ANALYSIS AND DESIGN         L T P C 
                                                                                                                            3  0 0  3 
AIM: 

To study object oriented analysis and design and the techniques needed to apply
them.
OBJECTIVES:
  To study the concepts of modelling in object oriented contexts
 To learn about the Object Constraint Language
 To study and learn how to apply analysis techniques and methodologies including
Use cases, System Sequence Diagrams
 To study and learn how to apply design techniques and methodologies including
Interaction Diagrams, Class Diagrams
 To study implementation related issues
 To study and learn how to apply advanced techniques including Architectural
Analysis and Design Patterns

UNIT I                 8
Introduction  –  Modelling as a design technique  –UML  diagrams-  Class modeling  –
Object Constraint Language – State modeling – Interaction Modeling  

UNIT II                 9
Inception – Evolutionary Requirements – Use Cases – Other Requirements – Domain
Models – System Sequence Diagrams – Operation Contracts    

UNIT III              10
Requirements to Design – Logical Architecture and UML Package Diagrams – Object
Design  –  Interaction Diagrams  –  Class Diagrams  –  Designing Objects with
Responsibilities – Object Design Examples – Designing for Visibility  

UNIT IV               8
Mapping designs to code – Test Driven development and refactoring – UML Tools and
UML as blueprint          

UNIT V                                              10
More Patterns  –  Analysis update  –  Objects with responsibilities  –  Applying design
patterns – Architectural Analysis – Logical Architecture Refinement – Package Design
– Persistence framework with patterns      
                                                                                            
                                                                                                      TOTAL: 45 PERIODS 
   
TEXT BOOKS:
1.  Michael Blaha and James Rumbaugh,  “Object-oriented modeling and      
     design with UML”, Prentice-Hall of India, 2005. (Unit 1)
2.  Craig Larman. “Applying UML and Patterns – An introduction to Object-  
     Oriented Analysis and Design and Iterative Development”, 3rd ed, Pearson    
     Education, 2005.

REFERENCES:

1.  Booch, Grady. Object Oriented Analysis and Design. 2
nd
 ed. Pearson Education.
2000.  
2. Ali Bahrami, “Object Oriented Systems Development”, McGraw-Hill, 1999.  
3. Fowler, Martin. UML Distilled. 3
rd
 ed. Pearson Education. 2004.
4. Lunn, Ken. Software development with UML. Palgrave Macmillan. 2003.  
5. O’Docherty, Mike. Object-Oriented Analysis & Design. Wiley. 2005.

IT9302               MULTIMEDIA SYSTEMS                     L T P C 
                                                                                                                           3  0 0  3 
AIMS 
  Introduce students to the different media used in multimedia systems.
 Introduce students to the design issues related to multimedia systems.
 Introduce students to Multimedia networking concepts


OBJECTIVES 
  Students will be able to handle all multimedia components efficiently.
 Students will be able to develop Integrated, Collaborative multimedia systems
UNIT I    MULTIMEDIA ELEMENTS            9
Introduction – Definitions – Applications – Elements - Text – Image/Graphics
Audio – video – Animation.

UNIT II   DATA AND FILE FORMATS                       9
Compression Techniques – Lossless, Lossy – JPEG, MPEG, GIF, TIFF, RIFF- H.261,
H.262, H.263 -File formats - Display Technologies (Output) – Input

UNIT III   MULTIMEDIA AUTHORING                       9
Authoring tools  -  Inserting media elements on the Web Pages  - Programming audio,
Video, Image using Java - open gl.  

UNIT IV   MULTIMEDIA STORAGE AND MANAGEMENT                    9
Storage and Retrieval and presentation-Synchronization Issues - Multimedia
Operating  Systems and Multimedia databases  –  Hypertext  -   Hypermedia
Architectures.   24
UNIT V   MULTIMEDIA NETWORKS                                  9
Protocol  - QOS Issues  - RTP, RTCP, RTSP, SIP, Multimedia over ATM Networks  -
Media on demand –ITV  - STB  Broad cast  Schemes for VoD Buffer Management  -
Multimedia over wireless networks.
TOTAL: 45 PERIODS
TEXT BOOKS:

1.  Ralf Steinmetz and Klara, “Multimedia Computing, Communications and
        Applications”, Pearson Education, 2004.
2.  K.Andleigh, Kiran Thakrar , Multimedia Systems Design, PHI, 2007.

REFERENCES: 
1.  Ze Nian Li, S. Drew,  “Fundamentals of Multimedia” , PHI,2006.
2. Fred Halsall, “Multimedia Communications- Applications, Networks, Protocols and
Standards , Pearson Education, 2007.

IT9303                   COMPUTER NETWORKS                     L T P C 
                                                                                                                         3  0 0  3 
AIM:

To understands the concepts of computer networks
OBJECTIVES:
  To understand the layering concepts in computer networks
 To understand the functions of each layer
 To have knowledge in different applications that use computer networks

UNIT I                  7
Network architecture – Layers – Physical links – Channel access on links – SDMA –
TDMA – FDMA – CDMA – Hybrid multiple access techniques - Issues in the data link
layer - Framing – Error correction and detection – Link-level flow control  

UNIT II                            7
Medium access   –  Ethernet  –  Token ring  –  FDDI  – Wireless LAN  –  Bridges and
Switches          

UNIT III               11
Circuit switching – Packet switching – Virtual circuit switching –  IP – ARP – RARP –
DHCP  –  ICMP  –  Routing algorithms   –  RIP  –  OSPF  –  Subnetting  –  CIDR  –
Interdomain routing – BGP –  IPv6 – Multicasting – Congestion avoidance in network
layer

UNIT IV               10
UDP – TCP – Flow control – Congestion control – Queueing discipline – Congestion
avoidance – QoS – RPC        
    25
UNIT V               10
Email (SMTP, MIME, POP3, IMAP) – HTTP – DNS- SNMP – Telnet – FTP – TFTP
        
         TOTAL:45 PERIODS 
TEXT BOOKS: 

1.  Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”,
Fourth Edition, Morgan Kaufmann Publishers Inc., 2007.
2. James F. Kurose, Keith W. Ross, “Computer Networking, A Top-Down Approach
Featuring the Internet”, Third Edition, Addison Wesley, 2005.

REFERENCES:
1.  Nader F. Mir, “Computer and Communication Networks”, First Edition, Pearson
Education, 2007
2. Douglas E. Comer, “Computer Networks and Internets with Internet Applications”,
Fourth Edition, Pearson Education, 2003.
3. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, Pearson
Education, 2002.
4. William Stallings, “Data and Computer Communication”, Eighth Edition, Pearson
Education, 2007.

IT9304                  DISTRIBUTED SYSTEMS            L T P C 
                                                                                                                              3  0 0 3 
AIM:  
The aim of the course is to convey an insight into the fundamental concepts,
principles, and state-of-the-art practice underlying the design of distributed systems.

OBJECTIVES:
  To understand the importance of communication in distributed environment and
the actual implementation of various communication mechanisms
 To study how a distributed operating system works and how it differs from the
single processor OS.
 To learn how to manage the resources in a distributed environment
 To learn how to make a distributed systems fault tolerant
 To study how the above-mentioned techniques have been used in actual, real-life
distributed systems.

UNIT I    COMMUNICATION IN DISTRIBUTED ENVIRONMENT                    8
Introduction – Various Paradigms in Distributed Applications – Remote Procedure Call
–  Remote Object Invocation  –  Message-Oriented Communication  –  Unicasting,
Multicasting and Broadcasting – Group Communication.

UNIT II   DISTRIBUTED OPERATING SYSTEMS         12
Issues in Distributed Operating System  –  Threads in Distributed Systems  –  Clock
Synchronization – Causal Ordering – Global States – Election Algorithms –Distributed
Mutual Exclusion  –  Distributed Transactions  –  Distributed Deadlock  –  Agreement
Protocols .

UNIT III   DISTRIBUTED RESOURCE MANAGEMENT        10
Distributed Shared Memory  –  Data-Centric Consistency Models  –  Client-Centric
Consistency Models – Ivy – Munin – Distributed Scheduling – Distributed File Systems
– Sun NFS.

UNIT IV   FAULT TOLERANCE AND CONSENSUS                     7
Introduction to Fault Tolerance  –  Distributed Commit Protocols  –  Byzantine Fault
Tolerance – Impossibilities in Fault Tolerance.

UNIT V   CASE STUDIES                         8
Distributed Object-Based System  –  CORBA  –  COM+  –  Distributed CoordinationBased System – JINI.
TOTAL:45 PERIODS 
TEXT BOOKS: 

 1.   George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems Concepts
       and Design”, Third Edition, Pearson Education Asia, 2002.
2.   Hagit Attiya and Jennifer Welch, “Distributed Computing: Fundamentals,
Simulations and Advanced Topics”, Wiley, 2004.

REFERENCES: 
1.  Mukesh Singhal, “Advanced Concepts In Operating Systems”,  
       McGrawHill Series in Computer Science, 1994.
2. A.S.Tanenbaum, M.Van Steen, “Distributed Systems”, Pearson    Education,2004.
3. M.L.Liu, “Distributed Computing Principles and Applications”, Pearson Addison
       Wesley, 2004.

CS9306    COMPUTER NETWORKS LABORATORY           L T P C 
                                                                                                                              0  0 3 2 

AIM: 
To have hands-on experience in network programming and to use simulation tools to
analyze network protocols.
OBJECTIVES: 
  To learn socket programming
 To use simulation tools.
 To analyze the performance of protocols in different layers in computer networks
using simulation tools.

1.  Applications using TCP Sockets like
a.  Echo client and echo server
b. File transfer
c.  Remote command execution
d. Chat
e. Concurrent server
2.  Applications using UDP Sockets like
a. DNS
b. SNMP  
3.  Applications using Raw Sockets like
a.  Ping
b. Traceroute

4.  RPC
5. Experiments using simulators like OPNET:
a.  Performance comparison of MAC protocols
b. Performance comparison of Routing protocols
c.  Study of TCP/UDP performance
TOTAL:45 PERIODS

CS9307                   CASE TOOLS LAB                     L T P C 
                                                                                                                             0  0 3 2 

AIM: 
Scope of this lab is to understand the application of case tools, which focuses on the
following software engineering activities:
• Software requirements analysis and specification
• Software design
• Software implementation
• Software testing and maintenance
• Communication skills and teamwork
• Modeling techniques and CASE tools
• Software project planning and management

1.  Study of case tools   such as rational rose or equivalent tools  
2. Requirements
      Implementation of requirements engineering activities such as elicitation,  
validation, management using case tools

3.  Analysis and design
Implementation of analysis and design using case tools.

4. Study and usage of software project management tools such cost estimates and
scheduling
5. Documentation generators - Study and practice of Documentation    
      generators.

6.  Data modeling using automated tools.
7. Practice reverse engineering and re engineering using tools.

8. Exposure towards test plan generators, test case generators, test coverage and
software metrics.

9. Meta modeling and software life cycle management.

TOTAL:45 PERIODS   28
GE9371    COMMUNICATION SKILLS AND SOFT SKILLS LAB           L  T P C 
                          FIFTH / SIXTH SEMESTER                                             0  0  2 1 

AIM: 
To enhance the overall capability of students and to equip them with the necessary
Communication Skills and Soft Skills that would help them excel in their profession.
OBJECTIVES:
  To equip students of engineering and technology with effective speaking and
listening skills in English.
 To help them develop their soft skills and interpersonal skills, which will make the
transition from college to workplace smoother and help them excel in their jobs.
 To enhance the performance of students at Placement Interviews, Group
Discussions and other recruitment exercises.


A.   Viewing and discussing audio-visual materials                                (6 periods)  
                                                                                                      

1.  Resume / Report Preparation / Letter Writing:                                            (2)
      Letter writing – Job application with Resume - Project report - Email etiquette.
2.  Presentation skills:                                                                                        (1)
Elements of effective presentation  – Structure of presentation  - Presentation
tools – Body language.
      3.   Soft Skills:                                                                                                      (1)
      Time management – Stress management – Assertiveness – Negotiation
strategies.
4.  Group Discussion:                                                                                         (1)
Group discussion as part of selection process, Structure of group discussion –
Strategies in group discussion – Mock group discussions.
5.  Interview Skills:                                                                                              (1)
Kinds of interviews – Interview techniques – Corporate culture – Mock
interviews.
(Career Lab Software may be used for this section).


       Note: Career Lab software may be used to learn the skills, to be applied in the
practice session.

   B.   Practice session                                                                               (24 periods)
1.  Resume / Report Preparation / Letter writing: Students prepare their    
      own resume and report.                                                                             (4)
2.  Presentation Skills: Students make presentations on given topics.        (8)
3.  Group Discussion: Students participate in group discussions.                (6)
4. Interview Skills: Students participate in Mock  Interviews                        (6)






For more information contact us via Studentstrainer@gmail.com. Caring is sharing, show your caring to us by sharing our post in social sites and keep like us,,,
Friday, 15 June 2012

3rd semester syllabus for Information Technology


ANNA UNIVERSITY :: CHENNAI 600 025
UNIVERSITY DEPARTMENTS
REGULATIONS – 2008
CURRICULUM FROM III TO VIII SEMESTERS AND ELECTIVES FOR
B.TECH. INFORMATION TECHNOLOGY
SEMESTER III
CODE NO COURSE TITLE L T P C
THEORY

MA9211 Mathematics III 3 1 0 4
EC9212 Communication Techniques 3 0 0 3
CS9202 Database Management Systems 3 0 0 3
IT9201 Computer Organization 3 1 0 4
CS9203 Programming and Data Structures II 3 0 0 3
CS9201 Design and Analysis of Algorithms 3 0 0 3
PRACTICAL
CS9205 Database Management Systems Laboratory 0 0 3 2
CS9206 Programming and Data Structures Laboratory II 0 0 3 2
CS9207 Algorithms Laboratory 0 0 3 2
TOTAL 18 2 9 26
MA9211 MATHEMATICS III L T P C
(Common to all branches of BE / B.Tech Programmes) 3 1 0 4
AIM:
To facilitate the understanding of the principles and to cultivate the art of formulating
physical problems in the language of mathematics.
OBJECTIVES:
  •  To introduce Fourier series analysis which is central to many applications in engineering apart from its use in solving boundary value problems
  •  To acquaint the student with Fourier transform techniques used in wide variety of situations in which the functions used are not periodic
  •  To introduce the effective mathematical tools for the solutions of partial differential equations that model physical processes
  •  To develop Z- transform techniques which will perform the same task for discrete time systems as Laplace Transform, a valuable aid in analysis of continuous time systems
UNIT I FOURIER SERIES 9+3
Dirichlet’s conditions – General Fourier series – Odd and even functions – Half-range
Sine and Cosine series – Complex form of Fourier series – Parseval’s identity –
Harmonic Analysis.
UNIT II FOURIER TRANSFORM 9+3
Fourier integral theorem – Fourier transform pair-Sine and Cosine transforms –
Properties – Transform of elementary functions – Convolution theorem – Parseval’s
identity.
UNIT III PARTIAL DIFFERENTIAL EQUATIONS 9+3
Formation – Solutions of first order equations – Standard types and Equations
reducible to standard types – Singular solutions – Lagrange’s Linear equation –
Integral surface passing through a given curve – Solution of linear equations of higher
order with constant coefficients.
UNIT IV APPLICATIONS OF PARTIAL DIFFERENTIAL EQUATIONS 9+3
Method of separation of Variables – Solutions of one dimensional wave equation and
one-dimensional heat equation – Steady state solution of two-dimensional heat
equation – Fourier series solutions in Cartesian coordinates.
UNIT V Z – TRANSFORM AND DIFFERENCE EQUATIONS 9+3
Z-transform – Elementary properties – Inverse Z-transform – Convolution theorem –
Initial and Final value theorems – Formation of difference equation – Solution of
difference equation using Z-transform.
L: 45, T: 15, TOTAL: 60 PERIODS
TEXT BOOKS:

1. Grewal, B.S. “Higher Engineering Mathematics”, Khanna Publications (2007)
REFERENCES:
1. Glyn James, “Advanced Modern Engineering Mathematics, Pearson Education
(2007)
2. Ramana, B.V. “Higher Engineering Mathematics” Tata McGraw Hill (2007).
3. Bali, N.P. and Manish Goyal, “A Text Book of Engineering 7th Edition (2007)
Lakshmi Publications (P) Limited, New Delhi.

EC9212 COMMUNICATION TECHNIQUES L T P C
3 0 0 3

UNIT I ANALOG MODULATION 9
Amplitude Modulation – AM, DSBSC, SSBSC, VSB – PSD, modulators and
demodulators – Angle modulation – PM and FM – PSD, modulators and demodulators
– Superheterodyne receivers
UNIT II DIGITISATION 9
Low pass sampling theorem – Quantisation - PAM – Line coding - PCM, DPCM, DM,
ADPCM and ADM, Channel Vocoder,– Time Division Multiplexing, frequency Division
Multiplexing
UNIT III DIGITAL MODULATION AND TRANSMISSION 9
Phase shift keying – BPSK, DPSK, QPSK - Principles of M-ary signaling M-ary PSK
& QAM – Comparison, ISI – Pulse shaping – Duo binary encoding - Cosine filters –
Eye pattern, equalizers
UNIT IV INFORMATION THEORY AND CODING 9
Measure of information – Entropy – Source coding theorem - Shannon-Fano coding,
Huffman Coding, LZ Coding– Channel capacity – Shannon-Hartley law – Shannon’s
limit- Error control Codes – Cyclic codes, Syndrome calculation – Convolutional
Coding, Sequential and Viterbi decoding
UNIT V SPREAD SPECTRUM AND MULTIPLE ACCESS 9
PN sequences – properties – m-sequence –DSSS –Processing gain, Jamming –
FHSS –Synchronisation and tracking - Multiple Access – FDMA, TDMA, CDMA
TOTAL: 45 PERIODS
TEXT BOOKS:

1. H Taub, D L Schilling, G Saha, “Principles of Communication Systems” 3/e, TMH
2007
2. S. Haykin “Digital Communications” John Wiley 2005
REFERENCES:
1. B.P.Lathi, “Modern Digital and Analog Communication Systems”, 3/e, Oxford
University Press,2007
2. H P Hsu, Schaum Outline Series - “Analog and Digital Communications” TMH
2006
3. B.Sklar, “Digital Communications Fundamentals and Applications” 2/e Pearson
Education 2007

CS9202 DATABASE MANAGEMENT SYSTEMS L T P C
3 0 0 3
AIM:

To provide a strong foundation in database technology and an introduction to the
current trends in this field.
OBJECTIVES:
  •  To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.
  •  To make a study of SQL and relational database design.
  •  To understand the internal storage structures using different file and indexing techniques which will help in physical DB design.
  •  To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure.
  •  To have an introductory knowledge about the Storage and Query processing techniques
UNIT I INTRODUCTION 9
Purpose of Database System -– Views of data – Data Models – Database
Languages –– Database System Architecture – Database users and Administrator –
Entity–Relationship model – E-R Diagrams -- Introduction to relational databases
UNIT II RELATIONAL MODEL 9
The relational Model – The catalog- Types– Keys - Relational Algebra – Domain
Relational Calculus – Tuple Relational Calculus - Fundamental operations –
Additional Operations- SQL fundamentals - Integrity – Triggers - Security – Advanced
SQL features –Embedded SQL– Dynamic SQL- Missing Information– Views –
Introduction to Distributed Databases and Client/Server Databases
UNIT III DATABASE DESIGN 9
Functional Dependencies – Non-loss Decomposition – Functional Dependencies –
First, Second, Third Normal Forms, Dependency Preservation – Boyce/Codd Normal
Form- Multi-valued Dependencies and Fourth Normal Form – Join Dependencies
and Fifth Normal Form
UNIT IV TRANSACTIONS 9
Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery
– Media Recovery – Two Phase Commit - Save Points – SQL Facilities for recovery –
Concurrency – Need for Concurrency – Locking Protocols – Two Phase Locking –
Intent Locking – Deadlock- Serializability – Recovery Isolation Levels – SQL Facilities
for Concurrency
UNIT V IMPLEMENTATION TECHNIQUES 9
Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary storage –
File Organization – Organization of Records in Files – Indexing and Hashing –Ordered
Indices – B+ tree Index Files – B tree Index Files – Static Hashing – Dynamic Hashing
– Query Processing Overview – Catalog Information for Cost Estimation – Selection
Operation – Sorting – Join Operation – Database Tuning.
TOTAL: 45 PERIODS

TEXT BOOKS

1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System
Concepts”, Fifth Edition, Tata McGraw Hill, 2006 (Unit I and Unit-V ) .
2. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”,
Eighth Edition, Pearson Education, 2006.( Unit II, III and IV)
REFERENCES:
1. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”,
FourthEdition , Pearson / Addision wesley, 2007.
2. Raghu Ramakrishnan, “Database Management Systems”, Third Edition, McGraw
Hill, 2003.
3. S.K.Singh, “Database Systems Concepts, Design and Applications”, First Edition,
Pearson Education, 2006.
IT9201 COMPUTER ORGANIZATION L T P C
3 1 0 4
AIM:

To understand the basics of digital design, the design of various components of the
computer system and its organization.
OBJECTIVES:
  •  To understand the fundamentals of Boolean logic and functions.
  •  To design and realize these functions with basic gates, and other components using combinational and sequential logic.
  •  To understand the design and organization of a von-neumann computer system.
  •  To comprehend the importance of the hardware-software interface.
UNIT I DIGITAL FUNDAMENTALS 9 +3
Number systems and conversions – Boolean algebra and simplification – Minimization
Of Boolean functions – Karnaugh map – Quine McCluskey tabulation method – Logic
gates – NAND – NOR implementation.
UNIT II COMBINATIONAL AND SEQUENTIAL CIRCUITS 9 +3
Design of combinational circuits – Adder / Subtracter – Encoder – Decoder – Mux /
Demux – Comparators – Flip Flops – Triggering – Master – Slave Flip Flop – State
diagrams and minimization – Counters – Registers.
UNIT III BASIC STRUCTURE OF COMPUTERS 9 +3
Functional units – Basic operational concepts – Bus structures – Performance and
metrics – Instructions and instruction sequencing – Hardware – Software Interface –
Instruction set architecture – Addressing modes – RISC – CISC. ALU design – Fixed
point and floating point operations.
UNIT IV PROCESSOR DESIGN 9 +3
Fundamental concepts – Execution of a complete instruction – Hardwired control –
Micro programmed control. Pipelining – Basic concepts – Data hazards – Instruction
hazards – Influence on instruction sets – Data path and control considerations –
Performance considerations

UNIT V MEMORY AND I/O SYSTEMS 9 +3 Memory Technology – Memory hierarchy – Cache Memory – Design Methods – Virtual
Memory – Input/Output System – Programmed I/O – DMA and Interrupts – Functions
of I/O devices and interfaces.
L: 45, T: 15, TOTAL:60 PERIODS
TEXT BOOKS

1. Morris Mano, “Digital Design”, Third Edition, Pearson Education, 2002.
2. Carl Hamacher, Zvonko Vranesic And Safwat Zaky, “Computer Organization”, Fifth
Edition,Tata McGraw Hill, 2002.
REFERENCES
1. Charles H. Roth, Jr., “Fundamentals of Logic Design”, Fifth Edition, Jaico
Publishing House, 2003.
2. William Stallings, “Computer Organization and Architecture – Designing for
Performance”, Sixth Edition, Pearson Education, 2003.
3. David A. Patterson And John L. Hennessy, “Computer Organization and Design:
The Hardware/Software Interface”, Third Edition, Elsevier, 2005.
4. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata
McGraw Hill, 1998.
CS9203 PROGRAMMING AND DATA STRUCTURES II L T P C
3 0 0 3
AIM:

The aim is to introduce the concepts Object Oriented Programming and analysis the
implementation of Advanced Data Structures using Object Oriented Programming
Language.
OBJECTIVES:
  •  To introduce the concepts of Object Oriented Programming language.
  • To introduce the concepts of Templates and Error Handling.
  •  To introduce the concepts of Advanced Data Structures.
UNIT I 9
Introduction – Learning C++ - Design of C++ - History and Use – Programming
Paradigms – Standard Library – Types and Declaration – Pointers, Arrays, Structures
– Expressions and Statements – Functions – Namespaces and Exceptions – Source
Files and Programs – Classes – User-Defined Types – Objects – Operator
Overloading – Operator Functions – Complex Number
UNIT II 9
Type Conversion Operators – Friends – Large Objects – Essential Operators –
Subscripting – Function Call – Dereferencing – Increment and Decrement – String
Class – Derived Classes – Abstract Classes – Design of Class Hierarchies

UNIT III 9
Templates – Function Templates – Error Handling – Grouping of Exceptions –
Catching Exceptions – Resource Management – Multiple Inheritance – Access Control
– Run Time Type Information
UNIT IV 9
OO Perspective of List, Stack, Queue, and Search Tree ADTs – AVL Trees – Red
Black Trees – Splay Trees – B-trees – Priority Queues (Heaps)
UNIT V 9
Disjoint Set ADT – Graph Algorithms – Topological Sort – Shortest-Path Algorithm –
Network Flow Problems – Minimum Spanning Tree – Applications of Depth-First
Search
TOTAL: 45 PERIODS
TEXT BOOKS:

1. Bjarne Stroustrup, “The C++ Programming Language”, 3rd ed., Pearson Education,
2007. (Units 1,2,3)
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 2nd ed.,
Pearson Education, 2005. (Units 4,5)
REFERENCES:
1. Ira Pohl, “Object-Oriented Programming using C++”, 2nd ed., Pearson Education,
1997.
2. Goodrich, Michael T., Roberto Tamassia, David Mount. Data Structures and
Algorithms in C++. 7th ed, Wiley. 2004.
CS9201 DESIGN AND ANALYSIS OF ALGORITHMS L T P C
3 0 0 3
AIM:

The aim is to introduce the basics of algorithm design paradigms and analysis to
enable designing of efficient algorithms.
OBJECTIVES:
  •  To introduce the basic concepts of algorithm analysis
  •  To introduce the design paradigms for algorithm design
  •  To introduce the basic complexity theory.
UNIT I 9
The Role of Algorithms in Computing-Getting Started-Growth of Functions –
Recurrences-The Substitution Method- The Recurrence Tree Method-The Master
Method -Probabilistic Analysis and Randomized Algorithms-The Hiring Problem-
Random Variables-Randomized Algorithms.
UNIT II 9
Quicksort-Description-Performance-Randomized version-Analysis.Sorting in linear
time-Lower bounds for sorting-Counting sort-Medians and order statistics-Minimum
and maximum-Selection in expected linear time- Selection in worst-case linear time-
Dynamic Programming – Matrix chain multiplication –Elements of Dynamic
programming- Longest common sequences.

UNIT III 9
Greedy Algorithms-Activity selection problem-Elements of Greedy Strategy-Huffman
code.Matrix Operations-Properties of matrices-Strassen's algorithm-Solving systems
of linear equations-Inverting matrices.
UNIT IV 9
Linear Programming-Standard and slack forms-Formulating problems-Simplex
algorithm-Duality-Initial basic feasible solution - String Matching-Naive string matching
algorithm-Knuth-Morris-Pratt algorithm.
UNIT V 9
NP-completeness-Polynomial time-Polynomial-time verification-NP-completeness and
reducibility-NP-completeness proofs - NP-completeness problems. Approximation
Algorithms-The vertex-cover problem-The traveling-salesman problem.
TOTAL: 45 PERIODS
TEXT BOOKS
:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, Cliford Stein,
“Introduction to Algorithms”, Second Edition, Prentice Hall of India, 2007.
REFERENCES
1. Jon Kleinberg, Eva Tardos, “Algorithm Design”, Pearson Education, 2006.
2. Michael T. Goodrich, Toberto Tamassisa, “ Algorithm Design: Foundations,
Analysis and Internet Examples”, Wiley Student Edition, 2007.
3. Anany Levitin, “Introduction to Design and Analysis of Algorithms”, Pearson
Education, 2003.
CS9205 DBMS LAB L T P C
0 0 3 2
EXPERIMENTS IN THE FOLLOWING TOPICS:

1. Data Definition, Manipulation of base tables and views
2. High level programming language extensions.
3. Front end tools
4. Forms
5. Triggers
6. Menu Design
7. Importing/ Exporting Data
8. Reports.
9. Database Design and implementation (Mini Project).
TOTAL: 45 PERIODS
12
CS9206 PROGRAMMING AND DATA STRUCTURES LAB II L T P C
0 0 3 2

EXPERIMENTS IN THE FOLLOWING:
1. Data abstraction, Implementation of any one of the following List, Stack,
Queue ADTs, using Header files, Separate compilation of implementation
and application. Search ADT, Binary Search Tree., Header files, Separate
compilation.
2. Use of Standard Template Library: Strings, Containers
3. Use of STL: Iterators
4. Operator Overloading
5. Templates,
6. Exception handling, Class Hierarchies
7. AVL Tree
8. Splay Tree
9. B Tree
10. Graph algorithms
TOTAL:45 PERIODS
CS9207 ALGORITHMS LAB L T P C
0 0 3 2 1
. Implementing simple recursive programs like Towers of Hanoi ,Generating
Permutations.
2. Implementation of simple sort algorithms.
3. Implementation of randomized quicksort algorithms.
4. Implementation of algorithms like merge sort using Divide and Conquer
approach.
5. Implementation of Huffman code using Greedy Approach.
6. Implementation of Dynamic Programming – Floyd's Algorithm.
7. Solving Simplex Method.
8. Implement String matching algorithms.
9. Implementation of programs Study of Benchmarking and analysis of
Algorithms for simple programs.
10. Study of Algorithms Tools like LEDA (Library of Efficient Data types and
Algorithms).
TOTAL: 45 PERIODS


For more information contact us via Studentstrainer@gmail.com. Caring is sharing, show your caring to us by sharing our post in social sites and keep like us,,,