Software Testing and Quality Assurances

Download  Software Metrics: A Rigourous and Practical Approach

 Download Metrics & Models in Software Quality Engineering






Download lab manual and programs Software Testing and Quality Assurances

410450 Software Testing And Quality Assurance

Teaching Scheme:

Theory: 04 Hrs./week

Examination Scheme:

Theory: 100 Marks Duration: 3 Hrs.

Objectives:

. To introduce Software Measurement concepts

. To introduce Software Testing Process

. To emphasis on Software Testing strategies

. To introduce Software Quality management principles & metrics.

UNIT I:

Principles of Measurement:

Representation Theory of Measurement, Measurement and models, Measurement Scales, Classification of Software Measures, Determining what to measure, Applying Framework, Software Measurement Validation, Four principles of Investigation, Planning Formal Experiments, What is a good data, How to define/collect data, How to Store and Extract data.

UNIT II:

Internal Product attributes Measurement

Size: Aspects of software size, length, reuse, functionality, complexity

Structure: Types of structural measures, control-flow structures, Modularity and information flow attributes, Object-oriented metrics, Data structure, Difficulties with general complexity measures, Halstead's Software Science.

UNIT III:

Software Measurement Programs and Principles of Testing:

What is a metric plan?, Goal-Question-Metric model, Measurement tools, Measurement in small, Measurement in Large systems.

Defects: Origins of Defects, Defect Classes, Defect repository and Test Design, Developer/Tester support for Defect Repository

Test Case Design I (White-Box): Test Adequacy criteria, Static testing by humans, Static analysis tools, Structural Testing, Code Complexity testing, Mutation Testing

Test Case Design II (Black-Box): Test case Design Criteria, Requirement based testing, Positive and negative testing, Boundary Value analysis, Equivalence Partitioning, State-based or Graph­based Testing, Compatibility Testing, User Documentation Testing, Domain Testing

UNIT IV: Software testing:

Test plan, Management, Execution and Reporting, GUI testing, Validation testing, Integration testing, System and Acceptance testing, Scenario testing, Regression testing, Specification-based testing, Performance Testing, Ad hoc Testing, Usability and Accessibility Testing, Software Test Automation.

UNIT V:

    Software Quality metrics and tools:

Quality concepts, Software Quality Assurance, Six Sigma principles, Malcolm Baldridge Assessment, ISO 9000, Edward Deming's principles, Total Quality Management, Product Quality Metrics, In process Quality Metrics, Software maintenance, Ishikawa's 7 basic tools, Checklists, Pareto diagrams, Histogram, Run Charts, Scatter diagrams, Control chart, Cause Effect diagram. Defect Removal Effectiveness & Process Maturity Level.

UNIT VI:

Software Maintenance:

Problem Reporting: Customer side Preliminary activities, Defects reported by Internal Customers, Logistics and Tooling, Challenges and Best Practices.

Problem Resolution: Overview of Problem Resolution, Categorizing and Identifying problem, Making the Fix and Testing it, Challenges and Best Practices.

Fix Distribution: Overview of Fix Distribution, Choosing method of Fix Distribution, Composing Fixes, Preparing and Testing Shipment unit.

Text Books:

1. Fenton, Fleeger, " Software Metrics: A Rigourous and Practical Approach", Thomson,

            ISBN 981.240-385-X

2. Stephen H. Kan, "Metrics & Models in Software Quality Engineering", Pearson

            Education, ISBN 81-297-0175-8

Reference Books:

                                                                                                        ...

1. Ramesh, Bhattiprolu, " Software Maintenance", Tata McGraw Hill, ISBN 0-07-048345-0

2. Desikan, Ramesh, "Software Testing: Principles and Practices", Pearson Education,

            ISBN 8l-7758-121-X

3. Burnstein, "Practical Software Testing", Springer International Edition, ISBN 81-8128­

            089-X

Advanced Computer Architecture and Computing

 Download Computer Architecture And Parallel Processing

Download Advanced Computer Architecture

410449 Advanced Computer Architecture and Computing

Teaching Scheme

Theory: 4 HrsJWeek

Examination Scheme

Theory: 100 Marks Duration: 3 Hours

UNIT I:

Overview of Parallel Processing and Pipelining Processing

Necessity of high performance, Constraints of conventional architecture, Parallelism in uniprocessor system, Evolution of parallel processors, future trends, Architectural Classification, Applications of parallel processing, Instruction level Parallelism and Thread Level Parallelism, Explicitly Parallel Instruction Computing (EPIC) Architecture, Case study of Intel Itanium Processor

Principles of scalable performance: Performance Metrics and Measures, Speedup Performance Laws 6Hrs.

UNIT II:

Pipeline Architecture

Principles and implementation of Pipelining, Classification of pipe lining processors, General pipe lining reservation table, Design aspect of Arithmetic and Instruction pipelining, Pipelining hazards and resolving techniques, Data buffering techniques, Job sequencing and Collision, Advanced pipelining techniques, loop unrolling techniques, out of order execution, software scheduling, trace scheduling, Predicated execution, Speculative loading, Register Stack Engine, Software pipelining, VLIW (Very Long Instruction Word) processor, Case study: Superscalar Architecture- Pentium, Ultra SP ARC 8 Hrs

UNIT III:

Vector and Array Processor

Basic vector architecture, Issues in Vector Processing, Vector performance modeling, vectorizers and optimizers, Case study: Cray Arch.

SIMD Computer Organization Masking and Data network mechanism, Inter PE Communication, Interconnection networks of SIMD, Static V s Dynamic network, cube hyper cube and Mesh Interconnection network.

Parallel Algorithms For Array Processors: Matrix Multiplication. Sorting, FFT 8Hrs.

UNIT IV:

Multiprocessor Architecture

Loosely and Tightly coupled multiprocessors, Processor characteristics of multiprocessors, Inter Processor communication network, Time shared bus, Crossbar switch, Multiport Memory Model, Memory contention and arbitration techniques, Cache coherency and bus snooping, Massively Parallel Processors (MPP), COW's and NOW's Cluster and Network of Work Stations), Chip Multiprocessing (CMP), Case Study of IBM Power4 Processor

Inter Processor Communication and Synchronization 8Hrs.

UNIT V:

Multithreaded Architecture

Multithreaded processors, Latency hiding techniques, Principles of multithreading, Issues and solutions,;

Parallel Programming Techniques

Message passing program development, Synchronous and asynchronous message passing, Message passing parallel programming, Shared Memory Programming, Data Parallel

Programming 7 Hrs.

UNIT VI:

Parallel Software Issues

a) Parallel algorithms for multiprocessors, classification of paranel algorithms, performance

of parallel algorithms

b) Operating systems for multiprocessors systems, Message passing libraries for parallel

programming interface, PVM (in distributed memory system), Message Passing

