ANNA UNIVERSITY CHENNAI
BTECH INFORMATION TECHNOLOGY
3 SEMESTER CURRICULUM AND SYLLABI
SEMESTER III
(Applicable to the students admitted from the Academic year 2008–2009 onwards)
Code No Course Title
THEORY
MA 2211 Transforms and Partial Differential Equations
CS 2201 Data Structures
CS 2202 Digital Principles and Systems Design
CS 2203 Object Oriented Programming
CS 2204 Analog and Digital Communication
GE 2021 Environmental Science and Engineering
PRACTICAL
CS 2207 Digital Lab
CS 2208 Data Structures Lab
CS 2209 Object Oriented Programming Lab
SEMESTER IV
(Applicable to the students admitted from the Academic year 2008–2009 onwards)
Code No. Course Title
THEORY
MA 2262 Probability and Queuing Theory
CS 2251 Design and Analysis of Algorithms
CS 2252 Microprocessors & Microcontrollers
CS 2253 Computer Organization and Architecture
CS 2254 Operating Systems
CS 2255 Data Base Management Systems
PRACTICAL
CS 2257 Operating Systems Lab
CS 2258 Data Base Management Systems Lab
CS 2259 Microprocessors Lab
MA 2211 TRANSFORMS AND PARTIAL DIFFERENTIAL EQUATIONS
(Common to all branches)
OBJECTIVES
The course objective is to develop the skills of the students in the areas of Transforms and Partial Differtial Equations. This will be necessary for their effective studies in a large number of engineering subjects like heat conduction, communication systems, electro-optics and electromagnetic theory. The course will also serve as a prerequisite for post graduate and specialized studies and research.
1.Fourier series
Dirichlet’s conditions – General Fourier series – Odd and even functions – Half range sine series – Half range cosine series – Complex form of Fourier Series – Parseval’s identify – Harmonic Analysis.
2.Fourier Transforms
Fourier integral theorem (without proof) – Fourier transform pair – Sine and
Cosine transforms – Properties – Transforms of simple functions – Convolution theorem – Parseval’s identity.
3.PARTIAL DIFFERENTIAL EQUATIONS
Formation of partial differential equations – Lagrange’s linear equation – Solutions of standard types of first order partial differential equations - Linear partial differential equations of second and higher order with constant coefficients.
4.applications of partial differential equations
Solutions of one dimensional wave equation – One dimensional equation of heat conduction – Steady state solution of two-dimensional equation of heat conduction (Insulated edges excluded) – Fourier series solutions in cartesian coordinates.
5.Z -TRANSFORMS AND DIFFERENCE Equations
Z-transforms - Elementary properties – Inverse Z-transform – Convolution theorem -Formation of difference equations – Solution of difference equations using Z-transform.
TEXT BOOKS
Grewal, B.S, ‘Higher Engineering Mathematics’ 40th Edition, Khanna publishers, Delhi, (2007)
REFERENCES
Bali.N.P and Manish Goyal ‘A Textbook of Engineering Mathematics’, Seventh Edition, Laxmi Publications(P) Ltd. (2007)
2. Ramana.B.V. ‘Higher Engineering Mathematics’ Tata Mc-GrawHill Publishing Company limited, New Delhi (2007).
3. Glyn James, ‘Advanced Modern Engineering Mathematics’, Third edition-Pearson Education (2007).
4. Erwin Kreyszig ’Advanced Engineering Mathematics’, Eighth edition-Wiley India (2007).
CS 2201 DATA STRUCTURES
Aim: To master the design and applications of linear, tree, balanced tree, hashing, set, and graph structures.
UnitI Linear Structures
Abstract Data Types (ADT) – List ADT – array-based implementation – linked list implementation – cursor-based linked lists – doubly-linked lists – applications of lists – Stack ADT – Queue ADT – circular queue implementation – Applications of stacks and queues
UnitII Tree Structures
Tree ADT – tree traversals – left child right sibling data structures for general trees – Binary Tree ADT – expression trees – applications of trees – binary search tree ADT – Threaded Binary Trees.
Unit III Balanced Trees
AVL Trees – Splay Trees – B-Tree - heaps – binary heaps – applications of binary heaps
Unit IV Hashing and Set
Hashing – Separate chaining – open addressing – rehashing – extendible hashing - Disjoint Set ADT – dynamic equivalence problem – smart union algorithms – path compression – applications of Set
Unit V graphs Definitions – Topological sort – breadth-first traversal - shortest-path algorithms – minimum spanning tree – Prim's and Kruskal's algorithms – Depth-first traversal – biconnectivity – Euler circuits – applications of graphs
TEXT BOOK
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition , Pearson Education, 2005.
REFERENCES
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”,
Pearson Education, First Edition Reprint 2003.
R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India
Edition, 2005.
CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN
(Common to CSE & IT)
AIM
To provide an in-depth knowledge of the design of digital circuits and the use of Hardware Description Language in digital system design.
OBJECTIVES
· To understand different methods used for the simplification of Boolean functions
· To design and implement combinational circuits
· To design and implement synchronous sequential circuits
· To design and implement asynchronous sequential circuits
· To study the fundamentals of VHDL / Verilog HDL
UNIT I BOOLEAN ALGEBRA AND LOGIC GATES
Review of binary number systems - Binary arithmetic – Binary codes – Boolean algebra and theorems - Boolean functions – Simplifications of Boolean functions using Karnaugh map and tabulation methods – Implementation of Boolean functions using logic gates.
UNIT II COMBINATIONAL LOGIC
Combinational circuits – Analysis and design procedures - Circuits for arithmetic operations - Code conversion – Introduction to Hardware Description Language (HDL)
UNIT III DESIGN WITH MSI DEVICES
Decoders and encoders - Multiplexers and demultiplexers - Memory and programmable logic - HDL for combinational circuits
UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC
Sequential circuits – Flip flops – Analysis and design procedures - State reduction and state assignment - Shift registers – Counters – HDL for Sequential Circuits.
UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC
Analysis and design of asynchronous sequential circuits - Reduction of state and flow tables – Race-free state assignment – Hazards. ASM Chart.
TEXT BOOKS
M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, 2007.
REFERENCES
1. Charles H.Roth, Jr. “Fundamentals of Logic Design”, 4th Edition, Jaico Publishing
House, Cengage Earning, 5th ed, 2005.
2. Donald D.Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2007.
CS 2203 OBJECT-ORIENTED PROGRAMMING
(Common to CSE & IT)
Aim: To understand the concepts of object-oriented programming and master OOP using C++.
UNIT I
Object oriented programming concepts – objects – classes – methods and messages – abstraction and encapsulation – inheritance – abstract classes – polymorphism.
Introduction to C++ – classes – access specifiers – function and data members – default arguments – function overloading – friend functions – const and volatile functions - static members – Objects – pointers and objects – constant objects – nested classes – local classes
UNIT II
Constructors – default constructor – Parameterized constructors – Constructor with dynamic allocation – copy constructor – destructors – operator overloading – overloading through friend functions – overloading the assignment operator – type conversion – explicit constructor
UNIT III
Function and class templates - Exception handling – try-catch-throw paradigm – exception specification – terminate and Unexpected functions – Uncaught exception.
UNIT IV
Inheritance – public, private, and protected derivations – multiple inheritance - virtual base class – abstract class – composite objects Runtime polymorphism – virtual functions – pure virtual functions – RTTI – typeid – dynamic casting – RTTI and templates – cross casting – down casting .
UNIT V
Streams and formatted I/O – I/O manipulators - file handling – random access – object serialization – namespaces - std namespace – ANSI String Objects – standard template library.
Text Books:
1. B. Trivedi, “Programming with ANSI C++”, Oxford University Press, 2007.
References:
Ira Pohl, “Object Oriented Programming using C++”, Pearson Education, Second Edition Reprint 2004..
S. B. Lippman, Josee Lajoie, Barbara E. Moo, “C++ Primer”, Fourth Edition, Pearson Education, 2005.
B. Stroustrup, “The C++ Programming language”, Third edition, Pearson Education, 2004.
CS2204 ANALOG AND DIGITAL COMMUNICATION
UNIT I FUNDAMENTALS OF ANALOG COMMUNICATION
Principles of amplitude modulation, AM envelope, frequency spectrum and bandwidth, modulation index and percent modulation, AM Voltage distribution, AM power distribution, Angle modulation - FM and PM waveforms, phase deviation and modulation index, frequency deviation and percent modulation, Frequency analysis of angle modulated waves. Bandwidth requirements for Angle modulated waves.
UNIT II DIGITAL COMMUNICATION
Introduction, Shannon limit for information capacity, digital amplitude modulation, frequency shift keying, FSK bit rate and baud, FSK transmitter, BW consideration of FSK, FSK receiver, phase shift keying – binary phase shift keying – QPSK, Quadrature Amplitude modulation, bandwidth efficiency, carrier recovery – squaring loop, Costas loop, DPSK.
UNIT III DIGITAL TRANSMISSION
Introduction, Pulse modulation, PCM – PCM sampling, sampling rate, signal to quantization noise rate, companding – analog and digital – percentage error, delta modulation, adaptive delta modulation, differential pulse code modulation, pulse transmission – Intersymbol interference, eye patterns.
UNIT IV DATA COMMUNICATIONS
Introduction, History of Data communications, Standards Organizations for data communication, data communication circuits, data communication codes, Error control, Error Detection, Error correction, Data communication Hardware, serial and parallel interfaces, data modems, Asynchronous modem, Synchronous modem, low-speed modem, medium and high speed modem, modem control.
UNIT V SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES
Introduction, Pseudo-noise sequence, DS spread spectrum with coherent binary PSK, processing gain, FH spread spectrum, multiple access techniques – wireless communication, TDMA and CDMA in wireless communication systems, source coding of speech for wireless communications.
TEXT BOOKS:
Wayne Tomasi, “Advanced Electronic Communication Systems”, 6/e, Pearson Education, 2007.
Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons., 2001.
REFERENCES:
H.Taub,D L Schilling ,G Saha ,”Principles of Communication”3/e,2007.
B.P.Lathi,”Modern Analog And Digital Communication systems”, 3/e, Oxford University Press, 2007
Blake, “Electronic Communication Systems”, Thomson Delmar Publications, 2002.
Martin S.Roden, “Analog and Digital Communication System”, 3rd Edition, PHI, 2002.
B.Sklar,”Digital Communication Fundamentals and Applications”2/e Pearson Education 2007.
GE 2021 ENVIRONMENTAL SCIENCE AND ENGINEERING
(Common to Civil, CSE, IT & Biomedical Degree Programmes)
AIM
The aim of this course is to create awareness in every engineering graduate about the importance of environment, the effect of technology on the environment and ecological balance and make them sensitive to the environment problems in every professional endeavour that they participates.
OBJECTIVE
At the end of this course the student is expected to understand what constitutes the environment, what are precious resources in the environment, how to conserve these resources, what is the role of a human being in maintaining a clean environment and useful environment for the future generations and how to maintain ecological balance and preserve bio-diversity. The role of government and non-government organization in environment managements.
Unit I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY
Definition, scope and importance of environment – need for public awareness - concept of an ecosystem – structure and function of an ecosystem – producers, consumers and decomposers – energy flow in the ecosystem – ecological succession – food chains, food webs and ecological pyramids – Introduction, types, characteristic features, structure and function of the (a) forest ecosystem (b) grassland ecosystem (c) desert ecosystem (d) aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) – Introduction to biodiversity definition: genetic, species and ecosystem diversity – biogeographical classification of India – value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values – Biodiversity at global, national and local levels – India as a mega-diversity nation – hot-spots of biodiversity – threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts – endangered and endemic species of India – conservation of biodiversity: In-situ and ex-situ conservation of biodiversity.
Field study of common plants, insects, birds
Field study of simple ecosystems – pond, river, hill slopes, etc.
Unit II ENVIRONMENTAL POLLUTION
Definition – causes, effects and control measures of: (a) Air pollution (b) Water pollution (c) Soil pollution (d) Marine pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear hazards – soil waste management: causes, effects and control measures of municipal solid wastes – role of an individual in prevention of pollution – pollution case studies – disaster management: floods, earthquake, cyclone and landslides.
Field study of local polluted site – Urban / Rural / Industrial / Agricultural.
Unit III NATURAL RESOURCES
Forest resources: Use and over-exploitation, deforestation, case studies- timber extraction, mining, dams and their effects on forests and tribal people – Water resources: Use and over-utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits and problems – Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources, case studies – Food resources: World food problems, changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies – Energy resources: Growing energy needs, renewable and non renewable energy sources, use of alternate energy sources. case studies – Land resources: Land as a resource, land degradation, man induced landslides, soil erosion and desertification – role of an individual in conservation of natural resources – Equitable use of resources for sustainable lifestyles.
Field study of local area to document environmental assets – river / forest / grassland / hill / mountain.
Unit IV SOCIAL ISSUES AND THE ENVIRONMENT
From unsustainable to sustainable development – urban problems related to energy – water conservation, rain water harvesting, watershed management – resettlement and rehabilitation of people; its problems and concerns, case studies – role of non-governmental organization- environmental ethics: Issues and possible solutions – climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust, case studies. – wasteland reclamation – consumerism and waste products – environment production act – Air (Prevention and Control of Pollution) act – Water (Prevention and control of Pollution) act – Wildlife protection act – Forest conservation act – enforcement machinery involved in environmental legislation- central and state pollution control boards- Public awareness.
Unit V HUMAN POPULATION AND THE ENVIRONMENT
Population growth, variation among nations – population explosion – family welfare programme – environment and human health – human rights – value education – HIV / AIDS – women and child welfare – role of information technology in environment and human health – Case studies.
TEXT BOOKS
1. Gilbert M.Masters, ‘Introduction to Environmental Engineering and Science’, 2nd edition, Pearson Education (2004).
2. Benny Joseph, ‘Environmental Science and Engineering’, Tata McGraw-Hill, New Delhi, (2006).
REFERENCE BOOKS
1. R.K. Trivedi, ‘Handbook of Environmental Laws, Rules, Guidelines, Compliances and Standards’, Vol. I and II, Enviro Media.
2. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’, Jaico Publ., House, Mumbai, 2001.
3. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT LTD, New Delhi, 2007.
4. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press (2005)
CS 2207 DIGITAL LABORATORY
(Common to CSE & IT)
LIST OF EXPERIMENTS
1. Verification of Boolean theorems using digital logic gates
2. Design and implementation of combinational circuits using basic gates for arbitrary functions, code converters, etc.
3. Design and implementation of 4-bit binary adder / subtractor using basic gates and MSI devices
4. Design and implementation of parity generator / checker using basic gates and MSI devices
5. Design and implementation of magnitude comparator
6. Design and implementation of application using multiplexers/ Demultiplexers
7. Design and implementation of Shift registers
8. Design and implementation of Synchronous and Asynchronous counters
9. Simulation of combinational circuits using Hardware Description Language (VHDL/ Verilog HDL software required)
10. Simulation of sequential circuits using HDL (VHDL/ Verilog HDL software required)
CS 2208 DATA STRUCTURES LAB
(Common to Information Technology & Computer Science Engineering)
Aim:
To develop programming skills in design and implementation of data structures and their applications.
1. Implement singly and doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial addition.
Implement stack and use it to convert infix to postfix expression
Implement a double-ended queue (dequeue) where insertion and deletion
operations are possible at both the ends.
Implement an expression tree. Produce its pre-order, in-order, and post-
order traversals.
Implement binary search tree.
Implement insertion in AVL trees.
Implement priority queue using binary heaps
Implement hashing with open addressing.
Implement Prim's algorithm using priority queues to find MST of an
undirected graph.
CS 2209 OBJECT ORIENTED PROGRAMMING LAB
(Common to CSE & IT)
1. Design C++ classes with static members, methods with default arguments, friend functions. (For example, design matrix and vector classes with static allocation, and a friend function to do matrix-vector multiplication)
2. Implement complex number class with necessary operator overloadings and type conversions such as integer to complex, double to complex, complex to double etc.
3. Implement Matrix class with dynamic memory allocation and necessary methods. Give proper constructor, destructor, copy constructor, and overloading of assignment operator.
4. Overload the new and delete operators to provide custom dynamic allocation of memory.
5. Develop a template of linked-list class and its methods.
6. Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort, and quick sort.
7. Design stack and queue classes with necessary exception handling.
8. Define Point class and an Arc class. Define a Graph class which represents graph as a collection of Point objects and Arc objects. Write a method to find a minimum cost spanning tree in a graph.
9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic polymorphism and RTTI.
10. Write a C++ program that randomly generates complex numbers (use previously designed Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and write the result to another file (one per line).
Friday, July 24, 2009
Saturday, June 27, 2009
BTech (INFORMATION TECHNOLOGY) Syllabus
ANNA UNIVERSITY
B.TECH. INFORMATION TECHNOLOGY
SEMESTER V
THEORY
GE1301 Professional Ethics and Human Values
CS1402 Object Oriented Analysis and Design
CS1252 Operating Systems
CS1302 Computer Networks
EC1391 Telecommunication Systems
CS1301 Database Management Systems
GE1302 Communication Skill & Seminar
PRACTICAL
CS1403 Case Tools Lab
CS1254 Operating System Lab (Linux based)
CS1307 DBMS Lab
SEMESTER VI
THEORY
MG1351 Principle of Management
IT1351 Network Programming and Management
IT1352 Cryptography and Network Security
CS1253 Visual Programming
IT1353 Embedded Systems
MA1251 Numerical Methods
GE1351 Professional Skill & Seminar**
PRACTICAL
CS1255 Visual Programming Lab
CS1305 Network Lab
SEMESTER VII
THEORY
MG1401 Total Quality Management
IT1401 Component Based Technology
IT1402 Mobile Computing
CS1354 Graphics and Multimedia
Elective I
Elective II
PRACTICAL
IT1403 Software Components Lab
CS1355 Graphics and Multimedia Lab
SEMESTER VIII
THEORY
IT1451 Web Technology
Elective III
Elective IV
PRACTICAL
IT1452 Project Work
IT1453 Comprehension**
GE1301 PROFESSIONAL ETHICS AND HUMAN VALUES
Objective
To create an awareness on Engineering Ethics and Human Values.
To instill Moral and Social Values and Loyalty
To appreciate the rights of Others
1. Human Values
Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue – Respect for Others – Living Peacefully – caring – Sharing – Honesty – Courage – Valuing Time – Co-operation – Commitment – Empathy – Self-Confidence – Character – Spirituality
2. Engineering Ethics
Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories.
3. Engineering as Social Experimentation
Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a balanced outlook on law - the challenger case study
4. Safety, Responsibilities and Rights
Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the three mile island and chernobyl case studies.
Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of interest - occupational crime - professional rights - employee rights - Intellectual Property Rights (IPR) - discrimination.
5. Global Issues
Multinational corporations - Environmental ethics - computer ethics - weapons development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers(India), Indian Institute of Materials Management, Institution of electronics and telecommunication engineers(IETE),India, etc.
TUTORIAL
TOTAL : 60
TEXT BOOKS
Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York 1996.
Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.
REFERENCES
Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New Jersey, 2004 (Indian Reprint)
Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available)
John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003.
4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.
CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN
AIM
To understand the concepts of object oriented analysis and design.
OBJECTIVES
· To understand the object oriented life cycle.
· To know how to identify objects, relationships, services and attributes through UML.
· To understand the use-case diagrams.
· To know the Object Oriented Design process.
· To know about software quality and usability.
UNIT I INTRODUCTION
An Overview of Object Oriented Systems Development - Object Basics – Object Oriented Systems Development Life Cycle.
UNIT II OBJECT ORIENTED METHODOLOGIES
Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks – Unified Approach – Unified Modeling Language – Use case - class diagram - Interactive Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity Diagram.
UNIT III OBJECT ORIENTED ANALYSIS
Identifying use cases - Object Analysis - Classification – Identifying Object relationships - Attributes and Methods.
UNIT IV OBJECT ORIENTED DESIGN
Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability.
UNIT V SOFTWARE QUALITY AND USABILITY
Designing Interface Objects – Software Quality Assurance – System Usability - Measuring User Satisfaction
TEXT BOOKS
1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 1999 (Unit I, III, IV, V).
2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002. (UNIT II)
REFERENCE BOOKS
1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-Hill, 2003.
2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language Reference Manual”, Addison Wesley, 1999.
3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG Press Wiley Publishing Inc., 2004.
CS1252 OPERATING SYSTEMS
AIM
To have a thorough knowledge of processes, scheduling concepts, memory management, I/O and file systems in an operating system.
OBJECTIVES
· To have an overview of different types of operating systems
· To know the components of an operating system.
· To have a thorough knowledge of process management
· To have a thorough knowledge of storage management
· To know the concepts of I/O and file systems.
UNIT I
Introduction - Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered Systems – Real Time Systems – Handheld Systems - Hardware Protection - System Components – Operating System Services – System Calls – System Programs - Process Concept – Process Scheduling – Operations on Processes – Cooperating Processes – Inter-process Communication.
UNIT II
Threads – Overview – Threading issues - CPU Scheduling – Basic Concepts – Scheduling Criteria – Scheduling Algorithms – Multiple-Processor Scheduling – Real Time Scheduling - The Critical-Section Problem – Synchronization Hardware – Semaphores – Classic problems of Synchronization – Critical regions – Monitors.
UNIT III
System Model – Deadlock Characterization – Methods for handling Deadlocks -Deadlock Prevention – Deadlock avoidance – Deadlock detection – Recovery from Deadlocks - Storage Management – Swapping – Contiguous Memory allocation – Paging – Segmentation – Segmentation with Paging.
UNIT IV
Virtual Memory – Demand Paging – Process creation – Page Replacement – Allocation of frames – Thrashing - File Concept – Access Methods – Directory Structure – File System Mounting – File Sharing – Protection
UNIT V
File System Structure – File System Implementation – Directory Implementation – Allocation Methods – Free-space Management. Kernel I/O Subsystems - Disk Structure – Disk Scheduling – Disk Management – Swap-Space Management. Case Study: The Linux System, Windows
TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.
REFERENCES
Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education Pvt. Ltd, 2002.
Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2003.
William Stallings, “Operating System”, Prentice Hall of India, 4th Edition, 2003.
Pramod Chandra P. Bhatt – “An Introduction to Operating Systems, Concepts and Practice”, PHI, 2003.
CS1302 COMPUTER NETWORKS
AIM
To introduce the concepts, terminologies and technologies used in modern days data communication and computer networking.
OBJECTIVES
To understand the concepts of data communications.
To study the functions of different layers.
To introduce IEEE standards employed in computer networking.
To make the students to get familiarized with different protocols and network components.
UNIT I DATA COMMUNICATIONS
Components – Direction of Data flow – networks – Components and Categories – types of Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media – Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences.
UNIT II DATA LINK LAYER
Error – detection and correction – Parity – LRC – CRC – Hamming code – low Control and Error control - stop and wait – go back-N ARQ – selective repeat ARQ- sliding window – HDLC. - LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11 – FDDI - SONET – Bridges.
UNIT III NETWORK LAYER
Internetworks – Packet Switching and Datagram approach – IP addressing methods – Subnetting – Routing – Distance Vector Routing – Link State Routing – Routers.
UNIT IV TRANSPORT LAYER
Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) – Integrated Services.
UNIT V APPLICATION LAYER
Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW – Security – Cryptography.
TOTAL: 45
TEXT BOOKS
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2004.
REFERENCES
James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Pearson Education, 2003.
Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd., Second Edition.
Andrew S. Tanenbaum, “Computer Networks”, PHI, Fourth Edition, 2003.
William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.
EC1391 TELECOMMUNICATION SYSTEMS
AIM
To gain knowledge about microwave, satellite, optical, telephone and cellular communication systems.
OBJECTIVES
To have knowledge about characteristics of Transmission and microwave devices.
To study about the fundamentals of satellite communication
To gain brief knowledge about optical communication
To gain knowledge about optical communication
To gain knowledge about advances in Telephone systems
To understand the essentials of cellular communication systems.
UNIT I METHODS OF COMMUNICATION
Transmission lines – Types and Characteristics, Antenna Fundamentals – Different types of antennas & their Characteristics, Radio Frequency wave propagation- Microwave –Principles, Devices (Reflex Klystron, Magnetron, TWT)-(Principles Only) Radar - Pulsed Radar - CW Radar (Principles and Block Diagram Only).
UNIT II INTRODUCTION TO SATELLITE COMMUNICATIONS
Satellite orbits- Satellite communication systems –Earth stations- Applications: Surveillance, Navigation, Mobile Communication, TV Broadcast, Satellite Radio, Satellite Telephone-The Internet.
UNIT III INTRODUCTION TO FIBER OPTIC COMMUNICATION
Light wave communication systems – Fiber structure and function types of Fiber – Optical Transmitter & Receiver –Fiber optic Data communication systems
UNIT IV TELEPHONE SYSTEM AND ITS APPLICATION
Telephones –Telephone system- Facsimile- Cellular telephone system-Paging system –Integrated services Digital Networks (ISDN)
UNIT V CELLULAR RADIO
Citizen’s band Radio, Cordless Telephone, Improved Mobile Telephone service (IMTS), Introduction to Advanced Mobile Phone Service (AMPS), GSM – RF channels and time slots – Voice transmission – Frequency Hopping - Subscriber ID module – GSM Privacy and Security – IS-95 CDMA PCS – Channels – Forward Channel – Reverse Channel – Voice Coding – Power Control – Hand-off and CDMA Security.
TEXT BOOKS
1. Louis.E.Frenzel, Communication Electronics – Principles and Application”, 3rd Editions, Tata McGraw-Hill, 2002 (Units I to IV)
2. Roy Blake, “Wireless Communication Technology”, Thomson Delmar Learning, Second Reprint 2002. (UNIT V Chapters: 10, 11)
REFERENCES
1. Wayne Tomasi,”Electronic Communication systems” 4th Edition, Pearson Education, 2001.
Marin Cole, “Introduction to Telecommunications –Voice, Data and Internet”, Pearson Education, 2001.
CS1301 DATABASE MANAGEMENT SYSTEMS
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 emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.
UNIT I INTRODUCTION AND CONCEPTUAL MODELING
Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and Calculus.
UNIT II RELATIONAL MODEL
SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).
UNIT III DATA STORAGE AND QUERY PROCESSING
Record storage and Primary file organization- Secondary storage Devices- Operations on Files- Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+Tree – Query Processing.
UNIT IV TRANSACTION MANAGEMENT
Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.
UNIT V CURRENT TRENDS
Object Oriented Databases – Need for Complex Data types - OO data Model- Nested relations - Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.
TUTORIAL
TEXT BOOKS
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan - “Database System Concepts”, Fourth Edition, McGraw-Hill, 2002.
REFERENCES
Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003.
Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.
Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2000.
Peter Rob and Corlos Coronel- “Database System, Design, Implementation and Management”, Thompson Learning Course Technology- Fifth edition, 2003.
CS1403 CASE TOOLS LAB
Prepare the following documents for two or three of the experiments listed below and develop the software engineering methodology.
1. Program Analysis and Project Planning.
Thorough study of the problem – Identify project scope, Objectives, Infrastructure.
2. Software requirement Analysis
Describe the individual Phases / Modules of the project, Identify deliverables.
3. Data Modeling
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test lass diagrams, Sequence diagrams and add interface to class diagrams.
4. Software Development and Debugging
5. Software Testing
Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop test case hierarchy, Site check and Site monitor.
Suggested List of Applications:
1. Student Marks Analyzing System
2. Quiz System
3. Online Ticket Reservation System
4. Payroll System
5. Course Registration System
6. Expert Systems
7. ATM Systems
8. Stock Maintenance
9. Real-Time Scheduler
10. Remote Procedure Call Implementation
CS1254 OPERATING SYSTEM LAB (Linux based)
(Implement the following on LINUX platform. Use C for high level language implementation)
1. Shell programming
- command syntax
- write simple functions
- basic tests
2. Shell programming
- loops
- patterns
- expansions
- substitutions
3. Write programs using the following system calls of UNIX operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
4. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)
5. Write C programs to simulate UNIX commands like ls, grep, etc.
6. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
7. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
8. Implement the Producer – Consumer problem using semaphores.
9. Implement some memory management schemes – I for eg
Free space is maintained as a linked list of nodes with each node having the starting byte address and the ending byte address of a free block. Each memory request consists of the process-id and the amount of storage space required in bytes. Allocated memory space is again maintained as a linked list of nodes with each node having the process-id, starting byte address and the ending byte address of the allocated space.
10. Implement some memory management schemes – II for eg
When a process finishes (taken as input) the appropriate node from the allocated list should be deleted and this free disk space should be added to the free space list. [Care should be taken to merge contiguous free blocks into one single block. This results in deleting more than one node from the free space list and changing the start and end address in the appropriate node]. For allocation use first fit, worst fit and best fit.
CS1307 DATABASE MANAGEMENT SYSTEMS LAB
LIST OF EXPERIMENTS
1. Data Definition Language (DDL) commands in RDBMS.
2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.
3. High-level language extension with Cursors.
4. High level language extension with Triggers
5. Procedures and Functions.
6. Embedded SQL.
7. Database design using E-R model and Normalization.
8. Design and implementation of Payroll Processing System.
9. Design and implementation of Banking System.
10. Design and implementation of Library Information System.
MG1351 PRINCIPLES OF MANAGEMENT
Objective
Knowledge on the principles of management is essential for all kinds of people in all kinds of organizations. After studying this course, students will be able to have a clear understanding of the managerial functions like planning, organizing, staffing, leading and controlling. Students will also gain some basic knowledge on international aspect of management.
1. Historical Development
Definition of Management – Science or Art – Management and Administration – Development of Management Thought – Contribution of Taylor and Fayol – Functions of Management – Types of Business Organisation.
2. Planning
Nature & Purpose – Steps involved in Planning – Objectives – Setting Objectives – Process of Managing by Objectives – Strategies, Policies & Planning Premises- Forecasting – Decision-making.
3. Organising
Nature and Purpose – Formal and informal organization – Organization Chart – Structure and Process – Departmentation by difference strategies – Line and Staff authority – Benefits and Limitations – De-Centralization and Delegation of Authority – Staffing – Selection Process - Techniques – HRD – Managerial Effectiveness
4. Directing
Scope – Human Factors – Creativity and Innovation – Harmonizing Objectives – Leadership – Types of Leadership Motivation – Hierarchy of needs – Motivation theories – Motivational Techniques – Job Enrichment – Communication – Process of Communication – Barriers and Breakdown – Effective Communication – Electronic media in Communication.
5. Controlling
System and process of Controlling – Requirements for effective control – The Budget as Control Technique – Information Technology in Controlling – Use of computers in handling the information – Productivity – Problems and Management – Control of Overall Performance – Direct and Preventive Control – Reporting – The Global Environment – Globalization and Liberalization – International Management and Global theory of Management.
TEXT BOOKS
1. Harold Kooritz & Heinz Weihrich “Essentials of Management”, Tata McGraw-Hill, 1998.
2. Joseph L Massie “Essentials of Management”, Prentice Hall of India, (Pearson) Fourth Edition, 2003.
REFERENCES
1 Tripathy PC And Reddy PN, “ Principles of Management”, Tata McGraw-Hill, 1999.
2. Decenzo David, Robbin Stephen A, ”Personnel and Human Reasons Management”, Prentice Hall of India, 1996
3. JAF Stomer, Freeman R. E and Daniel R Gilbert Management, Pearson Education, Sixth Edition, 2004.
4. Fraidoon Mazda, “Engineering Management”, Addison Wesley,-2000.
IT1351 NETWORK PROGRAMMING AND MANAGEMENT
AIM
To enable the students to develop the necessary skills for developing robust & scalable network applications and to build necessary basic knowledge for managing networks.
OBJECTIVES
To learn the basics of socket programming using TCP Sockets.
To learn basics of UDP sockets.
To develop knowledge of threads for developing high performance scalable applications.
To learn about raw sockets.
To understand simple network management protocols & practical issues
UNIT I ELEMENTARY TCP SOCKETS
Introduction to Socket Programming – Overview of TCP/IP Protocols –Introduction to Sockets – Socket address Structures – Byte ordering functions – address conversion functions – Elementary TCP Sockets – socket, connect, bind, listen, accept, read, write, close functions – Iterative Server – Concurrent Server.
UNIT II APPLICATION DEVELOPMENT
TCP Echo Server – TCP Echo Client – Posix Signal handling – Server with multiple clients – boundary conditions: Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown – I/O multiplexing – I/O Models – select function – shutdown function – TCP echo Server (with multiplexing) – poll function – TCP echo Client (with Multiplexing)
UNIT III SOCKET OPTIONS, ELEMENTRY UDP SOCKETS
Socket options – getsocket and setsocket functions – generic socket options – IP socket options – ICMP socket options – TCP socket options – Elementary UDP sockets – UDP echo Server – UDP echo Client – Multiplexing TCP and UDP sockets – Domain name system – gethostbyname function – Ipv6 support in DNS – gethostbyadr function – getservbyname and getservbyport functions.
UNIT IV ADVANCED SOCKETS
Ipv4 and Ipv6 interoperability – threaded servers – thread creation and termination – TCP echo server using threads – Mutexes – condition variables – raw sockets – raw socket creation – raw socket output – raw socket input – ping program – trace route program.
UNIT V SIMPLE NETWORK MANAGEMENT
SNMP network management concepts – SNMP management information – standard MIB’s – SNMPv1 protocol and Practical issues – introduction to RMON, SNMPv2 and SNMPv3.
TEXT BOOKS
W. Richard Stevens, “UNIX NETWORK PROGRAMMING Vol-I” Second Edition, PHI / Pearson Education, 1998. (Units – I, II, III & IV.) (Chapter – 1-10, 23, 25)
William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON 1 and 2”, Third Edition, Addison Wesley, 1999. (Unit - V) (Chapter – 4-7)
REFERENCE
D.E. Comer, “Intrenetworking with TCP/IP Vol- III”, (BSD Sockets Version), second Edition, PHI, 2003.
IT1352 CRYPTOGRAPHY AND NETWORK SECURITY
AIM
To understand the principles of encryption algorithms; conventional and public key cryptography. To have a detailed knowledge about authentication, hash functions and application level security mechanisms.
OBJECTIVES
To know the methods of conventional encryption.
To understand the concepts of public key encryption and number theory
To understand authentication and Hash functions.
To know the network security tools and applications.
To understand the system level security used.
UNIT I INTRODUCTION
OSI Security Architecture - Classical Encryption techniques – Cipher Principles – Data Encryption Standard – Block Cipher Design Principles and Modes of Operation - Evaluation criteria for AES – AES Cipher – Triple DES – Placement of Encryption Function – Traffic Confidentiality
UNIT II PUBLIC KEY CRYPTOGRAPHY
Key Management - Diffie-Hellman key Exchange – Elliptic Curve Architecture and Cryptography - Introduction to Number Theory – Confidentiality using Symmetric Encryption – Public Key Cryptography and RSA.
UNIT III AUTHENTICATION AND HASH FUNCTION
Authentication requirements – Authentication functions – Message Authentication Codes – Hash Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure Hash Algorithm – RIPEMD – HMAC Digital Signatures – Authentication Protocols – Digital Signature Standard
UNIT IV NETWORK SECURITY
Authentication Applications: Kerberos – X.509 Authentication Service – Electronic Mail Security – PGP – S/MIME - IP Security – Web Security.
UNIT V SYSTEM LEVEL SECURITY
Intrusion detection – password management – Viruses and related Threats – Virus Counter measures – Firewall Design Principles – Trusted Systems.
TUTORIAL
TEXT BOOK
1. William Stallings, “Cryptography And Network Security – Principles and Practices”, Prentice Hall of India, Third Edition, 2003.
REFERENCES
1. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.
2. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001.
3. Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Third Edition, Pearson Education, 2003.
CS1253 VISUAL PROGRAMMING
AIM
To make the students to understand the windows programming concepts including Microsoft Foundation Classes.
OBJECTIVES
To introduce the concepts of windows programming
To introduce GUI programming using Microsoft Foundation Classes
To enable the students to develop programs and simple applications using Visual C++
UNIT I WINDOWS PROGRAMMING
Windows environment – a simple windows program – windows and messages – creating the window – displaying the window – message loop – the window procedure – message processing – text output – painting and repainting – introduction to GDI – device context – basic drawing – child window controls
UNIT II VISUAL C++ PROGRAMMING – INTRODUCTION
Application Framework – MFC library – Visual C++ Components – Event Handling – Mapping modes – colors – fonts – modal and modeless dialog – windows common controls – bitmaps
UNIT III THE DOCUMENT AND VIEW ARCHITECTURE
Menus – Keyboard accelerators – rich edit control – toolbars – status bars – reusable frame window base class – separating document from its view – reading and writing SDI and MDI documents – splitter window and multiple views – creating DLLs – dialog based applications
UNIT IV ACTIVEX AND OBJECT LINKING AND EMBEDDING (OLE)
ActiveX controls Vs. Ordinary Windows Controls – Installing ActiveX controls – Calendar Control – ActiveX control container programming – create ActiveX control at runtime – Component Object Model (COM) – containment and aggregation Vs. inheritance – OLE drag and drop – OLE embedded component and containers – sample applications
UNIT-V ADVANCED CONCEPTS
Database Management with Microsoft ODBC – Structured Query Language – MFC ODBC classes – sample database applications – filter and sort strings – DAO concepts – displaying database records in scrolling view – Threading – VC++ Networking issues – Winsock – WinInet – building a web client – Internet Information Server – ISAPI server extension – chat application – playing and multimedia (sound and video) files
TEXT BOOKS
1.Charles Petzold, “Windows Programming”, Microsoft press, 1996 (Unit I – Chapter 1-9)
2. David J.Kruglinski, George Shepherd and Scot Wingo, “Programming Visual C++”, Microsoft press, 1999 (Unit II – V)
REFERENCES
1. Steve Holtzner, “Visual C++ 6 Programming”, Wiley Dreamtech India Pvt. Ltd., 2003.
IT1353 EMBEDDED SYSTEMS
AIM
To give sufficient background for undertaking embedded systems design.
OBJECTIVES
To introduce students to the embedded systems, its hardware and software.
To introduce devices and buses used for embedded networking.
To explain programming concepts and embedded programming in C and C++.
To explain real time operating systems, inter-task communication and an exemplary case of MUCOS – IIRTOS.
UNIT I INTRODUCTION TO EMBEDDED SYSTEMS
Definition and Classification – Overview of Processors and hardware units in an embedded system – Software embedded into the system – Exemplary Embedded Systems – Embedded Systems on a Chip (SoC) and the use of VLSI designed circuits
UNIT II DEVICES AND BUSES FOR DEVICES NETWORK
I/O Devices - Device I/O Types and Examples – Synchronous - Iso-synchronous and Asynchronous Communications from Serial Devices - Examples of Internal Serial-Communication Devices - UART and HDLC - Parallel Port Devices - Sophisticated interfacing features in Devices/Ports- Timer and Counting Devices - ‘12C’, ‘USB’, ‘CAN’ and advanced I/O Serial high speed buses- ISA, PCI, PCI-X, cPCI and advanced buses.
UNIT III PROGRAMMING CONCEPTS AND EMBEDDED PROGRAMMING IN C, C++
Programming in assembly language (ALP) vs. High Level Language - C Program Elements, Macros and functions -Use of Pointers - NULL Pointers - Use of Function Calls – Multiple function calls in a Cyclic Order in the Main Function Pointers – Function Queues and Interrupt Service Routines Queues Pointers – Concepts of EMBEDDED PROGRAMMING in C++ - Objected Oriented Programming – Embedded Programming in C++, ‘C’ Program compilers – Cross compiler – Optimization of memory codes.
UNIT IV REAL TIME OPERATING SYSTEMS – PART - 1
Definitions of process, tasks and threads – Clear cut distinction between functions – ISRs and tasks by their characteristics – Operating System Services- Goals – Structures- Kernel - Process Management – Memory Management – Device Management – File System Organisation and Implementation – I/O Subsystems – Interrupt Routines Handling in RTOS, REAL TIME OPERATING SYSTEMS : RTOS Task scheduling models - Handling of task scheduling and latency and deadlines as performance metrics – Co-operative Round Robin Scheduling – Cyclic Scheduling with Time Slicing (Rate Monotonics Co-operative Scheduling) – Preemptive Scheduling Model strategy by a Scheduler – Critical Section Service by a Preemptive Scheduler – Fixed (Static) Real time scheduling of tasks - INTER PROCESS COMMUNICATION AND SYNCHRONISATION – Shared data problem – Use of Semaphore(s) – Priority Inversion Problem and Deadlock Situations – Inter Process Communications using Signals – Semaphore Flag or mutex as Resource key – Message Queues – Mailboxes – Pipes – Virtual (Logical) Sockets – Remote Procedure Calls (RPCs).
UNIT V REAL TIME OPERATING SYSTEMS – PART - 2
Study of Micro C/OS-II or Vx Works or Any other popular RTOS – RTOS System Level Functions – Task Service Functions – Time Delay Functions – Memory Allocation Related Functions – Semaphore Related Functions – Mailbox Related Functions – Queue Related Functions – Case Studies of Programming with RTOS – Understanding Case Definition – Multiple Tasks and their functions – Creating a list of tasks – Functions and IPCs – Exemplary Coding Steps.
TOTAL : 45
TEXTBOOKS
1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-Hill, First reprint Oct. 2003
REFERENCES
Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes,
David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000.
Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design – Harcourt India, Morgan Kaufman Publishers, First Indian Reprint 2001
Frank Vahid and Tony Givargis, Embedded Systems Design – A unified Hardware /Software Introduction, John Wiley, 2002.
MA1251 NUMERICAL METHODS
AIM
With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically.
OBJECTIVES
At the end of the course, the students would be acquainted with the basic concepts in numerical methods and their uses are summarized as follows:
The roots of nonlinear (algebraic or transcendental) equations, solutions of large system of linear equations and eigenvalue problem of a matrix can be obtained numerically where analytical methods fail to give solution.
When huge amounts of experimental data are involved, the methods discussed on interpolation will be useful in constructing approximate polynomial to represent the data and to find the intermediate values.
The numerical differentiation and integration find application when the function in the analytical form is too complicated or the huge amounts of data are given such as series of measurements, observations or some other empirical information.
Since many physical laws are couched in terms of rate of change of one/two or more independent variables, most of the engineering problems are characterized in the form of either nonlinear ordinary differential equations or partial differential equations. The methods introduced in the solution of ordinary differential equations and partial differential equations will be useful in attempting any engineering problem.
UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS
Linear interpolation methods (method of false position) – Newton’s method – Statement of Fixed Point Theorem – Fixed point iteration: x=g(x) method – Solution of linear system by Gaussian elimination and Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method – Eigenvalue of a matrix by power method.
UNIT II INTERPOLATION AND APPROXIMATION
Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s forward and backward difference formulas.
UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION
Derivatives from difference tables – Divided differences and finite differences –Numerical integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpson’s rules.
UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS
Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne’s and Adam’s predictor and corrector methods.
UNIT V BOUNDARY VALUE PROBLEMS IN ordinary AND PARTIAL DIFFERENTIAL EQUATIONS
Finite difference solution of second order ordinary differential equation – Finite difference solution of one dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two dimensional Laplace and Poisson equations.
TUTORIAL
TOTAL : 60
TEXT BOOKS
Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education Asia, New Delhi, 2002.
Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, 1999.
REFERENCES
Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co. Ltd., New Delhi, 2003.
Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd., Singapore, 2002.
CS1255 VISUAL PROGRAMMING LAB
LIST OF EXPERIMENTS
Windows SDK / Visual C++
Writing code for keyboard and mouse events.
Dialog Based applications
Creating MDI applications
Visual C++
Threads
Document view Architecture, Serialization
Dynamic controls
Menu, Accelerator, Tool tip, Tool bar
Creating DLLs and using them
Data access through ODBC
Creating ActiveX control and using it
CS1305 NETWORK LAB
(all the programs are to be written using C)
Simulation of ARP / RARP.
Write a program that takes a binary file as input and performs bit stuffing and CRC Computation.
Develop an application for transferring files over RS232.
Simulation of Sliding-Window protocol.
Simulation of BGP / OSPF routing protocol.
Develop a Client – Server application for chat.
Develop a Client that contacts a given DNS Server to resolve a given host name.
Write a Client to download a file from a HTTP Server.
Study of NS2.
Study of Glomosim / OPNET.
MG1401 TOTAL QUALITY MANAGEMENT
OBJECTIVE
To understand the Total Quality Management concept and principles and the various tools available to achieve Total Quality Management.
To understand the statistical approach for quality control.
To create an awareness about the ISO and QS certification process and its need for the industries.
INTRODUCTION
Definition of Quality, Dimensions of Quality, Quality Planning, Quality costs - Analysis Techniques for Quality Costs, Basic concepts of Total Quality Management, Historical Review, Principles of TQM, Leadership – Concepts, Role of Senior Management, Quality Council, Quality Statements, Strategic Planning, Deming Philosophy, Barriers to TQM Implementation.
TQM PRINCIPLES
Customer satisfaction – Customer Perception of Quality, Customer Complaints, Service Quality, Customer Retention, Employee Involvement – Motivation, Empowerment, Teams, Recognition and Reward, Performance Appraisal, Benefits, Continuous Process Improvement – Juran Trilogy, PDSA Cycle, 5S, Kaizen, Supplier Partnership – Partnering, sourcing, Supplier Selection, Supplier Rating, Relationship Development, Performance Measures – Basic Concepts, Strategy, Performance Measure.
STATISTICAL PROCESS CONTROL (SPC)
The seven tools of quality, Statistical Fundamentals – Measures of central Tendency and Dispersion, Population and Sample, Normal Curve, Control Charts for variables and attributes, Process capability, Concept of six sigma, New seven Management tools.
TQM TOOLS
Benchmarking – Reasons to Benchmark, Benchmarking Process, Quality Function Deployment (QFD) – House of Quality, QFD Process, Benefits, Taguchi Quality Loss Function, Total Productive Maintenance (TPM) – Concept, Improvement Needs, FMEA – Stages of FMEA.
QUALITY SYSTEMS
Need for ISO 9000 and Other Quality Systems, ISO 9000:2000 Quality System – Elements, Implementation of Quality System, Documentation, Quality Auditing, TS 16949, ISO 14000 – Concept, Requirements and Benefits.
Total : 45
TEXT BOOK
Dale H.Besterfiled, et al., Total Quality Management, Pearson Education, Inc. 2003. (Indian reprint 2004). ISBN 81-297-0260-6.
REFERENCES
James R.Evans & William M.Lidsay, The Management and Control of Quality, (5th Edition), South-Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).
Feigenbaum.A.V. “Total Quality Management, McGraw-Hill, 1991.
Oakland.J.S. “Total Quality Management Butterworth – Hcinemann Ltd., Oxford. 1989.
Narayana V. and Sreenivasan, N.S. Quality Management – Concepts and Tasks, New Age International 1996.
Zeiri. “Total Quality Management for Engineers Wood Head Publishers, 1991.
IT1401 COMPONENT BASED TECHNOLOGY
AIM
To introduce different software components and their application.
OBJECTIVE
· Introduces in depth JAVA, Corba and .Net Components
· Deals with Fundamental properties of components, technology and architecture and middleware.
· Component Frameworks and Development are covered indepth.
UNIT I INTRODUCTION
Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture – components and middleware
UNIT II JAVA BASED COMPONENT TECHNOLOGIES
Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP
UNIT III CORBA COMPONENT TECHNOLOGIES
Java and CORBA – Interface Definition language – Object Request Broker – system object model – portable object adapter – CORBA services – CORBA component model – containers – application server – model driven architecture
UNIT IV . NET BASED COMPONENT TECHNOLOGIES
COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – .NET components - assemblies – appdomains – contexts – reflection – remoting
UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT
Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component framework – directory objects – cross-development environment – component-oriented programming – Component design and implementation tools – testing tools - assembly tools
TEXT BOOK
1. Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”, Pearson Education publishers, 2003
REFERENCES
Ed Roman, “Mastering Enterprise Java Beans”, John Wiley & Sons Inc., 1999.
Mowbray, “Inside CORBA”, Pearson Education, 2003.
Freeze, “Visual Basic Development Guide for COM & COM+”, BPB Publication, 2001.
Hortsamann, Cornell, “CORE JAVA Vol-II” Sun Press, 2002.
IT1402 MOBILE COMPUTING
AIM
To provide basics for various techniques in Mobile Communications and Mobile Content services.
OBJECTIVES
· To learn the basics of Wireless voice and data communications technologies.
· To build working knowledge on various telephone and satellite networks.
· To study the working principles of wireless LAN and its standards.
· To build knowledge on various Mobile Computing algorithms.
· To build skills in working with Wireless application Protocols to develop mobile content applications.
UNIT I WIRELESS COMMUNICATION FUNDAMENTALS
Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.
UNIT II TELECOMMUNICATION NETWORKS
Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite Networks - Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast Systems – DAB - DVB.
UNIT III WIRLESS LAN
Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE 802.11a - 802.11b standards – HIPERLAN – Blue Tooth.
UNIT IV MOBILE NETWORK LAYER
Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – Alternative Metrics.
UNIT V TRANSPORT AND APPLICATION LAYERS
Traditional TCP – Classical TCP improvements – WAP, WAP 2.0.
TOTAL : 45
TEXT BOOKS
1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. (Unit I Chap 1,2 &3- Unit II chap 4,5 &6-Unit III Chap 7.Unit IV Chap 8- Unit V Chap 9&10.)
2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2002. (Unit I Chapter – 7&10-Unit II Chap 9)
REFERENCES
1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education, 2003.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile Computing”, Springer, New York, 2003.
3. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.
CS1354 GRAPHICS AND MULTIMEDIA
AIM
To impart the fundamental concepts of Computer Graphics and Multimedia.
OBJECTIVES
· To study the graphics techniques and algorithms.
· To study the multimedia concepts and various I/O technologies.
· To enable the students to develop their creativity
UNIT I OUTPUT PRIMITIVES
Introduction - Line - Curve and Ellipse Algorithms – Attributes – Two-Dimensional Geometric Transformations – Two-Dimensional Viewing.
UNIT II THREE-DIMENSIONAL CONCEPTS
Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling Transformations – Three-Dimensional Viewing – Color models – Animation
UNIT III MULTIMEDIA SYSTEMS DESIGN
An Introduction – Multimedia applications – Multimedia System Architecture – Evolving technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data interface standards – Multimedia Databases.
UNIT IV MULTIMEDIA FILE HANDLING
Compression & Decompression – Data & File Format standards – Multimedia I/O technologies - Digital voice and audio – video image and animation – Full motion video – Storage and retrieval Technologies.
UNIT V Hypermedia
Multimedia Authoring & User Interface – Hypermedia messaging - Mobile Messaging – Hypermedia message component – creating Hypermedia message – Integrated multimedia message standards – Integrated Document management – Distributed Multimedia Systems.
TEXT BOOKS
1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson Education, 2003.
(UNIT I : Chapters 1 to 6; UNIT 2: Chapter 9 – 12, 15, 16)
2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003. (UNIT 3 to 5)
REFERENCES
1. Judith Jeffcoate, “Multimedia in practice technology and Applications”, PHI,1998.
2. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson Education, second edition 2003.
IT1403 SOFTWARE COMPONENTS LABORATORY
LIST OF EXPERIMENTS
COM COMPONENT: Development of simple com components in VB and use them in applications. [2 example].
ENTERPRISE JAVA BEANS: Deploying EJB for simple arithmetic operator.
RMI: Deploying RMI for client server applications. [2 Experiments].
Creation Of DLL Using VB And Deploy it in Java [2 Experiments]
Naming Services In CORBA
DSI, DII IN CORBA.
INTER ORB IN COMMUNICATION [IIOP, IOR] Jac ORB & Visi broker ORB
STUDYING J2EE SERVER.
SIMPLE APPLICATION USING CORBA.
CS1355 GRAPHICS AND MULTIMEDIA LAB 0 0 3 100
1. To implement Bresenham’s algorithms for line, circle and ellipse drawing
2. To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.
3. To implement Cohen-Sutherland 2D clipping and window-viewport mapping
4. To perform 3D Transformations such as translation, rotation and scaling.
5. To visualize projections of 3D images.
6. To convert between color models.
7. To implement text compression algorithm
8. To implement image compression algorithm
9. To perform animation using any Animation software
10. To perform basic operations on image using any image editing software
IT1451 WEB TECHNOLOGY
AIM
To highlight the features of different technologies involved in Web Technology and various Scripting Languages.
OBJECTIVES
Students will get an introduction about various Scripting Languages.
Students will be provided with an up-to-date survey of developments in. Web Technologies.
Enable the students to know techniques involved to support real-time Software development.
UNIT I INTRODUCTION
History of the Internet and World Wide Web – HTML 4 protocols – HTTP, SMTP, POP3, MIME, IMAP. Introduction to JAVA Scripts – Object Based Scripting for the web. Structures – Functions – Arrays – Objects.
UNIT II DYNAMIC HTML
Introduction – Object refers, Collectors all and Children. Dynamic style, Dynamic position, frames, navigator, Event Model – On check – On load – Onenor – Mouse rel – Form process – Event Bubblers – Filters – Transport with the Filter – Creating Images – Adding shadows – Creating Gradients – Creating Motion with Blur – Data Binding – Simple Data Binding – Moving with a record set – Sorting table data – Binding of an Image and table.
UNIT III MULTIMEDIA
Audio and video speech synthesis and recognition - Electronic Commerce – E-Business Model – E- Marketing – Online Payments and Security – Web Servers – HTTP request types – System Architecture – Client Side Scripting and Server side Scripting – Accessing Web servers – IIS – Apache web server.
UNIT IV DATABASE- ASP – XML
Database, Relational Database model – Overview, SQL – ASP – Working of ASP – Objects – File System Objects – Session tracking and cookies – ADO – Access a Database from ASP – Server side Active-X Components – Web Resources – XML – Structure in Data – Name spaces – DTD – Vocabularies – DOM methods.
UNIT V SERVLETS AND JSP
Introduction – Servlet Overview Architecture – Handling HTTP Request – Get and post request – redirecting request – multi-tier applications – JSP – Overview – Objects – scripting – Standard Actions – Directives.
TUTORIAL
TEXT BOOK
Deitel & Deitel, Goldberg, “Internet and world wide web – How to Program”, Pearson Education Asia, 2001.
REFERENCES
Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and JAVA”, Prentice Hall of India – QUE, 1999.
Aferganatel, “Web Programming: Desktop Management”, PHI, 2004.
B.TECH. INFORMATION TECHNOLOGY
SEMESTER V
THEORY
GE1301 Professional Ethics and Human Values
CS1402 Object Oriented Analysis and Design
CS1252 Operating Systems
CS1302 Computer Networks
EC1391 Telecommunication Systems
CS1301 Database Management Systems
GE1302 Communication Skill & Seminar
PRACTICAL
CS1403 Case Tools Lab
CS1254 Operating System Lab (Linux based)
CS1307 DBMS Lab
SEMESTER VI
THEORY
MG1351 Principle of Management
IT1351 Network Programming and Management
IT1352 Cryptography and Network Security
CS1253 Visual Programming
IT1353 Embedded Systems
MA1251 Numerical Methods
GE1351 Professional Skill & Seminar**
PRACTICAL
CS1255 Visual Programming Lab
CS1305 Network Lab
SEMESTER VII
THEORY
MG1401 Total Quality Management
IT1401 Component Based Technology
IT1402 Mobile Computing
CS1354 Graphics and Multimedia
Elective I
Elective II
PRACTICAL
IT1403 Software Components Lab
CS1355 Graphics and Multimedia Lab
SEMESTER VIII
THEORY
IT1451 Web Technology
Elective III
Elective IV
PRACTICAL
IT1452 Project Work
IT1453 Comprehension**
GE1301 PROFESSIONAL ETHICS AND HUMAN VALUES
Objective
To create an awareness on Engineering Ethics and Human Values.
To instill Moral and Social Values and Loyalty
To appreciate the rights of Others
1. Human Values
Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue – Respect for Others – Living Peacefully – caring – Sharing – Honesty – Courage – Valuing Time – Co-operation – Commitment – Empathy – Self-Confidence – Character – Spirituality
2. Engineering Ethics
Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories.
3. Engineering as Social Experimentation
Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a balanced outlook on law - the challenger case study
4. Safety, Responsibilities and Rights
Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the three mile island and chernobyl case studies.
Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of interest - occupational crime - professional rights - employee rights - Intellectual Property Rights (IPR) - discrimination.
5. Global Issues
Multinational corporations - Environmental ethics - computer ethics - weapons development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers(India), Indian Institute of Materials Management, Institution of electronics and telecommunication engineers(IETE),India, etc.
TUTORIAL
TOTAL : 60
TEXT BOOKS
Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York 1996.
Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.
REFERENCES
Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New Jersey, 2004 (Indian Reprint)
Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available)
John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003.
4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.
CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN
AIM
To understand the concepts of object oriented analysis and design.
OBJECTIVES
· To understand the object oriented life cycle.
· To know how to identify objects, relationships, services and attributes through UML.
· To understand the use-case diagrams.
· To know the Object Oriented Design process.
· To know about software quality and usability.
UNIT I INTRODUCTION
An Overview of Object Oriented Systems Development - Object Basics – Object Oriented Systems Development Life Cycle.
UNIT II OBJECT ORIENTED METHODOLOGIES
Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks – Unified Approach – Unified Modeling Language – Use case - class diagram - Interactive Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity Diagram.
UNIT III OBJECT ORIENTED ANALYSIS
Identifying use cases - Object Analysis - Classification – Identifying Object relationships - Attributes and Methods.
UNIT IV OBJECT ORIENTED DESIGN
Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability.
UNIT V SOFTWARE QUALITY AND USABILITY
Designing Interface Objects – Software Quality Assurance – System Usability - Measuring User Satisfaction
TEXT BOOKS
1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 1999 (Unit I, III, IV, V).
2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002. (UNIT II)
REFERENCE BOOKS
1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-Hill, 2003.
2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language Reference Manual”, Addison Wesley, 1999.
3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG Press Wiley Publishing Inc., 2004.
CS1252 OPERATING SYSTEMS
AIM
To have a thorough knowledge of processes, scheduling concepts, memory management, I/O and file systems in an operating system.
OBJECTIVES
· To have an overview of different types of operating systems
· To know the components of an operating system.
· To have a thorough knowledge of process management
· To have a thorough knowledge of storage management
· To know the concepts of I/O and file systems.
UNIT I
Introduction - Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered Systems – Real Time Systems – Handheld Systems - Hardware Protection - System Components – Operating System Services – System Calls – System Programs - Process Concept – Process Scheduling – Operations on Processes – Cooperating Processes – Inter-process Communication.
UNIT II
Threads – Overview – Threading issues - CPU Scheduling – Basic Concepts – Scheduling Criteria – Scheduling Algorithms – Multiple-Processor Scheduling – Real Time Scheduling - The Critical-Section Problem – Synchronization Hardware – Semaphores – Classic problems of Synchronization – Critical regions – Monitors.
UNIT III
System Model – Deadlock Characterization – Methods for handling Deadlocks -Deadlock Prevention – Deadlock avoidance – Deadlock detection – Recovery from Deadlocks - Storage Management – Swapping – Contiguous Memory allocation – Paging – Segmentation – Segmentation with Paging.
UNIT IV
Virtual Memory – Demand Paging – Process creation – Page Replacement – Allocation of frames – Thrashing - File Concept – Access Methods – Directory Structure – File System Mounting – File Sharing – Protection
UNIT V
File System Structure – File System Implementation – Directory Implementation – Allocation Methods – Free-space Management. Kernel I/O Subsystems - Disk Structure – Disk Scheduling – Disk Management – Swap-Space Management. Case Study: The Linux System, Windows
TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.
REFERENCES
Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education Pvt. Ltd, 2002.
Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2003.
William Stallings, “Operating System”, Prentice Hall of India, 4th Edition, 2003.
Pramod Chandra P. Bhatt – “An Introduction to Operating Systems, Concepts and Practice”, PHI, 2003.
CS1302 COMPUTER NETWORKS
AIM
To introduce the concepts, terminologies and technologies used in modern days data communication and computer networking.
OBJECTIVES
To understand the concepts of data communications.
To study the functions of different layers.
To introduce IEEE standards employed in computer networking.
To make the students to get familiarized with different protocols and network components.
UNIT I DATA COMMUNICATIONS
Components – Direction of Data flow – networks – Components and Categories – types of Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media – Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences.
UNIT II DATA LINK LAYER
Error – detection and correction – Parity – LRC – CRC – Hamming code – low Control and Error control - stop and wait – go back-N ARQ – selective repeat ARQ- sliding window – HDLC. - LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11 – FDDI - SONET – Bridges.
UNIT III NETWORK LAYER
Internetworks – Packet Switching and Datagram approach – IP addressing methods – Subnetting – Routing – Distance Vector Routing – Link State Routing – Routers.
UNIT IV TRANSPORT LAYER
Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) – Integrated Services.
UNIT V APPLICATION LAYER
Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW – Security – Cryptography.
TOTAL: 45
TEXT BOOKS
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2004.
REFERENCES
James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Pearson Education, 2003.
Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd., Second Edition.
Andrew S. Tanenbaum, “Computer Networks”, PHI, Fourth Edition, 2003.
William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.
EC1391 TELECOMMUNICATION SYSTEMS
AIM
To gain knowledge about microwave, satellite, optical, telephone and cellular communication systems.
OBJECTIVES
To have knowledge about characteristics of Transmission and microwave devices.
To study about the fundamentals of satellite communication
To gain brief knowledge about optical communication
To gain knowledge about optical communication
To gain knowledge about advances in Telephone systems
To understand the essentials of cellular communication systems.
UNIT I METHODS OF COMMUNICATION
Transmission lines – Types and Characteristics, Antenna Fundamentals – Different types of antennas & their Characteristics, Radio Frequency wave propagation- Microwave –Principles, Devices (Reflex Klystron, Magnetron, TWT)-(Principles Only) Radar - Pulsed Radar - CW Radar (Principles and Block Diagram Only).
UNIT II INTRODUCTION TO SATELLITE COMMUNICATIONS
Satellite orbits- Satellite communication systems –Earth stations- Applications: Surveillance, Navigation, Mobile Communication, TV Broadcast, Satellite Radio, Satellite Telephone-The Internet.
UNIT III INTRODUCTION TO FIBER OPTIC COMMUNICATION
Light wave communication systems – Fiber structure and function types of Fiber – Optical Transmitter & Receiver –Fiber optic Data communication systems
UNIT IV TELEPHONE SYSTEM AND ITS APPLICATION
Telephones –Telephone system- Facsimile- Cellular telephone system-Paging system –Integrated services Digital Networks (ISDN)
UNIT V CELLULAR RADIO
Citizen’s band Radio, Cordless Telephone, Improved Mobile Telephone service (IMTS), Introduction to Advanced Mobile Phone Service (AMPS), GSM – RF channels and time slots – Voice transmission – Frequency Hopping - Subscriber ID module – GSM Privacy and Security – IS-95 CDMA PCS – Channels – Forward Channel – Reverse Channel – Voice Coding – Power Control – Hand-off and CDMA Security.
TEXT BOOKS
1. Louis.E.Frenzel, Communication Electronics – Principles and Application”, 3rd Editions, Tata McGraw-Hill, 2002 (Units I to IV)
2. Roy Blake, “Wireless Communication Technology”, Thomson Delmar Learning, Second Reprint 2002. (UNIT V Chapters: 10, 11)
REFERENCES
1. Wayne Tomasi,”Electronic Communication systems” 4th Edition, Pearson Education, 2001.
Marin Cole, “Introduction to Telecommunications –Voice, Data and Internet”, Pearson Education, 2001.
CS1301 DATABASE MANAGEMENT SYSTEMS
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 emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.
UNIT I INTRODUCTION AND CONCEPTUAL MODELING
Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and Calculus.
UNIT II RELATIONAL MODEL
SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).
UNIT III DATA STORAGE AND QUERY PROCESSING
Record storage and Primary file organization- Secondary storage Devices- Operations on Files- Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+Tree – Query Processing.
UNIT IV TRANSACTION MANAGEMENT
Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.
UNIT V CURRENT TRENDS
Object Oriented Databases – Need for Complex Data types - OO data Model- Nested relations - Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.
TUTORIAL
TEXT BOOKS
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan - “Database System Concepts”, Fourth Edition, McGraw-Hill, 2002.
REFERENCES
Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003.
Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.
Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2000.
Peter Rob and Corlos Coronel- “Database System, Design, Implementation and Management”, Thompson Learning Course Technology- Fifth edition, 2003.
CS1403 CASE TOOLS LAB
Prepare the following documents for two or three of the experiments listed below and develop the software engineering methodology.
1. Program Analysis and Project Planning.
Thorough study of the problem – Identify project scope, Objectives, Infrastructure.
2. Software requirement Analysis
Describe the individual Phases / Modules of the project, Identify deliverables.
3. Data Modeling
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test lass diagrams, Sequence diagrams and add interface to class diagrams.
4. Software Development and Debugging
5. Software Testing
Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop test case hierarchy, Site check and Site monitor.
Suggested List of Applications:
1. Student Marks Analyzing System
2. Quiz System
3. Online Ticket Reservation System
4. Payroll System
5. Course Registration System
6. Expert Systems
7. ATM Systems
8. Stock Maintenance
9. Real-Time Scheduler
10. Remote Procedure Call Implementation
CS1254 OPERATING SYSTEM LAB (Linux based)
(Implement the following on LINUX platform. Use C for high level language implementation)
1. Shell programming
- command syntax
- write simple functions
- basic tests
2. Shell programming
- loops
- patterns
- expansions
- substitutions
3. Write programs using the following system calls of UNIX operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
4. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)
5. Write C programs to simulate UNIX commands like ls, grep, etc.
6. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
7. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
8. Implement the Producer – Consumer problem using semaphores.
9. Implement some memory management schemes – I for eg
Free space is maintained as a linked list of nodes with each node having the starting byte address and the ending byte address of a free block. Each memory request consists of the process-id and the amount of storage space required in bytes. Allocated memory space is again maintained as a linked list of nodes with each node having the process-id, starting byte address and the ending byte address of the allocated space.
10. Implement some memory management schemes – II for eg
When a process finishes (taken as input) the appropriate node from the allocated list should be deleted and this free disk space should be added to the free space list. [Care should be taken to merge contiguous free blocks into one single block. This results in deleting more than one node from the free space list and changing the start and end address in the appropriate node]. For allocation use first fit, worst fit and best fit.
CS1307 DATABASE MANAGEMENT SYSTEMS LAB
LIST OF EXPERIMENTS
1. Data Definition Language (DDL) commands in RDBMS.
2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.
3. High-level language extension with Cursors.
4. High level language extension with Triggers
5. Procedures and Functions.
6. Embedded SQL.
7. Database design using E-R model and Normalization.
8. Design and implementation of Payroll Processing System.
9. Design and implementation of Banking System.
10. Design and implementation of Library Information System.
MG1351 PRINCIPLES OF MANAGEMENT
Objective
Knowledge on the principles of management is essential for all kinds of people in all kinds of organizations. After studying this course, students will be able to have a clear understanding of the managerial functions like planning, organizing, staffing, leading and controlling. Students will also gain some basic knowledge on international aspect of management.
1. Historical Development
Definition of Management – Science or Art – Management and Administration – Development of Management Thought – Contribution of Taylor and Fayol – Functions of Management – Types of Business Organisation.
2. Planning
Nature & Purpose – Steps involved in Planning – Objectives – Setting Objectives – Process of Managing by Objectives – Strategies, Policies & Planning Premises- Forecasting – Decision-making.
3. Organising
Nature and Purpose – Formal and informal organization – Organization Chart – Structure and Process – Departmentation by difference strategies – Line and Staff authority – Benefits and Limitations – De-Centralization and Delegation of Authority – Staffing – Selection Process - Techniques – HRD – Managerial Effectiveness
4. Directing
Scope – Human Factors – Creativity and Innovation – Harmonizing Objectives – Leadership – Types of Leadership Motivation – Hierarchy of needs – Motivation theories – Motivational Techniques – Job Enrichment – Communication – Process of Communication – Barriers and Breakdown – Effective Communication – Electronic media in Communication.
5. Controlling
System and process of Controlling – Requirements for effective control – The Budget as Control Technique – Information Technology in Controlling – Use of computers in handling the information – Productivity – Problems and Management – Control of Overall Performance – Direct and Preventive Control – Reporting – The Global Environment – Globalization and Liberalization – International Management and Global theory of Management.
TEXT BOOKS
1. Harold Kooritz & Heinz Weihrich “Essentials of Management”, Tata McGraw-Hill, 1998.
2. Joseph L Massie “Essentials of Management”, Prentice Hall of India, (Pearson) Fourth Edition, 2003.
REFERENCES
1 Tripathy PC And Reddy PN, “ Principles of Management”, Tata McGraw-Hill, 1999.
2. Decenzo David, Robbin Stephen A, ”Personnel and Human Reasons Management”, Prentice Hall of India, 1996
3. JAF Stomer, Freeman R. E and Daniel R Gilbert Management, Pearson Education, Sixth Edition, 2004.
4. Fraidoon Mazda, “Engineering Management”, Addison Wesley,-2000.
IT1351 NETWORK PROGRAMMING AND MANAGEMENT
AIM
To enable the students to develop the necessary skills for developing robust & scalable network applications and to build necessary basic knowledge for managing networks.
OBJECTIVES
To learn the basics of socket programming using TCP Sockets.
To learn basics of UDP sockets.
To develop knowledge of threads for developing high performance scalable applications.
To learn about raw sockets.
To understand simple network management protocols & practical issues
UNIT I ELEMENTARY TCP SOCKETS
Introduction to Socket Programming – Overview of TCP/IP Protocols –Introduction to Sockets – Socket address Structures – Byte ordering functions – address conversion functions – Elementary TCP Sockets – socket, connect, bind, listen, accept, read, write, close functions – Iterative Server – Concurrent Server.
UNIT II APPLICATION DEVELOPMENT
TCP Echo Server – TCP Echo Client – Posix Signal handling – Server with multiple clients – boundary conditions: Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown – I/O multiplexing – I/O Models – select function – shutdown function – TCP echo Server (with multiplexing) – poll function – TCP echo Client (with Multiplexing)
UNIT III SOCKET OPTIONS, ELEMENTRY UDP SOCKETS
Socket options – getsocket and setsocket functions – generic socket options – IP socket options – ICMP socket options – TCP socket options – Elementary UDP sockets – UDP echo Server – UDP echo Client – Multiplexing TCP and UDP sockets – Domain name system – gethostbyname function – Ipv6 support in DNS – gethostbyadr function – getservbyname and getservbyport functions.
UNIT IV ADVANCED SOCKETS
Ipv4 and Ipv6 interoperability – threaded servers – thread creation and termination – TCP echo server using threads – Mutexes – condition variables – raw sockets – raw socket creation – raw socket output – raw socket input – ping program – trace route program.
UNIT V SIMPLE NETWORK MANAGEMENT
SNMP network management concepts – SNMP management information – standard MIB’s – SNMPv1 protocol and Practical issues – introduction to RMON, SNMPv2 and SNMPv3.
TEXT BOOKS
W. Richard Stevens, “UNIX NETWORK PROGRAMMING Vol-I” Second Edition, PHI / Pearson Education, 1998. (Units – I, II, III & IV.) (Chapter – 1-10, 23, 25)
William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON 1 and 2”, Third Edition, Addison Wesley, 1999. (Unit - V) (Chapter – 4-7)
REFERENCE
D.E. Comer, “Intrenetworking with TCP/IP Vol- III”, (BSD Sockets Version), second Edition, PHI, 2003.
IT1352 CRYPTOGRAPHY AND NETWORK SECURITY
AIM
To understand the principles of encryption algorithms; conventional and public key cryptography. To have a detailed knowledge about authentication, hash functions and application level security mechanisms.
OBJECTIVES
To know the methods of conventional encryption.
To understand the concepts of public key encryption and number theory
To understand authentication and Hash functions.
To know the network security tools and applications.
To understand the system level security used.
UNIT I INTRODUCTION
OSI Security Architecture - Classical Encryption techniques – Cipher Principles – Data Encryption Standard – Block Cipher Design Principles and Modes of Operation - Evaluation criteria for AES – AES Cipher – Triple DES – Placement of Encryption Function – Traffic Confidentiality
UNIT II PUBLIC KEY CRYPTOGRAPHY
Key Management - Diffie-Hellman key Exchange – Elliptic Curve Architecture and Cryptography - Introduction to Number Theory – Confidentiality using Symmetric Encryption – Public Key Cryptography and RSA.
UNIT III AUTHENTICATION AND HASH FUNCTION
Authentication requirements – Authentication functions – Message Authentication Codes – Hash Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure Hash Algorithm – RIPEMD – HMAC Digital Signatures – Authentication Protocols – Digital Signature Standard
UNIT IV NETWORK SECURITY
Authentication Applications: Kerberos – X.509 Authentication Service – Electronic Mail Security – PGP – S/MIME - IP Security – Web Security.
UNIT V SYSTEM LEVEL SECURITY
Intrusion detection – password management – Viruses and related Threats – Virus Counter measures – Firewall Design Principles – Trusted Systems.
TUTORIAL
TEXT BOOK
1. William Stallings, “Cryptography And Network Security – Principles and Practices”, Prentice Hall of India, Third Edition, 2003.
REFERENCES
1. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.
2. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001.
3. Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Third Edition, Pearson Education, 2003.
CS1253 VISUAL PROGRAMMING
AIM
To make the students to understand the windows programming concepts including Microsoft Foundation Classes.
OBJECTIVES
To introduce the concepts of windows programming
To introduce GUI programming using Microsoft Foundation Classes
To enable the students to develop programs and simple applications using Visual C++
UNIT I WINDOWS PROGRAMMING
Windows environment – a simple windows program – windows and messages – creating the window – displaying the window – message loop – the window procedure – message processing – text output – painting and repainting – introduction to GDI – device context – basic drawing – child window controls
UNIT II VISUAL C++ PROGRAMMING – INTRODUCTION
Application Framework – MFC library – Visual C++ Components – Event Handling – Mapping modes – colors – fonts – modal and modeless dialog – windows common controls – bitmaps
UNIT III THE DOCUMENT AND VIEW ARCHITECTURE
Menus – Keyboard accelerators – rich edit control – toolbars – status bars – reusable frame window base class – separating document from its view – reading and writing SDI and MDI documents – splitter window and multiple views – creating DLLs – dialog based applications
UNIT IV ACTIVEX AND OBJECT LINKING AND EMBEDDING (OLE)
ActiveX controls Vs. Ordinary Windows Controls – Installing ActiveX controls – Calendar Control – ActiveX control container programming – create ActiveX control at runtime – Component Object Model (COM) – containment and aggregation Vs. inheritance – OLE drag and drop – OLE embedded component and containers – sample applications
UNIT-V ADVANCED CONCEPTS
Database Management with Microsoft ODBC – Structured Query Language – MFC ODBC classes – sample database applications – filter and sort strings – DAO concepts – displaying database records in scrolling view – Threading – VC++ Networking issues – Winsock – WinInet – building a web client – Internet Information Server – ISAPI server extension – chat application – playing and multimedia (sound and video) files
TEXT BOOKS
1.Charles Petzold, “Windows Programming”, Microsoft press, 1996 (Unit I – Chapter 1-9)
2. David J.Kruglinski, George Shepherd and Scot Wingo, “Programming Visual C++”, Microsoft press, 1999 (Unit II – V)
REFERENCES
1. Steve Holtzner, “Visual C++ 6 Programming”, Wiley Dreamtech India Pvt. Ltd., 2003.
IT1353 EMBEDDED SYSTEMS
AIM
To give sufficient background for undertaking embedded systems design.
OBJECTIVES
To introduce students to the embedded systems, its hardware and software.
To introduce devices and buses used for embedded networking.
To explain programming concepts and embedded programming in C and C++.
To explain real time operating systems, inter-task communication and an exemplary case of MUCOS – IIRTOS.
UNIT I INTRODUCTION TO EMBEDDED SYSTEMS
Definition and Classification – Overview of Processors and hardware units in an embedded system – Software embedded into the system – Exemplary Embedded Systems – Embedded Systems on a Chip (SoC) and the use of VLSI designed circuits
UNIT II DEVICES AND BUSES FOR DEVICES NETWORK
I/O Devices - Device I/O Types and Examples – Synchronous - Iso-synchronous and Asynchronous Communications from Serial Devices - Examples of Internal Serial-Communication Devices - UART and HDLC - Parallel Port Devices - Sophisticated interfacing features in Devices/Ports- Timer and Counting Devices - ‘12C’, ‘USB’, ‘CAN’ and advanced I/O Serial high speed buses- ISA, PCI, PCI-X, cPCI and advanced buses.
UNIT III PROGRAMMING CONCEPTS AND EMBEDDED PROGRAMMING IN C, C++
Programming in assembly language (ALP) vs. High Level Language - C Program Elements, Macros and functions -Use of Pointers - NULL Pointers - Use of Function Calls – Multiple function calls in a Cyclic Order in the Main Function Pointers – Function Queues and Interrupt Service Routines Queues Pointers – Concepts of EMBEDDED PROGRAMMING in C++ - Objected Oriented Programming – Embedded Programming in C++, ‘C’ Program compilers – Cross compiler – Optimization of memory codes.
UNIT IV REAL TIME OPERATING SYSTEMS – PART - 1
Definitions of process, tasks and threads – Clear cut distinction between functions – ISRs and tasks by their characteristics – Operating System Services- Goals – Structures- Kernel - Process Management – Memory Management – Device Management – File System Organisation and Implementation – I/O Subsystems – Interrupt Routines Handling in RTOS, REAL TIME OPERATING SYSTEMS : RTOS Task scheduling models - Handling of task scheduling and latency and deadlines as performance metrics – Co-operative Round Robin Scheduling – Cyclic Scheduling with Time Slicing (Rate Monotonics Co-operative Scheduling) – Preemptive Scheduling Model strategy by a Scheduler – Critical Section Service by a Preemptive Scheduler – Fixed (Static) Real time scheduling of tasks - INTER PROCESS COMMUNICATION AND SYNCHRONISATION – Shared data problem – Use of Semaphore(s) – Priority Inversion Problem and Deadlock Situations – Inter Process Communications using Signals – Semaphore Flag or mutex as Resource key – Message Queues – Mailboxes – Pipes – Virtual (Logical) Sockets – Remote Procedure Calls (RPCs).
UNIT V REAL TIME OPERATING SYSTEMS – PART - 2
Study of Micro C/OS-II or Vx Works or Any other popular RTOS – RTOS System Level Functions – Task Service Functions – Time Delay Functions – Memory Allocation Related Functions – Semaphore Related Functions – Mailbox Related Functions – Queue Related Functions – Case Studies of Programming with RTOS – Understanding Case Definition – Multiple Tasks and their functions – Creating a list of tasks – Functions and IPCs – Exemplary Coding Steps.
TOTAL : 45
TEXTBOOKS
1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-Hill, First reprint Oct. 2003
REFERENCES
Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes,
David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000.
Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design – Harcourt India, Morgan Kaufman Publishers, First Indian Reprint 2001
Frank Vahid and Tony Givargis, Embedded Systems Design – A unified Hardware /Software Introduction, John Wiley, 2002.
MA1251 NUMERICAL METHODS
AIM
With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically.
OBJECTIVES
At the end of the course, the students would be acquainted with the basic concepts in numerical methods and their uses are summarized as follows:
The roots of nonlinear (algebraic or transcendental) equations, solutions of large system of linear equations and eigenvalue problem of a matrix can be obtained numerically where analytical methods fail to give solution.
When huge amounts of experimental data are involved, the methods discussed on interpolation will be useful in constructing approximate polynomial to represent the data and to find the intermediate values.
The numerical differentiation and integration find application when the function in the analytical form is too complicated or the huge amounts of data are given such as series of measurements, observations or some other empirical information.
Since many physical laws are couched in terms of rate of change of one/two or more independent variables, most of the engineering problems are characterized in the form of either nonlinear ordinary differential equations or partial differential equations. The methods introduced in the solution of ordinary differential equations and partial differential equations will be useful in attempting any engineering problem.
UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS
Linear interpolation methods (method of false position) – Newton’s method – Statement of Fixed Point Theorem – Fixed point iteration: x=g(x) method – Solution of linear system by Gaussian elimination and Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method – Eigenvalue of a matrix by power method.
UNIT II INTERPOLATION AND APPROXIMATION
Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s forward and backward difference formulas.
UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION
Derivatives from difference tables – Divided differences and finite differences –Numerical integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpson’s rules.
UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS
Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne’s and Adam’s predictor and corrector methods.
UNIT V BOUNDARY VALUE PROBLEMS IN ordinary AND PARTIAL DIFFERENTIAL EQUATIONS
Finite difference solution of second order ordinary differential equation – Finite difference solution of one dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two dimensional Laplace and Poisson equations.
TUTORIAL
TOTAL : 60
TEXT BOOKS
Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education Asia, New Delhi, 2002.
Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, 1999.
REFERENCES
Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co. Ltd., New Delhi, 2003.
Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd., Singapore, 2002.
CS1255 VISUAL PROGRAMMING LAB
LIST OF EXPERIMENTS
Windows SDK / Visual C++
Writing code for keyboard and mouse events.
Dialog Based applications
Creating MDI applications
Visual C++
Threads
Document view Architecture, Serialization
Dynamic controls
Menu, Accelerator, Tool tip, Tool bar
Creating DLLs and using them
Data access through ODBC
Creating ActiveX control and using it
CS1305 NETWORK LAB
(all the programs are to be written using C)
Simulation of ARP / RARP.
Write a program that takes a binary file as input and performs bit stuffing and CRC Computation.
Develop an application for transferring files over RS232.
Simulation of Sliding-Window protocol.
Simulation of BGP / OSPF routing protocol.
Develop a Client – Server application for chat.
Develop a Client that contacts a given DNS Server to resolve a given host name.
Write a Client to download a file from a HTTP Server.
Study of NS2.
Study of Glomosim / OPNET.
MG1401 TOTAL QUALITY MANAGEMENT
OBJECTIVE
To understand the Total Quality Management concept and principles and the various tools available to achieve Total Quality Management.
To understand the statistical approach for quality control.
To create an awareness about the ISO and QS certification process and its need for the industries.
INTRODUCTION
Definition of Quality, Dimensions of Quality, Quality Planning, Quality costs - Analysis Techniques for Quality Costs, Basic concepts of Total Quality Management, Historical Review, Principles of TQM, Leadership – Concepts, Role of Senior Management, Quality Council, Quality Statements, Strategic Planning, Deming Philosophy, Barriers to TQM Implementation.
TQM PRINCIPLES
Customer satisfaction – Customer Perception of Quality, Customer Complaints, Service Quality, Customer Retention, Employee Involvement – Motivation, Empowerment, Teams, Recognition and Reward, Performance Appraisal, Benefits, Continuous Process Improvement – Juran Trilogy, PDSA Cycle, 5S, Kaizen, Supplier Partnership – Partnering, sourcing, Supplier Selection, Supplier Rating, Relationship Development, Performance Measures – Basic Concepts, Strategy, Performance Measure.
STATISTICAL PROCESS CONTROL (SPC)
The seven tools of quality, Statistical Fundamentals – Measures of central Tendency and Dispersion, Population and Sample, Normal Curve, Control Charts for variables and attributes, Process capability, Concept of six sigma, New seven Management tools.
TQM TOOLS
Benchmarking – Reasons to Benchmark, Benchmarking Process, Quality Function Deployment (QFD) – House of Quality, QFD Process, Benefits, Taguchi Quality Loss Function, Total Productive Maintenance (TPM) – Concept, Improvement Needs, FMEA – Stages of FMEA.
QUALITY SYSTEMS
Need for ISO 9000 and Other Quality Systems, ISO 9000:2000 Quality System – Elements, Implementation of Quality System, Documentation, Quality Auditing, TS 16949, ISO 14000 – Concept, Requirements and Benefits.
Total : 45
TEXT BOOK
Dale H.Besterfiled, et al., Total Quality Management, Pearson Education, Inc. 2003. (Indian reprint 2004). ISBN 81-297-0260-6.
REFERENCES
James R.Evans & William M.Lidsay, The Management and Control of Quality, (5th Edition), South-Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).
Feigenbaum.A.V. “Total Quality Management, McGraw-Hill, 1991.
Oakland.J.S. “Total Quality Management Butterworth – Hcinemann Ltd., Oxford. 1989.
Narayana V. and Sreenivasan, N.S. Quality Management – Concepts and Tasks, New Age International 1996.
Zeiri. “Total Quality Management for Engineers Wood Head Publishers, 1991.
IT1401 COMPONENT BASED TECHNOLOGY
AIM
To introduce different software components and their application.
OBJECTIVE
· Introduces in depth JAVA, Corba and .Net Components
· Deals with Fundamental properties of components, technology and architecture and middleware.
· Component Frameworks and Development are covered indepth.
UNIT I INTRODUCTION
Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture – components and middleware
UNIT II JAVA BASED COMPONENT TECHNOLOGIES
Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP
UNIT III CORBA COMPONENT TECHNOLOGIES
Java and CORBA – Interface Definition language – Object Request Broker – system object model – portable object adapter – CORBA services – CORBA component model – containers – application server – model driven architecture
UNIT IV . NET BASED COMPONENT TECHNOLOGIES
COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – .NET components - assemblies – appdomains – contexts – reflection – remoting
UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT
Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component framework – directory objects – cross-development environment – component-oriented programming – Component design and implementation tools – testing tools - assembly tools
TEXT BOOK
1. Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”, Pearson Education publishers, 2003
REFERENCES
Ed Roman, “Mastering Enterprise Java Beans”, John Wiley & Sons Inc., 1999.
Mowbray, “Inside CORBA”, Pearson Education, 2003.
Freeze, “Visual Basic Development Guide for COM & COM+”, BPB Publication, 2001.
Hortsamann, Cornell, “CORE JAVA Vol-II” Sun Press, 2002.
IT1402 MOBILE COMPUTING
AIM
To provide basics for various techniques in Mobile Communications and Mobile Content services.
OBJECTIVES
· To learn the basics of Wireless voice and data communications technologies.
· To build working knowledge on various telephone and satellite networks.
· To study the working principles of wireless LAN and its standards.
· To build knowledge on various Mobile Computing algorithms.
· To build skills in working with Wireless application Protocols to develop mobile content applications.
UNIT I WIRELESS COMMUNICATION FUNDAMENTALS
Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.
UNIT II TELECOMMUNICATION NETWORKS
Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite Networks - Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast Systems – DAB - DVB.
UNIT III WIRLESS LAN
Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE 802.11a - 802.11b standards – HIPERLAN – Blue Tooth.
UNIT IV MOBILE NETWORK LAYER
Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – Alternative Metrics.
UNIT V TRANSPORT AND APPLICATION LAYERS
Traditional TCP – Classical TCP improvements – WAP, WAP 2.0.
TOTAL : 45
TEXT BOOKS
1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. (Unit I Chap 1,2 &3- Unit II chap 4,5 &6-Unit III Chap 7.Unit IV Chap 8- Unit V Chap 9&10.)
2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2002. (Unit I Chapter – 7&10-Unit II Chap 9)
REFERENCES
1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education, 2003.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile Computing”, Springer, New York, 2003.
3. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.
CS1354 GRAPHICS AND MULTIMEDIA
AIM
To impart the fundamental concepts of Computer Graphics and Multimedia.
OBJECTIVES
· To study the graphics techniques and algorithms.
· To study the multimedia concepts and various I/O technologies.
· To enable the students to develop their creativity
UNIT I OUTPUT PRIMITIVES
Introduction - Line - Curve and Ellipse Algorithms – Attributes – Two-Dimensional Geometric Transformations – Two-Dimensional Viewing.
UNIT II THREE-DIMENSIONAL CONCEPTS
Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling Transformations – Three-Dimensional Viewing – Color models – Animation
UNIT III MULTIMEDIA SYSTEMS DESIGN
An Introduction – Multimedia applications – Multimedia System Architecture – Evolving technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data interface standards – Multimedia Databases.
UNIT IV MULTIMEDIA FILE HANDLING
Compression & Decompression – Data & File Format standards – Multimedia I/O technologies - Digital voice and audio – video image and animation – Full motion video – Storage and retrieval Technologies.
UNIT V Hypermedia
Multimedia Authoring & User Interface – Hypermedia messaging - Mobile Messaging – Hypermedia message component – creating Hypermedia message – Integrated multimedia message standards – Integrated Document management – Distributed Multimedia Systems.
TEXT BOOKS
1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson Education, 2003.
(UNIT I : Chapters 1 to 6; UNIT 2: Chapter 9 – 12, 15, 16)
2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003. (UNIT 3 to 5)
REFERENCES
1. Judith Jeffcoate, “Multimedia in practice technology and Applications”, PHI,1998.
2. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson Education, second edition 2003.
IT1403 SOFTWARE COMPONENTS LABORATORY
LIST OF EXPERIMENTS
COM COMPONENT: Development of simple com components in VB and use them in applications. [2 example].
ENTERPRISE JAVA BEANS: Deploying EJB for simple arithmetic operator.
RMI: Deploying RMI for client server applications. [2 Experiments].
Creation Of DLL Using VB And Deploy it in Java [2 Experiments]
Naming Services In CORBA
DSI, DII IN CORBA.
INTER ORB IN COMMUNICATION [IIOP, IOR] Jac ORB & Visi broker ORB
STUDYING J2EE SERVER.
SIMPLE APPLICATION USING CORBA.
CS1355 GRAPHICS AND MULTIMEDIA LAB 0 0 3 100
1. To implement Bresenham’s algorithms for line, circle and ellipse drawing
2. To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.
3. To implement Cohen-Sutherland 2D clipping and window-viewport mapping
4. To perform 3D Transformations such as translation, rotation and scaling.
5. To visualize projections of 3D images.
6. To convert between color models.
7. To implement text compression algorithm
8. To implement image compression algorithm
9. To perform animation using any Animation software
10. To perform basic operations on image using any image editing software
IT1451 WEB TECHNOLOGY
AIM
To highlight the features of different technologies involved in Web Technology and various Scripting Languages.
OBJECTIVES
Students will get an introduction about various Scripting Languages.
Students will be provided with an up-to-date survey of developments in. Web Technologies.
Enable the students to know techniques involved to support real-time Software development.
UNIT I INTRODUCTION
History of the Internet and World Wide Web – HTML 4 protocols – HTTP, SMTP, POP3, MIME, IMAP. Introduction to JAVA Scripts – Object Based Scripting for the web. Structures – Functions – Arrays – Objects.
UNIT II DYNAMIC HTML
Introduction – Object refers, Collectors all and Children. Dynamic style, Dynamic position, frames, navigator, Event Model – On check – On load – Onenor – Mouse rel – Form process – Event Bubblers – Filters – Transport with the Filter – Creating Images – Adding shadows – Creating Gradients – Creating Motion with Blur – Data Binding – Simple Data Binding – Moving with a record set – Sorting table data – Binding of an Image and table.
UNIT III MULTIMEDIA
Audio and video speech synthesis and recognition - Electronic Commerce – E-Business Model – E- Marketing – Online Payments and Security – Web Servers – HTTP request types – System Architecture – Client Side Scripting and Server side Scripting – Accessing Web servers – IIS – Apache web server.
UNIT IV DATABASE- ASP – XML
Database, Relational Database model – Overview, SQL – ASP – Working of ASP – Objects – File System Objects – Session tracking and cookies – ADO – Access a Database from ASP – Server side Active-X Components – Web Resources – XML – Structure in Data – Name spaces – DTD – Vocabularies – DOM methods.
UNIT V SERVLETS AND JSP
Introduction – Servlet Overview Architecture – Handling HTTP Request – Get and post request – redirecting request – multi-tier applications – JSP – Overview – Objects – scripting – Standard Actions – Directives.
TUTORIAL
TEXT BOOK
Deitel & Deitel, Goldberg, “Internet and world wide web – How to Program”, Pearson Education Asia, 2001.
REFERENCES
Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and JAVA”, Prentice Hall of India – QUE, 1999.
Aferganatel, “Web Programming: Desktop Management”, PHI, 2004.
3. Rajkamal, “Web Technology”, Tata McGraw-Hill, 2001.
SOURCE:INTERNET
BY:BARAS
Subscribe to:
Posts (Atom)
