This action might not be possible to undo. Are you sure you want to continue?
TECH (IT) I – SEMESTER
B.TECH (IT) 2nd YEAR I-SEMESTER SCEME OF INSTRUCTION AND EXMINATION With effect from 2007-2008 admitted batch
Name of the Subject Theory
1 1 1 1 1 1 ---
Maximum marks Lab
100 100 100 100 100 100 100 100 4 4 4 4 4 4 2 2
70 70 70 70 70 70 50 50
30 30 30 30 30 30 50 50
IT 2.1.1 IT 2.1.2 IT 2.1.3 IT 2.1.4 IT 2.1.5 IT 2.1.6 IT 2.1.7 IT 2.1.8
ELETRONICS ELEMENTS OF ELECTRICAL ENGINEERING DATA STRUCTURES DESCRETE MATHEMETICAL STRUCTURES - I PROBABILITY STATISTICS & QUEUING THEORY DIGITAL LOGIC DESIGN ELECTRONICS LAB DATA STRUCTURES LAB
3 3 3 3 3 3 ---
(Common with CSE 2.1.1)
Instruction:3 Periods & 1 Tut /week Univ. Exam : 3 Hours I.
Sessional Marks: 30 Univ-Exam-Marks:70
Semiconductors : Electronic Emission from metal carrier concentration in an intrinsic Semiconductors open circuited PN junction – diffusion. PN Junction Diode : PN Junction Diode, VI Characteristics of PN Junction Diode, capacitate effects in PN Junction Diode, Quantitative theory of PN Junction Diode. Special Devices: Principles, Working of zero diode, Tunnel diode, Varactor diode, Schottky diode, SCR and UJT. Transistors: The bipolar junction Transistor – Operation of PNP and NPN Transistors – Transistor Circuit configurations- characteristics of a CE configurations – h parameter, low frequency small signal equivalent circuit of a Transistor. Transistor Biasing and thermal stabilization: Transistor Biasing, stabilization, Different methods of transistor biasing – Fixed bias, Collector feedback bias – self bias – Bias compensation. Field Effect Transistors: Junction Field Effect Transistors (JFET) – JFET characteristics, JFET Parameters, Small equivalent circuit – MOSFETS – Depletion and Enhancement MOSFETS. Rectifying circuits: Half wave and full wave rectifiers – Bridge rectifiers – rectifier efficiency, Ripple and regulation – Shunt capacitor filter – Zener regulation. Transistor Amplifiers: CE, CB, CC amplifier configurations – Analysis using h- parameters – Multistage amplifier – RC coupled amplifier – frequency response curve and bandwidth.
TEXT BOOK: Electronic Device and Circuits by Sanjeev Gupth. REFERENCE: Integrated Electronics by Millman & Halkias.
ELEMENTS OF ELECTRICAL ENGINEERING
(Common with CSE 2.1.2)
Instruction:3 Periods & 1 Tut / week Univ. Exam : 3 Hours
Sessional Marks: 30 Univ-Exam-Marks:70
Magnetic circuits: Definitions of magnetic circuit, Reluctance, Magneto-motive force), magnetic flux, Simple problems on magnetic circuits, Hysterisis loss. Electromagnetic Induction : Faraday‟s laws of Electromagnetic Induction, Induced E.M.F., Dynamically induced E.M.F., Statistically induced EMF, Self Inductance, Mutual Inductance. D.C. Generators: D.C.Generator principle, construction of D.C. generator, E.M.F equation of D.C. generator, Types of D.C. generator, Efficiency, Characteristics of D.C. generator, Efficiency, Applications of D.C. generator D.C. Motors: D.C. Motor principle, working of D.C.Motors. significance of back E.M.F., Torque equation of D.C. Motors, Types of D.C. Motors, Characteristics of D.C. Motors, Speed control methods of D.C. Motors, Applications of D.C. Motor. Testing of D.C. Machines : Losses and Efficiency, Direct load test and Swinburne‟s test. A.C. Circuits: Introduction to Steady State Analysis of A.C. Circuits, Single and Balanced 3 Phase Circuits. Transformers: Transformer principle, EMF equation of transformer, Transformer on load, Equivalent circuit of Transformer, Voltage regulation of Transformer, Losses in a Transformer, Calculation of Efficiency and Regulation by Open circuit and Short circuit Tests. Three phase Inductance Motor: Induction Motor working principle. Construction of 3 Phase induction Motor, Principle of operation. Types of 3 phase induction Motor., Torque Equation of Induction Motor., slip – Torque characteristics., Starting Torque, Torque under running condition., Maximum Torque Equation., Power stages of Induction Motor., Efficiency Calculation of Induction Motor by direct loading. Alternator: Alternator working principle, EMF equation of Alternator, Voltage Regulation by Sync. Impedance method. Synchronous Motor: Synchronous Motor principle of Operation, Construction., Methods of starting of synchronous motor Text Book: “Elements of Electrical Engineering and Electronics” by V.K.Mehta, S. Chand & Co Reference Book: “A First Course in Electrical Engineering” by Kothari.
The Stack: Primitive operations – As an Abstract Data Type – Implementing the Stack operations in C. Queues and Lists: The Queue as Abstract Data Type – Sequential Representation _Types of Queues – Operations – Implementation in C. Data Structures Using C and C++ Yddish Langsam. Tanenbaum. Infix.IT2. Graph Traversal and Spanning Forests – Undirected Graph and their Traversals.1. Augenstein and Aaron M. Moshe J. Binary Tree Representation: Node Representation – Implicit array Representation – Choice of Representation – Binary Tree Traversal – Threaded Binary Trees and their Traversal – Trees and their Applications Sorting: General Background: Efficiency – The big 0 Notation – Efficiency of Sorting. Algorithms and Applications with C++. Evaluation and Conversions using C. Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 Introduction to Data Structures: Information and Meaning – Representation of MultiDimensional Arrays _ Review of C Programming. Note: All Implementation are Using C Language only. Tree Searching: Insertion into a Binary Search Tree – Deleting from a Binary Search Tree – Efficiency of Binary Search Tree operation Graphs and Their Application: Graphs: Application of Graphs – Representation of Graphs in C – Transitive closure – Warshall‟s Algorithm – Shortest Path Algorithm. Recursion in C and Recursive Implementation of Applications. Textbooks: 1.1. 26 .3) Credits:4 Instruction: 3 Periods & 1 Tut/week Univ. Postfix and Prefix: Definitions. Applications and Efficiency – Minimal Spanning Trees –Prim‟s and Kruskal‟s Algorithms. Simulation of Recursion – Efficiency of Recursion. Circular Lists: Insertion. Queues and priority Queues in C. Sahani Mc-Graw Hill. Prentice Hall Of India (2nd Edition) (Chapters 1 to 8) 2.3 DATA STRUCTURES (Common with CSE 2. Data Structures. Linked List: Operations – Implementation of Stacks. Searching: Basic Searching Techniques: Dictionary as an Abstract Data Type – Algorithmic Notation – Sequential Searching and its Efficiency – Binary Search – Interpolation Search. Trees: Binary Trees Operations and Applications. Linked Representation of Graphs: Dijikstra‟s Algorithm – Organizing the set of Graph Nodes – Application to Scheduling and its implication. Recursion: Recursive Definition and Processes. Deletion and Concatenation Operations _ Stacks and Queues as Circular Lists _ Doubly Linked Lists _Applications. Bubble Sort and Quick Sort and their Efficiency – Selection Sorting – Binary Tree Sort – Heap Sort – Insertion Sorts – Shell Sort – Address calculation Sort – Merge and Radix Sorts.
4 DISCRETE MATHEMATICAL STRUCTURES . H. Rosen. New Delhi Reference Books: 1) “Discrete mathematics and its applications” by Keneth. P.I (Common with CSE 2. Mott.Applications of sorting. Recurrence Relations: Generating Functions of Sequences-Calculating their Coefficients-Recurrence relations-Solving recurrence relations-Method of characteristic RootsNon-homogeneous Recurrence relations and their solutions Relations and Digraphs: Relations and Directed Graphs-Special Properties of Binary relationsEquivalence Relations-Ordering Relations-Lattices and Enumeration.Logical inferences-Methods of proof of an implication-First Order logic and Other Proof methods-Rules of inference for quantified Propositions-Mathematical Induction Elementary Combinatorics: Basics of Counting. .1. New Delhi 2) “ Discrete mathematics” by Richard Johnsonbaug. Pearson Education. Text Book: “Discrete Mathematics for computer scientists & Mathematicians” by Joe L.IT2.Operations on relations-Paths and Closures-Directed Graphs and Adjacency matrices. Baker. New Delhi 27 . Tata McGraw. Trees: Trees and their properties-Trees as graphs-spanning trees-Directed trees-Binary trees-Their traversals-Arithmetic and Boolean expressions as trees.4) Credits:4 Instruction: 3 Periods & 1 Tut/week Univ.Hill Publishing Company. searching and topological sorting.height balanced trees. Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 Introduction: Sets-Operations on sets-relations-functions-Proof methods and problem solving strategies-Fundamentals of Logic.Combinations and Permutations-Their Enumeration with and without repetition-Binomial coefficients-Binomial and Multinomial Theorems-The Principle of Inclusion-Exclusion.Multigraphs and Euler circuits-Hamiltonian graphs-Chromatic numbers-Four color theorem. Graphs: Basic concepts-Isomorphism-subgraphs-Planar Graphs-Euler‟s formula. Abraham Kandel & T. Prentice Hall of India Ltd.1.
M/M/1 . Conditional probability. level of significance.Veerarajan. study state solutions of M/M/1: α Model. Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 Probability: Definitions of probability. testing equality of variances. test of correlation coefficient. Multivariate Analysis: Correlation.5) Instruction: 3 Periods & 1 Tut/week Univ. Multiplication theorem. (Definition. Attributes. variance. Probability Distribution joint probability distributions their properties.IT2. test for Regression Coefficient. Curve fitting using Principle of Least Squares. parameter. fitting of the distribution. Large Sample tests: Tests based on normal distribution Queuing theory: Queue description. statistic. test for independence. Tata McGraw Hill Reference Book: Probability & Statistics with Reliability. Bayes theorem of probability and Geometric probability. Rank correlation. Transformation variables. Queuing and Computer Applications by Kishor S. χ2 – test for goodness of fit.5 PROBABILITY. characteristics of a queuing model.. Addition theorem. STATISTICS & QUEUING THEORY Credits:4 (Common with CSE 2. N Model. probability generating functions. Regression Analysis.1. populations. Maximum likelihood estimator. power of the test. exponential distributions and their roperties. Random variables and their properties. Small Sample Tests: Testing equality of . Testing of Hypothesis: Formulation of Null hypothesis. notion & interval estimation. unbiasedness. Sample. Continuous Random variable. Normal. efficiency.means.1999 28 . Discrete Random variable. coefficient of Association. standard error. Trivedi . Prentice Hall of India . moment generating function. Mathematical expectations.) Continuous distributions: Uniform. Poisson Negative binominal distributions and their properties. Probability Distributions / Discrete distributions: Binomial. correlation coefficient. Statistics and Random Processes by T. Text Book: Probability. Additive properties. critical region. Multiple Regression.1. mean. Sampling distribution.
2. Other Counters.IT2. Flip-Flops. Shift Registers. Programmable Array Logic. Hardware Description Language (HDL). Encoders. Analysis Procedure. 3. The Map Method. Design Procedure.S Salivahanan and S Arivazhagan. 2002 29 . Binary Systems. Binary Storage and Registers. John Wiley & Sons(Asia) Pte. Ananda Kumar. Four-Variable Map. Combinational Logic Combinational Circuits.. Morris Mano. HDL For Combinational Circuits. Tata McGraw-Hill Edition. Binary Adder. Ltd. Fundamentals of Digital Logic with VHDL Design. Latches. Axiomatic Definition of Boolean Algebra. Fundamentals of Asynchronous Sequential Logic Introduction. Digital Logic Design Principles. Other Logic Operations. Combinational Logic Design. Sequential Logic Design. Programmable Logic Array. Binary Logic Basic Definitions. State Reduction and Assignment. Binary Multiplier. 2003 4. Gate-Level Minimization. Product of Sums Simplification. PHI. Analysis Procedure. HDL for Registers and Counters. Digital Circuits and Design.2002 REFERENCE BOOKS:1. Complements. Memory and Programmable Logic Introduction. Magnitude Comparator. Synchronous Sequential Logic Sequential Circuits. Random-Access Memory. Binary Numbers.6) Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut. Registers. 2nd Edition. Design Procedure. Memory Decoding. Vikas Publishing House Pvt. Error Detection and Correction. Pearson Education. NAND and NOR Implementation. Octal and Hexadecimal Numbers.. /week Univ. Registers ad Counters. Ltd. Stephen Brown and Zvonko Vranesic.-Exam : 3 Hours 1. Norman Balabanian and Bradley Carlson. M.6 DIGITAL LOGIC DESIGN (Common with CSE 2. Decoders. Read-Only Memory. Boolean Algebra and Logic Gates. Canonical and Standard Forms. Hazards 4. Integrated Circuits.. 3rd Edition. Five-Variable Map. Signed Binary Numbers. Ripple Counters. Boolean Functions. Digital Systems.Subtractor.1. 2002 3. Decimal Adder. Number Base Conversions. Binary Codes. Synchronous Counters. Exclusive-OR Function. Digital Logic Gates. Fundamentals of Digital Circuits.1. Inc. 2002 2. Don'tCare Conditions. Analysis of Clocked Sequential Circuits. Other Two. Circuits With Latches. HDL For Sequential Circuits.Level Implementations. A. TEXT BOOK : Digital Design. Multiplexers. Design Procedure. Basic Theorems and Properties of Boolean Algebra. Sequential Programmable Devices.
Transistor as Switch 4.7 Lab: 3 Periods /week Univ. CE Amplifier 6.1.-Exam : 3 Hours ELECTRONICS LAB Credits:2 Sessional Marks: 50 Univ-Exam-Marks:50 1.IT 2. Full-Wave Rectifier 30 . CE characteristics 5. Zener diode Characteristics 3. Half-Wave Rectifier 8. FET Characteristics 7. P-N Junction Diode Characteristics 2.
Write a program to implement the operations on circular queues Write a program for sorting a list using Bubble sort and then apply binary search. 3.-Exam : 3 Hours 1. Write a program to implement the operations on stacks. Write a program for converting a given infix expression to postfix form 7. 13. Write a program for Merge sort. Write a program for evaluating a given postfix expression 8. Write a program for implementing the operations of a dequeue 9. Write a program to create a binary search tree and for implementing the in order. Write a program for Heap sort 12. 4. Write a program for finding the Depth First Search of a graph.IT2. a) Write a program for finding the transitive closure of a digraph b) Write a program for finding the shortest path from a given source to any vertex in a digraph using Dijkstra‟s algorithm 31 . Write a program for quick sort 11.8 DATA STRUCTURES LAB Credits:2 Sessional Marks: 50 Univ-Exam-Marks:50 Lab: 3 Periods /week Univ. post order traversal using recursion 5. and Breadth First Search of a graph 6. Write a program for the representation of polynomials using circular linked list and for the addition of two such polynomials 10. 2. preorder.1.
II/IV B.2.TECH (IT) II – SEMESTER B.1 IT 2.2.5 IT 2.II MICROPROCESSORS COMPUTER ORGANIZATION OBJECT ORIENTED ANALYSIS AND DESIGN ENVIRONMENTAL STUDIES MICROPROCESSORS LAB OBJECT ORIENTED PROGRAMMING LAB 3 3 3 3 3 3 --- TOTAL CREDITS 26 32 .2.2. Name of the Subject Theory Periods Tutorial 1 1 1 1 1 1 --- Maximum marks Lab 3 3 Credits Total 100 100 100 100 100 100 100 100 4 4 4 4 4 2 2 2 Exam 70 70 70 70 70 70 50 50 Sessionals 30 30 30 30 30 30 50 50 IT 2.TECH (IT) 2nd YEAR II-SEMESTER SCEME OF INSTRUCTION AND EXMINATION With effect from 2007-2008 admitted batch Sub.2.No.3 IT 2.Ref.6 IT 2.2 IT 2.8 SYSTEM PROGRAMMING DISCRETE MATHEMATICAL STRUCTURES .2.4 IT 2.2.7 IT 2.2.
IInd Revised Edition 33 .Absolute & DLL. Design of Assembler .1 SYSTEMS PROGRAMMING Credits 4 Sessional Marks: 30 Univ-Exam Marks:70 Instruction: 3 Periods & 1 Tut /week Univ-Exam : 3 Hours Introduction to Systems Programming. Index Register. Design of Loaders .Introduction to Instruction Formats. Introduction to Assembler. databases used in assembler design. functions of a loader.IT2. Debug Monitors. Data formats . Introduction to Software Tools. types of Loaders. Introduction to Macros.Single Pass & Double Pass. TextBook: Systems Programming by Donovan Tata Mc Graw Hill Reference: System Programming by Dhamdhere Tata Mc Graw Hill.Role of Base Register. Introduction to Loaders. Text editors. Introduction to Assembly Language Programming . various types of Macros. Interpreters. Program Generators. databases used in Loaders. Design of Macro Processor .Single Pass & Double Pass.2.
Liu. L. G. P. Reference Books: 1) Discrete and combinatorial mathematics by Ralph. New Delhi. Manohar Tata McGraw-Hill Publishing Company.Group Codes Lattices: Lattices as Partially Ordered Sets-Properties of Lattices. New Delhi 2) Elements of discrete mathematics by C.2. New Delhi. Trembley & R. Algebraic Structures: Algebraic Systems-Semi groups and Monoids-Grammars and LanguagesPolish expression and their compilation-Groups-The application of residue arithmetic to Computers.Sublattices-Direct Product and Homomorphisms-Isomorphisms-Modular Lattices-Distributive lattices.Complimented lattices –Their Properties Boolean Algebra: DefinitionSubalgebra-Direct Product-HomomorphismsIsomorphisms-Boolean Functions-Representation of Boolean Functions-Minimization of Boolean Functions-Design examples of Boolean Algebra Computability: Introduction-Finite State Machines-Introductory Sequential Circuits. Text Book: Discrete Mathematical Structures with applications to computer science by J. Tata McGraw-Hill Publishing Company.Equivalence of Finite State Machines-Finite State Acceptors and Regular Grammars.IT2.2.Turing Machines and Partial Recursive Functions.II Credits:4 (Common with CSE 2. Grimaldi Pearson Education.2) Instruction: 3 Periods & 1 Tut /week Univ-Exam : 3 Hours Sessional Marks: 30 Univ-Exam Marks:70 Introduction: Relations-Types of relations-Matrix representation of relationsRepresentation of relations as graphs-Ordering-Partial Ordering-Functions-Composition of Functions-Binary and n-ary Operations-Characteristic Functions of a set-Hashing functionsRecursion-Primitive recursive functions-Recursive functions.2 DISCRETE MATHEMATICAL STRUCTURES . 34 .
Internal Architecture and Functional/Signal Description of typical 8-bit µP. The 8088 and 8086 Microprocessors. and Applications with the 8085 Ramesh S. Counting. Time Delay Loops Procedures. 2003 3. Programming and Interfacing.. Programming. Interrupts and Interrupt Service Routines The 8086 µP. The 80x86 Family. BCD Arithmetic. 2nd Edition. 16-bit data Operations. Instruction Set and Timing Diagrams Addressing Modes. 1999 2.3) Credits:4 Sessional Marks: 30 Univ-Exam Marks:70 Instruction: 3 Periods & 1 Tut /week Univ-Exam : 3 Hours The 8085A µP. Data Definition. 3rd Edition. and Macros TEXT BOOKS: 1. and Indexing. COM and EXE program Files Programming techniques: Logical Processing. Programming the 8086 µP. Design. Programming Techniques: Looping.IT2. Counter and timing Delays. Gaonkar.. Maximum-Mode and Minimum-Mode Operation. Architecture and Instruction Set: Internal Architecture and Functional/Signal Description of 8086/8088 Segmented Memory. Architecture and Instruction Set: Introduction to Microprocessors and Microcomputers. Code Conversion. Modular programming. Triebel and Avtar Singh. Data tables. Interfacing. Stack and Subroutines. Pearson Education Inc. Hall. 4th Edition. TMH Edition. Water A. Pearson Education Inc. 1999 35 .Microprocessor Architecture. Software. Hardware and Applications. Pearson Education Inc.Uffenbeck. Instruction Set and Timing Diagrams of 8085 µP. 5th Edition.2.. 4th Edition.: Assembly Language Requirements. 2002 REFERENCE BOOK: 1.: Assembly Language Programming Requirements. Programming. Penram International. Microprocessors and Interfacing.8085. IBM PC Assembler Language and Programming. Programming the 8085 µP. 2001 2. Douglass V. Arithmetic processing.3 Microprocessors (Common with CSE 2.2. John E.. Peter Abel. Programming and Hardware.
Complete Computer Description. Main Memory. Central Processing Unit: Introduction. Priority Interrupt.2. Text Book: Computer System Architecture..Pearson Education Inc.2.. M. Addressing Modes. Input-Output Interface. Pearson Education Inc. Address Sequencing. Memory Organization: Memory Hierarchy. Micro program Example. Computer Instructions. Modes of Transfer. Bus and Memory Transfers. Auxiliary Memory. Asynchronous Data Transfer. Input-Output Organization: Peripheral Devices. Virtual Memory. Timing and Control. Data Transfer and Manipulation. Logic Micro-operations. Decimal Arithmetic Unit. Program Control.Morris Mano . Basic Computer Organization and Design: Instruction Codes. Microprogrammed Control: Control Memory. Instruction Formats. Arithmetic Microoperations. John D.Third Edition.4) Credits:4 Sessional Marks: 30 Univ-Exam Marks:70 Instruction: 3 Periods & 1 Tut /week Univ-Exam : 3 Hours Register Transfer and Micro operations : Register Transfer Language. Shift Micro-operations. Direct Memory Access.IT2. Associative Memory. Carpinelli . Input-Output and Interrupt.4 COMPUTER ORGANIZATION (Common with CSE 2. Instruction Cycle. General Register Organization. Stack Organization. Computer Registers. 2003 Reference Book: Computer Systems Organization and Architecture. Cache Memory. Computer Arithmetic : Introduction. Register Transfer. Arithmetic Logic Shift Unit. Memory-Reference Instructions. 2003 36 . Addition and Subtraction.
access to the base class-overloading inherited member function.pure virtual functions . 37 .L : Description of various U.IT2. POLYMORPHISM: Overloading functions and operators-runtime polymorphism-over loading new and delete operators. 4.preprocessor directives-data types and declarationExpressions and operator precedence-Program flow control-functions-scope of variables-default arguments-dynamic allocation-new and delete operators.M.multiple inheritance.Function templates .dynamic binding through virtual functions.virtual base class virtual functions and polymorphism.implications of polymorphism use of classes . controlling and accessibility.2. 3. Basics OF C++: Structure of a c++ program . Templates: Generic Classes using Macros .procedural Paradigm – An overview of classes.virtual function call mechanism . static and dynamic bindings . 6. DATA ABSTRACTION: Classes as objects.L. 9.Class Templates . BASICS OF OBJECT ORIENTED PROGRAMMING: Introduction to Object Oriented Paradigm. objects and Methods inheritance and polymorphism. 7.virtual functions . class members.virtual destructors .Advantages of Templates. user defined data types. 2. OBJECT ORIENTED DESIGN: Trends in software design-Notation for objects-Hybrid design methods -separation of Responsibilities-driven design-design phases and tools-step by step designgrady booch approach.calling virtual functions in a base class constructor C++ I/O. constructors & destructors.5 OBJECT ORIENTED ANALYSIS AND DESIGN Credits:4 Sessional Marks: 30 Univ-Exam Marks:70 Instruction: 3 Periods & 1 Tut /week Univ-Exam : 3 Hours 1. member functions.standard functions using C functions -Stream I/O in C++ -Manipulators . Diagrams with examples.M. Introduction to U. INHERETANCE: Derived classes-syntax of derived classes .Formatted I/OOverloading << and >> Operators -File I/O 5. EXCEPTION HANDLING IN C++: Benefits of exception handling troubles with standard C functions (setjmp and longjmp)-Proposed exception handling mechanism for C++ 8. implementation of classes.
PHI 2. Object Oriented Programming in C++: N.(Pearson Education) References: 1. 2. The Unified Modeling Languages user Guide by Grady Booch Etal. Barkakati. Object Oriented Analysis and Design by Andrew Haigh – (Tata Mcgrah Hjill. Balagurusamy. Object Oriented Programming through C++ by Robat Laphore. PHI.Text Books: 1. 3. Object oriented Programming using C++: E.) 38 .
2. habitat loss. characteristic features. effects and control measures of Air Pollution. Sanitation and Public health (b)Effects of activities on the quality of environment Urbanization-Transportation.Hot spots.6 ENVIRONMENTAL STUDIES (Common with CSE 2. ethical.their effects on forest and tribal people ©Water resources -Use and over-utilization of surface and ground water-Floods and droughts-Water logging and salinity-Dams –benefits and costs-Conflicts over water (d) Energy resources Energy needs-Renewable and non-renewable energy source-Use of alternate energy sources -Impact of energy use on environment (8 lectures) Module 4: Bio-diversity and its conservation (a)Value of bio-diversity-consumptive and productive use. loss of species.Indoor air pollution-Water pollution.In-situ and Ex-situ conservation (3 lectures) Module 5: Environmental Pollution Local and Global Issues (a)Cause. social. recycling and reuse (b)Nature of thermal pollution and nuclear hazards ©Global Warming (d)Acid rain (e)Ozone depletion (8 lectures) Module 6 : Environmental problems in India (a)Drinking water. poaching of wildlife.resettlement and rehabilitation of people: problems and concerns (e)Rain water harvesting.Soil pollution.Marine pollution-Noise pollution-Solid waste management.2. vermiculture. composting.6) Credits:2 Sessional Marks: 30 Univ-Exam Marks:70 Instruction: 3 Periods & 1 Tut /week Univ-Exam : 3 Hours Module 1: Introduction (a)Definition.Industrialization.IT2.Urban and industrial wastes. types.Green revolution ©Water scarcity and Ground Water depletion (d)Controversies on major dams. seeds etc. (d)Conservation of bio-diversity. rivers and estuaries) (2 lectures) Module 3: Environmental and Natural Resources management (a)Land resource -Land as a resource -Common property resource -Land degradation -Soil erosion and desertification Effects of modern agriculture. structure and functions of Ecosystems -Forest –Grass land -Desert -Aquatic (lakes. Scope and importance (b)Measuring and defining environmental development: indicators (1 lecture) Module 2: Ecosystem (a) Introduction.India as a mega diversity habitat ©Threats to biodiversity. aesthetic and option values (b)Bio-geographical classification of India. fertilizer – pesticide problems (b) Forest resources Use and over-exploitation-Mining and dams. cloud seeding and watershed management (5 lectures) 39 .
pond.common plants. hill. birds ©Study of simple ecosystems.river/ forest/ grassland/ Hill/ Mountain.Module 7: Economy and Environment (a)The economy and environment interaction (b)Economics of development. ( 5 lectures) 40 . insects. (b) Study of local environment. (d) Visit to Industries. river. slopes etc. Water treatment plants. preservation and conservation ©Sustainability: theory and practice (d)Limits to Growth (e)Equitable use of resources for sustainable lifestyles (f)Environmental Impact Assessment (4 lectures) Module 8: Social Issues and the Environment (a)Population growth and environment (b)Environmental education ©Environmental movements (d)Environment vs Development ( 2 lectures) Module 9: Institutions and Governance (a)Regulation by Government (b)Monitoring and Enforcement of Environmental regulation ©Environmental Acts Water (Prevention and Control of pollution) act-Air (Prevention and Control of pollution) act-Envt. affluent treatment plants. Protection act-Wild life Protection act-Forest Conservation act-Coastal Zone Regulations (d)Institutions and policies relating to India (e)Environmental Governance (5 lectures) Module 10: International Conventions (a)Stockholm Conference 1972 (b)Earth Summit 1992 ©World Commission for environmental Development (WCED) ( 2 lectures) Module 11: case Studies (a)Chipko movement (b)Narmada Bachao Andolan ©Silent Valley Project (d)Madhura Refinery and Taj Mahal (e)Industrialization of Pattancheru (f)Nuclear reactor in Nagarjuna Sagar (g)Tehri dam (h)Ralegaon Siddhi (Anna Hazzare) (i)Kolleru lake-aquaculture (j)Florosis in Andhra Pradesh ( 3 lectures) Module 12: Field Work (a) Visit to a local area to document and mapping environmental assests.
Serial Monitor of 8085µP Trainer with Terminal 8085 Line Assembler of 8085µP Trainer with PC as Terminal 8085 Cross Assembler using In-Circuit Emulator (ICE) with 8085µP Trainer and PC as Terminal 2.2. Counters 5. 8086 Assembly Language Programming according to theory course Microprocessor-I using the following : PC Assembler using TASM or MASM. 8085 Assembly Language Programming according to theory course microprocessors-I using the following trainers : Keyboard Monitor of 8085µP Trainer. Multiplexers & Decoders 3.IT2. TD or SYMDEB or CVD(Code View debugger) Graded Problems are to be used according to the syllabus of MICROPROCESSORS-I TTL IC Gates 41 . Flip-Flops 4. TTL Characteristics and 2. Shift Registers 6.7 Lab: 3 Periods/week Univ-Exam : 3 Hours MICROPROCESSORS LAB Credits: 2 Sessional Marks: 50 Univ-Exam Marks:50 Digital Logic Design Experiments : 1. Binary Adders & Subtractors 7. A L U Assembly Language Programming : 1.
deletion (a) Extend insertion and deletion with exception handling and templates 3. . set) . >= . postorder traversal.A 1. concatenation. of drawing 2-D object. deletion Infix to postfix conversion Postfix evaluation Extend insertion and deletion with exception handling and templates 2. == for comparison of two strings. Void insert ( int x). Define a class String and write a C++ program to overload + for concatenation. (a) (b) (c) Implement Stack operations insertion. Define a class Complex and overload operators + . 2. Void unionset (set. Let the user specify the position. inorder traversal. Write a C++ program to implement member functions Set ( int SZ = 0 ). Implement „static class member function‟ using class Item which has a static member count. >> for complex numbers. size. * . . set) . << .. deletion. void difference ( set. Define a class Matrix and overload operators + . 3. Implement operations on Double linked list. Define a class Set whose objects are integers. 5. 7. Void intersection ( set. 6.2. (a) Extend these operations with exception handling and templates 5. Implement Linked list operations insertion. deletion. 4. Implement Stack operations with linked list. searching. int find ( int x) . preorder traversal. set ).8 OBJECT ORIENTED PROGRAMMING .LAB Credits:2 Sessional Marks: 50 Univ-Exam Marks:50 Lab: 3 Periods/week Univ-Exam : 3 Hours PART . Define a basic two-dimensional Shape class from which objects such as rectangle. >>. << . <= . Implement Queue operations using linked list. 6. circle which can be derived. 42 . Implement Queue operations insertion. * . traversal. PART – B 1. (a) Implement polynomial addition with linked list (b) Implement polynomial multiplication with linked list (c) Extend these operations with exception handling and templates 4.IT2. Implement tree operations insertion..
1.6 IT 3.TECH (IT) 3rd YEAR I-SEMESTER SCEME OF INSTRUCTION AND EXMINATION With effect from 2007-2008 admitted Name of the Subject Theory DATA COMMUNICATION INTERNET CONCEPTS & JAVA PROGRAMMING COMPUTER GRAPHICS FORMAL LANGUAGES & AUTOMATA THEORY FILE STRUCTURES OPERATING SYSTEMS OPERATING SYSTEMS LAB JAVA PROGRAMMING LAB SOFT & COMMUNICATION SKILLS LAB Periods Tutorial 1 1 1 1 1 1 ---- Maximum marks Lab 3 3 3 Credits 100 100 100 100 100 100 100 100 25 4 4 4 4 4 4 2 2 1 Exam 70 70 70 70 70 70 50 50 25 Sessionals 30 30 30 30 30 30 50 50 -- Total IT 3.III/IV B.1.1 IT 3.2 IT 3. No.4 IT 3. I – SEMESTER B.TECH (IT) batch Sub.1.8 IT 126.96.36.199.1.5 IT 3.3 IT 3.1.Ref.7 IT 3.1.9 3 3 3 3 3 3 ---- TOTAL CREDITS 29 43 .
Enhanced Terminal Components.S. Understanding Data Communications & Networks. Multiplexers.Behrouz A. Line Configurations. Loomis.Other Data Link Control Protocols. Line Conditioning and Leased Lines. Miller. Analog Signals 3. Error Detection. Concentrators.J.1. Data Link Control Flow Control. 4. Communications Processing Hardware Introduction.Vikas publishing House. William Stallings. TDM Link Control. Data Communications Hardware: Terminals Introduction.1 DATA COMMUNICATIONS Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut /week Univ. An Introduction to Data Communications: A Communications Model. Practical Digital and Data Communications. Multiplexing: Frequency-Division Multiplexing. Data Communications.1983 (Capter 3. Transaction Terminals. Front-End Processors. Basic Terminal Components. Analog Signals. 7th Edition. Mary E. Interfacing. Switching Processors. Remote Job Entry Terminals. 3rd EditionTMH. Digital Carrier Systems Statistical TimeDivision Multiplexing: Characteristics. Analog and Digital Data Transmission.. Digital Data. Digital Signals. The Data Communication Interface Asynchronous and Synchronous Transmission. Wireless Transmission Data Encoding. Michale A. Protocols and Protocol Architecture. Transmission Impairments 2. 2nd Edition Thomson-Brooks/Cole .. Modems and Modem Circuits. High-Level Data Link Control (HDLC). Forouzan. Pearson Education Inc. Synchronous Time-Division Multiplexing: Characteristics. PHI-N. Error Control. Transmission Media: Guided Transmission Media. Characteristics of Data Transmission: Concepts and Terminology. Multidrop Lines. Modems: Network Attachment and Regulations. 2004 2. Clustering of Terminal Devices. Digital Signals. Exam : 3 Hours 1. Data Communications and Data Communications Networking.J. Analog Data. 2004 2. Data & Network Communications. Shay. 1999 3. Paul Bates.William A. 2000 44 . Thomson/Delmar . PHI-N. Chapter 5) 3. Digital Data.IT3. Data and Computer Communications. TEXT BOOKS: 1. Analog Data. General-Purpose Terminals.Vikas Publishing House. 5. Data Communications and Networking. 1987(Chapter5) REFERENCE BOOKS: 1.
Herbt Schild. Lang package. Applet Programming: Events. Math package. Arrays & Structures: One Dimensional & Two Dimensional Arrays. Inet address. layout managers.1. URL. Comparing JAVA with C & C++.2 INTERNET CONCEPTS & JAVA PROGRAMMING Credits:4 Instruction: 3 Periods & 1Tut/Week Univ_Exam:3 Hours Sessional Marks: 30 Univ_ Exam Marks:70 Fundamentals: HTML. Exception handling. Control Statements: If else. Static Modifier. Variables. Datagrams. Textbook: 1. Introduction to packages. Named Structures. Graphics. Events like buttons. Applets.IT3. and do while loops. OOP Concepts. statements and expressions. for.. colours. a primar ”. Balaguruswamy. 2. Daneal/Young PHI 45 . Java Complete Reference . images. while. TCP/IP server sockets. Reference Book: “Introduction to Java programming”. Event driven programming. “Introduction to Java programming. Fonts. Threads and multithreaded programming. TCP/IP client sockets. URL connection. Data types. Proxy servers. AWT components. Switch statements. Internet addressing. Networking: Networking Basics: Socket overview.JAVA Programming language Syntax. Features of JAVA: Classes and Interfaces. Functions: Parameter Passing. Applets package. Util package. mouse. keyboards etc. Reserved sockets. writing event driven program using components. Client/Server. Java and the net.
Inquiry Functions. S. New Delhi. 2004 Reference Books: 1) Procedural Elements for Computer Graphics by David F. 2003 2) Computer Graphics: Principles & Practice in C by J.Computer Aided Design.Rotationscaling-Other Transformations-Composite Transformations-3D Transformation Functions-Modeling and Coordinate Transformations.Circle.Raster methods for Transformations Two Dimensional Viewing: The viewing Pipeline-Viewing Coordinate Reference FrameWindow-to-Viewport Coordinate Transformation-Two Dimensional Viewing Functions-Clipping Operations-Point Clipping-Line Clipping-Polygon Clipping-Curve Clipping. 2004 3) Computer Graphics using Open GL by Franscis S Hill Jr Pearson Education. 46 . Presentation Graphics. D.Loading the Frame buffer.Generating Algorithms.Area Fill Attributes.Editing Hierarchical Modeling with Structures-GUI and Interactive Input Methods.Other Curves. 2004.Ellipse Generating Algorithms.Graphics software Output primitives: Points and Lines-Line Drawing Algorithms.Visualization. Tata McGraw Hill Book Company.Viewing Coordinates. A Van Dam F.Line function.3 COMPUTER GRAPHICS Credits:4 Sessional Marks: 30 Univ_ Exam Marks:70 Instruction: 3 Periods & 1Tut/Week Univ_Exam:3 Hours Introduction: Usage of Graphics and their applications.Raster Scan systems-random scan systems-Graphics monitors and workstations-Input devices-hard copy devices.Cubic Spline methods-Bézier Curves and Surfaces.Education and Training.Parallel Curve Algorithms-Curve Functions-Pixel Addressing.Quadratic Surfaces-Super Quadrics-Blobby Objects-Spline Representations.IT3. H John. Pauline Baker Pearson Education. Three Dimensional Viewing: Viewing Pipeline. Pearson Education.Three Dimensional Viewing Chapters 1 to 12 except 10-9 to 10-22 of the Text book Text Book: Computer Graphics C Version by Donald Hearn & M.B Spline Curves and Surfaces Three Dimensional Geometric and Modeling Transformations: Translation.Projections.Graphical User Interfaces Over view of Graphics systems: Video Display Devices.View VolumesGeneral Projection Transformations-Clipping-Hardware Implementations.1.Curved Lines and Surfaces. Foley. New Delhi.Entertainment.Filled Area Primitives-Filled Area FunctionsCell Array.Affine TransformationsTransformation Functions. K Feiner.Text and Exterior Clipping Structure And Hierarchical Modeling: Concepts of Structures and Basic models.Windows and IconsVirtual Reality Environments Three Dimensional Concepts and Object representations: 3D display methods-3D GraphicsPolygon Surfaces.Antialiasing Two Dimensional Geometric Transformations: Basic TransformationsMatrix Representations-Homogeneous Coordinates-Composite Transformations-Other Transformations-Transformations between Coordinate Systems.Character Generation Attributes of Output Primitives: Line and Curve Attributes-Color and Gray scale levels.Character Attributes-Bundled Attributes.Computer Art.Image Processing. Rogers.
Regular Expressions. REFERENCE BOOKS: Theory of Computer Science By Mishra & Chandra Sekharan. An Introduction To Formal Languages and Automata. Simplification of Context Free Grammars. 5. Deterministic and Non-Deterministic Finite Automata. Minimization of Finite Automata. 2.E. Chomsky Hierarchy. Parsing and Push-Down Automata. Undecidability of PCP. Finite Automata with e-moves.3e By Peter Linz – Narosa Publishing House.4 FORMAL LANGUAGES AND AUTOMATA THEORY (Common with CSE 3.IT3. Push-Down Automata and Context free Languages. Mealy and Moore Machines. Regular Sets and Regular Grammars. Regular Grammars. Normal Forms. Pumping Lemma for CFL. Closure Properties of Regular Sets. Decision Algorithm for CFL. TEXT BOOKS: Introduction to Automata Theory. Push down Automata and Deterministic CFL: Informal Description. Minimization of Finite Automata. Regular sets & Regular Grammars: Basic Definitions of Formal Languages and Grammars. Two-Way Finite Automate.Ulman – Narosa Publishing Company. Pumping Lemma for Regular Sets. 47 .4) Credits: 4 Instruction: 3 Periods & 1Tut/Week Univ_Exam: 3 Hours Sessional Marks: 30 Univ_ Exam Marks:70 1. Context Free Grammars and Languages: Context Free Grammars and Languages. closure properlties of CFL‟s. Languages & Computation By J. Definitions. Context Sensitive languages. Derivation Trees.1. 4. PHI. Universal Turing Machines and Undecidability: Design and Techniques for Construction of Turing Machines. Unrestricted Grammars. Finite Automata and Regular Expressions: Basic Concepts of Finite State Systems.Hopcraft & Jeffery D. Decision Algorithm for Regular Sets.1.Relationship between classes of languages. Myhill-Nerode Theorem. 3.
1. Bill Zoellick and Greg Riccardi. reclaiming space – record deletion and storage compaction. seeking and special characters in files. reading the variable length records from the files Managing records in C files Retrieving records by keys.CD-ROM – CD-ROM as a file structure. header records. deleting variable-length records. organization estimation of tape length and data transmission times. indexing to provide access by multiple keys. Exam : 3 Hours File Processing Operations Physical and logical files. entry sequenced file.Magnetic Tape – types. deleting fixedlength records for reclaiming space dynamically. improving the secondary index structure – inverted lists Indexed sequential file access and prefix B+ Trees Indexed sequential access. Exam Marks:70 Instruction: 3 Periods & 1 Tut /Week Univ. I/O processing. internal structure of index set blocks: a variable B+ tree rder B-tree. memory requirements. space fragmentation. blocks. Indexing Index. a simple hashing algorithms. simple prefix B+ content of the index: separators instead of keys.IT3. hashing functions and record distributions. field structures. cost of a disk access. A simple index with an entry sequenced file. extendable hashing performance Designing file structure for CD-ROM Tree structure on CD-ROM. collision resolution by progressive overflow.5 FILE STRUCTURES (Common with CSE 3. performance. sectors. tracks.1. physical organization. Folk. reading & writing and closing files in C. buckets. index set block size. record structures and that uses a length indicator. CD-ROM file structure Text Book: File Structures – An Object Oriented Approach with C++ by Michael J. indexes that are too large to hold in memory. the simple tree prefix B maintenance. buffer strategies and bottlenecks File Structure Concepts A stream file. reading a stream of fields. loading a simple prefix o Special Note: Implementation in C only Hashing Collisions in hashing. retrieval using combination of secondary keys. implementation.5) Credits:4 Sessional Marks : 30 Univ. deletions Extendable hashing Working of extendable hashing. adding a simple index to the sequence set. basic operations on an indexed. internal set block size. disk vs tape. storage hierarchy Byte Journey and buffer Management File manager. choosing a record structure and record length. deletion. opening. strengths and weakness of cd-roms. maintaining a sequence set. file-related header files in C Secondary Storage Disks – organization. file access and file organization Organizing files for performance Data compression. physical devices and logical files. I/O buffer. the + tree. Pearson 48 .. direct access. capacity. replacement strategies. sequential search. Mixing numbers and characters – use of a hex dump. non-data overhead. hashing files on CD-ROM.
History of Operating Systems. Segmentation File Systems And Input/Output : Files. Security. Grey Gagne 49 . Other Issues Case Study : Unix: Fundamental Concepts in Unix. Design issues for paging systems. Modeling paging algorithms. Tanenbaum Reference: Applied Operating Systems Concepts by Avi Silberschatz. MS – DOS: Fundamental Concepts in MS-DOS Text Book: Modern Operating Systems by Andrew S. Protection mechanism.6) Credits:4 Instruction: 3 Periods & 1 Week. Peter Galvin. Process Scheduling Memory Management : Memory Management without Swapping or Paging. Deadlocks. Directories. Deadlock Avoidance. Disk Management Deadlocks: Resources. Operating Systems Structure Processes: Introduction to Processes. Deadlock Detection and Recovery./Week Univ_ Exam : 3 Hours Sessional Marks : 30 Univ_ Exam Marks:70 Introduction: What IS OS.6 OPERATING SYSTEMS (Common with CSE 3. Classical IPC Problems. Inter Processor Communication. The O-----ptical Algorithm. Virtual Memory. Principles of I/O Software. Page Replacement Algorithms. Operating System Concepts. Swapping.1. Deadlock Prevention.IT3.1. File system implementation.
Programs using fork system calls. 8. 6. Programs to simulate deadlock detection. 3. and Peter Galvin. 2. software specifications Simple Unix-C programs: Programs using system calls. OPERATING SYSTEMS LAB Credits:2 Sessional Marks: 50 Univ_Exam marks: 50 1. Operating System Concepts by Silberschatz. library function calls to display and write strings on standard output device and files. 7. Shortest Job First and Round Robin. Programs to simulate free space management. Programs to simulate page replacement algorithms like FIFO.1. 4. Study of laboratory environment: Hardware specifications. Programs using pipes. 2. Shell programming by Yashwanth Kanetkar.IT3. TMH Publications. 5. 3. Unix programming by Stevens. Pearson Education. 50 . perror( ) function. 10. Programs for error reporting using errno. Shell programming. Programs to simulate process scheduling like FCFS. References: Unix concepts and applications by Sumitabha Das. Programs to simulate virtual memory. Optimal and LRU.7 Lab: 3 periods/week Univ_Exam: 3 hours.
Write a java program to implement stack & Queue operations. Display the error message if divide by zero without abnormal exit. 10.IT3. 6.8 Lab: 3 periods/week Univ_Exam: 3 hours. (a) Write a class to display the area of rectangle and inherit this class into other class which is displaying perimeter of a rectangle and implement. 7. Write a applet program to design a calculator for implementing basic functions like +. (c) Write a program to display simultaneously output of even and odd numbers starting from one to specified number. filename and extension for a given path of a file. (b) A program to accept more than one string and arrange them in alphabetical order. (b) write a program to receive two command line arguments check whether they are equal or not. 51 .-.1. Write a applet program for drawing the bar chart. Write a program to accept data from keyboard and write it into a file. 3.*. 9. /. (b) Write a class to add three no‟s inherit this class into other class to add five no‟s and implement it. 5. (a) A program to take two arguments and divide the first argument with second argument and display the result. (a) Program to display the area of a rectangle. Write a program to check active ports in system. 4.. (a) write a program to print the path. 8. Write a program to draw line and circle using mouse. (b) Program to find Sum of series 1+x+x2+x3+…… 2. JAVA PROGRAMMING LAB Credits:2 Sessional Marks: 50 Univ_Exam marks: 50 1.
2.1 IT 3.No.III/IV B.Ref.188.8.131.52 COMPILER DESIGN DESIGN & ANALYSIS OF ALGORITHMS DATA BASE MANAGEMENT SYSTEMS COMPUTER NETWORKS WEB TECHNOLOGIES OPERATION RESEARCH WEB TECHNOLOGIES LAB DATA BASE MANAGEMENT SYSTEMS LAB 3 3 3 3 3 3 --- TOTAL CREDITS 28 52 .4 IT 3.6 IT 3.SEMESTER B.2.2.5 IT 3.3 IT 3.2 IT 3.7 IT 3.2. Name of the Subject Theory Periods Tutorial 1 1 1 1 1 1 --- Maximum marks Lab 3 3 Credits Total 100 100 100 100 100 100 100 100 4 4 4 4 4 4 2 2 Exam 70 70 70 70 70 70 50 50 Sessionals 30 30 30 30 30 30 50 50 IT 3.2.TECH (IT) 3rd YEAR II-SEMESTER SCEME OF INSTRUCTION AND EXMINATION With effect from 2007-2008 admitted batch Sub.TECH (IT) II.
2.7. Ullman Reference Books: Compiler Construction by Kenneth.11. Three address Code. Intermediate Code Optimization: The principle sources of optimization. Text Book Principles of Compiler Design by Aho. Louden. Register allocation and assignment.5.2. A simple code generator. Vikas Pub.4. properties. LALR parser. Syntax Directed Translation: Syntax directed translation and implementation. Design of Parsers: Shift Reduce parser. D. SLR parser. Finite Automata and Regular expressions. Regular expressions. Grammars and Automata.9. Predictive Parser.1 COMPILER DESIGN (Common with CSE 3. 53 . Loop Optimization. Brief discussion on symbol tables. Regular sets and Regular Grammars. Postfix notation. House. chapters: 1. Operator Precedence Parser. Grammars.1) Credits:4 Instruction: 3 Periods & 1 Week. Run-time storage administration. Acceptability of string. Peep hole optimization.6. Code generation from DAG.10.IT3. Machine model.12.2. Quadruples. Transition systems. C. Global data flow analysis. NDFA. LR parser.15 of the text book.3. Triples. Design of lexical analyzer./Week Univ_ Exam : 3 Hours Sessional Marks : 30 Univ_ Exam Marks:70 The Theory of Automata: Definition and description. Intermediate code. DAG. parsing tree. Types of Grammars. Overall view of Compilers: Brief discussion on various phases of Compilers. Code Generation: Problems. Equivalence in between DFA & NDFA.
IT3. New Delhi.and – Conquer Decrease – and – Conquer – Insertion Sort – Depth-First Search and Breadth-First Search. Pearson Education. Greedy Technique – Prim‟s Algorithm – Kruskal‟s Algorithm – Dijkstra‟s Algorithm – Huffman Trees Limitations of Algorithm Power – Lower-Bound Arguments – Decision Trees – P. Hopcroft & Ullman. 2003 3. Leiserson.2 DESIGN AND ANALYSIS OF ALGORITHMS (Common with CSE 3. Rivest & Clifford Stein. Prentice Hall of India. Charles E. New Delhi. Prentice Hall of India. Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 Introduction – Fundamentals of algorithmic problem solving – important problem types – fundamental data structures. The Design and Analysis of computer Algorithms. New Delhi. Introduction to Algorithms by Thomas H.2. New Delhi 2. Fundamentals of analysis of algorithms and efficiency – Analysis framework – Asymptotic Notations and Basic Efficiency classes – Mathematical Analysis of Non-recursive Algorithms – Mathematical Analysis of recursive Algorithms – Empirical Analysis of Algorithms – Algorithm Visualization Brute Force – Selection Sort and Bubble sort – Sequential Search and Brute – Force String Matching – Closest Pair and Convex-Hull Problems by Brute Force – Exhaustive Search Divide-and-Conquer – Mergesort – Quicksort – Binary Search – Binary Tree Traversals and Related Properties – Multiplication of large integers and Strassen‟s Matrix Multiplication – Closest. Fundamentals of algorithmics. Aho.Constant-Factor Algorithms – VariableSize-Decrease Algorithms Transform-and-Conquer – Presorting – Gaussian Elimination – Balanced Search Trees – Heaps and Heapsort – Horner‟s Rule and Binary Exponentiation – Problem Reduction Space and Time Tradeoffs – Sorting by Counting – Input Enhancement in string Matching – Hashing – B-Trees Dynamic Programming – Computing a Binomial Coefficient – Warshall‟s and Floyd‟s Algorithm – Optimal Binary Search Trees .2) Credits:4 Instruction: 3 Periods & 1 Tut /week Univ.Topological Sorting – Algorithms for Generating Combinatorial Objects – Decrease-by-a.Pair Convex-Hull Problems by Divide. Text Book: Introduction to Design & Analysis of Algorithms by Anany Levitin. Ronald R. NP and NP – complete problems – Challenges of Numerical Algorithms Coping with the Limitations of Algorithms Power – Backtracking – Branch-and-Bound – Approximation Algorithms for NP-hard Problems – Algorithms for solving Nonlinear Equations. 2003 Reference Books: 1. New Delhi 54 .The Knapsack Problem and Memory Functions. Gilles Brassard & Paul Bratley. Pearson Education. Corman.2.
views. specialized locking techniques. Features of ER model. Embedded SQL. File system vs DBMS. queries. media recovery Text Book: Database Management Systems by Raghu Ramakrishnan and Johannes Gehrke. Storage data. ODBC and JDBC. Aggregated Operation. transactions and execution of transactions. lossless join & dependency preserving decomposition Transaction management: Transaction concept.3) Credits:4 Instruction: 3 Periods & 1 Tut /week Univ. interest. Transaction Management. concurrency control without locking Crash Recovery: Aries. normalization up to 3rd & BC normal forms. Triggers and Active database. Nested Queries. lock – based concurrency control.2. destroying/altering tables and views Relational Languages: algebra and calculus SQL: Basic SQL. crash recovery schedules. Relation ship and Relation ship sets. reasoning normal forms.2. Querying relation data. Query. Logical database design. Conceptual database design with ER model Relational model: Integrity constraints over relations and enforcement.3 DATABASE MANAGEMENT SYSTEMS (Common with CSE 3. except. fds. concurrent Concurrency control : Lock management. Null values. McGraw-Hill 55 . cursors. DBMS structure E-R model: Entities. recovering from a system crash. Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 Introduction to DBMS: Overview. designing active databases Schema refinement and normal forms : Schema refinement. Advantages of DBMS. Attributes and Entity sets. union.IT3.
2003 2.2004 Reference Books: 1.Understanding Communications and Networks . Data and Computer Communications.4 COMPUTER NETWORKS Credits:4 Instruction: 3 Periods & 1 Tut /week Univ. Seven Edition. Exam : 3 Hours Local Area Networks: Sessional Marks: 30 Univ-Exam-Marks:70 LAN Overview. Circuit Switching and Packet Switching Routing in Switched Networks Principles of Cellular Networks Basic protocol functions Priniciples of Internetworking Connectionless Internetworking Internet Protocol Connection oriented Transport Protocol Mechanisms TCP. Pearson Education Asia.3rd Edition .TANENBAUM . WILLIAM STALLINGS.ANDREW S. TCP Congestion Control UDP Wide Area Networks: Internet Protocols: Transport protocols: Distributed Applications: E-Mail. Pearson Education.IT3.WILLIAM A. Wireless LANs. 4th Edition. Computer Networks. Token Ring. HTTP Textbooks: 1.2004 56 .2.Thomson Asia/ Vikas Publishing. High Speed LANs: Ethernet.SHAY .
servlet container. distributed programming services. JDBC 2. deployment. J2EE Architecture. containermanaged persistence(CMP) and bean managed. Kim Hasse. Transaction and transaction management. Scrollable Resultsets. creating a backend interface. 57 . Development Methodology and process. EJB framework.5 WEB TECHNOLOGIES Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut /week Univ. distributed programming overview. Benefits of Servlets. use as controller in MVC and the sample application. the lifecycle of enterprise JavaBeans. HTTP response header. Dale Green. The Design and Development of a J2EE Application : J2EE Layers. Enterprise JavaBeans overview. JDBC: Introduction. designing the database. JDBC Architecture: API and Drives. Paul R. building session beans: creating session beans. Thomas Garben. the components of a JSP page. Mark Ashnault. XML and J2EE. Java server pages: introduction: features of JSP Pages. The JDBC API. Beth Stearns-Pearson Education –Asia. creating the interface.0 Optional package API. HML clients. building pages. Sherry Smith – SAMS Techmedia Reference Book: The J2EE Tutorial. Batch Statements. common object request broker architecture (CORBA) and remote method invocation (RMI). Java Script.IT3. Retrieving and updating Data. Distributed computing and J2EE: Requirements of web architecture. Parts of a Bean. Task list for building J2EE Applications: Completing prerequisite Tasks. Session and entity Beans. Text Book: J2EE UNLEASHED – Joseph J.2. personal roles for EJB Development. web applications. updating rows. Eric Jendrock.1 New Data Types. the package of J2EE Applications. refining your code. Monica Pawlan. JDBC Execution Types. Servlets: What are Servlets?. Attributes of a Bean. JDBC 2. servlet lifecycle. Bambara.Stepahnie Bodoff. validating your code. Servlets API. J2EE Application Components. basic HTTP. creating data access objects. Servlets with JDBC. JSP architectures. dispatching requests. java message service (JMS) and message driven beans (MDB). Entity beans. de4veloping and deploying JSP pages. transaction support. defining the application. practical development with tag libraries: JSP syntax. session management. creating tables and columns. web application lifecycle.Allen. Tag libraries Enterprise JavaBeans: Introduction. sample applications introduced. SQL-to-Java Data Types. service method detail. Ziyad Dean. Metadata. Security. Exam : 3 Hours Introduction: Java.
Network Models : Definitions – CPM and PERT – Their Algorithms Integer Programming : Branch and Bound Algorithms cutting plan algorithm. North West corner Rule .lowest cost method –Vogels approximation method – Transportation algorithms –Assignment problem – Hungarian Method.unrestricted variables – simplex algorithm – artificial variables – Big M and two phase method – Degeneracy .alternative optima – unbounded solutions – infeasible solutions. Books: 1.2. Operations Research by R Panneerselvan.6 OPERATIONS RESEARCH Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut /week Univ.Relation between primal and dual problems – Dual simplex method Transportation model – starting solutions.IT3. Introduction to Operations Research by HILLIER/LIEBERMAN. Game theory: Two person Zero Sum Games – Mixed strategy games and their Algorithms. Tata McGraw Hill 2. Graphical sensitivity analysis – The standard form of linear programming problems – Basic feasible solutions . Dynamic Programming: Recursive nature of dynamic programming – Forward and Backward Recursion Deterministic Inventory Models : Static EOQ Models – Dynamic EOQ models. Prentice Hall of India. Dual problems. Exam : 3 Hours Overview of operations Research: OR models – OR Techniques Linear Programming: Introduction – Graphical solution. 58 .
J2EE 1. marks etc. water tax. 3. Design Library Information system Design Gram Panchayat Information system for House tax. phone bill. Library tax collection. Electricity bill collection Design student information system portal which maintain attendance. 2. wealth tax. 59 . Design Airlines Ticket Reservation System Design ONLINE Banking system.2.JDBC. 6. 5.IT3.7 Lab: 3 Periods/week Univ-Exam : 3 Hours WEB TECHNOLOGIES LAB Credits:2 Sessional Marks: 50 Univ-Exam-Marks: 50 Each student should develop two projects out of this list using JSP. Design online examination system. 4.
MYSQL & Structured Query Language (SQL) used with the RDBMS. are given below: Accounting package for a shop. etc.( Select two of RDMSs) Laboratory exercises should include defining schemas for applications. Personal library. Preparing greeting cards & birthday cards.2. Personal bank account. interface with the embedded SQL.. mortgage payments. to retrieve information from the database. Cable TV transmission program manager. creation of a database. use of host languages.Insurance. Class marks management. Hostel accounting. 60 . which may be programmed. Some sample applications. Doctor's diary & billing system. use of forms & report writing packages available with the chosen RDBMS product. loans. History of cricket scores. Ticket booking for performances. Database manager for a Magazine agency or a newspaper agency. Video Tape library. writing SQL queries. MS Access.8 Lab: 3 Periods/week Univ-Exam : 3 Hours DBMS LAB Credits:2 Sessional Marks: 50 Univ-Exam-Marks: 50 Study features of a commercial RDBMS package such as ORACLE/DB2. Personal accounts .IT3.
I :  Satellite and Mobile Communications  Visual Programming Techniques  Embedded systems  Combinatorics & Graph Theory  Artificial Intelligence  Random Processes in Computer Engineering 61 .IV/IV B.2 IT 4.5 IT 4.1 IT 4.1.Ref.7 OBJECT ORIENTED SOFTWARE ENGINEERING NETWORK PROTOCOLS ADVANCE OPERATING SYSTEMS MANAGEMENT PRINCIPLES ELECTIVE – I NETWORK PROGRAMMING LAB OBJECT ORIENTED SOFTWARE ENGINEERING LAB INDUSTRIEL TRAINING 3 3 3 3 3 --- TOTAL CREDITS 26 Elective . Name of the Subject Theory Periods Tutorial 1 1 1 1 1 --- Maximum marks Lab -----3 3 Credits Exam 70 70 70 70 70 50 50 Sessionals 30 30 30 30 30 50 50 Total 100 100 100 100 100 100 100 4 4 4 4 4 2 2 2 IT 4.4 IT 4.1.No.1.TECH (IT) 4th YEAR I-SEMESTER SCEME OF INSTRUCTION AND EXMINATION With effect from 2007-2008 admitted batch Sub.184.108.40.206 IT 4.3 IT 4.1.TECH (IT) I – SEMESTER B.
concepts. concepts. Requirements: Requirements elicitation. Project Communications: Project communication. development activities 2. modes. Modeling: Modeling with UML 3. Testing overview. concepts. Rationale Management: Rationale overview. activities and managing rationale 9. Project Management: Project management overview. Object Design: Object design overview. Software Engineering: Software related problems. activities and managing system design 7. /Week Univ. concepts.-Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 1.1. activities and managing configuration management 11. Lethbridge and Robert Laganiere McGraw-Hill Higher education 62 . Text Book: Object-Oriented Software Engineering: Conquering Complex and Changing Systems Bernd Bruegge and Allen H. concepts.1) Credits:4 Instruction: 3 Periods & 1 Tut. activities and managing analysis 6.1. Testing.IT4. activities and managing project management models and activities. activities and managing object design 8.1 Object Oriented Software Engineering (Common with CSE 4. activities and managing testing 10. activities & managing requirements elicitation 5. software engineering. concepts. mechanisms and activities 4. concepts. concepts. Analysis: Analysis overview. concepts. System Design: Design overview. Software Configuration Management: Configuration Management overview. Dutoit Pearson Education Asia Reference Book: Object-Oriented Software Engineering: Practical software development using UML and Java Timothy C.
Applying for IP addresses-Private networks. Comer (PHI publications). /Week Univ. SUBNETTING AND SUPERNETTING: Subnetting. D. FILE TRANSFER PROTOCOL: Connections.TCP Timers-Connection-State Transition Diagram-Congestion Control-TCP operation. INTERNET GROUP MANAGEMENT PROTOCOLS: Multicasting. TELNET AND RLOGIN: Concept-Network Virtual Terminal.Address Transformation-Byte manipulation Function-Information about Remote Host. HYPERTEXT TRANSFER PROTOCOL: HTTP overview-Proxy-Gateway-Tunnel-Cache-Messages-General Header Fields-Cache Control-Connection-Request Methods-Request Header Fields-Response MessagesResponse Header Fields-Entity Header Fields-Client/Server Authentication. TRIVIAL FILE TRANSFER PROTOCOL: Messages.Rlogin-Security Issue. SOCKET INTERFACE: Definitions-Sockets-Byte ordering.TCP Design.1.uses of UDP – UDP design.IGMP-Encapsulation.-Exam : 3 Hours IP ADDRESSING: Decimal Notation-Classes.Types of Records-Compression-DDNS-Encapsulation.IT4.ICMP design.User Interface.Checksum. Text Book: TCP/IP Protocol Suite.IP design. ARP and RARP: ARP.Communication-Command Processing-File Transfer-User Interface-Anonymous FTP.DNS Messages.Tftp ExampleTFTP options -Security-Applications.Socket System Calls.Data Transfer-UDP ports. Forouzan (TMH edition) Reference Book: Internetworking with TCP/IP.UDP operation.NVT character set -Embedding-Options-Option Negotiation-Sub option Negotiation-Controlling Server-Out of Band signaling –Escape character-Mode of Operation-Examples.Multicast Backbone.Message formats.Connectionless Iterative server.A simple Internet-Unicast and Broadcast addresses .Masking-Examples of Subnetting – Variable length Subnetting. USER DATAGRAM PROTOCOL: Process to process communication-User datagram – Checksum. TRANSMISSION CONTROL PROTOCOL: Process to Process communication -TCP Services – Segment Options.IGMP design.Checksum.UDP Client/Server Programs-Connection oriented Concurrent Server .2 NETWORK PROTOCOLS Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut. E.Supernetting.Connection. INTERNET PROTOCOL: Data gram-Fragmentation-Options.special addresses . Tech (IT) 1st Semester 63 .Error reportingQuery. Behrouz A. APPLICATION LAYER AND CLIENT-SERVER MODEL: Client-server Model-Concurrency-Processes BOOTP and DHCP: BOOTP-DHCP DOMAIN NAME SYSTEM: Name Space-Domain name Space-Distribution of Name space-DNS in the Internet-Resolution.Checksum-Flow control.ARP design – RARP INTERNET CONTROL MESSAGE PROTOCOL: Types of Messages.Error Control. IV/IV B.TCP Client/Server Programs.
3 ADVANCED OPERATING SYSTEMS Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut. An example for thread packages. Design issues. Features of RPC. System models. Protocols. Clock synchronization algorithms. Directory Service. LAN. Client module. Distributed shared memory Introduction: Shared memory. Distributed deadlock detection. loosely coupled systems. The hybrid model . Page based Distributed shared memory. exception handling. Physical Clocks. A distributed algorithms. Process and Processors in distributed systems: Threads. Allocation models.Shivaratna 64 . Dead Locks in distributed systems. Distributed File and Directory Services: Distributed file service requirements. A centralized algorithms. User package. Interface definition language. Network and protocols: An introduction to Computer networking .Tanenbanm Reference Book: Advanced Concepts in Operating Systems. Andrew s. The Client – Server Model Remote Procedure Calling: Introduction . delivery guarantees. Network file systems. Design issues. implementation . A token ring algorithms. The Bully algorithms. Processor allocation. design Issues – transparency – Flexibility – performance – scalability. Ring algorithms.IT4. Usage. binding. Locating the binder. implementation techniques. TEXT BOOK: Distributed Operating systems. Hardware & Software Concepts. Network technologies . Mutual exclusion. Classes of RPC system .-Exam : 3 Hours Introduction to Distributed Systems: Goals – Advantages of distributed systems over centralized systems – disadvantages of distributed systems. Flat file service . Design issues. Technology case study. Singhal and Niranjan G. Logical Clocks. File service components . Consistency models. Object based Distributed Shared Memory. Election algorithms. Implementation issues. Design issues for thread packages.1. Shared – variable Distributed shared memory. interface processing . RPC in Unix system Synchronization in Distributed systems: Clock synchronization. ATM. /Week Univ. The workstation model. The processor pool model. Introduction. comparison of the three algorithms. WAN. network operating systems.
Importance of communication – Purposes of communication . 5. 7. Tata McGraw-Hill. Direction: Requirements of effective direction – Motivation.IT4.-Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 1. /Week Univ. PN Reddy. Second Edition. PC Tripathi. 11. 9. Text Book: Principles of Management . Nature and functions of management: Importance of management – definition of management – management process – Roles of manager – management _ a science or art – management _ a profession. Authority Delegation and Decentralization : Source of formal authority – difference between authority and power – line and staff authority – delegation of authority – decentralization of authority. Leadership: Difference between a leader and a manager – Characteristics of leadership – Functions of a leader – Approaches to leadership – Effective leadership – Leadership style in Indian organizations. 3. 8. 2. Organization : Span of management – principles of organizing – departmentalization. Planning: Nature of planning – Importance of planning – Types of planning – Steps on planning.4) Credits:4 Instruction: 3 Periods & 1 Tut. Managerial control : Steps in a control process – Need for control – Types of control methods – Essentials of Effective control systems. 65 .4 MANAGEMENT PRINCIPALES (Common with CSE 4. 6.1. 10. 4. Decision – Making: Meaning of decision – Types of decisions. Coordination: Need for coordination – Types of coordination – Techniques of coordination.Formal ommunication Informal communication – Barriers to communication – Principles of effective Communication. Social Responsibilities of Business : Meaning of social responsibility – social responsibilities of business towards different groups.1.
propulsion subsystem. Satellite Subsystems and Global Mobile Satellite systems: Introduction. Electric power supply. TTC subsystems. structure subsystem.5 Elective -1 SATELLITE & MOBILE COMMUN ICATIONS Credits:4 Instruction: 3+1 Periods /Week Univ Exam: 3 Hours Sessional Marks: 30 Univ Exam Marks: 70 Principles of satellite communications: Evolution and growth of communication satellites. antenna systems. Reliability of satellite subsystems. TDMA Burst structure.Lee 66 . Atmospheric and Ionospheric effects on link design. Mobile Cellular Telecommunications 2nd edition --WilliumC. general and technical characteristics of satellite communication systems. TDMA frame efficiency. The GlobalStar system. synchronous satellites. D. Mobile and personal communication systems and services -.IT4. interference effects on complete link design.Dr. TDMA. earth station parameters. PHI publications Reference Books: 1. attitude and orbit control. System Noise temperature. Satellite communications -.Y. Uplink design. TDMA super frame. Mobile and Personal communications: implementation. satellite frequency allocation and band spectrum. Teledesic system.1. advent of digital satellite communications. complete link design. General link design Equations. Cellular. active and passive satellites. Multiple Access Techniques: Introduction. Introduction. Digital cellular mobile systems. advantage of satellite communication systems. TDMA frame structure. thermal control subsystems. IRIDIUM-System. repeaters.C Agarwal khanna publishers 2.Rajpandya. CDMA. Communication satellite link design: Introduction. C/N and G/T ratio. Cellular concept and its initial Text books: 1.
2002 2. Debugging techniques. typical and advanced. 2003 67 . Interrupt latency. Text Books: 1.IT4. UART and PLD‟s. Embedded Systems Design – A Unified Hardware/Software Introduction. mailboxes and pipes. shared data. Architecture. shared data problem. Getting embedded software in to the target system. Sriram V Iyer and Pankaj Gupta. mutex binary semaphore and counting semaphore. Host and target systems. timing diagrams. priority inversion. Task division. Use of real time operating system. Embedded Real Time Systems programming. Tristate devices. Embedded Software development tools. David A. Tasks . need of interrupt routines. cross compilers. Simon. ISR.Context saving. Inc. message queue. memories ( RAM. RTOS. Survey of software architectures.5 Elective-I EMBEDDED SYSTEMS Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut. 2004 Reference Books: 1. Scheduler. In-circuit emulators and monitors. Embedded system software design using an RTOS. Function queue scheduling architecture. Hard real-time and soft real time system principles. linkers. Shared data reentrancy. Interrupts basics. Interrupt routines in an RTOS environment. Programming and Design. /Week Univ. ROM.-Exam : 3 Hours Introduction to embedded systems hardware needs. Round Robin . locators for embedded systems.. timer functions. Atomic and critical section. logic analysers..1. Raj Kamal. TMH. Instruction set emulators. Pearson Education. DMA. 1999 2. events. TMH. An Embedded Software Primer. John Wiley & Sons. Inter task communication. EPROM). Testing on host machine. Inc. Built-ins on the microprocessor. Buses. Embedded Systems. Frank Vahid/ Tony Givargis.
Text Books: Mastering Visual Basic 6 –Evangelos Petroutsos –BPB Publications Visual C++ 6 . Event oriented window programming . Working with Forms: Appearance of forms. device context. Elective -1 VISUAL PROGRAMMING TECHNIQUES Credits:4 Instruction: 3+1 Periods /Week Univ Exam: 3 Hours Sessional Marks: 30 Univ Exam Marks: 70 Visual Basic Language: Variables. Building Dynamic forms at runtime. Designing Menus. The File Controls. handling mouse . radio buttons. tool bars.application object – main window object . Function return Values. Collections. Creating Active X controls. Connecting to database using VC++ and visual basic. Loop statements. Control Flow statements. Procedures. Arguments. debugging Creating ActiveX controls: DLLs . file handling .IT4. The scrollbar and Slider Controls. Nested Control structures.Steven Holzner –BPB publications 68 . controls. Microsoft foundation classes an overview Event Handling :Reading keystrokes. buttons. The List Box and Combo Box Controls.1. Constants. file handling . check box. OLE. dialog box. Drag and Drop Operations. status bar prompts. sliders. Arrays. serialization . Creating internet program‟s using visual C++ and visual basic. multiple documents. view object document object. Object technologies. Getting Started in Visual C++: Parts of Visual C++ program . list boxes. creating menus. Basic ActiveX Controls: The Textbox Control. File Handling: Understanding and working with objects. combo boxes.
Kenneth H Rosen.L.3) 2. “Discrete Mathematics: Applied Combinatorics and graph theory”.I COMBINATORICS & GRAPH THEORY Credits:4 Instruction: 3 Periods & 1 Tut. 2. Tata McGrahHill Publishing Company.J.RECURRENCE RELATIONS: Generating Functions of Sequences. PART II GRAPH THEORY 4. “Discrete Mathematics and Its Applications.Enumeration of Combinations & Permutations without repetitions and without repetitions. 5.MATCHINGS AND CONNECTIVITY : Matchings and Covers-Algorithms and applications of matching-Matchings in General graphs-Cuts and Connectivity-k-connected graphs-Network flow problems.FUNDAMENTAL CONCEPTS: what is a Graph-Paths-Cycles-Trails-Vertex Degrees and Counting-Directed Graphs-Trees and Distance-Spanning Trees-Enumeration-Optimization and Trees. West. New Delhi.5.1. The Benjamin/Cummings Publishing Company”. Pearson Education Asia.FOUNDATION: Basics.-Exam : 3 Hours PART I: COMBINATORICS 1. 6. Prentice-Hall of India Ltd.Principle of Inclusion.2. Robin J.Sets. Mott. Sessional Marks: 30 Univ-Exam-Marks:70 69 .IT4.5 Elective.Exclusion 3. 3.Proof methods./week Univ.COMINATORICS: Basics of counting-Combinations and Permutations. Baker.Mathematical Induction.4.Recurrence Relations. “Introduction to Graph Theory" Pearson Education Asia. Wilson. Abraham Kandel & Theodore P.with constrained repetitionsBinomial Coefficients-Binomial and Multinomial theorems. “ Discrete mathematics for Computer Scientists & Mathematics”. (Chapters 1.Problem-solving strategies.COLORING AND PLANAR GRAPHS: Vertex coloring and upper bounds-Structure of kchromatic Graphs-Enumerative Aspects-Embeddings and Euler‟s formula-Characterization of Planar graphs-Parameters of Planarity-Edges and Cycles-Line Graphs and edge-coloring-Hamiltonian CyclesPlanarity-coloring and cycles. New Delhi. TEXT BOOKS: 1.Douglas B.Solving Recurrence Relations using Substitution and Generating Functions-Method of Characteristic Roots-Solutions of homogeneous and inhomogeneous recurrence relations. New Delhi. California. New Delhi. “Introduction to Graph Theory”. Michel Townsend. (Chapters 1.Calculating Coefficients of Generating Functions.3.6.2. 2.Relations.7) REFFERENCE BOOKS: 1.
Series systems.Queues in Series. NA Process . Probability. REFERRENCES: 1.Concepts of Reliability.QUEUEING THEORY:.I RANDOM PROCESSES IN ENGINEERING Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut.RELIABILITY ANALYSIS:. Spectrum of a Process. PRIORITY QUEUING MODELS:. Fault analysis. ARIMA Process. Queues in Parallel. Box and Jinkins Models. Stand by redundancy. Properties of Poisson. Correlogram analysis. stationery distribution of Morkovchains.1. queues with bulk arrivals queues with bulk services. Applications of elementary renewal theorem and key renewal theorem.tub curve. Embedded Markovchains Technique. n th step transition probabilities. Renewal theory.AR Process. Applications of Queuing theory in Communication Networks. GI/G/I Queues model./week Univ. Phase type Technique. Maintainability. System reliability.IT4. Bath. Polzak.-Exam : 3 Hours 1. Throughput analysis and waiting time distributions. Birth and Death Process. Fault tree constructions.Non Morkovchian queues.Veerarajan Tata McGraw – Hill 2. Trivedi (Prentice Hall) 70 . Time dependent Birth and Death process. ARMA Process.5 Elective. Probability and Statistics with Reliability . Availability .Notion of Stochastic Process. 5. 2. parallel systems. Hazard rate functions. Poisson process. Scheduling algorithms. Periodogram analysis. Failure Time distributions. Statistics and Random Processes – By T. Queueing & Computer Science Applications – By Kishore S. Discrete time Morkovchains. Reliability of a component. 3. Classification of Stochastic Process according to Time and State Space. Kintchins formula.STOCHASTIC PROCESSES:. Stationary and Non Stationary processes:. 4.
Logic Programming. Semantic Analysis. Components of a Planning System.IT4. Rich E & Knight K – Tata Mcgrahill (1991) 2. Problem reduction. Hierarchical Planning. question answering. Representation of a problem as State space search.5 Elective. Artificial Intelligence Technique. Weak & Strong Slot Filler Structures Semantic nets. Goal State Planning. Non Linear Planning. Means Endo Analysis Predicate Logic Proof with Backward Chaining. Conceptual dependencies. Problem characteristics. Artificial Intelligence. Control Knowledge Symbolic Reasoning with uncertainty Non-monotonic Reasoning. Dependency – Directed Backtracking TMS. Resolution. Scripts Planning Block world. Expert Systems Shells. Matching. Paterson. Discuses and Pragmatic Processing. Frames. Natural Language Processing Syntactic Analysis. Introduction to Artificial Intelligence & Expert Systems. Statistical Reasoning with Bayes Theorem. Best First search. /Week Univ. production systems.I ARTIFICIAL INTELLIGENCE Credits:4 Instruction: 3 Periods & 1 Tut. Representing Knowledge Using Rules: Procedural Vs Declarative knowledge. certainty Factors & Rule Based System.-Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 Introduction to Artificial Intelligence. DS. PHI 71 . Forward Vs Backward Reasoning. Production System characteristics Heuristic Search Technologies Generate & Test Hill Climbing.Theory. Expert Systems Representing and Using Domain Knowledge.1. Constraint satisfaction. Explanation Text Books: 1.
4. POST HEAD. 1)Downloading Image Files from HTTP server: Using Java URL connection class (Ref. If the exception does not occur then the remote port is active else the remote port is inactive.IT4. 7.Identifying well known ports on a Local/Remote System: By trying to listen to the various well-known ports by opening client connections. 5. The server accepts SQL Queries from the client executes it on the database and sends the responses to the client. retrieve the mails and allow manipulation of mailbox using POP commands. 6.Simulation of Telnet: Provide a user interface to contact well known ports so that client server interaction can be seen by the user. DELETE.Writing a chat application: i)One-One: By opening socket connection and displaying what is written by one party to the other. user name and password. Book: Java Network Programming-Orielly) 72 .HTTP Server: Develop a HTTP server to implement the following commands. ii)SMTP Client: Gives the server name.1. ii)Many-Many (Broad cast): Each client opens a socket connection to that chat server and writes to the socket.-Exam : 3 Hours 1. GET. What ever is written by one party can be seen by all other parties. The server must handle multiple clients.Mail Client: i)POP Client: Gives the server name. 2.6 NETWORK PROGRAMMING LAB Credits:2 Sessional Marks: 50 Univ-Exam-Marks:50 Instruction: 3 Periods /Week Univ.Data retrieval from a Remote database: At the remote database a server listens for client connections.Simple file transfer between two systems (with out protocols): By opening socket connection to our server on one system and sending a file from one system to another. 3. send email to the recipient using SMTP commands.
testing. design/code review. 5. 3. 4. design. etc. (second month) 3. Instructor notices missed requirements and reminds students of requirements for final project. They are able to present their work in a professional manner. They can design and implement complex software solutions using state of the art software engineering techniques. They know how to test and document software. Also. Instructor goes over design/code with the team to point out problems and formalize requirements. Design documents. Instructor determines requirements for tracerbullet implementation.8 Object Oriented Software Engineering Laboratory Credits:2 Sessional Marks: 50 Univ-Exam-Marks:50 Lab: 3 Periods/week Univ. Presentations.1. Software Engineering Process. 4.-Exam : 3 Hours Computing Platform: Each student group chooses its own platform. (last month). 2. Syllabus Flexibility: High. Debugging. Object-oriented design. and project management. They are capable of working as part of a software team and develop significant projects under a tight deadline. Topics to beCovered: 1. They have deep knowledge of the technologies they used for implementing their project. Code documentation. 4. Write-up. The have working knowledge of UML. Sessional Marks Allotment: Monthly Meeting Participation: 10% Monthly Progress Reports: 15% Design/code 73 . tracer-bullet implementation demo. code review. Data Structures and Specification. The students are free to chose a project based on the instructor's approval. Final meeting. source control.IT4. 5. write-up. subject to approval by the instructor Course Objectives: 1. Team presents project idea and has it approved by instructor. Assessment Methods: 1. each project team meets individually with the instructor at least four times during the semester. Group meetings with faculty: initial proposal. Verify requirements.(beginning of third month). Team shows that it has achieved full vertical integration functionality. (first month) 2. division of labor. Unified Modeling Language (UML). the students give their final presentations and demos. Tracer-bullet implementation demo. 3. The agenda for each of the four meeting is as follows: 1. 2. 6. documentation. 2. final demo. 3.
Either resist the urge to make last minute changes. When you make significant changes. If you think you‟ll remember why you did something. and an example. Regression Testing: A good habit to get into: frequently run your program on an extensive test set. Generate files of the input and the correct output as a test set. save a version of your entire system! Never.Document: 15% Presentation: 10% Prototype Demonstration: 10% Final Project Demonstration: 30% Final Project Report: 10% General Software Engineering Tips: Be careful when making major modifications and keep backups! A good motto: There is no such thing as a safe software change.) Put together an extensive regression set! If it alerts you to one major bug (and it always does). or keep them isolated and well-marked so that they can be backed out easily if necessary. then it is time well spent. no matter how small. Else you will not know if a bug was introduced! You will get no sympathy if you break your system at the last minute. 74 . test!!! You must test your system thoroughly after making any change. Computer scientists typically hate to do documentation. A few comments. When you make a change. and let people know when you are behind or ahead of schedule. not just you. After verifying that a new change is “safe”. you are probably wrong. Communication is crucial! Don‟t make major decisions by yourself. One of the biggest mistakes that even professional software teams make is modifying code at the last minute. then you will know that you‟ve introduced a bug. can make a world of difference. Once you have a prototype. Try to exploit each other‟s strengths. run your program on the test set. (Or if the output is improved. and will prevent thrashing. Working as a Team: _ Be honest and realistic with your teammates when setting goals. it affects the whole team. If the output is different. mark it with your initials. a brief explanation. Test. One reason is that they leave it all for the end! Get into the habit of writing small comments as you go. create a set of examples that your program handles correctly. EVER make changes to the saved version – it is a reliable version that you can recover in an emergency. If you fail to meet a promised deadline. explaining what‟s happening and why. you should update the test set. Documentation: Get into the habit of documenting your code quickly as you go. This will help enormously if the change needs to be removed or modified. test. the date.
5 E COMMERCE CRYPTOGRAPHY & NETWORK SECURITY ELECTIVE –II GRAPHICS & MULTIMEDIA LAB PROJECT WORK 3 3 3 --- TOTAL CREDITS 22 Elective: I 1] WAP  Multimedia Systems  Internet and Application Technologies  VHDL  Data Ware housing & Data Mining 75 .3 IT 4. Name of the Subject Theory II – SEMESTER Periods Tutorial 1 1 1 --- B.Ref.2.2 IT 4.TECH (IT) 4th YEAR II-SEMESTER SCEME OF INSTRUCTION AND EXMINATION With effect from 2007-2008 admitted batch Maximum marks Lab ---3 3 Credits Exam 70 70 70 50 50 Sessionals 30 30 30 50 50 Total 100 100 100 100 100 4 4 4 2 8 IT 220.127.116.11.No.1 IT 4.TECH (IT) Sub.IV/IV B.2.4 IT 4.
Sessional Marks: 30 Univ-Exam-Marks:70
Instruction: 3 Periods & 1 Tut. /Week Univ.-Exam : 3 Hours
Electronic commerce environment and opportunities: Back ground – The Electronic commerce Environment – Electronic Market Place Technologies. Modes of electronic commerce: Overview – EDI – Migration to open EDI – E commerce with WWW/Internet – Commerce Net Advocacy – Web commerce going forward. Approaches to safe electronic Commerce – Overview – Source – Transport Protocols – Secure Transactions – Secure Electronic Payment Protocol – Secure Electronic Transaction – Certificates for Authentication – Security on Web Servers and enterprise networks. Electronic cash and electronic payment schemes – Internet Monitory Payment and Security requirements – payment and purchase order process – online electronic cash. Master card/ Visa Secure electronic transaction: Introduction – Business requirements - Concepts Payment Processing. Email and Secure Email Technologies for Electronic Commerce: Introduction – The means of Distribution – A model for Message Handling – How Does a Email Work. Internet Resources for Commerce: Introduction – Technologies for Web Servers – Internet Applications for commerce – Internet Charges – Internet Access and Architecture – Searching the Internet. Text Books: Web Commerce Technology Hand Book Daniel Minoli, Emma Minoli McGraw Hill Reference: Frontiers of Electronic Commerce Ravi Kalakotar, Andrew B.Whinston Addison-Wesley .
CRYPTOGRAPHY AND NETWORK SECURITY
(Common with CSE 4.2.2)
Instruction: 3 Periods & 1 Tut. /Week Univ.-Exam : 3 Hours
Sessional Marks: 30 Univ-Exam-Marks:70
INTRODUCTION: The need for security-security approaches-principles of security-Plain Text and Cipher Text-substitution and Transposition Techniques-Encryption and Decryption-Symmetric and Asymmetric Cryptography-Stenography-key range and key size-types of attacks SYMMETRIC KEY CRYPTOGRAPHIC ALGORITHMS: Algorithm types and modesoverview of symmetric key cryptography-DES-IDEA-RC5-BLOWFISH-AES-Differential and Linear Cryptanalysis. ASYMMETRIC KEY CRYPTOGRAPHIC ALGORITHMS: Overview of asymmetric key cryptography- RSA algorithm-symmetric and asymmetric key cryptography together-digital signatures-knapsack algorithm-some other algorithms. PUBLIC KEY INFRASTRUCTURE: Introduction-Digital certificates- Private Key managementThe PKIX model-Public Key Cryptography Standards- XML, PKI and Security INTERNET SECURITY PROTOCOLS: Basic concepts-SSL-SHTTP-TSP-SET-SSL versus SET3D secure protocol-Electronic money-Email security-WAP security-security in GSM USER AUTHENTICATION MECHANISMS: Introduction-Authentication basicspasswords- authentication tokens-certificate based authentication-biometrics authentication-kerberosSSO approaches PRACTICAL IMPLEMENTATIONS OF CRYPTOGRAPHY/SECURITY: Cryptographic solutions using Java-Cryptographic solutions using Microsoft-cryptographic toolkits-security and operating systems NETWORK SECURITY: Brief Introduction to TCP/IP- firewalls-IP security-Virtual Private Networks- case studies on cryptography and security. TEXT BOOK: Cryptography and Network security, Atul Kahate, Tata McGraw-Hill Pub company Ltd., New Delhi REFERENCE BOOKS: 1) Network Security Private Communication in a public world, Charlie Kaufman, Radia Perlman & Mike Speciner, Prentice Hall of India Private Ltd., New Delhi 2) Network Security Essentials Applications and Standards, William Stallings, Pearson Education, New Delhi 3) Network Security: The Complete Reference by Roberta Bragg, Mark Phodes-Ousley, Keith Strassberg Tata Mcgraw-Hill
Sessional Marks: 30 Univ-Exam-Marks:70
Instruction: 3 Periods & 1 Tut. /Week Univ.-Exam : 3 Hours
1.Introduction: What is WAP, History, Architecture and future of WAP. 2.The user interface: User interface basics, Text entry, using the cache, Types of WML cards, Graphics. WAP development Tools and Software: Editors and Emulators, SDK‟s, Converting Images. 3.Working with WML: WML basics: Writing WML code, some examples, Graphics, Templates. Forms and User input: The Options Menu, Events, Variables, Input Tag. Adding Functionality with WML Script: The rules of WML Script, Variables, Operators, Control Constructs, Reserved Words, Functions, The Standard Libraries, Arrays, pragmas, General coding Principles. 4.Database-Driven WAP: ASP and WAP, ActiveX Data Objects (ADO), methods of converting existing HTML web site to WAP, M-Commerce and Security, Push Technology and Telematics. 5.Sample Applications: Currency Converter, User Directory, Scheduling, E-Commerce
Text Books: 1. WAP „A beginners Guide‟--------- DALE BULBROOK 2.WAP Development with WML and WML Script------- BEN FORTA and KEITH
Making animation that works.schools .spread sheets . Authoring tools .Shooting and Editing . Introduction to making of multimedia: hardware .Towards professional sounds .Icon Based authoring tools .Images for web .databases .Video tips . Sound: Multimedia system sounds .Web page makers and Site builders .word processors .Colors .creativity .and organization.The World Wide Web .K.Beyond HTML DESIGNING FOR THE WORLD WIDE WEB: Working on web .IT4.time based authoring tools . Andleigh and K.Connections . Multimedia applications: business .Web browsers . MULTIMEDIA TOOLS: Macintosh and windows production platforms .presentation tools.Text for web . /Week Univ.video .2.Steve Rimmer 4.working with sounds in windows .production tips.CD-ROM and multimedia.3 Elective-II MULTIMEDIA SYSTEMS Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut.image-editing tools sound editing tools .linking multimedia objects .Integrating computers and television .homes . Multimedia Literacy . Multimedia System Design.Animation for web.3-d modeling and animation .working with sounds on the Macintosh .digital audio .computers and text . Multimedia: Computing.Font editing and design tools Hypermedia and Hypertext.Image file format. TEXTBOOKS: Multimedia: Making It Work .Broadcast video standards .Plug-ins and Delivery vehicles .Recoding formats . Video: How video works .NIFF Adding sounds to multimedia .Fred T. Thakkrar 2.public places and virtual reality.animation .text in multimedia .object oriented authoring tools .Hofstetter MGHill 79 .MIDI versus digital audio .Ralf stein Metz and Klara Nahrstedt 3.Digital video MULTIMEDIA AND THE INTERNET: Internet fundamentals: Internetworking .Internet services .-Exam : 3 Hours INTRODUCTION: Definition .making MIDI audio audio file format .Card and Page-based authoring tools . Advanced multimedia programming .office suites .cross platform-authoring tools MULTIMEDIA BUILDING BLOCKS: Text: About fonts and faces . Communication & Application .and digital movie tools .Tools for the World Wide Web: Web serves . Images: -Making still images . Animation: Principals of animation .Tay Vaughan REFERENCE BOOKS: 1.Sound for web .software .
Simple ASP. Working with Web Server Controls: The Web server control hierarchy. Data Access with ADO. The Visual Studio . Using the DataGrid to modify Data.NET. Structures. Repeating Binding Control Methods. NET data Namespaces. Label Control. Mapping Fields to the Control. Paging the Datagrid.Wiley Dreamtech publications 80 . Referencing External Code Libraries. Post back. Serialization.NET Framework and Visual Basic . Server Controls. Using Data Bound Web Controls: Data-Binding Basics.NET integrated. The . Directory Classes. Exploring ASP. life cycle of a web form and its controls. The XML Document Object Model. page layout. Validation Controls. Storing data with the DataGrid. Working with XML Data: XML in the . and the Visual Studio . CheckBox and RadioButton Controls. The Benefits of ASP. Solutions. Updating the Data store.NET Object-Oriented Programming. Image and ImageButton Control.NET.NET IDE: Planning and Creating the Visual Studio .NET: Problems with older versions of Active Server Pages. Streams.NET Programming Models.NET BIBLE – Glenn Johnson. Data Bound Controls. XML Objects.IT4. Text Book: ASP. Working with XML Documents.NET Object Programming: Definitions. Single Value Data Binding. Choosing the Appropriate Development Environment. ADO. DropDownList and LIstBOx Controls. View State.NET Page.NET Framework.3 Elective-II INTERNET AND ITS APPLICATION TECHNOLOGIES Credits:4 Instruction: 3 Periods Lec&1Tut/week Univ-Exam: 3 Hours Sessional Marks: 30 Univ-Exam-Marks: 70 Introducing ASP.NET: Connected versus Disconnected Data.NET and Web Forms: Web Forms. Validating XML Documents. Event Handler Procedure Arguments.NET Data Provides. Interfaces. Enumerations. Repeating Bindin Control Events. The . Setting up the Development Environment. ADO.2. TextBox Control. Responding to Events. Modified Table Data. Code-Behind page. Adding the Solution to Visual SourceSafe. Button and LinkButton Control. Primary Data Objects. File Classes. Projects. File Access and Serialization: Stream Classes. Two ASP.NET Framework. Hyperlink control. XML Namespace. Working with Collections. Visual Basic .
8).2. 2002 2. Samir Palnitkar.2. Fundamentals of Digital Logic with Verilog Design. (chapters: 1..7.5. Stephen Brown and Zvonko Vranesic. Tata McgrawHill.6. Bhasker. 4.-Exam : 3 Hours 1. Verilog HDL – A Guide to Digital Design and Synthesis.IT4. 6. /Week Univ.3 Elective-II V H D L Credits:4 Sessional Marks: 30 Univ-Exam-Marks:70 Instruction: 3 Periods & 1 Tut. 2.4. 1999 81 . 5. J. A Verilog HDL Primer. Ltd. 2001 Reference Books: 1. Pearson Education Pte. 7. Star galaxy Pub. Second Edition. 8.3. Overview of Digital Design with Vermilion HDL Hierarchical Modeling Concepts Basic Concepts Modules and ports Gate-Level Modeling Dataflow Modeling Behaviour Modeling Tasks and Functions Text Book: 1. 3.
-Exam : 3 Hours Sessional Marks: 30 Univ-Exam-Marks:70 1.What is Concept Description? Data Generalization and summarization-based Characterization. Data Mining Techniques. Prediction. A Data Mining query language. Discretization and Concept Hierarchy Generation 4Data Mining Primitives. Fuzzy Set Approaches.3 Elective-II DATA WARE HOUSING AND DATA MINING Credits:4 Instruction: 3 Periods & 1 Tut.Data Mining Primitives: What defines a Data Mining Task?. Classification Based on Concepts from Association Rule Mining. Jiawei Han and Micheline Kamber. Constraint-Based Association Mining 7Classification and prediction. A. Data Integration and Transformation Data Reduction. Mining Class Comparisons: Discriminating between different Classes. Generic Algorithms.Based Reasoning. Case.IT4. Introduction to Data Mining. Data Warehouses. Advanced Database Systems and Advanced Database Applications. Mining Multilevel Association Rules from Transaction Databases. Major issues in Data Mining. A Categorization of Major Clustering Methods Text Book: Data Mining Concepts and Techniques.Introduction to Data Mining: Motivation and importance. Development of Data Cube Technology. Adriaan. Interestingness of a pattern Classification of Data Mining Systems.K. Mining Single. Mining Descriptive Statistical Measures in large Databases 6Mining Association rule in large Databases. University Press 82 . Relational Databases. From Association Mining to Correlation Analysis. Rough Set Approach. Data Mining Functionalities. Transactional Databases. Mining Multidimensional Association Rules from Relational Databases and Data Warehouses. What is Data Mining. Classification by Decision Tree Induction. Morgan Kaufman Publications Reference Books: 1. Bayesian Classification. Classifier Accuracy 8Cluster Analysis What is Cluster Analysis? Types of Data in Cluster Analysis.2.Pujari. Analytical Characterization: Analysis of Attribute Relevance. Languages and system Architectures. Designing Graphical Use Interfaces Based on a Data Mining Query language. 2. Data Warehouse Implementation. /Week Univ. Classification by Back-propagation.Architectures of Data Mining Systems 5Concept Description: Characterization and comparison . Data Warehousing to Data Mining 3Data Preprocessing Why Pre-process the Data? Data Cleaning.Dimensional Boolean Association Rules from Transactional Databases.Concepts and Issues regarding Classification and Prediction. Association Rule Mining. Data Warehouse Architecture.Data Warehouse and OLAP Technology for Data Mining What is a Data Warehouse? Multi-Dimensional Data Model. Other Classification Methods like k-Nearest Neighbor Classifiers. Addison Wesley Publication 2.
Books: 2) Prabhat K. 13." possibly using your "What is Multimedia?" text. flowchart. 2. “ Multimedia in Action”.4 GRAPHICS & MULTIMEDIA LABORATORY Credits:2 Sessional Marks: 50 Univ-Exam-Marks:50 Lab: 3 Periods/week Univ. User Interface Design & Graphics II: Create a user interface for your final project. 4) James E. New Delhi. they must be your original work created in any of the acceptable tools. Rotation. 7. Coloring the pictures and Zooming. Creating three dimensional objects using wire frame modeling. Digital Video: Use video capture to digitize your video shoot ro another video source to create short production (15-45 seconds) 8. Include summary. Andleigh & Kiran Thakrar. 5. Include graphics.) 2. 6. Creating various types text and fonts. 3. Production Planning and Design: Create a proposal of project. Corel Presentations 9 is free and is acceptable. Coloring the 3 D objects. Create three basic Web pages using Dreamweaver / flash or other authoring package or write bare HTML if you are able.2. pages must be linked and must include at least one graphic per page. 7. “ Mulitmedia Systems Design”. Vikas Publishing House. 4. Creating an object and applying animation of key framing. 1. Multimedia Sound: Create 2 soundtracks and 2 EFX sounds for a previous project. scaling and translating the 3 D objects. New Delhi. Include 2 backgrounds and 1 button set. Vikas Publishing House. (Power point is suggested. 83 . 10. 8. 3) Calleen Coorough. 5. Creating two dimensional objects using the lines and curves Animating the two dimensional pictures using transformations. Multimedia: 1 Preproduction & Presentation Graphics: Create a 7-10 slide presentation in your favorite presentation graphics application. 11. “Multimedia and the Web Creating digital Excitement”. Creating rugged surfaces based on fractal geometry. 9. New Delhi. Drawing various types of lines and curves. 3. 4. Desktop Publishing: Create a 2-page desktop-published "newsletter.IT4. Exam : 3 Hours Graphics: using any graphic package. Shuman. 6. element and resource lists. Prentice Hall of India. Aim for a cohesive look. 12. Shading the 3 D objects Rendering the objects Creating smooth surfaces. Typefaces and Graphics: Create 1 vector and 1 bitmap graphic.
TECH. 5. ARRANGEMENT OF CONTENTS: The sequence in which the project report material should be arranged and bound should be as follows: 1. 4. 9. 3. The term „SUPERVISOR‟ must be typed in capital letters between the 84 3. The certificate shall carry the supervisor‟s signature and shall be followed by the supervisor‟s name. department and full address of the institution where the supervisor has guided the student.(IT) 1. 3. PAGE DIMENSION AND BINDING SPECIFICATIONS: The dimension of the project report should be in A4 size. The cover should be printed in black letters and the text for printing should be identical. 2. 10. Abbreviations and Nomenclature Chapters Appendices References The table and figures shall be introduced in the appropriate places.2. 6.5 Project: 6 Periods /week PROJECT WORK Credits:8 Sessional Marks: 50 Univ-Exam-Marks:50 GUIDELINES for preparing the report of the Project Work FORMAT FOR PREPARATION OF PROJECT REPORT FOR B. 3. academic designation (not any other responsibilities of administrative nature). 7.1 PREPARATION FORMAT: Cover Page & Title Page – A specimen copy of the Cover page & Title page of the project report are given in Appendix 1. as per the format in Appendix 2.IT4.2 . Bonafide Certificate – The Bonafide Certificate shall be in double line spacing using Font Style Times New Roman and Font Size 14. 2. Cover Page & Title Page Bonafide Certificate Abstract Table of Contents List of Tables List of Figures List of Symbols. 8. The project report should be bound using flexible cover of the thick white art paper.
One and a half spacing should be adopted for typing the matter under this head. (ii) Chapters developing the main theme of the project work (iii) and Conclusion. One and a half spacing should be adopted for typing the matter under this head. The main text will be divided into several chapters and each chapter may be further divided into several divisions and sub-divisions. etc.8 85 . A specimen copy of the Table of Contents of the project report is given in Appendix 3. Tables and figures in a chapter should be placed in the immediate vicinity of the reference where they are cited. Font Style Times New Roman and Font Size 14.4 3.6 3.3 3. 3. 3. Abstract – Abstract should be one page synopsis of the project report typed double line spacing. One and a half spacing should be adopted for typing the matter under this head. which is included in the main text may serve as a distraction and cloud the central theme. Each chapter should be given an appropriate title. List of Figures – The list should use exactly the same captions as they appear below the figures in the text. Tables and References appearing in appendices should be numbered and referred to at appropriate places just as in the case of chapters. Standard symbols. Appendices should be numbered using Arabic numerals. Table of Contents – The table of contents should list all material following it as well as any material which precedes it. Chapters – The chapters may be broadly divided into 3 parts (i) Introductory chapter.g. Appendix 1. List of Tables – The list should use exactly the same captions as they appear above the tables in the text. e. Appendices.9 Appendices – Appendices are provided to give supplementary information. Footnotes should be used sparingly. Abbreviations and Nomenclature – One and a half spacing should be adopted or typing the matter under this head. which refers to the material they annotate. They should be typed single space and placed directly underneath in the very same page. List of Symbols. abbreviations etc. Appendices shall carry the title of the work reported and the same title shall be made in the contents page also. The title page and Bonafide Certificate will not find a place among the items listed in the Table of Contents but the page numbers of which are in lower case Roman letters.7 3.supervisor‟s name and academic designation. should be used.5 3. Appendix 2.
421-425. pp. (1984) „Open Loop Minimum Time Control of Mechanical Manipulations and its Applications‟. TYPING INSTRUCTIONS: The impression on the typed copies should be black in colour. The general text shall be typed in the Font style „Times New Roman‟ and Font size 14. One and a half spacing should be used for typing the general text. 3. N.10 List of References –The listing of references should be typed 4 spaces below the heading “REFERENCES” in alphabetical order in single spacing left – justified. and Kellogg. Pramana – Journal of Physics Vol. (1994) „Transport Phonomena of Sm Sel – X Asx‟. Shin. S. Vol. C. 2. and Natarajan. K.By the word Table. The name of the author/authors should be immediately followed by the year and other details. maps. pp. 4. pp. No.3.42.D. 1231-1236. Barnard. J. photographs and diagrams may be designated as figures. Michigan Mach. graphs. All other non-verbal materials used in the body of the project work and appendices such as charts.81–94.10. The reference material should be listed in the alphabetical order of the first author. A typical illustrative list given below relates to the citation example quoted above. Proc. ***** 86 . S.27.G..W.Contr. (1980) „Applications of Convolution Operators to Problems in Univalent Function Theory‟. R. and Mckay. San Diego. REFERENCES 1. CA. Ariponnammal. is meant tabulated numerical data in the body of the project report as well as in the appendices.1.Conf. 3.1 Table and figures ..Amer.
(A typical Specimen of Cover Page & Title Page) <Font Style Times New Roman – Bold> TITLE OF PROJECT REPORT <Font Size 18><1.5 line spacing> MONTH & YEAR <Font Size 14> 87 .5 line spacing><Italic> BACHELOR OF TECHNOLOGY <Font Size 16> IN INFORMATION TECHNOLOGY <Font Size 14> DEPARTMENT OF COMPUTER SCIENCE AND SYSTEMS ENGINEERING <Font Size 12> ANDHRA UNIVERSITY AUTONOMOUS COLLEGE OF ENGINEERING < Font Size 14> ANDHRA UNIVERSITY : VISAKHAPATNAM .5 line spacing> A PROJECT REPORT <Font Size 14> Submitted by <Font Size 14><Italic> NAME OF THE CANDIDATE(S) <Font Size 16> in partial fulfillment for the award of the degree of <Font Size 14><1.530003 <Font Size 16><1.
SPECIMEN SOME PERFORMANCE ASPECTS CONSIDERATIONS OF A CLASS OF ARTIFICIAL NEURAL NETWORK A PROJECT REPORT Submitted by SANDHY. A GAYATHRI. R in partial fulfillment for the award of the degree of BACHELOR OF TECHNOLOGY in INFORMATION TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND SYSTEMS ENGINEERING ANDHRA UNIVERSITY AUTONOMOUS COLLEGE OF ENGINEERING ANDHRA UNIVERSITY:: VISAKHAPATNAM-530 003 MAY 2005 88 .
<<Signature of the Head of the Department>> SIGNATURE <<Name>> HEAD OF THE DEPARTMENT <<Signature of the Supervisor>> SIGNATURE <<Name>> SUPERVISOR <<Academic Designation>> <<Department>> <<Full address of the Dept & College >> <<Department>> <<Full address of the Dept & College >> 89 .” is the bonafide work of “…………..TITLE OF THE PROJECT…………….(A typical specimen of Bonafide Certificate) <Font Style Times New Roman> ANDHRA UNIVERSITY : VISAKHAPATNAM-530 003 <Font Style Times New Roman – size -18> BONAFIDE CERTIFICATE <Font Style Times New Roman – size -16> <Font Style Times New Roman – size -14> Certified that this project report “……….…………” who carried out the project work under my supervision..NAME OF THE CANDIDATE(S).
2. .. 1 1 2 5 12 19 25 29 30 45 58 69 75 99 100 2..2..2 ..... .1 General 1. . . ..2 2. ...2 . . . ABSTRACT LIST OF TABLE LIST OF FIGURES LIST OF SYMBOLS TITLE PAGE NO. .1 GENERAL 2. .... ... . 1. .2. 1. ...2.. . .2..3 .... . . .. . 1.2 General . 1..1 1. . .(A typical specimen of table of contents) <Font Style Times New Roman> TABLE OF CONTENTS CHAPTER NO.2.. . .3 ... .. . ... INTRODUCTION 1.. . .2 GENERAL . .. . …………….. .. .. 90 .2... .. .. .. .. . LITERATURE REVIEW 2. .3 1. .... .. iii xvi xviii xxvii 1. . .1 1.2. ..2. 1. .. . ..4 .
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue listening from where you left off, or restart the preview.