Interfaces (MPI), PThreds (in shared memory system)

c) Parallel Programming Languages: Fortan 90, Occam, C-Linda, CCC etc.

d) Issues towards cluster

computing. Introduction to Neuro Computing and GridComputing 8 Hrs.

Text Books

1. Kai Hwang, Faye A. Briggs, "Computer Architecture and Parallel Processing"

McGrawhill international Edition

2. Kai Hwang, "Advanced Computer Architecture", Tata McGrawhill Edition

References

1. V.Rajaraman, L Sivaram Murthy, "Parallel Computers", PID.

2. William Stallings, "Computer Organization and Architecture, Designing for

performance" Prentice Hall, Sixth edition

3. Kai Hwang, Scalable Parallel Computing

4. Harrold Stone, High performance computer Architceture

5. Richard Y. Kain , Advanced Computer Architecture

6. http://www.intel.com/products/processor (for Intel Itanium Processor)

7. For IBM Power 4 Processor

a. http://www. ibm.com/servers/eserver/pserieslhardware/whitepapers/power/ppc - ar

ch.html

b. http://www . i bm .com! servers/ eserver/pserics/hard ware/wh itepapers/power/ppc ar

ch 2.html

TE_COMP_SYLLABUS_2008

Download TE COMP Syllabus

Theory of Computation

Download Theory Of Computation

310245: THEORY OF COMPUTATION
Examination Scheme Theory: 100 Marks
Teaching Scheme Lectures: 3 Hrs/Week

Objectives:
• Study abstract computing models
• Learn about the theory of computability and complexity.
Prerequisites:
• Discrete Structures
• Data Structures and Algorithms

Unit I (6 Mrs)
Automata Theory: Introduction to Finite Automata, Structural Representations, Automata
and Complexity, Central Concepts to Automata Theory: Alphabets, Strings, Languages and
Problems, Finite Automata: An Informal Picture of FA, Deterministic Finite Automaton
(DFA): How a DFA processes Strings, Simpler Notations for DFA, Extending the transition
function to strings, the language of DFA, Non-deterministic Finite Automaton (NFA): NFA,
Extended transition function, the language of an NFA, Equivalence of NFA and DFA, FA
with e-transitions: Use of e-transitions, NFA with e, e-closures, Extended transitions and
languages for e-NFA, Eliminating €-transitions-Con version of NFA with e to NFA without
e, Conversion of NFA without e to DFA, Conversion of NFA with 6 to DFA (direct method),
FA with output: Moore and Mealy machines -Definition, models, inter-conversion.

Unit II (6 Hrs)
Regular Expressions (RE) and Languages: Regular Expressions - Operators of RE,
Building RE, Precedence of operators, Algebraic laws for RE, Arden's Theorem, FA and RE:
DFA to RE, RE to DFA (RE to s-NFA & e-NFA to DFA and RE to DFA-direct method), FA
limitations, Properties of Regular Languages: pumping lemma for regular languages, closure
and decision properties of regular languages, Equivalence and minimization of automata,
Application of RE: Regular expressions in Unix, GREP utilities of Unix, Lexical analysis and
finding patterns in text.

Unit III (6 Hrs)
Context Free Grammars (CFG) and Languages: Context Free Grammar- Definition,
derivations, languages of a grammar, sentential form, Parse Tree- inference, derivation and
parse tree, from inference to tree, Ambiguity in grammars and languages: removal of
ambiguity, inherent ambiguity, Properties of CFL- Normal forms- Chomsky Normal Form
and Greibach Normal Form, Eliminating unit productions, useless production, useless
symbols, and e-productions, Regular Grammar - definition, left linear and right linear
Regular Grammar, Regular Grammar and Finite Automata, FA to RG and RG to FA, Interconversion
between left linear and right linear regular grammar.

Unit IV (6 Hrs)
Push Down Automata (PDA): Definition, The Language of PDA, Equivalence of PDA's
and CFG- CFG to PDA, PDA to CFG, Deterministic Push Down Automata (DPDA)-
Regular language and DPDA, DPDA and CFL, DPDA and ambiguous grammar, Nondeterministic
Push Down Automata (NPDA), The pumping lemma for CFL, Closure
properties of CFL, Decision properties of CFL, Chomsky Hierarchy, Application of CFG:
Parser, Markup languages, XML and Document Type Definitions.
Unit V (6 Hrs) Turing Machine: Problems that computers cannot solve, The Turing
Machine(TM)-Notation, the language of TM, TM and Halting, Programming techniques to TM,
Extensions to basic TM, TM and Computers. Introduction to Post Machines, Comparison
between FA, PDA, Post Machine and TM

Unit VI (6 Hrs)
Introduction to Computational Complexity: Un-decidability: A Language that is not
recursively enumerable, An un-decidable problem that is RE, Post Correspondence Problem,
Intractable Problems* The classes P and NP, Problems solvable in polynomial time, Nondeterministic
Polynomial time, Polynomial time reduction and NP-complete problems.

Text Books:
1. Hopcroft J., Mptwani R., Ullman J., "Introduction to Automata Theory, Languages and
Computations", Second edition, Pearson Education Asia, ISBN 81-7808-347-7
2. Martin J., "Introduction to Language and Theory of Computation", Third edition, Tata
McGraw-Hill, ISBN 0-07-049939-X

Reference Books:
1. Lewis H., Papadimitriou C., "Elements of Theory of Computation", Second edition, Pearson
[education Asia, ISBN 81-7808-487-2
2. Cohen D., "Introduction to Computer Theory", Wiley Publications, edition, ISBN-9971-51-
220-3
3. Moret B., " The Theory of Computation", Pearson Education Asia, ISBN 81-7808-487-2
4. Mishra K., Chandrasekaran N., 'Theory of Computer Science (Automata, Languages and
Computation)", Second Edition, Prentice Hall of India, ISBN-81-2030-1271-6.

Data Communications

Download Data and Computer Communications

Download Modern Digital and Analog Communication Systems




310242: DATA COMMUNICATIONS
Teaching Scheme: Lectures: 3 Hrs/Week
Examination Scheme: Theory: 100 Marks
Objectives:
• To learn and understand fundamentals of data communications
• To understand the conceptual and analytical differences between analog and digital
communication

Unit I (06 Hrs)
Introduction: Communication System, Modulation, Baseband and Carrier Communication,
Amplitude modulation: DSBFC, DSBSC, SSB, QAM, Carrier Acquisition, Superheterodyne
AM Receiver, Angle Modulation: Frequency modulation, phase modulation, Analysis of FM,
Bandwidth Requirements, Equivalence between FM and PM Digital Continuous Wave
Modulation: ASK, FSK and PSK and Modems

