Rajiv Gandhi Technological University, Bhopal (MP

B.E. (IT) Information Technology
Revised syllabus and Scheme of Examination effective from July 2007

S.N Cour Course Subject o se Code Cate (New) gory

Period Per Week

Distribution of Marks Total




Theory Practi Internal Exam cal Assessment Exam C MST TW

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

BS 5 BE 301 Mathematics - III HS 2 DC 1 DC 2 CS/ IT Energy Environment 302 Ethics & Society IT 303 OOPs Methodology

3 3 3 3 3 0 0 0 15

1 1 1 1 1 0 0 0 5

0 0 2 2 2 4 1 1

4 4 6 6 6 4 1 1

100 100 100 100 100 500

50 50 50 50 200

20 20 20 20 20 100

30 30 30 50 30 30 200

120 120 200 200 200 100 30 30 1000

CS/IT Electronic Devices & 304 Circuits Data Structure & DC 3 IT 305 Algorithm CS/IT IT 2 Java Technologies 306 NEC C1 NEC C2 IT 307 Self Study IT 308 Seminar/Group Discussion etc. Total

12 32


Basic Sciences Department Core Information Technology subjects Mid Semester Test Credits Practical Hrs


Humanity Sciences Department Inter Disciplinary Non Exam Credit Course Term Work (Session/ Practical) Lecture Hrs Tutorial Hrs


Rajiv Gandhi Technological University, Bhopal (MP)
B.E. (IT) Information Technology
Revised syllabus and Scheme of Examination effective from July 2007

S.No Course Course Subject Categor Codes y (New)

Period Per Week L T P C

Distribution of Marks Theo Practic Internal ry al Assessment Exa Exam MST TW m 100 100 20 20 Total

1 2

DC 4 DC 5

CS/IT 401 CS/IT 402 IT 403 CS/ IT 404 CS/ IT 405 CS/IT 406

Computer System Organization


2 2

0 0

5 5

120 120

Discrete Structures 3 Data Base Management System Analysis & Design of Algorithms Analog & Digital Communication Dot.Net Self Study Seminar/Group Discussion etc.

3 4 5 6 7 8

DC 6 DC 7 DID 1 IT 3

3 3 3 0 0 0

1 1 1 0 0 0

2 2 2 4 1 1

6 6 6 4 1 1

100 50 100 50 100 50 50 -

20 20 20 100

30 30 30 50 30 30 200

200 200 200 100 30 30 1000

NECC IT407 3 NECC IT408 4 Total

15 7

12 34 500 200


Basic Sciences Department Core Information Technology subjects Mid Semester Test Credits Practical Hrs


Humanity Sciences Department Inter Disciplinary Non Exam Credit Course Term Work (Session/ Practical) Lecture Hrs Tutorial Hrs


Category Basic Sciences BS-5

Title Mathematics-III

COURSE CONTENTS Code Credits-4C BE 301 L T P 3 1 0

Theory Papers Max Marks-100 Min Marks-35 Duration-3 Hrs

Unit 1 Functions of Complex Variables: Analytic functions, Harmonic Conjugate, Cauchy - Riemann Equations, Line integral, Cauchy's theorem, Cauchy's Integral formula, Singular points, Poles and Residues, Residue theorem, Evaluation of Real Integral, Bilinear Transformation. Unit 2 Numerical Analysis: Difference operators, Errors and Approximations, Interpolation, Inverse interpolation, Numerical differentiation, Numerical Integration by using Simpson’s method, Weddel’s rule and Gauss legendre open quadrate formula. Unit 3 Solutions of algebraic and transcendental equations( Regular False, Newton-Raphson, Iterative, Graffe’s root squaring methods), Solutions of simultaneous algebraic equations, Solutions of ordinary differential equations ( Tailor’s Series, Picard’s Method, Modified Euler’s method, Runge Kutta Method, Predictor-Corrector Method), Solution of Partial differential equation. Unit 4 Introduction to optimization by linear programming, only two variable problems solution by graphical and simplex method, concept of degeneracy and duality; simple three variable transport and assignment problems and modeling into LPP. Unit 5 introduction to Q theory and Markovian process, time independent property of exponential distribution, solution of only M/M/1 (∞/∞/FCFS) Queues; introduction to design of experiments, factorial design, sampling methods, Taguchi Loss Function, robust design methods, variance reduction and six (±3)σ outliers in quality. References: 1. Kreyszig E; Advanced Engineering Mathematics; Wiley Eastern Limited. 2. Ramana BV; Higher Engineering Mathematics; TMH 3. Grewal BS; Higher Engineering Mathematics; Khanna Publisher. 4. Taha H; Operations Research an Introduction; PHI 5. Ross; Taguchi techniques for Quality engineering, TMH 6. Spiegel; Theory and problems of probability and statistics; TMH 7. Chandrasekharaiah DS; Engineering Maths Part II & III; Prism Books Pvt. 8. Johnson; Miller and Freund’s Probability and statistics for Engineers; PHI. 9. Jaggi, Mathur; Engineering Mathematics; Khanna Publisher.


Category Humanities Science HS 2

COURSE CONTENTS Title Code Credits-4C Energy Environment BM/CS/EC/EE/ L T P Ethics and Society EI/EX/IT 302 3 1 0

Theory Papers Max Mark-100 Min Mark-35 Duration-3Hrs

Unit 1 Energy: linkage with development, world energy scenario, fossil fuel resource- estimates and duration, India’s energy scenario; Finite/ depleting energy resources, coal, oil, gas, nuclear fission, promises and present status of nuclear fusion energy; Renewable energy, solar, hydro, wind, biomass, ocean, tidal, wave and geothermal. Synergy between energy and environment, global environment issues, greenhouse gas emission, global warming, green energy solutions. Unit 2 Society and environment: exponential growth in population, environmentally optimum sustainable population, free access resources and the tragedy of commons; environment problems and impact of P.A.T (Population, Affluence and Technology), environmentally beneficial and harmful technologies; environment impact assessment policies and auditing interaction between environment, life support systems and socio-culture system. Unit 3 Ecosystem: definition, concepts, structure, realm of ecology, lithosphere, hydrosphere, biosphere, atmosphere-troposphere-stratosphere; energy balance to earth, matter and nutrient recycling in ecosystems; nitrogen, oxygen, carbon and water cycles, food producers, consumers and decomposers, food chains; biodiversity, threat and conservation of biodiversity. Worldviews and environmentally sustainable economic growth, introduction to Design For Environment (DFE), product lifecycle assessment for environment and ISO 14000; triple bottom-line of economic, environment and social performance; environmental ethics, its world impact and challenges. Unit 4 (a) Air pollution-primary, secondary; chemical and photochemical reactions, effects of CO, NO, CH and particulates, acid rain, Ozone depletion; monitoring and control of pollutants (b) Noise pollution-sources and control measures. (c) Water pollution, analysis and management, heavy metals- and nuclear pollutions; industrial pollution from paper, pharmacy, distillery, tannery, fertilizer, food processing and small scale industries. Unit 5 Ethics and moral values, ethical situations, objectives of ethics and its study, role morality and conflicts; values, policies and Organization Culture; Non-professional, quasi- and hard- professionals; preventive, personal, common and professional ethics; different ethical value criteria like utilitarian, virtue, right and duty ethics with discussion on the case of priority for improvement of urban (high traffic) or rural (low traffic) intersections causing equal number of fatalities; codes of ethics and their limitations; Institute of engineers code for corporate member, IEEE and ACM professional-code. References: 1. Miller G. T Jr; Living in the environment; Cengage Publisher. 2. Cunningham W; Principles of Environmental Science: TMH 3. Harris CE, Prichard MS, Rabins MJ, Engineering Ethics; Cengage Pub. 4. Martin; Ethics in Engineering; TMH 5. Govindrajan, Natrajan, Santikumar; Engineering Ethics; PHI pub. 6. Rana SVS;Essentials of ecology and environment; PHI Pub. 7. Gerard Kiely, Environmental Engineering; TMH 8. Khan BH; Non Conventional energy resources; TMH Pub. 9. Raynold G.W. “Ethics in Information Technology; Cengage


Marks-100 Min. 5 . 7. Class declarations. The protected interface. Objects interaction. Kahate A. India List of experiments (Expandable): Programming assignments may be given to students so that they can better understand the concepts of object oriented programming such as objects. Object oriented design with C++. Argument passing. Public and protected properties. Abstract base classes. Kamthane. Disinheritance. Redefined methods. Flow chart. Method lookup. aggregate components of objects. Rumbaugh. Multiple inheritance. 3. Unit I : Introduction. Object Oriented Programming With C++. Wiley. objects and classes. Unit II : Identifying objects and classes. Unit IV :Inherited methods. Storage Management : Memory allocation. Ken Barclay. Object Oriented Programming Concepts. Classes. Dynamic allocation. Pearson Education. Inheritance. Message sending. Objects. Wiley. Many to many association. Recursive association. Mandatory profiles. Polymorphism. Abstract classes. References: 1. Object oriented programming in C++ by Robert Lafore. TMH 4. Object oriented programming with C++. 2. inheritance. polymorphism etc. Object oriented analysis and design. Hierarchies of classes. Association. Private operations. Josuttis. India 5. Unit V : Study of C++ as object oriented programming language. Representation of objects.Marks-35 Duration-3hrs. TMH 6. Pearson Education 8. J. Object-Oriented Modeling and Design using UML. Rajesh K Shukla. Modeling. Unit III : Object oriented programming languages. Object Oriented Programming by C++. Relationships. Association between objects. Object declarations.”Object Oriented Programming using Turbo C++”. Balagurusamy. classes.Category Departmental Core DC 2 Course Contents Title Code Credits-6C Object Oriented IT 303 L T P Programming 3 1 2 Methodology Theory Paper Max. Objects as software modules.

TMH5. TMH 4. RC phase shift. h. characteristics. instrumentation amplifier . types. Introduction to IC voltage regulators. TMH 6. FET. Photo diode. Pearson Ed.Integrated Electronics. Zener diode. differential amplifier . TMH Pub. current series and current shunt feedback. Electronic devices and circuits. C amplifiers. Miliman Grabel. Electronics Devices and circuit Theory. fixed and adjustable switching regulators. bandwidth. Pearson Education 3. OP-Amp and its Applications 4. LED. reverse recovery time. Salivahanan. differentiator. current limiting circuits. 555 timer and its application. full power bandwidth. Micro electronics . OP-amp and linear Integrated Circuits.UPS References: 1. class A. voltage to current and current to voltage converters . Unit II Feedback amplifier. and region of operation. bias current. active filters. Unit III Switching characteristics of diode and transistor. Diode and Transistor characteristics 2.parameters equivalent. log and antilog amplifier . PIN diode. L-C (Hartley-Colpitts) oscillators. Power amplifiers. SMPS . summer . Darlington pair. Unit I Semiconductor device. class A B. comparators Schmitt trigger . MOSFET. Linear Integrated Circuits. OFF time. voltage shunt. Transistors BJT.Marks-100 Min. Unit IV Operational amplifier characteristics. temperature dependence and break down characteristics. integrator. 2. 555 timer and its Applications 6 . RobertBoylestad & Nashetsky. load line biasing method. slew rate. Unit V Regulated power supplies. their efficiency and power Dissipation. junction capacitances. type of amplifier. Cllipers and clampers. calculation of differential. voltage-series. Transistor as an amplifier. frequency response. turn ON. Varactor diode. Cascade and cascode amplifier. Monostable. Astable multivibarators. averager . class B. gain. common mode gain and CMRR using hparameters. negative feedback. List of Experiments (Expandable): 1. Transistor Applications (Amplifier and switching) 3. Bistable. Salivahanan. non inverting amplifier . Differential amplifier. Series and shunt regulators. theory of P-N junction. working principal.Marks-35 Duration-3hrs. offset voltage. Multivibrators. transistor as switch. Milliman Hallkias . Sinusoidal oscillators. application .. Boot strapping technique.Category DC 2 Title Electronic Devices and Circuits Course Contents Code CS/IT 304 Credit-6C L T P 3 1 2 Theory Papers Max.inverting . Wien bridge. and Crystal oscillators. Gayakwad.

Array Implementation of stack. Kruse et al.Corman. Binary Trees. Prentice-Hall of India Pvt. Removal of recursion. Unit I Introduction: Basic Terminology. Data structure (Schaum). Lipschutz. Ltd. Application of stack: Conversion of Infix to Prefix and Postfix Expressions and Expression evaluation. Hash Table. Threaded Binary trees. Hash Functions. Connected Component and Spanning Trees. UNIT III Trees: Basic terminology. Tenenbaum. B-trees.. Complete Binary Tree. Dynamic Tree table. Queue. A M. Unit V Graphs: Introduction. D-queues and Priority Queues. . 3. Galgotia Publication Pvt. 4. N Delhi. selection sort Quick Sort. Horowitz and Sahani. Huffman coding Algorithm. Generalized linked list. Array as Parameters. Symbol Table. Representation and Analysis of Arrays. Sparse Matrices. Array and linked implementation of queues. simulating recursion.Marks-35 Duration-3hrs. binary search. Application: Garbage collection and compaction. Data structures using C. Hash Table Implementation. Implementation of Singly Linked List. Sequential Representations of Graphs. Algorithm complexity notations like big Oh. Polynomial Arithmetic. Circular queues. Recursive algorithms. TMH 6. Linked List in Array. UNIT IV Internal and External sorting . Pai. Reference: 1.Insertion Sort. “Fundamentals of data Structures”. Array and Linked Representation of Binary trees. AVL Trees. Single and Multidimensional Arrays. Traversal. UNIT II Stack. Collision Resolution Strategies. Recursion-definition and processes. Linked list. Marks-100 Min. Data Structures Trembley and Sorenson. New Delhi. Ordered List and operations. Minimum Cost Spanning Trees. Data structure and algorithm. Address calculation. Introduction to Algorithm. Ltd.. TMH 2. Pearson Education Asia. Garbage collection. Application: Algebraic Expression. Doubly linked list. Binary Search Tree (BST ). Two-way Header List. Tower of Hanoi Problem. Adjacency Matrices. Merge Sort. Extended Binary Trees. Array Definition. 7 . Searching & Hashing: Sequential search. Static tree table. Delhi2002ISRD Group. Data types and its classification. Storage pools. TMH Publications 5... algebraic Expressions. “Data Structures using C & C++”. Backtracking.Category Departmental Core DC-3 Title Data Structures Course Contents Code Credits-6C CS/IT 305 L T P 3 1 2 Theory Paper Max. “Data Structures and Program Design in C”. Heap Sort. Linked Representation of Stack. Tail recursion. AWL 7. Radix sort. Traversing Binary trees. TMH List of Experiments (expandable): Programs in C relating to different theory units. Bubble Sort. R.

Using JDBC from a Servlet. RMI. Write a program to show Scope of Variables 3. Abstract methods and Classes UNIT–II Java Collective Frame Work . Write a program to show Type Casting in JAVA 5. Implicit Objects. Priorities and Thread Scheduling. JAVA virtual machine. Properties Class. fill. Algorithms add All. References: 1. Scripting. Techmedia. Write a program to show How Exception Handling is in JAVA 6. Write a program to show Polymorphism 8. Peter Norton. Networking: Manipulating URLs. Control Statements. Algorithm shuffle. Generic Classes. Dynamic Memory Allocation. TMH Publications 3. File and Streams. J2EE. Objects. Cay Horstmann. Visibility. MySQL. Private. The Complete Reference: Herbert Schildt.Data Structures: Introduction. Class. Linked List. Multimedia: Applets and Application: Loading. Exception Handling. Inheritance: Polymorphism. Accessing Databases with JDBC: Relational Database. ”JAVA. Installation of J2SDK 2. Networking. Class Priority Queue and Interface Queue. Type-Wrapper Classes for Primitive Types. Deitel & Deitel. Collections Algorithms: Algorithm sorts. Multithreading with GUI. Precedence relations. Write a program to show Access Specifiers (Public. Life Cycle of a Thread.Multithreading: Thread States. Creating and Executing Threads. Manning Publications/Prentice Hall 6. Oracle UNIT–IV Advance Java Technologies . Wiely India. Queues. Stack Class of Package java. Thread Synchronization. SQL. Marks-25 Duration- UNIT-I Basic Java Features . Static Members. et al. copy. Reading a file on a Web Server. Multitier Applications.Servlets: Overview and Architecture. Constant & Variables. Collections: Interface Collection and Class Collections. XML. Stack. Big JAVA. 2. “Peter Norton Guide To Java Programming”. EJB. Handling HTTP get Requests. Java Network Programming . Operators. Operator and Methods Overloading. List of Program to be perform (Expandable) 1. Type Casting. Linked List. Marks-50 Min. Merlin Hughes. TMH 4. How to Program”.C++ Vs JAVA. Animating a Series of Images. Java Server Pages (JSP): Overview. Write a program to show use and Advantages of CONTRUCTOR 8 . Socket programming. max and min Algorithm binary Search. “Programming In Java”. Security and the Network. Setting Up the Apache Tomcat Server. Strings and Arrays. 5. Deploying a web Application. Displaying and Scaling Images. Loading and playing Audio clips UNIT–V Advance Web/Internet Programming (Overview): J2ME. Overloading Generic Methods. Standard Actions. Util. Write a program to show Concept of CLASS in JAVA 4.Category IT-2 Title JAVA Course Contents Code Credits-4C CS/IT/EC/ L T P CE/ME 0 0 4 306 Practical Max. Protected) in JAVA 9. Data Types. Vector. Lists. Un-modifiable Collections. UNIT–III Advance Java Features . Balaguruswamy. Directives. Monitors and Monitor Locks. Methods. Generics: Introduction. E. Pearson. Array List and Iterator. Maps. PHI. Constructors. Trees. Algorithms reverse. First JSP Example. Write a Program to show Inheritance 7.

Write a program to show Interfacing between two classes 11. Write a program to show Life Cycle of a Thread 13. Write a Program to show “HELLO JAVA ” in Explorer using Applet 17. Write a program to Add a Class to a Package 12. 14. 20. Write a program to demonstrate multithreading using Java. Write a program to demonstrate applet life cycle.10. 19. 9 . Write a Program to show Data Base Connectivity Using JAVA 16. Write a program to Hide a Class 15. Write a program to demonstrate concept of servlet. Write a program to demonstrate AWT. Write a Program to show Connectivity using JDBC 18.

Marks: 35 Duration: 3 hrs. Microprogramming. CPU. Memory Hierarchy. Carter. Carl Hamacher: Computer Organization. Instruction formats and addressing modes of basic computer. 2. I/O Interface. TMH 7. PHI 6. System Bus. Register Transfer Language. Program Counter. Gaonkar: Microprocessor Architecture. Associative memory. Pearson Education 3. Vector and array processors. References: 1. Addition. Unit V Multiprocessors: Pipeline and Vector processing.Category DC-4 Title Computer System Organization Course Contents Code CS/EC/IT 401 Credit-4 L 3 T 1 P Theory paper Max. Interrupt structures. CPU and Memory registers. I/O processor. Instruction and arithmetic pipelines. Memory Management Hardware. Arithmetic and Logic Unit: Arithmetic Processor. Cache Memory . TMH 8. Micro program sequencer. Computer Architecture (Schaum). PHI. Programming. Interconnection structure and inter-processor communication. design of arithmetic unit. Instruction Fetch. Virtual memory. Control Memory. Data transfer – Serial / parallel. Micro Instruction formats. Micro operations. Asynchronous data transfer. ISRD group. subtraction. synchronous/asynchronous. Computer orgOrganization. Memory. Instruction register. William Stallings: Computer Organization and Architecture. data movement and manipulation. Floating point and decimal arithmetic and arithmetic units. various subsystems. 8085 instruction set and basic programming. Marks-100 Min.Organization and mappings. Address Sequencing. Penram Int. Micro and nano programmed control unit. Unit I Computer Basics and CPU: Von Newman model. Computer Architecture and Organisations. Tanenbaum: Structured Computer Organization. Unit-IV Memory organization: Memory Maps. Morris Mano: Computer System Architecture. New Delhi 4. 5. J P Hayes. 8085 microprocessor organization Unit-II Control Unit Organization: Hardwired control unit. TMH 10 . interrupt driven and direct memory access.Graw Hills. simplex/half duplex and full duplex. Applications with 8085. Accumulator. I/O. decode and execution. Mc. multiplication and division. Unit-III Input Output Organization: Modes of data transfer – program controlled. 8085 I/O structure.

7. Permutation groups. cyclic groups. East-West Press Pvt. Groups. 2. “Discrete Mathematical Structure with Application CS”. type of functions. “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition. C. Theorem Proving Techniques : Set Theory: Definition of sets. into and onto function. composition of functions.Marks-100 Min.. New Delhi. properties of groups. Subgroup. bounded and complemented lattices. TMH 5. 4. Universal and existential quantifiers. Shortest path in weighted graph. 6. Normal subgroup. Combinatorics: Introduction. Cosets. logical equivalence. Trembley. Narsingh. “Discrete Mathematics and its applications”.Science. Abelian group. types: Semi Groups. factor group. Hasse diagram of partially. J. Equivalence relation. Introduction to finite state machine Finite state machines as models of physical system equivalence machines. Introduction to Eulerian paths and circuits. truth tables. Isomorphism and Homomorphism of graphs. Binomial Theorem. Hasse Diagram and Lattices: Introduction. Lipschutz.L. Function. S. Chand Pub 11 .”. “Graph Theory With application to Engineering and Computer. Particular solutions. properties of Lattices. tautologies. Multigraphs and weighted graphs. Total solutions . Monoid. Theorem proving Techniques: Mathematical induction. logical implications. Unit-I Set Theory. Homogeneous solutions. S k Sarkar “ Discrete Mathematics”. Multimonial Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms . Generating functions . isomorphic ordered set. McGraw Hill. one to one. Proof by contradiction. proofs of some general identities on sets Relation: Definition. inverse function. Krishnamurthy V. Linear recurrence relations with constant coefficients. Rosen. ordered set. types of relation. Unit V Posets. Pictorial representation of relation. Normal Forms. predicates. Graph coloring. 3. Refereences: 1. Ltd. Deo. Finite state machines as language recognizers Unit-IV Graph Theory: Introduction and basic terminology of graphs.Liu. Properties. well ordered set. Basic logical operation. Permutation and combination. Venn Diagrams. Kenneth H. ordered set. Algebra of Proposition. recursively defined functions. Hamiltonian paths and circuits.P & Manohar. Job-Scheduling problem Function: Definition. composition of relations. countable and uncountable sets. pigeonhole principle. “Combinatorics Theory & Application”. PHI. Unit-III Propositional Logic: Proposition. chromatic number. First order logic. McGraw Hill. Discrete mathematics (Schaum). Partial ordering relation.Category Departmental Core DC-5 Title Discrete Structure Course Contents Code Credits-4C CS/IT 402 L T P 3 1 0 Theory Paper Max. Unit-II Algebraic Structures: Definition. Homomorphism and isomorphism of Groups. Relation. example and standard results. Planer graphs. Paths.Marks-35 Duration-3hrs. Solution by method of generating functions. Cycles and connectivity. Isomorphic graphs. Rings and Fields: definition and standard results. Contradictions.

SQL: Data definition in SQL. Relations. TMH 8. Data retrieval queries and update statements. Tuples. Project. update statements and views in SQL QUEL & QBE: Data storage and definitions. multi-valued dependencies. Functions of DBA and designer. “Database Concepts”. Date C J. References: 1. Data independence.Category Departmental Core DC 6 Title Course Contents Code Credits-6C L 3 T 1 P 2 Theory Papers Max. volume 1. “An Introduction To Database System”. Schemas. Relational database. and Relational data model. Attributes. Comparison between the three types of models. Sets.Marks-100 Min. McGraw Hill 3. Data Base IT 403 Management System Unit 1 Basic Concepts: DBMS Concepts and architecture Introduction. Majumdar . Sudarshan. Data models. Schemas and instances. Unit 3: Structured Query Language Relational Query languages: Relational algebra and relational calculus. Oracle 9i Database Administration fundamental – I. student record system. Unit 2: Data models and Relational Databases Various data models. Division. DBMS. Advantages of database systems. Fundamental of Data Base Management System by Leon & Leon. Relational Data models: Domains. Network data model. Dependency preservation and lossless join. Entities and attributes. Unit 5: Advance Concepts: Introduction to: Distributed databases. Relational algebra operations like select. Key attributes. problems with null valued and dangling tuples. Toledo. recovery and transaction processing. Addision Wesley 6. Relationships. outer union. Value. Functional dependency. institute time-table management system. Data base management systems. TMH 7. Basic concepts of Hierarchical data model. Decomposition. Normal forms.TMH 4. 12 . Defining the E-R diagram of database. Review of file organization techniques. security and integrity constraints. hospital management system in RDBMS (preferably ORACLE 9i 10g). concurrent operation on databases. Addision Wesley 2. “Fundamentals Of Database Systems”. Oracle Press. Navathe. Join. Keys.Marks-35 Duration-3 hrs. basic concepts of object oriented data base system and design. Database approach v/s Traditional tile accessing approach. library management system. Silbertz. Integrity constraints. Characteristics of relations. Intension and Extension. Suggested list of experiments(expandable): In this subject the students are supposed to prepare a small database application in complete semester like financial accounting system. Key attributes of relation. Panneeselvam “Database Management System” PHI 5. Korth. Elmasri. Railway reservation system. Entity types. protection. Unit 4: Database Design Data Base Design: Introduction to normalization.

Write a program for minimum spanning trees using Prim’s algorithm. Write a program for Hamiltonian cycle problem. Rivest RL. NP-completeness. Designing algorithms. PHI. Ullmann. Unit V Binary search trees. Horowitz & Sahani. Write a program for traveling salesman problem. Unit III Concept of dynamic programming. height balanced trees. 8. multistage graph. Analysis & Design CS/IT-404 of Algorithm Unit I Algorithms. strassen’s matrix multiplication. Floyd-Warshall algorithm. Robarto Tamassia. knapsack problem. 6. B-trees. Huffman coding.Category Departmental Core DC-7 Title Course Contents Code Credits-6C L 3 T 1 P 2 Theory Papers Max. Dasgupta. 5. 5.Marks-35 Duration-3 hrs. Introduction to Algorithms. preorder. TMH 4. examples of branch and bound method like traveling salesman problem etc. Wiely India List of Experiments( expandable): 1. Meaning of lower bound theory and its use in solving algebraic problem. Write a program for Floye-Warshal algorithm. merge sort. 2-3 trees. 9. 12. algorithms. introduction to parallel algorithms. Unit IV Backtracking concept and its examples like 8 queen’s problem. Write a program for single sources shortest path algorithm. Introduction to branch & bound method. problems based on this approach such as 0/1 knapsack. Write a program for optimal merge patterns. Write a program for Huffman coding. Introduction to divide and conquer technique. Leiserson CE.Marks-100 Min. analyzing algorithms. Write a program for minimum spanning trees using Kruskal’s algorithm. Hamiltonian cycle. job sequencing with deadlines. postorder. Algorithm Design. 4. quick sort. minimum spanning trees. DFS. Unit II Study of Greedy strategy. 10. example binary search. 13 . analysis. Coremen Thomas. 3. Analysis & Design of Algorithm 3. BFS). reliability design. 7. 11. Write a program for Iterative and Recursive Binary Search. Graph coloring problem etc. References: 1. basic search and traversal techniques for trees and graphs (In order. Analysis & Design of Algorithm. Write a program for Merge Sort. heap and heap sort. examples of greedy method like optimal merge patterns. 2. etc. single source shortest path algorithm. Write a program for Strassen’s Matrix Multiplication. 2. design and comparison of various algorithms based on this technique. Michael T Goodrich. asymptotic notations. Write a program for Quick Sort. etc.

Bandwidth comparison of modulation techniques. Differential phase shift keying (DPSK). Transform of Gate. Fourier Transform and its properties. Time division.Information. Quantization.Category DID-1 Course Contents Title Code Analog and BM/CS/EE/IT 405 Digital Communication Credit-6C L T P 3 1 2 Theory Paper Max. Companding. Communication System. Modern Digital and analog communication system. TMH 3. Correlation & Auto correlation. Communication System. Electronic Communication System. multiplexing (TDM). Mutual information. Fano and Huffman coding methods and their efficiency error control coding. Analog and digital communication(Schaum). channel and receiver characteristics. Shannon theorem. Mathematical representation of source. Cyclic code and convolution codes. Power distribution. Shanon. 14 . channel capacity efficiency of noise free channel Binary symmetric channel (BSC) Binary erasure channel (BEC). Repetition of signal. Bandwidth. convolution with impulse function. errors in synchronous detection. Introduction to SSB and VSB Transmission Angle modulation. Thomson/Vikas. Pulse code modulation. Introduction to pulse position and pulse duration modulations. detection. Unit-IV Digital modulations techniques. Unit-V Information theory and coding.Marks-100 Min. Periodic gate. B. Equation and its frequency domain representation. Generation. multiplexed PCM signal. Introduction to probability of error. modulation index frequency spectrum. Introduction of modulations techniques. Channel Bandwidth for PAM-TDM signal Type of sampling instantaneous. Minimum Hamming distance. Unit-II Base band signal. M-Ary PSK. Discovery Press. signal to noise ratio.Amplitude modulation. Hsu. Binary frequency Shift Keying (BFSK). References: 1. offset and non offset quadrature phase shift keying (QPSK). Aperture effect. Power density of periodic gate and impulse function. RZ. NM symmetric Binary channel. Wayne Tomasi. Frank R. Shanon-Hartley theorem (S/N-BW trade off)Source encoding code properties. Taub & shilling. equation and Bandwidth of amplitude shift keying (ASK) Binary Phase Shift keying (BPSK). Electronic Communication system. TMH 4. TMH 2. Linear Block Code. Line Encoding: Manchester coding. Pulse amplitude modulation (PAM). John Willy 6. Frequency and phase modulation equation and their relative phase and frequency deviations. Communication System. 8. NRZ coding.P.Marks-35 Duration-3hrs. causal and non causal system impulse response of ideal low pass filter. Simon Haykins. Digital signal. MODEM. 7. Concept of energy density and power density (Parseval’s theorem). Unit-III Sampling of signal. Unit-I Time domain and frequency domain representation of signal. impulse response of a system. Delta Modulation (DM) and Adaptive Delta Modulation (ADM). M-Ary FSK Quadrature Amplitude modulation (QAM). Martin S. Natural and flat top. convolutions. Differential PCM (DPCM). Dungan. Lathi. Model of a communication system. 5. NBFM and WBFM. AM suppressed carrier waveform equation and frequency domain representation Generation (Balance/Chopper modulator) and synchronous detection technique. Quantization error. need of modulation. Impulse periodic impulse sine and cosine wave. Singh & Sapre. entropies (Marginal and conditional). Roden. sampling theorem for low pass and Band pass signal. Data rate and Baud rate. Bit rate. comparison of various systems. Analog & Digital Communication System.

9. Study of PAM PPM and PDM 3. Study of AVC and AFC. Study of super heterodyne receiver and characteristics of ratio radio receiver. 15 . 10. 2. Time division multiplexing (TDM) and De multiplexing 5. Study of sampling process and signal reconstruction and aliasing. Study of FM modulation and demodulation (Transmitter and Receiver) & Calculation of parameters 8. 4. To construct and verify pre emphasis and de-emphasis and plot the wave forms. Study of ASK PSK and FSK transmitter and receiver.List of Experiments(Expandable) 1. To construct frequency multiplier circuit and to observe the waveform 11. Study of PCM transmitter and receiver. Study of AM modulation and Demodulation techniques (Transmitter and Receiver) Calculate of parameters 7. 6.

ASP . Paul Deitel. xml data source. TMH 3. Creating a COM+ component with C#. adding controls to forms. Interacting with a Windows Service with C# 6. UNIT I Introduction . architecture and component of . using navigation controls. Wiley 5.Net. Perform String Manipulation with the String Builder and String Classes and C#: 9. Inheritance and Polymorphism. ado . Operator Overloading. class library. rich controls. ODBC. Creating Web Application. Using the System . 14. 6. Advanced Features Of C# Interfaces.Component object model. Structure. Data Sources access through ADO. data-reader Data base controls: Overview of data access data control. Presenting and Handling XML. handling Events. Pearson Education 2.Net 13. object data source control. TMH. elements of . site map data source. TMH 4. SQL data source control. 7. using grid view controls. disconnected mode. and syntax of XML.Net. 3. OLEDB. Working with Forms using ASP .Net Course Contents Code Credit-4 CS/IT L T /EE/EX406 - P 4 Practical Max. introduction of web parts. Arrays. study of standard controls. 12. Working with call backs and delegates in C# 2.net control. document type definition (DTD).Net Web Client to Retrieve or Upload Data with C# 10. Using Reflection in C# 7. Emma Minoli . Transactions 15. Classes and Objects. Reading and Writing XML Documents with the XML Text-Reader/-Writer Class and C# 11.net data readers. Web Programming by Chris Bates. UNIT II Basic Features Of C# Fundamentals.Net.NET framework.Category IT-3 Title Dot. overview of ASP.net framework. Sending Mail and SMTP Mail and C# 8. Creating a Windows Service with C# 5.Net Complete Reference by McDonald. Web Services References: 1. Web Commerce Technology Handbook by Daniel Minoli.NET. and using various Tolls UNIT IV Understanding and handling controls events. C# for Programmers by Harvey Deitel. Handling Exceptions. XML Bible by Elliotte Rusty Harold . XML Schema. Windows Forms: All about windows form. Marks: 25 Duration: 3 hrs. Indexers and Collections.Net Complete Reference by Odey. Strings and Regular Expressions. Working with Page using ASP . ADO.Net. using details view and frame view controls. 16 . and SQL connected mode. ADO .NET framework.Net framework. Document object model. TMH List of Experiments/ program (Expandable): 1. creating windows applications. validations controls. 4. Structures. Programming in C#. overview of the ASP . overview of CLR. Delegates and Events. features of . Marks-50 Min. understanding HTML controls. MDI form. Working with Data readers . UNIT V XML: Introducing XML. Code access security with C#. using java script. dataset. UNIT III Installing ASP. Balagurusamy.

Ethics and Management Computer Networks System Programming and Operating System JAVA Programming JAVA Programming (Lab) Self Study Seminar/Group Discussion Total 3 3 T 1 1 P 2 0 C 6 4 I 100 100 II 50 20 20 III 30 50 20 I+II+III 200 120 3 4 DC-10 DC-11 IT 503 IT 504 3 3 1 1 2 2 6 6 100 100 50 50 20 20 30 30 50 50 200 200 5 DC-12 IT 505 3 1 0 4 100 - 20 20 120 6 IT-4 IT 506 0 0 4 4 - 50 - 50 50 100 7 8 NECC-5 NECC-6 IT 507 IT 508 0 0 15 0 0 5 1 1 12 1 1 32 500 200 100 30 30 200 30 30 300 30 30 1000 Minimum Pass marks (A)Theory: 35 Percent (B)Practical:50 Percent Duration [c] Duration of Theory paper 3hrs . BHOPAL Course of study and Scheme of Examination B. Course category Course codes Period per week Subject Theory Distribution of marks Practical Internal Total Assesment MST TW Total L 1 2 DC-8 DC-9 IT 501 IT 502 Data Communication IT Enabled Services.n.RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA. E Information Technology Semester V s.

n. E Information Technology Semester VI s. BHOPAL Course of study and Scheme of Examaination B. Course category Course codes Period per week Subject Theory Distribution of marks Practical Internal Total Assesment MST TW Total I L T P C II 50 50 20 20 III 30 30 50 50 1 2 DC-13 DC-14 3 DC-15 4 5 DC-16 DC-17 6 7 8 DC-18 NECC-7 NECC-8 IT 601 Unix & Shell Programming IT 602 Computer Graphics & Multimedia IT 603 Internet Technology & Network Management IT 604 Web Technology IT 605 Software Engineering & Project Management IT 606 Minor Project IT 607 Self Study IT 608 Seminar /Group Discussion Total 3 3 1 1 2 2 6 6 100 100 I+II+II I 200 200 3 1 0 4 100 - 20 - 20 120 3 3 1 1 2 0 6 4 100 100 50 - 20 20 30 - 50 50 200 120 0 0 0 0 0 0 4 1 1 4 1 1 - 50 - - 50 30 30 50 30 30 100 30 30 15 5 12 32 500 200 100 200 300 1000 Minimum Pass marks (A)Theory: 35 Percent (B)Practical:50 Percent Duration [c] Duration of Theory paper 3hrs .RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA.

Unshielded twisted pair and Shielded twisted pair. Vertical redundancy check. ISDN devices. Baseband and broadband transmission. single bit error. bauds . Branch : Information Technology V sem Course : IT 501 Data Communication Unit I Data and signal-Analog and digital signals. noise. digital subscriber line – ADSL.SDSL.Throughout. References:- .and 7.Nyquist bit rate . error correction. cable standard-Category 5. Error detection .VDSL . Integrated services digital network.STM -1 frame. ISDN interface. distortion. Unit III Telephone Network-Network topology. Non return to zero codes. radio waves. synchronous digital hierarchy ( SDH) . mapping of data signals on STM. twisted pair . modem standard.dial-up modems. Unit IV Switching techniques. Longitudinal redundancy check.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. signaling.DataCommunication Course Contents Course Code IT 501 L 3 Category of Course Course Title Credit-6C Theory Paper Departmental Core DC-8 Data Communication T 1 P 2 Max. and Asynchronous transmission. pleisochronous digital hierarchy( PDH).6.Network interface card. rack. Simplex. Time and frequency domain. microwaves and infrared transmission RJ45.half duplex and fullduplex . straight connection cable coding standards. coaxial cable and fiber optic cable. delay .E. burst error.Frequency division multiplexing. Composite signals. Attenuation. Types of error. cyclic redundancy check.1. pulse code modulation. Information Technology. Unit II Data communication concepts – Data transmission – Parallel and serial transmission. modem. reference points . unipolar and polar line codes. Line configurations-Point to point and point to multipoint configuration. return to zero codes. time division multiplexing and wavelength division multiplexing.Marks-100 Min. synchronous. bit rate. bipolar line codes.Multiplexing.Marks-35 Duration-3hrs. virtual container. V Semester Course: IT .Shannon capacity .Circuit . packet and hybrid switching.cross connection.Jitter. Bandwidth delay product. bit length. Bandwidth.ISDN services.SS7. ISDN Protocols Unit V Transmission media-Guided and unguided media.

coaxial cable and Fiber optic cable 10. TMH 4 th edition Data communication and Computer Networks. TMH “Computer Communications & Networking Technologies”-Michael A. Hancock -Cengage pearsen publications “Network for computer scientists & engineers” –Youlu zheng & shakil akhtar . Forouzan.PHI Learning. Prakash C Gupta . Study of NRZ and RZ Codes . 5. ISDN implementation for internet 6.PHI Learning “Computer Networks” . Oxford pub. Study of cross cable connection and straight cable connection 11. ISDN Devices 7. Case Study of Synchronous and asynchronous transmission 3. 3. Leon-Garcia. Study of digital subscriber line-ADSL for broadband connection 12. 6. Study of twisted pair. “Data communication and networking”. 4.Tanenbaum . Case Study of various multiplexing techniques Case Study of Parallel and serial transmission 5.1. Study of Network Interface Card 9. 2. Study of SDH 8.Widjaja. Suggested List of Experiment 1. Case Study of digital interface RS-232 2. 4. Gallo & William M. “Communication Networks-Fundamental concepts and key Architectures”.

Three-D Framework for Business and IT Strategy Alignment Unit II : Strategic IT Planning Business Implications for IT Strategic and Planning. Max. Strategic IT Planning Motivations. Defining EITA. Imperatives for Outsourcing. Incident Management. Technology Strategy for IT. Desired Qualities of a Program Office Manager. Measuring PMO Performance.Marks-35 DC-9 IT enabled services. Challenges of IT and Business Strategy Alignment. Variants of Outsourcing. Success Factors for PMO. Availability Management. Application Strategy. Ethics and Management IT 502 L 3 1 T Unit I: Business Strategy: Challenges and Opportunities for IT Business Strategy: Challenges and Opportunities in the Globalized. Best Practices for Achieving Good SITP. V Semester Course: IT. Interconnected. Service Delivery. Insourcing. ITIL Overview. Technology Management strategy Framework. Implementation of PMO Strategy. Contents of a Typical Enterprise IT Architecture. Business Process Outsourcing.IT enabled services. Ethics and Management Category of Course Course Title Course Code Credit-4C Theory Paper (ES) P _ Duration-3hrs. Problem Management. Prevalent Technology Reference Architectures Framework and Standards. Unit IV : Copyright and IPR . Service Level Management.E. Difficulties in Developing and Executing SITP. Establish Principles before Practice. IT Management Layers. Stages of IT Strategy Development and Implementation . SITP Process: Prevalent Planning Approaches. Program Management. SITP Approaches: Prevalent Researches. ITIL Service Support Processes. Inhibitors of Business and IT Strategy Alignment. IT Service Continuity Management (ITSCM). Maturity of PMO. Standard for Enterprise IT Architecture. IT Management Strategy.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. Financial Management. Capacity Management.Marks-100 Min. Convergent World. Developing IT Strategy for Competitive Advantage. Benefits of PMO. Information Technology. IT Strategy. PMO Dashboard and Reporting Unit III : IT Service Management Strategy Information Technology Infrastructure Library (ITIL). Project Scope Management.

Caution with Internet . Email Etiquette. Intellectual Property Law. Indian Standards Institution and its role Indian copyright law of 1957 and its most important amendment from a software viewpoint. defining Computer Ethics.by K. Social Networking. Understanding Software Compliance. ease of misuse. Understanding Intellectual property.Understanding the concepts of Copyright. do and don’ts with proprietary data. PHI Marketing of Information Technology. and social conduct. Patents. Spamming. Understanding Professional Responsibility References IT strategy and Management by Sanjiva Shankar Dubey. Unit V : IT ethics Theoretical basis of Computer Ethics.TMH . Software Piracy. computer professional’s behavior.Venkatesh. Broadcasting. Understanding computer crime.

hubs.E.packet delivery & forwarding. “Local area networks ”. study of structured LAN .Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B.Computer Networks Course Contents Course Title Category of Course Departmental Course DC-10 Course Code Credits-6C Theory Paper (DC) Max.HDLC LAN Protocol stack-Logical link control and Media Access Control sublayer.Go back N ARQ . IEEE 802. broadcast and point to point networks. quality of service . Pure and slotted ALOHA protocols. Protocol data unit. Forouzan. Persistent and non persistent CSMA. Introduction to ISO-OSI reference model. Process to process delivery. function of each layer. Computer Networks IT 503 L 3 T 1 P 2 Branch:-Information Technology Course:-IT 503 Computer Networks   Unit I Importance of computer networks. Arpanet . using Ipconfig.2 LLC Frame format Data link layer in the internet. Serial line IP and Pont to point protocol Unit III MAC layer Protocols.Data link layer design issues. 1st edition “Computer Networks” . TMH. ping command . X. Differentiated services LAN-WAN Design and implementation-Configuring TCP/IP.Tanenbaum .TCP . IEEE 802. Dijkstra's.802.4. Stop & Wait protocol . .5. multicast routing protocols. Novel Netware. interfaces and services.3 and Ethernet. Comparison of wired and wireless LAN.PHI Learning. service primitives. study of internetworking devices and their configuration– switches. connection oriented and connectionless services.. framing . FDDI Wireless LAN . Bridges. address mapping . TCP/IP reference model . UDP .congestion control . IEEE standard 802. routers and Gateways References:- 1. static and dynamic allocation .3 cabling. Introduction to Internet protocol IPv4 Unit V Transport layer-Transport services .Marks-35 Duration-3hrs. Routing algorithmLeast Cost. flow & error control . V SEMESTER Course: IT. Bellman-ford. classful & classless addressing . comparison of TCP/IP and ISO-OSI reference model. WIMAX Unit IV The Network layer. unicast routing protocols . 2. INFORMATION TECHNOLOGY. physical addressing.selective repeat ARQ . congestion control algorithms.Marks-100 Min. Internetworking devices. IEEE 802.piggybacking and pipelining . Local area networks and Wide area networks .logical addressing.25 Unit II Data-Link layer: . Carrier sense multiple access. Integrated services.

Study of IOS of routers 13.3. Establishing & studying the various parameters of a home LAN Network 12. Establishment and configuration of LAN 2. 4. etc 9. Configuring routers.5 7. ipconfig.Wiley publication “Computer Communications & Networking Technologies”-Michael A. Case study of STOP AND WAIT Protocols 5. Standards and Interfaces By Black. Study of sliding window protocol 6.N Olifer and V Olifer .3 .7 and crimping of cable in RJ-45 3. PHI learning Suggested List of Experiment 1.6. Study of basic networking commands like ping. Study of FDDI 8. Hancock -Cengage pearsen publications pub. “Computer Networks” . 802. study of IEEE 802. Gallo & William M. bridges and switches and gateways .802. Colour coding standard of CAT 5. Computer Networks: Protocols. Study of WAN 4. Case study of various Routing Strategies 10.4 . Case studies of various Network Topologies 11.

free space managements. thrashing. introduction to distributed systems. Scheduling criteria. deadlock detection. semaphores. Operating system services.E. Scheduling algorithms. File organization. threads. Unit V Disk scheduling. Cache Memory Organization. page replacement algorithms. First-Fit and Worst Fit Allocation. directory systems. paging. and paging combined with segmentation. access methods. file protection. algorithm evaluation. Types of operating Systems. Macros and Macro Processors. Security Breaches. Role of Operating System in Security. Methods for deadlock handling. allocation of frames. interprocess communication. file sharing implement issue.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. system protection. Unit II Basic concepts of CPU scheduling. multiple processor scheduling. deadlock avoidance. operations on processes. demand paging. critical section problem. classical problems of synchronization. recovery from deadlock. File Management in Linux. Fixed and Dynamic Partitions. file organization & access mechanism. File manager. Compiler. . deadlock characterization.Marks-100 Min. V SEMESTER COURSE: IT -System Programming and Operating System Course Contents Course Code Category of Course Course Title Credits-6C Theory Papers (DC) Departmental Course (DC-11) System Programming and Operating System L T 1 P 2 Max. Software Tools . allocation methods. Assemblers. Unit III Deadlock problem. IT 504 3 Branch: Information Technology V Semester Course: System Programming and Operating System Unit I Introduction Language Processors. System Protection. INFORMATION TECHNOLOGY.Marks-35 Duration-3 hrs. Best-Fit. demand segmentation. Linkers. file concepts. Introduction to Operating Systems. logical and physical address space. Concepts of memory management. deadlock prevention. Unit IV Concepts of virtual memory. swapping. precedence graphs. Language Processing Activities and Language Processors Development Tools. Process concept. segmentation. and Password Managment.

4. . 9. 11. PHI Learning Suggested List of Experiment 1.References: 1. Program to implement LFU page replacement. 6. 4.”Operating system”. 5. 5. 2. Willey Pub Tanenbaum “ Modern Operating System” PHI Learning. 3. Stuart. Program to implement classical inter process communication problem(producer consumer). M. Flynn “ Operating Systems”. Dhamdhere. ”System Programming and Operating System”. Program to implement FCFS CPU scheduling algorithm. 6. 2. Program to implement SJF CPU scheduling algorithm. Program to implement classical inter process communication problem(Dining Philosophers).TMH. Design & Applications”. 8. Silberschatz . Program to implement Round Robin CPU scheduling algorithm.”Operating System Principles. Program to implement FIFO page replacement algorithm. 7. 3. Program to implement Optimal page replacement.Cengage Learning Operating System : Principle and Design by Pabitra Pal Choudhury. Program to implement Priority CPU Scheduling algorithm. Program to implement classical inter process communication problem(Reader Writers). Program to implement LRU page replacement algorithm 10. Cengage Learning.

Focus Event. the class hierarchy for applets.Layout Managers and Menus:adding and removing control. Item Event. Self contained events. Adapter classes. The event class hierarchy. Access specifies. Mouse Event. Applets: Applet security restrictions.AWT classes. Java Event Handling Model: Java’s event delegation model – Ignoring the event.Labels. The relationship between interface.Information Technology Course:-IT 505 JAVA Programming UNIT-I The Java Environment: Java Development Kit (JDK) . arrays.Marks-35 Departmental Course DC-12 JAVA Programming IT 505 Branch:. Max.Frame. parameters and event source.flow layout. Java Applications Programming Interface (API).Window. Information Technology. methods called. inheritance. . Card layout.Container.Marks-100 Min. encapsulation. Container Event. Window Event. interpreter.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. implementing & applying interfaces. Frame. extending interfaces. Memory allocation and garbage collection UNIT-II AWT:Containers and components. Text Event. Text area. Eye Event. appletviewer. Check Box. V Semester Course: IT. Java as an object oriented language:objects. Scroll bar. debugger). Event classes action Event.JAVA Programming COURSE CONTENTS CATEGORY OF COURSE COURSE TITLE COURSE CODE CREDIT-6C THEORY PAPER ( DC) L 3 T 1 P 2 Duration-3hrs. polymorphism. Border layout.scope and lifetime. HTML Tags for applet Introduction to Swing: swing library. Constructors.AWT Controls. Choice .Java virtual machine . Java programming environment (compiler.Canvas. finalize () method. Delegating events. classes. Scroll list.Panel.menu. Button. Grid layout. this pointer. Building applications using Swings . abstract classes and abstract methods.and software reuse. Adjustment Event. Life cycle of applet. Radio Button. Basic idea of application and applet. Packages. Layout managers. : defining an interface. window fundamentals: Component. variables in interfaces. Copy constructor.E.

JDK 5 Ed. Wiley India.Finally. 4.Catch.UNIT-III Multithreading and Exception Handling: Overview of simple threads. RMI:Client/Server architecture. JDBC: JDBC-ODBC bridge. Steps of creating RMI Application and an REFERENCES:1. Random access file.Exception types:. output stream. Thread scheduling. PHI Learning . stream classes The Byte stream : Input stream. Naughton & Schildt “The Complete Reference Java 2”.stack based execution and exception propagation. file input stream. Basic idea of exception handling. Sun Microsystems lvan Bayross “Java 2. Java Programming for the absolute beginners By Russell. Daemon thread. Basic idea of multithreaded programming. Navigating the result set object contents.How to Program:” Pearson Education. The driver manager..sql Package. proxy servers. UNIT-V Java Networking : exploring java. 2. synchronized methods. file output stream. buffered writer. Asia Horstmann & Cornell “Core Java 2” (Vol I & II ) . synchronized block. Tata McGraw Hill Deitel “Java. Client server. 3. print stream. Connecting to Remote database.net packageNetworking Basics : Socket. Internet addressing.Assertions UNIT-IV Input/Output : Exploring Java I/O.Throw statement. print writer. Buffered reader.Producer-consumer relationship. UDP sockets. The JDBC exception classes. 5. TCP sockets. Directories. The connectivity model. 6. RMI registry services. serialization. Exception Handling:Try. the character streams. reserved sockets. java.0” : BPB publications Ivor Horton’s “Beginning Java 2.Thread synchronization:Locks. example..

finally.Dialog .super keyword. JPanel. ArrayList. labeled continue) . List Map. for. final class. Event handlers. method overriding. static method. Math Class.Scaner . Panel . Panel. Choice. Set. Lifecycle of an Applet. JButton. Icon. DataInputStream. Collection. DataOutputStream.Graphics2D and drawing Image. InputStreamReader. using package. . notify. Constructor and finalize method . LookAndFeel. ObjectInputStream. JApplet. List. OutputStream. . Unit -IV Abstract Window toolkit. Iterator. Control Statement (if.Writer. Layout Manager.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. this keyword. break. dynamic method dispatch. throw.JTextArea.lifecycle of a thread. FileWriter. constructors in Inheritance . Information Technology. Try. CheckBox ).JList JTree. static data member. Compiler options and JVM options. extending Interface.. JTable. Label. while. Containers.FileInputStream. JDK Tool(Java Compiler. if…else. Event Source. Wrapper Classes. Applet. V Semester Course: IT 506 CP V COURSE CONTENTS COURSE COURSE CREDIT-4C TITLE CODE JAVA Programming (Lab) L IT 506 4 T P CATEGORY OF COURSE Information Technology IT-4 PRACTICAL Max. Unit -III Command Line Arguments. Creating Thread . throws. static block. Inheritance. GUI Component (Button. TextField. File Class.E. FileOutputStream. TextArea.String Class. Event classes.Classes and object scope and life time . Javadoc. RandomAccessFile.final data member. awt package. defining an Interface. Data type.Memory allocation and garbage collection. final method .JCheckBox.Compile and run java program. do…while. Unit-II creating package . Frame class.Swing.ObjectOutputStream. catch. JFrame. labeled break. InputStream . JTextField.Marks-50 Min. Implementing and applying interface. thread synchronization. switch …case.JRadioButton. swing complonents. Operators . Object Serialization. continue. BufferedReader . Object Class.Marks-25 Unit I JDK Installation and setting the path. Runnable Interface. wait. String Buffer class.Reader. Java Virtual Machine. Thread class and its method. instance block. ThreadGroup class. Debugger.. abstract method and abstract class. Jar). StringTokenizer Class. JLabel. SortedSet. FileReader. Appletviewer. Arrays .Access specifies.

Horstman and Cornell. insert. Programs on chatting 1-1 & 1-M (Threading). Herbert Schildt. Connection Pooling. Classes to be covered Socket. Passing Object in RMI.net – networking classes and interfaces. Internet addressing and URL. Types of JDBC Drivers. TMH 2. URL connections. Proxy servers. ResultsetMetaData. ResultSet. Implementing Remote Interface. Inserting and updating records. Pearson Education 3. IPAddress.Writing RMI Server. Core Java Volume-I. Pearson Education . Introduction of RMI & Architecture . update. delete. Implementing TCP/IP based Server and Client. Java 2 Complete Reference (5th Ed ).Implementing UDP based Server and Client DatagramPacket and DatagramSocket. Core Java Volume-II. ServerSocket. Designing Remote Interface. Writing JDBC applications using select. Horstman and Cornell. Types of Statement objects (Statement. Creatting RMI Client. Socket. java.Unit-V Networking basics. port. PreparedStatement and CallableStatement). Reference Books:- 1.Implementing RMI .

File creation. Advantage and disadvantage of buffer cache.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. STAT and FSTAT.Networking tools:Resolving IP addressing. Directories conversions of a path name to an inode. Unix commands. UNIT-IV Introduction to shell scripts: shell Bourne shell.Marks-35 Duration-3hrs.Marks-100 Min. PIPES mounting and unmounting files system. scripts. Awk arithmetic and variables. Structure of regular. editors. the chop() function.UNIX AND SHELL PROGRAMMING Course Contents CATEGORY OF COURSE COURSE CREDIT-6C THEORY PAPER TITLE COURSE CODE DC Departmental Course DC-13 Unix And Shell Programming L IT. metacharacters and environment. user perspective.Information Technology Course:. C shell. job control. change owner and change mode.E. and operators. Kernel data Structure. shell variables. Information Technology. if and case statements. Link Unlink UNIT–III Structures of Processes and process control: Process states and transitions layout of system memory. manipulation of process address space. Structure of the buffer pool. Shell programming. variable and operators. Inode assignment to a new file. O/S services assumption about Hardware The Kernel and buffer cache architecture of Unix O/S. Super block. Allocation of disk blocks. TELNET. Buffer headers. Socket programming. Reading and writing disk block. for while and until loops. changing the size of a process. Branch:. grep family. UNIT-V Introduction of Awk and perl Programming: Awk pattern scanning .601 3 T 1 P 2 Max. The user Id of a process. permissions. FTP. Operation of special files change directory and change root.TIME. System concepts. Killing process with signals.IT 601 Unix And Shell Programming UNIT–I General Overview of the System: System structure. References:- . Scenarios for retrieval of the buffer. Sleep process creation/termination.CORN. BEGIN and END patterns. Open read write file and record close. introduction of Linux structure . VI Semester Course:-IT. perl. UNIT–II Internal Representation of Files: Inodes. scheduling commands: AT and BATCH. the context of a process. System administration. functions.

Write your own profile 14.Implement WE Command in C 3.2001 Suggested list of experiments Installation of Unix/Linux 1.Write a shell program to find factorial 10.Implement LS command in C 7. Sumitabha Das “ Unix concepts and Applications”.Prata “Advanced UNIX: A Programming's Guide”. B. Pearson Education. BPB Publications.Write the program to find biggest among 3 numbers using 9. 5.Study about the Unix system variables 8.Implement More command in C 5. Beck “Linux Kernel. Y.W.Write a shell program to sort the strings using arrays shell . New Delhi.Implement Link & Unlink in C 6.J. Kernighan & R.S. “The UNIX Programming Environment”.Write a shell program to check whether the user is logged (or) not 12.Tata McGraw Hill. PHI Learning 2. BPB Pub.Write a shell program to check the given string is Palindrome (or) not 11.Second Edition. Bach “Design of UNIX O.Implement Grep command in C 4.Write a shell program to wish the user those who login to the system 13.Kanetkar “Unix shell programming”.Study about the General Purpose utilities a) Banner b)cal c)date d)calender e)tty f)bc g) spell & fspell 2.Write a shell program to find the biggest among numbers using positional parameters 15.1. M. Pike. Asia. S. PHI Learning 4. 3. 6. “.

RTF. . screen coordinate system. simple DDA. working principles of keyboard. positioning techniques. Unit III 2D & 3D Co-ordinate system. B-spline Method. Unit IV An Introduction – Multimedia applications – Multimedia System Architecture – Evolving technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data interface standards – Multimedia Databases. Reflection Inverse transformation. Branch:.E. colour monitors. graphical input techniques. rubber band techniques.Computer Graphics and Multimedia Course Contents COURSE CODE CATEGORY OF COURSE COURSE TITLE CREDIT-6C THEORY PAPER (DC) Departmental Course DC-14 Computer Graphics and Multimedia L IT 602 3 T 1 P 2 Max. refreshing. Information Technology.Marks-100 Min. JPEG. world coordinate system. Multimedia components. Polygon Clipping algorithms. specular reflection. mouse scanner. IDE. phong shading. interlacing. image representation. Basic illumination model. Multimedia -Tools. Unit II Scan conversion techniques. Representation of 3D object on 2D screen. dragging etc. SCSI. line drawing. color models like RGB. digitizing camera. – Multimedia I/O technologies . tablets and joysticks. Storage tube displays. track ball . Bresenham’s Algorithm. Point Clipping. Bresenham’s Algorithm. CMY. parallel and perspective projection.Digital voice and audio – Video image and animation– Full motion video – Storage and retrievaltechnologies. Circle drawing. DIB. Introduction to Hidden Surface elimination. Gourand shading ray tracing. general method. inkjet laser printers. presentation tools. symmetric DDA. curves. VI Semester Course: IT. MPEG. parametric function. Authoring tools . HSV etc. flickring. MIDI. MCI. Translation.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. Beizier Method. Rotation. Composite transformation. working principle of dot matirix. Scaling. diffuse reflection.Information Technology Course:. Line Clipping Algorithms. YIQ. display processors resolution.Marks-35 Duration-3hrs. Unit V Compression & Decompression – Multimedia Data & File Format standards :-TIFF.IT 602 Computer Graphics & Multimedia Unit I Introduction to Raster scan displays. Multimedia Hardware.

. 3. . McGraw Hill publication .References:1. 8. “Computer Graphics C Version”. PHI Learning. 2003. 7. 15.Pauline Baker. “Multimedia making it work”. 2008. 9.Write a program to perform various transformations on line .Study of various Multimedia file formats:-RTF. Amarendra N Sinha & Arun D Udai . 3. 6.Write a program to implement Liang-Bersky line clipping algorithm.MPEG.Write a program to convert a color given in RGB space to it’s equivalent CMY color space. 12.TIFF etc. Tay Vaughan. “Computer Graphics”.Write a program to implement Bresenhames’ line drawing algorithm.Write a program to implement DDA line drawing algorithm 2. square & rectangle. 5. PHI Learning Suggested list of experiment 1. Tata McGraw Hill edition.MIDI. 4.Write a program to implement JPEG compression scheme for still images. 3rd Indian reprint edition .Write a program to implement Cohen-Sutheland polygon clipping algorithm to clip a polygon with a Pattern.GIF. Pearson Education. Prabat K Andleigh and Kiran Thakrar.Write a program to implement Bresenhames’ circle drawing algorithm. Donald Hearn and M. 14. 13.Write a program to perform Packbits compression & decompression.JPEG.Study of various Multimedia Authoring Tools. “Multimedia Systems and Design”. 10. 4. 2. Fundamental of Computer Graphics and Multimedia.Write a program to implement Cohen Sutherland line clipping algorithm. Mukherjee.Write a program to draw an ellipse using Bresenhames’ algorithm. 11. Write a program to convert a BMP file into either JPEG or GIF file.Write a short program to create a TIFF file using bitmap segments and text files as the TIFF File components.

timeout of connection establishment. state transition diagram. VI Semester Course: IT. Accounting management . port no. encapsulation & decapsulation . Supernetting.Information Technology Course:-IT 603 Internet Technology & Network management Unit-I Binding Protocol Address. ICMP Header. ICMP message types. FTP:-Connection. Unit-III TCP: Introduction. UDP checksum. headers. UDP header. SNMP:-Management components.command processing . Encapsulation. maximum segment size.E. Subnet mask. comparison of Ipv4 and Ipv6. Ipv4Datagrams.OSPF.packet format.Marks-35 Branch:. Security management . TFTP.SCTP-Services . services. frame format and addressing. policy based management .Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B.half. IGMP-IGMP message. T P CATEGORY OF COURSE THEORY PAPER (DC) Departmental Course DC-15 Max. TCP timers UDP: Introduction. Unit-IV BOOTP:-operation .DHCP:-Address allocation.Link State Routing. . Unit-II ICMP: Introduction. IP routing. Information Technology. ICMP timestamp request and reply.operation. Encapsulation. ping program .SMI.Internet Technology and Network Management COURSE CONTENTS COURSE COURSE CREDIT-4C TITLE CODE Internet Technology and Network Management L IT 603 3 1 0 Duration-3hrs.Unicast Routing protocols . and socket addresses . ARP & RARP .configuration & packet Format. packet format. connection establishment and termination.MIB. Performance management .packet format. E-Mai:-SMTP . Internet protocol: Introduction. .RIP. Subnet addressing. Intra & inter domain routing-distance vector routing. Fault Management . Ipv4 header.Path Vector Routing .Address Resolution Protocol & RARP. Report Management . Communication .transmission sequence number. DNS in the internet .DNS:Distribution of name spaces .stream identifier . Fragmentation and Reassembly.stream sequence number.queuing .POP & IMAP .Marks-100 Min. close. trace route.special case of IP addresses Ipv6-Motivation.encapsulation.BGP. Unit-V Network management applications:-Configuration management.UDP operations .

“Computer Networks and Internets”. Pearson 3.References:1. I. Richard Stevens. 4.“TCP/IP-Protocol suite”. Forouzan.E.“TCP/IP Illustrated” Volume I .“Network management.Comer.principles & practice” Mani Subramaniam .W. PHI Learning . D. Addison Wesley Internetworking with TCP/IP Vol. Comer. TMH 3rd edition 2. Pearson education. II & III.

E. Introduction World Wide Web (WWW).IT 604 Web Technologies UNIT I History of the internet. security on the web. Document tree. Loops. VIII semester Course: IT. DTD files and basics of Cascading Style Sheet (CSS). internet address and domains. Arrays. DOM event handling. Java Remote Method Invocation (RMI) . N-tier architecture. services of web server. format of the URL. feature of HTTP protocol HTTP request-response model.Information Technology Course:. Operators.Marks-100 Min. router. Departmental Course DC-16 Branch:. introduction to Apache web server. multimedia server. Web server and its deployment. multitier web applications.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B.Marks-35 Duration-3hrs. element. conditional statements.Web Technologies Course Contents COURSE Credit-6C CODE IT 604 L 3 T 1 P 2 CATEGORY OF COURSE COURSE TITLE Web Technologies THEORY PAPER (DC) Max. EJB. Uniform Resource Locator (URL). Common gateway interface (CGI). security issues. type of web documents. protocols for internetworking. Microsoft’s Distributed Component Object Model( DCOM) Web Servers HTTP request types System Architecture Server side Scripting. proxy server. Hyper Text Transfer Protocol Secure (HTTPS). entity declarations. Basic concepts. architecture. CORBA. Information Technology. authorization. services of web server. Web client. Middleware Concepts. Web server and its deployment. Message Oriented Middleware(MOM). . working of web browser and web server.Document object Model (DOM) history and levels. and protocol: switch. variables and data types. eXtensible Markup Language (XML). Hyper Text Transfer Protocol (HTTP). Standard Objects and form processing in Java UNIT IV Evaluation of web applications. UNIT II Introduction to Hyper Text Markup Language (HTML). feature of web pages. internetworking concepts. mail server proxy server. XHTML syntax and Semantics. Firewall. auditing. attributes. Security in application: authentication. functions. UNIT III Introduction to Java Script. HTML elements.

Web Technologies-TCP/IP Architecture. PHI Learning . S Katila.UNIT V Introduction to servlet.CENGAGE Learning. Overview Architecture Handling HTTP Request. J. References:1. Wang Sanda.Web Technologies.Akilandeswari . 2.A computer science perspective By Jeffrey C. and Java Programming By Achyut S.Gopalan.P.A developer’s Perspective by N. 4. Introduction to JSP. Get and post request. Jackson. Godbole and Atul Kahate 3. Java Bean class and JSP. Web Technology. redirecting request multi-tier applications. Pearson Eduction . basic JSP. Setting up an Open Data Base Connectivity (ODBC) data source.An introduction to Web Design+Programming by Paul S.

maintenance activities. debugging. S/W reliability. Metrics in the Process and Project Domains. Software design and implementation: Software design objectives. Informal/ formal specifications. construction. Marks. specialization. Metrics of Software Quality. Information Technology. Software Measurement. pre/post conditions. project tracking and scheduling. reuse performance improvement. software components. class extensions. design techniques. Object-oriented design. white box.35 Duration-3 hrs. User interface design. Departmental Course DC-17 Software Engineering and Project Management L IT605 3 T 1 Branch: Information Technology-VI Semester Course: IT605 Software Engineering and project management Unit I Introduction. loc and FP estimation. intelligent software agents. rapid prototyping. risk assessment.problem and prospects Software development process: Software life cycle models. Safety. Metrics and Indicators. Empirical models like COCOMO. the unified process. system testing test case design and acceptance testing. team etc. Software Testing Strategies: Verification and Validation. Specification design tools. Data structure design. Unit III Software requirements and specification: feasibility study. programming style. documentation. Strategic Issues. Design patterns implementation strategies like top-down. black-box testing. configuration management.Rajiv Gandhi Proudyogiki Vishwavidyalaya PROGRAMME: B. Software estimation techniques. unit and integration testing. code sharing. VI Semester Course: IT Software Engineering and Project Management Course Content Course Code Category of Course Course Title Credits-4C Theory Papers (DC) P 0 Max.E. Software. test plan. algebraic specification and requirement analysis models. bottom-up. Unit IV Coding standard and guidelines. Unit II Measures. code review. reverse engineering.Marks-100 Min. modularity Functional decomposition Data flow design. Open source software development. .

SQA and quality planning.Deepak Jain Oxford University Press. A Practitioner's Approach by P. forward engineering. Dreamtech Press. matrix organization. Pressman New edition McGraw. Re-engineering. Directing: leadership. project management plan.S.Bell Douglas Pearson Education Software Project Management.Unit V Organizing: Alternatives for project managers. Controlling risk analysis and RMMM plan. Software Engineering for students 4/e . motivation. Kelkar. Software Engineering principle and practices. 5. PHI Learning . Software project management standards References: 1. web engineering. SCM activities and plan. 3. reverse. project scheduling and tracking plan. delegation. 2. Software Engineering. Software project Management from concept to development Black Book by Kieron Conway. 4. Staffing.

Sign up to vote on this title
UsefulNot useful