Unit 11 (06 Hrs)
Pulse Modulation: Sampling theorem, Natural and Flat Top Sampling, PAM, Pulse Time
Modulation, Pulse Transmission over Band Limited Channel, Effect of Gaussian Type Noise
on Digital Transmission, Crosstalk, Eye Diagram Line Codes: Bipolar, Unipolar, RZ, NRZ,
Manchester, AMI

Unit III (06 Hrs)
Pulse Code Modulation: Encoder and Decoder, PCM - TDM, Tl Carrier System,
Quantization Noise, Companding, DPCM, ADPCM, Delta modulation, Slope overload and
Adaptive Delta Modulation, Scrambling, Digital Carrier Systems, Digital Multiplexing

Unit IV (06 Hrs)
Information and Coding: Measure of information, entropy, information rate, Shannon's
theorems on channel capacity, Optimum Codes, Huffman Code, Code Efficiency, Error
Control Coding, Methods of Controlling Errors, Types of Errors, Types of Codes, Linear
Block Codes: Matrix Description of Linear Block Codes, Error detection and correction
capabilities, Hamming Distance, Hamming Bound, Hamming Codes, CRC Block Codes,
Syndrome Calculation, Error Detection and Correction, Handshaking Techniques, FEC, ARQ
- Stop and Wait, Go Back N, Selective Repeat, Channel Throughput and Efficiency

UnitV (06 Hrs)
Digital Communications Technologies: SF, ESF Framing, DS1/T1, B8ZS, DSU, CSU,
HDSL, Digital Hierarchy, Digital Services, ISDN, Frame Relay, SONET, ATM, BISDN,
SMDs, Video on Demand, ADSL
Cellular Telephone Systems: Spread Spectrum Systems, DS/SS, FH/SS, Cellular Telephony,
GPS, Transmission Media, PSTN

Unit VI (06 Hrs) Computer Network: Need and Applications of Network, Network
Architecture, Protocols and Standards, OSI Model, TCP/IP Model, Network topology
(Physical & logical), Types of Networks: Peer to Peer, Client-Server, LAN: Ethernet, Token
Ring, FDDI, MAN: DQDB, SMDS, WAN: Architecture, Transmission Mechanism,
Addressing, ISDN and Broadband ISDN

Transmission Media: Guided Media - Twisted Pair, Coaxial and Fiber-optic cables,
Unguided Media (Wireless): Radio and Micro Waves, Infrared
Switching Techniques: Circuit switching, Packet switching and message switching,
Telephone network, High-Speed Digital Access: DSL, Cable Modems and Sonets

Text Books:
1. Stallings W., "Data and Computer Communications", Sixth Edition, Prentice Hall of India
Pvt. Ltd., 2002, ISBN 81-203-2067-0
2. Lathi B. "Modern Digital and Analog Communication Systems", 3rd Edition, Oxford
University Press, 2003, ISBN 0-19-511009 - 9
»
Reference Books:
1. Shanmugam K., "Digital and Analog Communication Systems", John Wiley & Sons (Asia)
Pvt. Ltd. ISBN 9971-51-146-0
2. Fourauzan B., "Data Communications and Networking", 3rd edition, Tata McGraw-Hill
Publications, 2004, ISBN 0 - 07 - 058408 - 7
3. Godbole A., "Data Communications and Networks", Tata McGraw-Hill Publications, 2002, 0
- 07 - 047297 - 1
4. Gupta P., "Data Communications", PHI, 2004, ISBN 81 - 203 - 1118 - 3
5. Shay W., "Understanding Data Communications and Networks", Third Edition, Brooks Kale
Thomson Learning/Vikas Publishing House, ISBN 981-254-966-8
6. Garcia L., Widjaja I., "Communication Networks - Fundamental Concepts and Key
Architectures" 2nd edition, Tata McGraw-Hill, 2000, ISBN 0 - 07 - 040235 – 3

Database Management Systems

Download  RVPL  Lab Manual

Download RVPL Program 

Download Database System Concepts

Download Database Systems Design, Implementation and Management

Download Fundamental of Database System

Download an introduction to database systems

310241: DATABASE MANAGEMENT SYSTEMS
Teaching scheme: Lectures: 3 Hrs/Week
Examination Scheme: Theory: 100 Marks
Objectives:
• To learn and understand Database System and its components
• To learn and understand various Database Architectures and Applications
*•
Prerequisites:
• Discrete Structures
• Data Structures and Files

Unit I (06 Hrs)
Introduction to DBMS: Basic concepts, Advantages of a DBMS over file-processing
systems, Data abstraction, Database Languages, Data Models and Data Independence,
Components of a DBMS and overall structure of a DBMS, Multi-User DBMS
Architecture, System Catlogs
Data Modeling: Basic Concepts, entity, attributes, relationships, constraints, keys, E-R
and EER diagrams: Components of E-R Model, conventions, converting E-R diagram into
tables, EER Model components, converting EER diagram into tables
Relational Model: Basic concepts, Attributes and Domains, Codd's Rules, Relational
Integrity: Nulls, Entity, Referential Integrities, Enterprise Constraints, Views, Schema
diagram

Unit II (06 Hrs)
Relational Query Languages: Relational Algebra and Relational Calculus: Tuple
Relational and Domain Relational Calculus
Introduction to SQL: Characteristics and advantages, SQL Data Types and Literals,
DDL, DML, SQL Operators, Tables: Creating, Modifying, Deleting, Views: Creating,
Dropping, Updation using Views, Indexes, Nulls
SQL DML Queries: SELECT Query and clauses, Set Operations, Predicates and Joins,
Set membership, Tuple Variables, Set comparison, Ordering of Tuples, Aggregate
Functions, Nested Queries, Database Modification using SQL Insert, Update and Delete
Queries, concept of Stored Procedures and Triggers, Introduction to QBE and QUEL
Programmatic SQL: Embedded SQL, Dynamic SQL, ODBC

Unit III (06 Hrs)
Database Analysis and Design Techniques: Information Systems Lifecycle, Application
Lifecycle, Planning, System Definition, Requirement Analysis, Design, DBMS Selection,
Application Design: Transaction and User-Interface Design, Prototyping, Implementation,
Data Conversion and Loading, Testing, Data and Database Administration, Fact-Finding
Techniques
Relational Database Design: Purpose of Normalization, Data Redundancy and Update
Anomalies, Functional Dependencies, The Process of Normalization: INF, 2NF, 3NF, BCNF,
4NF, 5NF and DKNF

Unit IV (06 Hrs)
Storage and File Systems: Secondary Storage, RAID, File Organization, Indices, Static and
Dynamic Hashing, B-trees and B+ Trees
Introduction to Query Processing: Overview, Measures of query cost, Selection and join
operations, Evaluation of Expressions, Introduction to Query Optimization, Estimation,
Transformation of Relational Expressions

Unit V (06 Hrs)
Transaction Management: Basic concept of a Transaction, Properties of Transactions, Database
Architecture, Concept of Schedule, Serial Schedule, Serializability: Conflict and View, Cascaded
Aborts, Recoverable and Non-recoverable Schedules, Concurrency Control: Need, Locking
Methods, Deadlocks, Timestamping Methods, Optimistic Techniques, Multi-Version
Concurrency Control, Different Crash Recovery methods such as Shadow-Paging and Log-Based
Recovery: Deferred and Immediate, Checkpoints

Unit VI ' (06 Hrs)
Object-Oriented Databases: Need of OODBMS, Storing Objects in Relational Database,
Introduction to OO Data Models, Persistent Programming Languages, Pointer Swizzling
Techniques, Persistence, Object Management Group, Object Database Standard ODMG
Database Architectures: Centralized and Client-Server Architectures, Introduction to
Distributed Database systems

Text Books:
1. Silberschatz A., Korth H., Sudarshan S., "Database System Concepts", 4* Edition, McGraw
Hill Publishers, 2002, ISBN 0-07-120413-X
2. Connally T., Begg C., "Database Systems", 3rd Edition, Pearson Education, 2002, ISBN 81-
7808-861-4
Reference Books:
1. Rab P. Coronel C. "Database Systems Design, Implementation and Management", 5th Edition,
Thomson Course Technology, 2002, ISBN 981-243-135-7
2. Elmasri R., Navathe S., "Fundamentals of Database Systems", 4* Edition, Pearson Education,
2003, ISBN 8129702282
3. Date C., "An Introduction to Database Systems", 7th Edition, Pearson Education, 2002, ISBN
81 -7808-231- 4
4. Ramkrishna R., Gehrke J., "Database Management Systems", 3rd Edition, McGraw-Hill,
2003, ISBN 0-07- 123151 –X

Microprocessors and Micro¬controllers

 Download HL Lab Manual


Downlaod MMC program

Download Introduction to microprocessors and microcontrollers

Digital Signal Processing

 Download Digital Signal Processing Lab Manual

Download DSP notes

Download  Digital Signal Processing FAQ


Download DSP Program

Download This Book

310244: DIGITAL SIGNAL PROCESSING
Teaching Scheme Lectures: 4 Hrs Week
Examination Scheme Theory: 100 Marks
Objectives:
• To learn methodology to analyze signals and systems
• To get acquainted with the DSP Processors
Prerequisite:
• Knowledge of basic Engineering Mathematics

Unit I (08 Hrs)
Classification of Signals: Analog, Discrete-time and Digital, Basic sequences and sequence
operations. Discrete-time systems, Properties of D. T. Systems and Classification, Linear Time
Invariant Systems, impulse response, linear convolution and its properties, properties of LTI
systems: stability, causality, parallel and cascade connection, Linear constant coefficient different
equations, Eigen functions for LTI systems and frequency response, Periodic Sampling, Sampling
Theorem, Frequency Domain representation of sampling, reconstruction of a band limited Signal,
A to D conversion Process: Sampling, quantization and encoding.

Unit 11 (08 Hrs)
Representation of Sequences by Fourier Transform, Symmetry properties of F. T., F. T. theorems:
Linearity, time shifting, frequency shifting, time reversal, differentiation, Parseval’s theorem,
convolution theorem, windowing theorem, Z-transform, ROC and its properties, Inverse z
transform by inspection, partial fraction, power series expansion and complex inversion, Z
transform properties: Linearity, time shifting, multiplication by exponential sequence,
differentiation, conjugation, time reversal, convolution, initial value theorem, Unilateral Ztransform:
 solution of difference equation

Unit III (08 Hrs)
Frequency Response of LTI Systems: Ideal frequency selective filters, magnitude and phase
response, group delay, System Functions for LTI Systems: Stability and causality, inverse
systems, significance of poles/zeros, Frequency Response for Rational System Functions:
Frequency Response of a single zero or pole, Frequency response from pole-zero plot using
simple geometric construction, systems with Linear phase, Generalized Linear phase systems,
Four Types of GLPS

Unit IV (08 Hrs)
Sampling the F.T., Fourier representation of finite-duration sequences: The Discrete Fourier
Transform, Properties of DFT: Linearity, circular shift, duality, symmetry, Circular Convolution,
Linear Convolution using DFT, Effective computation of DFT and FFT, Goerzel Algorithm, DIT
FFT, DIP FFT, Inverse DFT using FFT, Practical considerations in FFT implementation

Unit V (08 Hrs)
Concept of filtering, Ideal filters and approximations, specifications, IIR filter design from
continuous time filters: Characteristics of Butterworth, Cheybyshev and elliptic
approximations, impulse invariant and bilinear transformation techniques, Design examples,
FIR filter design using windows: properties of commonly used windows, incorporation of
Generalized Linear Phase, Design Examples, Design using Kaiser window, Comparison of
IIR and FIR Filters

Unit VI (08 Hrs)
Block diagrams and Signal flow graph representation of LCCDE, Basic structures for IIR
Systems: direct form, cascade form, parallel form, feedback in IIR systems, Transposed Forms,
Basic Structures for FIR Systems: direct form, cascade form, structures for linear phase FIR
Systems, Finite Register Length effect
DSP Processors Architecture and Applications of DSP: Detail Study of DSP chip architecture as
an example of ADSP 21XX series of microprocessor and their desirable features, Instruction set
of ADSP 21XX series processor and some examples
».
Text Books:
1. Oppenheim A., Schafer R., Buck J., "Discrete time signal processing", 2nd Edition, Prentice
Hall, 2003, ISBN-81-7808-244-6
2. Proakis J., Manolakis D., "Digital signal processing", 3rd Edition, Prentice Hall, ISBN 81-
203-0720-8

Reference Books:
1. Babu R., "Digital Signal Processing", 2nd Edition, Scitech Publications, ISBN SI-873- 2852-5
2. Mitra S., "Digital Signal Processing: A Computer Based Approach", Tata McGraw-Hill,
1998, ISBN 0-07-044705-5
3. Vallavraj A., "Digital Signal Processing", ISBN 0-07-463996-X
4. Manual - ADSP 21 XX family DSP
5. White S., "Digital Signal Processing", Thomson Learning, ISBN -981 -240-620-4

Seminar and Technical Communication

• IRC
• Working on the Rails Road
• BioTorrent
• Java Card Technology
• D Programming Language
• PS3 (Play Station 3)
• The Emergency Alert Systems (EAS)
• WiMAX
• Plan 9 Operating System
• Intel Centrino Mobile Technology
• Clockless Chips
• INFERNO
• Digital Forensic
• Parallels Workstation 2.2
• ADLET
• ARM Processor
• The User Authentication in Longhorn
• Privacy Compliance in Email: Where are we now?
• JXTA
• Multicore Processing
• Advance Intelligent Network(AIN)
• Active Pixel Sensor
• Satellite based Internet
• Math ML(Mathematical Markup Language)
• Petal Distributed Virtual Disks
• Java Ring
• Hydrophone
• InfiniBand - Highspeed Network
• Domotics
• Wibree
• RedTacton
• Biometrics
• JFS - Journaled File System
• Programmable Routing Framework for Autonomic Sensor Networks
• Genetic Programming
• VPN over Satellite
• eCOS - Embedded Configurable Operating System
• Crusoe Processing(TM 5800)
• AJAX
• Pervasive Computing
• Blu-Ray Disc
• Xen- Virtualization
• Cellular Wave Computersfor Brain-Like Spatial Temporal Sensory Computing
• 4G
• Inteligent Clothing
• ATRAC
• Rootkits
• RFID In Logistics Management
• Video Format ( MPEG 7)
• Visual Techniques In Animation
• BIG-IP 5000
• Brain Computer Interface
• Teleportation
• MAYA
• Night Vision Technology
• House Automation
• WINE
• Embedded s/m for an Eye Detector
• Embedded configurable O.S
• VSAT Very Small Aperture Terminal
• Global Layer Unix For Network of Workstation
• The TIGER SHARC Processor
• Web Services an emerging trend in distributed technology approach
• Optimistic Replication
• DTH(Direct-to home)
• C++ QT
• Magnetic RAM
• Optical Add/Drop switches
• Optical communication in space
• Ubiquitous network
• web ontology language
• NTFS New Technology file System
• Dual Transport HTTP
• The Importance of Branching Models in SCM
• Secure Shell
• Application of non-blocking Data structures to real time systems
• Blue Eyes
• Pervasive Computing
• Agent Oriented Programming
• Millipedes
• JINI
• Gnutella Protocol
• Windows VISTA
• Network Attached storage
• Network RAM
• Computer Forensics
• Linux Virtual Server
• Multiprotocol Label Switching
• Enterprise Patch Management with WSUS
• SLI
• Dynamic Parallel Access to Replicated content in the Internet
• Rijndael
• Efficient & Reliable Communication Indistributed Embedded Systems
• Distributed Denial of service
• Cellular Network In-Out
• Dcompiler
• The Xen Virtual Machine Monitor
• .NET Remoting
• Eclipse
• .Backtracking Intrusions.
• MailGate Secure Messenger
• Adaptive video multicasting over the internet
• Single chip multiprocessor.
• Bluetooth
• Operating systems for Reconconfigurable Embedded Platforms :Online scheduling of Real-Time Tasks
• Performance of database workload on shared memory system with out-of—order processors
• Global Positioning System
• Reliable Detection of BPCS-Steganography in Natural Images.
• Soft Updates
• Web Based Shape Modeling With Hyperfun
• Cluster Computing
• Hyper -threading
• VOIP
• WoWing 32 bit applications with 64 bit windows.
• New trends in Embedded System
• Secure Email
• Exploiting user profiles to support differentiated services in next generation wireless networks.
• IP-spoofing
• RFID in supply chain management and Logistics.
• Placement of continious media in wireless peer-to-peer networks..
• Hammer Architecture.
• Speech driven facial animation.
• System Support for Pervasive Applications
• Mobile Agent
• Simultaneous Multi –threading
• Biometrics
• Dual Core Technology
• Wireless Firewall
• IP Firewalling Chains & IP Masquerading
• WIMAX network
• 
  
• Hypertext Preprocessor
• Reed –Solomon Codes
• Bioinformatic databases and their analysis
• Expression Invarient 3D Face Recognition
• Interactive Colour Palette Tools
• REISER file system
• Wireless Sensor networks
• Recovering Internet service sessions from operating system failures
• Software based self testing of Embedded processors
• Itanium Processor
• Importance of QUBIT in quantum Computing
• Resource Description Framework
• Software pipelining
• Socket Secure –A Versatile Proxy server
• Cellular Internet protocol
• XSTREAM- A middleware for streaming XML contents over wireless environments.
• HIPIKAT- A project memory for software development.
• NEMO (Network Mobility)
• Multicasting.
• Comparative architecture for OS
• Unicore(uniform interface to computing resources)
• Advanced password manager
• Resource sharing On Internet
• Dynamic Reconfiguration in computer clusters with irregular topologies in the presence of multiple node and link failures.
• A safe algorithm for resolving or Deadlocks
• IP Trace Back
• Copper bullet for software quality improvement.
• Tools for software protection
• Optimal Lexicographic shaping of Aggregate streaming of data
• Future wireless
• 
  

Systems Programming

Download Systems programming and operating systems









310252: SYSTEMS PROGRAMMING

Teaching Scheme Lectures: 3 Hrs/Week
Examination Scheme Theory: 100 Marks
Objectives:
• To understand the concepts and components of Systems Programming
• To Learn and understand the fundamentals of Compilers
• To Learn and understand the fundamentals of Operating systems
Prerequisites:
• Data Structures
• Computer Organization
Unit I (6 Hrs)
Introduction: Components of System Software, Language Processing Activities,
Fundamentals of Language Processing, Development tools
Assemblers: Structure of an assembler, Design of Two pass assembler, Single Pass
Assembler, Cross Assembler
Macro Processors: Macro Definition and call, Macro expansion, Nested Macro Calls,
Advanced Macro Facilities, Design of a macro-processor, Case study of MASM
Unit II (6 Hrs)
Linkers and Loaders: Loader Schemes: Compile and go, General Loader Scheme, Absolute loaders, subroutine linkages, relocating loaders, direct linking loader, dynamic linking loader, overlay structure, Design of an Absolute loader, Case study of MS-DOS Linker and Debug Dynamic Linking: Dynamic Link Libraries-their need, conventional dynamic linking libraries, the class library, dynamic linking, DLL's, use of call back functions, Dynamic linking with and without import
Unit III (6 Hrs)
Compilers and Interpreters: Overview of Compilation process, Concepts of Pass, Phases, front-end and back-end, Concepts of Bootstrap compiler, cross compiler, incremental compiler and compiler- compiler (Only definitions), Interpreters, comparison of Compilers and Interpreters
Lexical Analysis and Parsing: Why and what is lexical analysis, design issues, Introduction to parsing, concept of top-down recursive-descendent parsers
Unit IV (6 Hrs)
Operating Systems: Introduction, Evolution of OS, Functions of an OS, Batch Processing Systems, Multi-programming Systems, Time sharing systems, Multitasking systems, Real Time Operating Systems, OS Structure, System Calls, Process, Process Control and Process Scheduling (Job Scheduling, scheduling criteria, scheduling algorithms)
Unit V (6 Hrs)
Memory management: Contiguous and non-contiguous, Swapping, Paging, Segmentation
and demand Paging, Virtual Memory, Management of Virtual memory: allocation, fetch and
replacement
Unit VI (6 Hrs)
I/O Management: I/O programming, I/O organization, I/O scheduling algorithms, I/O
buffering
Fife Management: Concept, Access methods, Directory Structure, Protection, File System
implementation, Directory Implementation, Allocation methods, Free Space management,
efficiency and performance



Textbooks
1. Dhamdhere D., "Systems Programming and Operating Systems", 2nd Edition, ' McGraw Hill, 1999, ISBN 0 - 07 - 463579 - 4
2. Silberschatz, Galvin, Gagne, "Operating System Concepts", 6th Edition, John W and Sons, ISBN 9812 - 53 - 055 - X
Reference Books
1. Stallings W., "Operating Systems", 4th Edition, Prentice Hall, 81 - 7808 - 503 - 8
2. Beck L., "System Software: An Introduction to Systems Programming", 3rd Edit Pearson Education, 1997, ISBN 0-201-43581-0
3. Aho A., Sethi R., Ullman J., "Compilers", Pearson Education, 81 - 7808 - 046 - X
4. Petzold C., "Programming Windows", 5th Edition, Microsoft Press, 81-7853- 007-4

Software Engineering

Download Software Engineering, A Practitioners Approach

               Download Software Engineering Notes

               Download Software Engineering -Ebook

310253: SOFTWARE ENGINEERING

Teaching Scheme Lectures: 3 Hrs/week
Examination Scheme Theory: 100 Marks
Objectives:
• To learn and understand the Concepts of Software Engineering
• To apply the principles of Software Engineering for software development

Unit I (06 Hrs)
Introduction To Software Engineering: Software, Software Myths, Process Framework, CMMI, Process Patterns, Process Assessment, Personal and Team Process Models, Process Models: Waterfall Model, Incremental Models, Evolutionary Models, Introduction to specialized Process Models, The Unified Process

Unit II (06 Hrs)

Software Engineering Practice: The Essence of Practice, Core Principles, Communication Practices, Planning Practices, Modeling Practices: Analysis and Design Modeling, Construction Practice: Coding and Testing Principals, Deployment System Engineering: Computer-Based Systems, Hierarchy: System Modeling and Simulation, Business Process Engineering, Product Engineering, System Modeling: Hatley-Pirbhai Modeling and Modeling using UML


Unit III (06 Hrs)

Requirements Engineering

Requirements Engineering Tasks, Initiating the process, Eliciting Requirements, Developing Use-Cases, Building The Analysis Model: Requirements Analysis, Data Modeling Concepts, Object-Oriented Analysis, Scenario-Based Analysis, Flow-Oriented Modeling, Class-Based Modeling, Creating a Behavioral Model


Unit IV (06 Hrs)
 Design Engineering Design Process and design quality, Design Concepts, The Design Model, Introduction to
Pattern-Based Software Design

Architectural Design: Software Architecture, Data Design and Architectural Design
User Interface Design: Rules, User Interface Analysis and Steps in Interface Design, Design
Evaluation


Unit (06 Hrs)
Testing Strategies And Tactics: A Strategic approach to Software Testing, Strategic Issues, Testing Strategy for Conventional Software and Object-Oriented Software, Validation Testing, System Testing, Validation and Verification
Testing Tactics: Black Box and White Box Testing, Basis Path Testing, Control Structure Testing, Object-Oriented Software Testing Methods

Unit VI (06 Hrs)

Product Metrics: Software Quality, Framework for Product Metrics, Metrics for Analysis Model, Design Model, Metrics for Source Code, Metrics for Testing and maintenance

Text Books:

Pressman R., "Software Engineering, A Practitioners Approach", 6th Edition, Tata

MCGraw Hill Publication,2004,ISBN 007-124083-124083-7


Reference Books:

1. Mall R., "Fundamentals of Software Engineering", Second Edition, Prentice Hall India, 2004, ISBN 81 -203-2445-5

2. Vliet H., "Software Engineering Princilpes and Practices", Second Edition, John Wiley and Sons, ISBN 9971-51-357-9

3. Ghezzi C., Jazayeri M., Mandrioli D., "Fundamentals of Software Engineering", Second Edition, Prentice Hall India, 2003, ISBN 81-203-2242-6

4. Behfarooz A:, Hudson F., "Software Engineering Fundamentals", Oxford University Press, 2002, ISBN 0-19-510539-7

Management Information Systems

310251: MANAGEMENT INFORMATION SYSTEMS
Examination Scheme: Theory: 100 Marks
• To learn and understand fundamentals of Information Systems
• To learn and understand architecture, methodology and applications of MIS

Unit I (06 Hrs)
Foundations of Information Systems and Management: Why Information systems? Components and resources of information systems, Information system activities, Types of information systems: Operations support systems and Management support systems Management Information Systems: Definition, role and impact of MIS, Introduction to Management, Approaches to Management, Functions of the managers: Management effectiveness, planning, organizing, staffing, coordinating and directing, MIS as a support to the management and a tool for management Process, Organization structure and theory: Organization structure, behavior, organization as a system, MIS: Organization Strategic Management of Business: Concept of Corporate Planning, Essentiality of strategic planning, development of business strategies, types of strategies, MIS for Business Planning Infrastructure management: Selection, maintenance of hardware, communication equipments and software as per MIS needs of the organization. Ensure uptime of hardware resources, database management and end user training

Unit II (06 Hrs)
Applications of MIS
Manufacturing Sector: Introduction, Personal Management, Marketing Management,
Accounting and Finance Management, Production Management, Materials Management and
Marketing Management, MIS Applications in Banking and Insurance Sector
Service Sector: Introduction, MIS applications in service industry Cross-Functional Enterprise Systems: Introduction, Collaboration systems in Manufacturing, Enterprise application Integration, Transaction Processing systems Implementation Challenges: Integration, implementing IT, End user Resistance and
Involvement, Change Management

Unit III (06 Hrs)
Enterprise Management Systems (EMS): Introduction, Enterprise Resource Planning (ERP)
systems: Basic features, benefits, selection, implementation, EMS and MIS
Business Process Re-engineering (BPR): Introduction, Business process, Process and Value
stream model of the organization, MIS and BPR Business Process Outsourcing (BPO): What is BPO? Voice BPO i.e. Call center, non-voice BPO, Scope of BPO, challenges in BPO management

Unit IV (06 Hrs)
Customer Relationship Management(CRM): Introduction, What is CRM? Three phases of
CRM, Benefits, challenges and trends in CRM Supply Chain Management(SCM): What is SCM? Role of SCM, Benefits, challenges and trends in SCM  Electronic Commerce Systems(eCommerce): Introduction, scope, B2C, B2B and C2C, Essential e-Commerce processes, Electronic Payment Processes, e-Commerce Applications

Unit V (06 Hrs)
Decision Support Systems (DSS): Concept and philosophy, Using Decision Support systems: What-if analysis, sensitivity analysis, Goal-seeking analysis, Optimization analysis, Introduction to Data Warehouse: Architecture, Organization and Management of Data Warehouse, Implementation, Data Mining for Decision support, Executive Information systems, Enterprise Information portal and knowledge management systems, Introduction to Artificial Intelligent Systems, Knowledge Based Expert systems, GIS

Unit VI (06 Hrs)

Security and Ethical Challenges: Introduction, Ethical responsibility of Business
Professionals, Computer Crime, Hacking, Cyber Theft, Software Piracy, Privacy issues,
Health issues Security Management: Introduction, Tools, Encryption, Firewalls, e-Mail monitoring,
biometric security, disaster recovery, fault-tolerant systems, system controls and audits,
Contingency management and solutions Global Management of Information Technology: Cultural, political and Geo-economic challenges, global business/it strategies, applications, platforms and Data access issues

Text Hooks:
1. O'Bricn J., "Management Information Systems: Managing Information Technology in the Business Enterprise", 6* Edition, Tata McGraw-Hill Publishing Company Limited, 2004, ISBN 0 - 07 - 058739 - 6
2. Jawadekar W., "Management Information Systems", 2nd Edition, Tata McGraw-Hill Publishing Company Limited, 2002, ISBN 0 - 07 - 044575 - 3

Reference Books:
1. Post G., Anderson D., "Management Information Systems", 3rd Edition, Tata McGraw-Hill Publications, ISBN 0 - 07 - 049940 - 3
2. Gupta U., "Management Information Systems: A Managerial Perspective", Galgotia, ISBN 81-7515-085-8

Computer Networks

Download  Computer Networks Lab Manual


 Computer Networks FAQ


Download CN Program

Download This Book

310250: COMPUTER NETWORKS
Theory: 100 Marks
Objectives:

• To learn and understand fundamentals of computer network
• To learn and understand network architectures, protocols and applications
Prerequisite:
• Data Communications

Unit I (06 Hrs)
Introduction: Review of Applications of Computer Networks, Network hardware and software, Reference Models: OSI and TCP/IP, Example Networks: Internet, X.25, Frame Relay, ATM, Ethernet, Wireless LANs, Network standardization, Switching, Buffering and Multicasting

Unit II (06 Hrs)
Data Link Layer: Design issues: Services, Framing, Error and flow control, Stop-and-Wait protocol, Sliding Window protocol, Go-Back-N ARQ, Selective Repeat ARQ, HDLC, Data link layer in Internet and ATM

Point-to-Point-Access (PPP): Frame format, Transition states, PPP Stack: LCP, NCP Network Hardware Components: Connectors, Transceivers and Media Converters, Repeaters, NICs, Bridges and Switches

Unit III (06 Hrs)
Medium Access Control sub-layer: Channel allocation: Static and Dynamic allocation, Multiple Access Protocols: ALOHA, CSMA, Collusion-free and limited-contention protocols, WDMA, Wireless LAN Protocols, Ethernet: Cabling, encoding, MAC sub-layer protocol, Switched, fast and Gigabit Ethernet, Logical link control, Wireless LANs and Digital Cellular Radio, Broadband Wireless, Virtual LANs, Bluetooth, Virtual Circuit Switching: Frame Relay and ATM


Unit IV (06 Hrs)

Network Layer: Design Issues, Packet switching, Connectionless and Connection-oriented
Services, Virtual Circuit and Datagram Subnets, Routing Algorithms, Internetworking,
Firewalls Congestion Control and QOS: General Principals, Congestion prevention policies, Load
shading, Jitter Control, Quality of Service, Internetworking Network layer Protocols: ARP, IP protocol, IP Addresses, IPV6, ICMP, Unicast Routing
Algorithms: RIP, OSPF, BGP, Multicast Routing: IGMP, Mobile IP

Unit V (06 Hrs)
Transport Layer: Services and service primitives, Sockets and Socket programming, Elements of Transport protocol: Addressing, Connection establishment and release, flow control and buffering, Multiplexing, Crash recovery, Simple Transport Protocol, UDP: Introduction, RPC, TCP: Introduction, Model, protocol, header, connection establishment and release, connection management, Transmission policy, congestion control, timer management, Introduction to wireless TCP and UDP, Performance issues

Unit VI

Application Layer: Domain Name Systems (DNS),and DNS server, Electronic Mail Architecture and services, Message Formats,MIME, message transfer ,SMTP, Mail Gateways, Relays, Configuration Mail Servers, File Transfer Protocol, General Model commands,TFTP
World Wide Web: Introduction, Architecture overview, static and dynamic web pages, WWW pages and browsing UTTP, LDAP, Browser Archicture, Caching in Web Browser remote login, Wireless web

Text Books:
1. Tanenbaum A "Computer Networks", 4th Edition, PHI ISBP 81 - 203 - 2175 - 8

2. Fourauzan B., "Data Communications and Networking", 3^ edition, Tata McGtaw Hill Publications, 2004, ISBN 0 - 07 - 058408 - 7

Reference Books:
1. Keshav S., "An Engineering Approach to Computer Networking", Perason Education, ISBN 981-235-986-9
2. Comer D., "Computer Networks and Internet", 2140 Edition, fieatson Education, ISBN 81 -7808-086-9

3. Gallo M., Hancock W., "Computer Communications and networking Technologies", Thomson Brooks/Cole, ISBN 8811 - 240 - 354 - X

Principles of Programming Languages

Download Software Lab Manual

 Software Lab program1

Software Lab program2

Download Foundations of Programming Languages

310249: PRINCIPLES OF PROGRAMMING LANGUAGES

Teaching Scheme Lectures: 4 Hrs/week

Examination Scheme

Theory: 100 Marks

Objectives:

• To understand the basic building blocks of programming languages.

• To learn and understand various programming paradigms.

Prerequisites:

• Data Structures and Algorithms

• Theory of Computation

Unit I (6 Hrs)

Introduction: Role of programming languages, need to study programming languages, characteristics of a good programming languages, Introduction to various programming paradigms: Procedural, object-oriented, logic and functional programming. Data Types: properties of structured and non-structured data types and Objects, variables, constants, Derived and abstract data types, declaration, type checking. Binding and binding times, type conversion, scalar data type, composite data types, Implementation and Storage representation of data types and control flow statement.

Unit II (6Hrs)

Procedures: Procedure call and return, recursive subprogram, Different parameter passing methods, Lifetime of variables, Scope rules: Static and Dynamic scope, Referencing environment: activation records (Local, Non local and Global), Storage management (static and Dynamic), Exceptions and exception handling

Unit III (8 Hrs)

Procedural Programming: Design Principles, Control flow: statement-oriented and block-oriented structure programming, Execution steps, desirable and undesirable characteristics of procedural programming.

Procedural Programming with Pascal: Program structure, Lexical elements, Data Types, Operators and punctuators, variable and type declarations, I/O, type conversion, control structures: conditional and iterative, arrays, procedures and functions, local and global variables, nested procedures and scope rules, pointers, parameter passing, User defined data types, comparative study of C and PASCAL

Unit IV (8 Hrs)

Object Oriented Programming: Design Principles: Objects, classes, Messages and methods, Implementation of Object-oriented Programming, Object oriented programming with Java: Program structure, Object and class declarations, constructors, inheritance, polymorphism, access specification, interfaces, packages, exception handling, Java I/O, Java applications and applets, introduction to Java threads and multithreads, Comparative study of C++ and Java.

Introduction to .NET Technology and C#: Brief introduction to Microsoft .NET - The Microsoft .NET platform, .NET framework, advantages, introduction to C#, type system, classes, method, Properties, Arrays, Interfaces, Delegates and event handlers, Assemblies and Modules, late binding, creating and executing code at Run Time

Unit V (6 Hrs)

Logic Programming: Logic programming language model, logical statements, resolution, unification, search structures: backward and forward, Applications of logic programming

Logic Programming with Prolog: Program structure, logical variable, syntax structure, Control structure, resolution and unification, depth-first search, backtracking, cut operator, recursive rules, Prolog facilities and deficiencies

Unit VI (8 Hrs)

Functional Programming: Introduction to functional programming, Lambda calculus:

Ambiguity, free and bound identifiers, reductions, typed lambda calculus, application of

functional programming

Functional Programming with LISP: Elements of functional Programming, Function

declaration, Expression evaluation, type checking

Introduction to Concurrent Programming

Text Books:

1) Roosta S., "Foundations of Programming Languages", Thomson Brookes/Cole, ISBN 981 -243-141-1

2) Sethi R., "Programming Languages concepts & constructs", 2nd Edition, Pearson Education, ISBN 81 - 7808 - 104 - 0

References Books:

1) Scbesta R., "Concepts Of Programming Languages", 4th Edition, Pearson Education, ISBN-81-7808-161-X

2) Ghezzi C, Milano P., Jazayeri M., "Programming Languages Concepts", 3rd Edition, John Wiley and Sons Pvt. Ltd (WSE), ISBN - 0195113063

3) Balagurusamy E., "Programing with C#", Tata McGraw-Hill, 2002, ISBN 0 - 07 -047339-0

4) Bhave M. Patekar S., "Programming in Turbo PASCAL", Tata-McGraw Hill, 0-07 -462100-9

5) Eckel B., "Thinking in Java", 3rd Edition, Pearson Education, 81 - 297 - 0524 - 9

6) Winston P., Klaus B., Horn P., "LISP", 3rd Edition, Pearson Education, 81 - 7808 -155-5

Data Structures

Programming Laboratory lab_manual

Download DATA Structure Program


Download Other DATA Structure Program

Download Data structures: a pseudocode approach with C++

                                        210250: DATA STRUCTURES
Teaching Scheme Examination Scheme
Lectures: 4 Hrs/week Theory: 100 Marks
Prerequisite: Data Structures and Algorithms (Subject Code: 210244)
Learning Objectives
1. To study the representation, implementation and applications of data structures
2. To study implementation of data structures using OOP concepts
3. To compare the benefits of static and dynamic data structures
4. To choose the appropriate data structure for modeling a given problem

UNIT – I [TB 1]
Trees
Basic tree concepts, binary trees and their properties, representation using sequential
and linked organization, full and complete binary trees, converting tree to a binary
tree, binary tree traversals, BFS ,DFS (recursive and non recursive), infix, postfix,
prefix, Huffman’s codes. Binary search trees & operations. BST as an ADT, Threaded
binary trees, Insertion and deletion of nodes in in-order threaded binary tree, preorder,
in-order and post order traversals of in-order threaded binary tree, applications of
binary trees: Gaming, Expression and decision trees (8 Hrs)

UNIT – II [TB 1]
Graphs
Basic concepts, operations, graphs storage structures, Traversals: Depth First and
Breadth First. Graph algorithm, Graph as an ADT, Minimum spanning trees:
Kruskal’s and Prim’s. Algorithm for shortest path and topological sorting (8 Hrs)

UNIT – III [TB 1]
Symbol Tables: Static & dynamic tree table ,AVL tree ,AVL tree implementation,
AVL tree algorithms.
Hash Tables: Basic concepts, hash function, hashing methods, collision resolution,
bucket hashing. (8 Hrs)

UNIT IV [TB 1]
Heaps and multi way trees
Heap: Basic concepts, heap implementation algorithm & heap sort, heap as an ADT,
heap applications.
Multi way trees: B tree implementation, B-tree variations (8 Hrs)

UNIT V [RB4]:
Files
External storage devices, Files: Definition and concepts, File organization: Sequential
files, random, linked, inverted and cellular partitions. Processing of sequential, Indexsequential
and direct files.
Sequential file organisation, direct file organisation, index sequential file organisation
and their implementation. (8 Hrs)

UNIT VI [TB 2]
Abstract data types: ADT, classes and objects, generic programming: introduction to
STL (Standard Template Library), containers, iterators and algorithms, study of
container template classes for vectors and stacks and related algorithms. (8 Hrs)

Text Books(TB):
1. R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with C”,
Cengage Learning, ISBN 9788131503140.
2. A. Michael Berman, “Data structures via C++”, Oxford University Press, 2002,
ISBN-0-19-510843-4.

Reference Books(RB):
1. E. Horowitz, S. Sahni, D. Mehta “Fundamentals of Data Structures in C++”,
Galgotia Book Source, New Delhi, 1995, ISBN 16782928.
2. Y. Langsam, M. Augenstin and A. Tannenbaum, “Data Structures using C and
C++”, 2nd Edition, Prentice Hall of India, 2002, ISBN-81-203-1177-9.
3. R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with
C++”, Cengage Learning, ISBN 9788131504925.
4. A. Tharp ,”File organisation and processing”,2008 ,Willey India
edition ,9788126518685
5. A. Drozdek, “Data Structures in C++”, 2nd Edition, Thomson Brookes /COLE
Books, 2002, ISBN 981 – 240 – 079 – 6.
6. J. Tremblay, P. Soresan, “An introduction to data structures with Applications”,
2nd edition, Tata McGraw-Hill International Editions, 1984, ISBN-0-07-462471-7.
7. M. Folk, B. Zoellick, G. Riccardi, “File Structure An Object oriented approach
with C++”, Pearson Education, 2002, ISBN 81 – 7808 – 131 – 8.
8. M. Weiss, “Data Structures and Algorithm Analysis in C++”, 2nd edition,
Pearson Education, 2002, ISBN-81-7808-670-0