B.Tech Syllabus2008-12 IT

135
Scheme of Examination and Syllabus for B.Tech. (Information Technology) Batch 2008 – 2012

Transcript of B.Tech Syllabus2008-12 IT

Page 1: B.Tech Syllabus2008-12 IT

Scheme of Examination

and Syllabus

for

B.Tech. (Information Technology)

Batch 2008 – 2012

Maharishi Markandeshwar

University, Mullana, Ambala

Page 2: B.Tech Syllabus2008-12 IT

Maharishi Markandeshwar University, Mullana – AmbalaScheme of B.Tech. (Information Technology) for Batch 2008 - 2012

B.Tech. (Information Technology) Semester - III

L T P TOTAL CREDITSHUT - 201 Engineering Economics 3 1 - 4 3.5ECE - 205 Analog Communication 3 1 - 4 3.5IT - 203 Digital System Design 3 1 - 4 3.5IT - 205 Advanced C and Data Structures 3 1 - 4 3.5IT - 207 Internet Fundamentals 3 1 - 4 3.5IT - 209 Discrete Mathematical Structures 3 1 - 4 3.5IT - 211 Colloquium 1 - - 1 1ECE - 207 Analog Communication lab - - 2 2 1IT - 213 Digital System Design Lab - - 3 3 1.5IT - 215 Advanced C and Data Structures Lab - - 3 3 1.5IT-217 Internet Fundamentals Lab - - 2 2 1

19 6 10 35 27

B.Tech. (Information Technology) Semester - IV

L T P TOTAL CREDITSMA-201 Mathematics III 3 1 - 4 3.5IT - 202 Data Base Management Systems 3 1 - 4 3.5IT - 204 Computer Organization & Architecture 3 1 - 4 3.5IT - 206 Advanced Data Structures 3 1 - 4 3.5IT - 208 Object Oriented Programming Systems 3 1 - 4 3.5IT - 210 Operating Systems 3 1 - 4 3.5IT - 212 Seminar 2 - - 2 2IT - 214 DMBS Lab - - 3 3 1.5IT - 216 Advanced Data Structures Lab - - 3 3 1.5IT - 218 OOPS Lab - - 3 3 1.5

20 6 9 35 27.5

Page 3: B.Tech Syllabus2008-12 IT

Maharishi Markandeshwar University, Mullana - Ambala Scheme of B.Tech. (Information Technology) for Batch 2008 - 2012

B.Tech. (Information Technology) Semester - V

L T P TOTAL CREDITSIT - 301 Digital Data Communication 3 1 - 4 3.5IT - 303 Microprocessor and Interfacing 3 1 - 4 3.5IT - 305 Analysis & Design of Algorithms 3 1 - 4 3.5IT - 307 Java Programming 3 1 - 4 3.5IT - 309 System Modelling & Simulation 3 1 - 4 3.5IT - 311 Software Engineering 3 1 - 4 3.5IT - 313 Colloquim 2 - - 2 2IT - 315 Microprocessor and Interfacing Lab - - 3 3 1.5IT - 317 Java Programming Lab - - 3 3 1.5IT - 319 Analysis & Design of Algorithms Lab - - 3 3 1.5IT - 321 Industrial Training & Project Work - - - - 4

20 6 9 35 31.5

B.Tech. (Information Technology) Semester - VI

L T P TOTAL CREDITSIT - 302 Computer Networks 3 1 - 4 3.5IT - 304 Unix/Linux OS & Shell Programming 3 1 - 4 3.5IT - 306 Theory of Computation 3 1 - 4 3.5IT - 308 Web & .Net Technologies 3 1 - 4 3.5IT - 310 Computer Graphics 3 1 - 4 3.5ES – 101 Environmental Studies 3 - - 3 -IT – 312 Computer Networks Lab - - 3 3 1.5IT – 314 Visual Basic & .Net Lab - - 3 3 1.5

IT – 316 Computer Graphics Lab - - 3 3 1.5IT – 318 Unix/ Linux Programming Lab - - 3 3 1.5

18 5 12 35 23.5

Page 4: B.Tech Syllabus2008-12 IT

Maharishi Markandeshwar University, Mullana - Ambala Scheme of B.Tech. (Information Technology) for Batch 2008 - 2012

B.Tech. (Information Technology) Semester - VII

L T P TOTAL CREDITSIT - 401 Broad Band Communication 4 1 - 5 4.5IT - 403 Compiler Design 3 1 - 4 3.5IT - 405 Multimedia & Virtual Reality 3 1 - 4 3.5

Elective - I 4 1 - 5 4.5Elective - II 4 1 - 5 4.5

IT - 407 Broad Band Communication Lab - - 3 3 1.5IT - 409 Multimedia & Virtual Reality Lab - - 3 3 1.5IT - 411 Elective I Lab - - 3 3 1.5IT - 413 Minor Project - - 3 3 1.5IT - 415 Industrial Training - - 0 0 2

18 5 12 35 28.5Elective - IIT-417 Advanced Web DesigningIT-419 Advanced Java ProgrammingElective - IIIT-421 Advanced Computer NetworksIT-423 Object Oriented Software Engineering

B.Tech. (Information Technology) Semester - VIII

L T P TOTAL CREDITSIT - 402 Mobile Communication 4 1 - 5 4.5IT - 404 E-Commerce 4 1 - 5 4.5IT - 406 Datawarehousing & Data Mining 4 1 - 5 4.5

Elective - III 4 1 - 5 4.5Elective - IV 4 1 - 5 4.5

IT - 408 Major Project Lab - - 6 6 3IT - 410 Mobile Communication Lab - - 2 2 1IT - 412 Seminar 2 2 1IT - 414 Comprehensive Viva - - - - 1IT - 416 General Fitness & Professional apptitude - - - - 1

20 5 10 35 29.5Elective - IIIIT-418 Digital Image ProcessingIT-420 Advanced Database Management SystemsElective - IVIT-422 Cryptography & Security SystemsIT-424 Distributed Operating Systems

Page 5: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 3rd Semester Engineering Economics (HUT – 201)

L T P Cr Theory : 603 1 0 3.5 Sessionals : 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions will be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one from each unit.

Unit – 1Engineering and Economics: Definition and Scope, Role of Economics in Engineering.Demand and elasticity of demand: Meaning, types and determinants of demand: Law of demand, changes in demand, Elasticity of demand, Price elasticity of demand, Degrees of price elasticity of demand, measurement of price elasticity of demand, Factors affecting price elasticity of demand, Importance of price elasticity of demand ; Income elasticity of demand and cross elasticity of demand.Demand forecasting: Purpose, significance and techniques.

Unit – 2Theory of Production: Law of variable proportions and laws of returns to scale.Cost: Concept of costs, short and long run cost functions, economies and diseconomies of scale.Market structures: Features of Perfect Competition, Monopoly and Monopolistic Competition.

Unit – 3Money and Banking: Money market, Components of money market, commercial bank, functions of commercial bank, central bank, Functions of central bank with special reference to Reserve Bank of India.Monetary Policy: Objectives of monetary policy.Instruments of Monetary Policy: Qualitative and Quantitative methods of credit control.

Unit – 4Indian Economy: Nature and characteristics.Economic Reforms: An Introduction; Globalization: Meaning, Merits and Demerits, Impact of globalization on Indian economy; Privatization: Meaning, Merits and Demerits, Steps of Indian Economy towards privatization.Elementary concepts of VAT, WTO, GATT and TRIPS

REFERENCES:

1. Business Economics Micro, Ahuja H.L., S.Chand & Co. Ltd., New Delhi.2. Economics for Engineers, Gupta M.L. & Gupta S.P., ESS PEE Publications,

Chandigarh.

Page 6: B.Tech Syllabus2008-12 IT

3. Modern Microeconomics, 2nd Edition, Koutsoyiannis A., Macmillan Publications.4. Elementary Economic Theory, Gupta R.D., Kalyani Publishers.5. WTO and the Indian Economy, Chadha G.K., Deep and Deep Publications Pvt. Ltd..6. Essentials of Business Environment, Aswathappa K., Himalaya Publishing House,

New Delhi.7. Course in Microeconomic Theory, Kreps A., Prentice Hall of India Pvt. Ltd., New

Delhi.8. Economics, Samuelson Paul A. & Nordhaus William D., Tata McGraw Hill

Publishing Co. Ltd., New Delhi.9. Modern Microeconomics, Jhingan M.L., Vrinda Publications (P) Ltd..10. Money, Banking, International Trade & Public Finance, Seth, M.L., Educational

Publishers, Agra.

Page 7: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 3rd SEMESTERAnalog Communication (ECE-205)

L T P Cr External Marks: 60 3 1 - 3.5 Internal marks: 40

Time Duration: 3 Hrs. Total Marks: 100

Note: Eight questions will be set in all by the examiner taking at least two from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

UNIT – INOISE: Classification of Noise, Various sources of Noise, Addition of Noise due to several sources; noise in amplifiers in cascade, noise in reactive circuits, Noise figure, its calculation and measurement. Noise temperature, signal to noise ratio, noise bandwidth.

UNIT-IIAmplitude MODULATION: Basic constituents of Communication Systems, need of modulation, Amplitude modulation, spectrum of AM wave, modulation index, DSBSC modulation, SSB Modulation, Collector modulation, Square law modulation methods, Methods of generating SSB Signals, vestigial side band modulation, Detection of AM Signal; Diode detector, Square Law Detector. Time Constant RC in diode detector, Diode detector with filter

UNIT-IIIANGLE MODULATION: frequency and phase modulation, spectrum of FM Wave, modulation index and Bandwidth of FM Signal, NBFM and WBFM, Comparison between FM and PM Signals, FM and AM signals, AM and NBFM Signals, FM generation methods, Demodulation methods; slope detector, ratio detector, Foster-Seeley discriminator.Pre-emphasis & De-emphasis.

UNIT-IVTRANSMITER AND RECEIVER: Classification of radio transmitters, Block diagram of AM transmitter, Frequency Scintillation, Frequency drift, Radio broadcast transmitter,Radio telephone transmitter, Armstrong FM transmitter, Classification of radio receivers, TRF receives, super heterodyne receivers, Image Signal rejection, frequency mixers, Intermediate frequency, AGC, AFC, SSB receiver

REFERENCE BOOKS:1. Principles of Communication Systems: Taub & Schilling, TMH Publication, New

Delhi.2. Radio Engineering: Mithal G K, Khanna Pub, New Delhi.3. Communication Systems, Sirnon Haykin, John Wiley Pub., New Delhi.4. Electronics Communication System, Dungan F.R., Thomson-Delmar. 5. Electronics Communication System: Kennedy; TMH, New Delhi.

Page 8: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 3rd SemesterDigital System Design (IT–203)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-INumber Systems and Conversion, Boolean Algebra, SOP and POS form, inversion, duality, factoring in and out of expressions, XOR and equivalence operation, algebraic simplification; Consensus theorem, Combinational Circuit Design: using Truth Tables, Karnaugh Maps including 5 and 6 variable kernaugh maps, QM method, Patrick’s methodUnit-IIMulti-Level combinational Circuits using NAND only and NOR only universal gates Multiplexers, De-multiplexer, Encoder, Decoders, Read-Only Memories, Programmable Logic Arrays, Combinational Logic Circuit design using VHDL

Unit-IIILatches and Flip-Flops(S-R, J-K, T, D), Register and Counter Design Using Flip-Flops, Sequential parity checker, code converter, Analysis of Clocked Sequential Circuits, Mealy and Moore circuits

Unit-IVState Graphs and Tables, Reduction of State Tables and State Assignment, Sequential Network design using state tables and state graphs, Circuits for Arithmetic Operations, Arithmetic Circuit design using VHDL

Text Book: Fundamental of Logic Design by Charles: H Roth: Thomson Press (5th Edition),

New Delhi. Modem Digital Electronics (3rd Edition): R.P Jain, TMH, New Delhi.

Reference Books: Digital Integrated Electronics: Taub & Schilling: MGH. Digital Principles and Applications: Taub & Schilling: MGH Publications, New

Delhi. Digital Design: Morris Mano: PHI, New Delhi.

Page 9: B.Tech Syllabus2008-12 IT

B. Tech (IT) 3rd SemesterAdvanced C and Data Structures (IT – 205)

L T P Cr External Marks: 60 3 1 - 3.5 Internal marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-IReview of control structure, functions, macros and arrays in C, Pointers; array of pointers, pointer to arrays and functions, Structures; Self referential structures, Pointer to structures, array of structures, function call by value and reference using pointers, structures and arrays as arguments, Variable number of arguments in functions, String Handling and explicitly defining all the functions related to strings, Union, enumerated data type, bitwise operator and their use, Command line arguments, Low level and high level File handling, input-output functions/macros; printf, scanf, fprintf, fscanf, sprintf, sscanf, getc, getch, getchar, gets, puts. Storage classes of variables, Use of static global variables

Unit-IIMulti dimensional array, Static and dynamic memory allocation for arrays, operation on arrays; insertion, deletion, displaying, Searching (Linear Search, Binary Search, Heuristic Binary Search) and sorting (Selection Sort, Bubble Sort, Insertion Sort, Shell Sort, Merge Sort, Quick Sort, Dictionary Sorts)

Unit-IIIAbstract Data Types, Stack operations; push, pop, is_stack_full, is_stack_empty, peek, display_stack implementation and applications; polish notation inter-conversions,evaluation of postfix expression, Queue operations; insert_element, Remove_element, is_queue_full, is_queue_empty, display_queue, implementation and applications; Dequeue and circular queue implementation and applications

Unit-IVLinear Linked List implementation and applications, Circular Linked List implementation and applications, Josephus Problem, Doubly Linked List implementation and applications, Dynamic Implementation of stack, queue and dequeue, Sorting using linked list and merging of two sorted linked list

Text books:1. Programming with C by Byron S. Gottfried, TMH, New Delhi.2. Data Structures using C and C++ by A.M.Tenenbaum, Langsam, Moshe

J.Augentem, PHI, New Delhi. 3. Data Structures and Algorithum by A.V.Aho , J.E.Hopcroft and T.D. Ullman,

Addison -Wesley, 1999, New Delhi.

Page 10: B.Tech Syllabus2008-12 IT

Reference Books:1. Programming in C, 3rd Edition, July 2004, Stephen G. Kochan, Pearson

Education, New Delhi. 2. C Programming Language, 2nd Edition, Kernighan and Ritchie, Prentice Hall, Inc.,

1988, New Delhi.3. Data Structures and Program Design in C by Robert Kruse, PHI, New Delhi.4. Theory & Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline

by TMH, New Delhi.5. Data Structure and the Standard Template Library – William J. Collins, 2003,

TMH, New Delhi.6. Fundamentals of Computing and C Programming, R. B. Patel, Tech Publications,

New delhi.

Page 11: B.Tech Syllabus2008-12 IT

B. Tech (IT) 3rd SemesterInternet Fundamentals (IT – 207)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-1 Introduction to Networks and its Features, Types of Networks. Internet: working of internet, Diff. b/w internet, Intranet &extranet, Modems: Types of Modems, Modes of connecting to internet, internet service providers (ISPs), Internet address.(IPV4 &IPV6). DNS: Domain Name System, Types of DNS.Internet Tools: Telnet and FTP, HTTP, gopher commands, SMTP, MIME, Newsgroups. Unit-2 World Wide Web: Introduction, miscellaneous Web Browser, searching the WWW: Directories search engines and Meta Search Engines, working of the search engines, TCP/IP, UDP: formats & difference. Introduction to Browser, Coast-to-Coast Surfing, Web Page Installation, Web Page Setup, Using front page express, plug –ins.

Unit-3Electronic Mail: introduction, advantages and disadvantages, user Ids, pass words, e-mail address, message components, message composition, E-mail inner workings, mailing lists, chat rooms and secure mails, PICO, PINE.

Unit-4Servers: Introduction to Web servers: PWS, IIS, Apache; Microsoft personal Web server. Accessing & using these servers, Encryption schemes, Digital signatures, Firewalls, Intrusion detection systems (IDS) HTML: Hypertext markup language, basics of HTML & formatting and hyperlink creation, commands of HTML, DHTML, Difference b/w HTML and XML.

Text book: Fundamentals of the Internet and the Word Wide Web, Raymond Greenlaw and

Ellen Hepp- 2001, TMH, New Delhi. Internet and Word Wide programming, Deitel, Deitel & Nieto, 2000, Pearson

Education, New Delhi.Reference books:

Complete Idiots Guide to Java Script,. Aron Weiss, QUE, 1997. Networks Firewalls, Kironjeet Syan –New Rider Pub. Networling Essentials –Firewalls Media, New Delhi. Alferd Glkossbrenner-internet 101 computing MGH, 1996, New Delhi.

Page 12: B.Tech Syllabus2008-12 IT

B. Tech (IT) 3rd SemesterDiscrete Mathematical Structures (IT – 209)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-1Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets, Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product, Representation of relations, Types of relation, Binary relations, Equivalence relations and partitions , Partial ordering relations and lattices. Mathematics Induction, Principle of Inclusion &Exclusion, Propositions .Function and its types, Composition of function and relations, Cardinality and inverse relations, Functions & Pigeon hole principles.

Unit-2Propositional Calculus: Basic operations: AND (^), OR (v), NOT (~), Truth value of a compound statement, propositions, tautologies, contradictions.Techniques of Counting: Rules of sum and product, Permutations with and without repetition, Combination.Sequence, Series And Recurrence Relation :Polynomials and their evaluation, Sequences, Introduction to AP, GP and AG series, partial fractions, linear recurrence relation with constant coefficients, Homogeneous solutions, Particular solutions, Total solution of a recurrence relation using generating functions.

Unit-3Algebric Structures Definition, elementary properties of algebraic structure, examples of a monoid, Semigroup, Groups and rings, Homomorphism, Isomorphism and Automorphism, Subgroups and Normal subgroups, Cyclic groups, Integral domain and fields, Cosets, Lagrange’s theorem, Rings, Division.

Unit-4Graphs And Trees: Introduction to graphs, Directed and Undirected graphs, Homomorphic and Isomorphic graphs, Subgraphs, Cut points and Bridges, Multigraph and Weighted graph, Paths and circuits, Shortest path in weighted graphs, Eurelian path and circuits, Hamilton paths and circuits, Planar graphs, Euler’s formula, Trees, Rooted trees, Spanning trees & cut trees, Binary trees and its traversals.

Text Books: Elements of Discrete Mathematics, C.L Liu, 1985, McGraw Hill, New Delhi.

Discrete Mathematical Structures, B. Kolman and R.C. Busby, 1996, PHI, New Delhi.

Page 13: B.Tech Syllabus2008-12 IT

Discrete Mathematical Structures with Applications to Computers by Trembley & Manohar, 1995, MGH, New Delhi.

Reference Books

Concrete Mathematics: A Foundation for Computer Science, Ronald Graham, Donald Knuth and Oren Patashik, 1989, Addison-Wesley, New Delhi.

Mathematical Structures for Computer Science, Judith L. Gersting, 1993, Computer Science Press.

Applied Discrete Structures for Computer Science, Doerr and Levasseur, (Chicago: 1985, SRA)

Discrete Mathematics by A. Chtewynd and P. Diggle (Modular Mathematics Series), 1995, Edward Arnold, London,

Discrete Mathematics, Schaum’s Outline series: McGraw-Hills Singapore.

Page 14: B.Tech Syllabus2008-12 IT

3rd Semester B. Tech. (Information Technology) Analog Communication Lab (ECE-207)

L T P Cr Internal marks: 60- - 2 1 External mark: 40

List of Experiments

1. i) To study Double Sideband Amplitude Modulation and determine its modulation

factor and power in sidebands.

ii) To study amplitude demodulation by linear diode detector.

2. i)To study Frequency Modulation and determine its modulation factor.

ii) To study PLL 565 as frequency demodulator.

3. To study Sampling and reconstruction of pulse amplitude modulation system.

4. To study the Sensitivity characteristics of superhetrodyne receiver.

5. To study the Selectivity characteristics of superhetrodyne receiver

6. To study the Fidelity characteristics of superhetrodyne receiver

7. i) t o study Pulse Amplitude Modulation

ii) Using switching method

iii) By sample and hold circuit

ii) To demodulate the obtained PAM signal by IInd order Low pass filter

8. To study Pulse Width Modulation/Demodulation.

9. To study Pulse Position Modulation/Demodulation

10. To study active filters (Low pass, High pass, Band pass, Notch filter)

Page 15: B.Tech Syllabus2008-12 IT

3rd Semester B. Tech. (Information Technology) Digital System Design Lab (IT - 213)

L T P Cr Internal marks: 60- - 3 1.5 External mark: 40

List of Experiments

1. Familiarization of the digital trainer kit.

2. Study of the various TTL gates-AND,OR,NOT,NOR,NAND,EX-OR USING IC

3. Verify the truth table of the ABC+A’BC+AB’C+ABC’=AB+BC+CA

4. Design the gate configuration of the for the following K-Map - m(1,2,3,5,6,7,8,9)

5. 3)Design and verify the truth table of the 4-bit Comparator

6. Design and verify the truth table of the S-R F/F,J-K F/F,D-Type F/F,T TYPE F/F.

7. Design and verify the operation of the Multiplexer and De-Multiplexer with the help of the gates.

8. Design and Verify the operation of the Left-Shift Register.

9. Design and verify the operation of the TRight Shift Register.

10. Design and verify the operation of the Asynchronous Mod10 Counter.

11. Design and verify the operation of the UP/DOWN Counter.

12. Verify the truth table of the BCD-7 Segment Display

Page 16: B.Tech Syllabus2008-12 IT

3rd Semester B. Tech. (Information Technology)Advanced C and Data Structures Lab (IT-215)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments1 Write a program to find sum of digits of a number.

2 Write a program to generate following pyramid1

21232123

4321234543212345

65432123456 3(a) (b)

Write a program to find factorial of a number using recursive function

Write a program to find factorial of a number using recursive function

4 Write a program to generate first n numbers of a Fibonacci series using recursive functions

5 Write a program to generate all Armstrong numbers in the range of 0 to 999.

6 (a)

(b)

Write a program for swapping of two Numbers using call by Value

Write a program for swapping of two Numbers using call by reference

7 Write a menu based program to perform following operations on tables using functions only 1) addition 2) subtraction3) multiplication4) transpose.

8 Write a program to maintain records of employees of a company in Main Memory.

9 Write a program to implement various operations on Strings as Length of String, Concatenation, Reverse and copy of a string to other

10 Write a program to find no. of character, vowels, lines, digits from a text file.

11 Implement copy command of DOS to copy contents of one text file to another.

12 Implement Array

13(a)(b)

Write a program to search a element in a 2-D array using Linear SearchWrite programs for finding the element in the array using Binary Search

14 Write a program to implement Bubble Sort.Write a program to implement Selection Sort.

Page 17: B.Tech Syllabus2008-12 IT

Write a program to implement Insertion Sort.

15 Write a program to implement Quick Sort.

16 Write a program to implement MergeSort.

17 Write a program to implement Stack.

18 Write a program to implement Circular Queue

19 Write a program to implement Linked list.

Page 18: B.Tech Syllabus2008-12 IT

3rd Semester B. Tech. (Information Technology)Internet Fundamentals Lab (IT-217)

L T P Cr Internal marks: 60- - 2 1 External Mark: 40

List of Experiments

1. Qualifications placed in a table. Make an attractive biodata, with Educational and

other

2. Create a table in ms-excel with fields rollno, name,sub1,sub2, sub3, sum, avg,,

%age

(1) Fill the above table for 15 students

(2) Calculate the sum , avg and % of each student

(3) Calculate avg and % for each subject.

3. Design a power point presentation specifying details of Infrastructure and other

facilities available in the college.

4. Create web pages for an organization like your college giving details about

various departments, faculty members, its foundation, various achievements etc

5. To design a web-page showing the employee details of the company

6. Create the following seven item ordered list using roman numerals. After the fifth

item, increase the next list value by 5.

7. Create a web page to display the given list process.

8. Create the table using links that loads a different document for each content

9. Use the align attribute of an image tag to align other image to the top, middle,

bottom of first image.

10. Design web page for an email registration form.

11. Design a web page containing four frames and insert previous four experiments in

the frames

12. Create your own mail-id in yahoo.com and add names in address book, compose

and search an element

Page 19: B.Tech Syllabus2008-12 IT

B. Tech (IT) 4th SemesterMathematics – III (MA-201)

L T P Cr External Marks: 60 3 1 - 3.5 Internal marks : 40

Time Duration: 3 Hrs. Total Marks: 100

Note: Eight questions will be set in all by the examiner taking at least two from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

UNIT – IFourier series: Euler’s Formulae, Conditions for Fourier expansions, Fourier expansion of functions having points of discontinuity, change of interval, Odd & even functions, Half-range series.Fourier Transforms: Fourier integrals, Fourier transforms, Fourier cosine and sine transforms. Properties of Fourier transforms, Convolution theorem, Perseval’s identity, Relation between Fourier and Laplace transforms, Fourier transforms of the derivatives of a function, Application to boundary value problems.

UNIT-IIFunctions of Complex Variables: Functions of a complex variable, Exponential function, Trigonometric, Hyperbolic and Logarithmic functions, limit and continuity of a function, Differentiability and analyticity.Cauchy-Riemann equations, Necessary and sufficient conditions for a function to be analytic, Polar form of the Cauchy-Riemann equations, Harmonic functions, Application to flow problems, Conformal transformation, Standard transformations (Translation, Magnification & rotation, inversion & reflection, Bilinear).

UNIT-IIIProbability Distributions : Probability, Baye’s Theorem, Discrete & Continuous probability distributions, Moment generating function, Probability generating function, Properties and applications of Binomial, Poisson and normal distributions.

UNIT-IVLinear Programming : Linear programming problems formulation, Solution of Linear Programming Problem using Graphical method, Simplex Method, Dual-Simplex Method.

Text Book1. Higher Engg. Mathematics: B.S. Grewal, Khanna Publishers, New Delhi2. Advanced Engg. Mathematics: E. Kreyzig.

Reference Book1. Complex Variables and Applications: R.V. Churchil; Mc. Graw Hill, New Delhi2. Engineering Mathematics Vol. II: S.S. Sastry; Prentice Hall of India, New Delhi3. Operations Research: H.A. Taha, Sultan Chand & Sons, Meerut.4. Probability and Statistics for Engineer: Johnson. PHI, New Delhi

Page 20: B.Tech Syllabus2008-12 IT

B. Tech (IT) 4th SemesterDatabase Management Systems (IT–202)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-1 Introduction: Overview of Database Management System: Various views of data Models, Schemes and Introduction to database Languages & Environments, Advantages of DBMS over file processing systems, Responsibility of Database Administrator. Three level architecture of Database Systems: Introduction to client/Server architecture. Data Models: E-R Diagram (Entity Relationship), mapping Constraints, keys.

Unit-2Reduction of E-R diagram into tables, Naming Secondary Storage Devices, Network & Hierarchical Models, File Organization: Sequential File, index sequential files, direct files, Hashing, B-trees Index files, Inverted Lists., Relational Models, Relational Algebra & various operations (set operations, select, project, join, division), Order.

Unit-3Relational calculus: Domain, Tuple, Well Formed Formula, specification, quantifiers. Introduction to Query Languages: QBE, Integrity constrains, functional dependencies & Normalization (Normal forms-up to 5th Normal forms).

Unit-4Introduction to Distributed Data processing, Concurrency control: Transactions, Time stamping, Lock-based Protocols, Serializability and Recovery Techniques.

Text Books: Database System Concepts by A. Silberschatz, H.F.Korth and S.Sudarshan, 3rd

Edition, 1997, McGraw-Hill, International Edition. Fundamentals of Database Management System by Renu vig & Ekta Walia, ISTE

Publications, New Delhi. An Introduction to Database Systems by C.J.Date, 7th Edition, Pearson Education,

New Delhi.

Reference Books: Fundamentals of Database Systems by R.Elmasri and S.B.Navathe, 3rd Edition,

Pearson Education, New Delhi.

Page 21: B.Tech Syllabus2008-12 IT

Database Management and Design by G.W Hansen, 2nd Edition, 1999, Prentice-Hall of India, New Delhi.

Database Management Systems by A,.K.Majumdar and P.Bhattacharyya.5th

Edition, 1999, Tata McGraw-Hill Publishing Company, New Delhi. A Guide to the SQL Standard, Data,C. and Darwen, H.3rd Edition, Reading,

MA:1994, Addison-Wesley Publications, New Delhi. Data Management & File Structure by Looms, 1989, PHI,New Delhi. Introduction to Database Management system by Bipin Desai, 1991, Galgotia

Pub, New Delhi.

Page 22: B.Tech Syllabus2008-12 IT

B. Tech (IT) 4th SemesterComputer Organization & Architecture (IT–204)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-1General System Architecture: Stored program control concept, Flynn’s classification of computers (SISD, MISD, MIMD); Multilevel viewpoint of a machine: digital logic, micro architecture, ISA, Operating system, high level language, structured organization,CPU, caches, main memory, secondary memory units & I/O, performance metrics, MIPS, MFLOPS.Instruction Set Architecture: Instruction set based classification of processors (RISC,CISC, and their comparison); addressing modes: register, immediate, direct, indirect, indexed operation in the instruction set; arithmetic and logical, data transfer and machine control flow, instruction set format (fixed, variable hybrid) Unit-2Basic Non-Pipelined CPU Architecture: CPU architecture types (accumulator, register, stack, and memory/register) detailed data path of a typical register based CPU, fetch-decode-execute cycle (typically 3 to 5 stage); microinstruction sequencing, implementation of control unit: Hardwired control design method, micro program control unit.

Unit-3Memory Hierarchy & I/O techniques: The need for a memory hierarchy (locality of reference principle) cache, main memory and secondary memory parameters: access, cycle time, cost per bit, main memory organization, cache memory (associative & direct map cache organization. allocation and replacement polices, segments, pages & file organization), virtual memory: Program I/O, DMA & Interrupts.

Unit-4Introduction to Parallelism: Goals of parallelism (Exploitation of concurrency, throughput enhancement); Amdahl’s law, instruction level parallelism (pipelining, super scaling –basic features); processor level parallelism (multiprocessor systems overview).

Text Book: Computer Architecture and Organization by John P.Hayes, 1998, TMH, New

Delhi. Computer Architecture & Organization by M. Mano, 1990 PHI, New Delhi. Computer Organization, 5th Edi, by Carl Hamacher, Zvonko Vranesic, 2002,

Saftwat Zaky Publications.

Reference Books:

Page 23: B.Tech Syllabus2008-12 IT

Computer Organization and Design, 2nd Ed. By David A. Patterson and John L. Hennessy, Morgan 1997, Kauffman.

Operating Systems Internals and Design Principles by William Stalling, 4 th

Edition, 2001, PHI, New Delhi. Structured Computer Organization by A.S.Tanenbaum, 4th Edition, PHI, 1999,

New Delhi. Computer Organization & Architecture: Designing for Performance by W.

Stalling, 4th Edition, 1996, PHI, New Delhi. Computer Architecture- Nicholas Carter, 2002, TMH, New Delhi.

Page 24: B.Tech Syllabus2008-12 IT

B. Tech (IT) 4th SemesterAdvanced Data Structures (IT – 206)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-IPointer, Self referential structures, Static and dynamic memory allocation, Abstract Data Types, Stack , Queue, Dequeue and circular queue, Josephus Problem, Towers of Hanoi Problem, Linear, Circular, Recursive and Doubly Linked List, Linked List with Header, Dynamic Implementation of stack & queue, Radix sort, Two way merge sort.

Unit-IIBinary Search Trees operations, implementation and applications, recursive and non-recursive traversals, Binary threaded Trees implementation and traversal, Balanced Trees: Height balanced (AVL) trees implementation, Converting general trees into binary tree, Extended Binary Tree, Complete Binary Tree, Random Search Trees, Red Black and Splay Trees, Heap sort and Priority Queues.

Unit-IIIGraphs and its representation in computers: Adjacency matrix based, incidence matrix based, adjacency lists, linked representation, depth first search (DFS) and Breadth first search (BFS) traversal, connected component of a graph, Spanning trees algorithms: Kruskal and Prim’s Algorithms, Shortest paths algorithms: Bellman Ford and Dijkstra’s algorithm.

Unit-IVHashing and collision handling techniques, Recursion, Applications of Recursion: Sorting using recursion (bubble sort, insertion sort and selection sort), searching using recursion (linear and binary search), Multi-way search tree, B, B+ and B* trees, File Structure: Physical Storage Media, file organization, organization of records into blocks, sequential blocks, primary indices, secondary indices, B+ tree index files, B* tree index files.

Text books:1. Fundamental of Data Structures by Ellis Horowitz & Sartaj Sahni , 2nd Edition,

University Press, Hyderabad. 2. Data Structures and Algorithm by A.V.Aho , J.E.Hopcroft and T.D. Ullman,

Original Edition, Addison -Wesley, 1999, New Delhi. 3. Data Structures using C and C++ by A.M. Tenenbaum, Langsam, Moshe

J.Augentem, PHI, New Delhi.

Page 25: B.Tech Syllabus2008-12 IT

Reference Books:1. Data Structures and Program Design in C by Robert Kruse, PHI, New Delhi.2. An Introduction to Data Structures and Applications by Jean Paul Trembley, Pal

G. Sorenson, McGrawHill Publications, New Delhi.3. Theory & Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s

Outline Series by TMH, New Delhi.4. Data Structure and the Standard Template Library – William J. Collins, 2003,

TMH, New Delhi.

Page 26: B.Tech Syllabus2008-12 IT

B. Tech (IT) 4th SemesterObject Oriented Programming Systems (IT-208)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-1Introduction to C++, C++ standard library, Basics of a typical C++ Environment, pre- processors Directives (from page 23), Illustrative simple C++ programs, Header files and namespaces, library files. Concepts of objects, basic of object modeling, object classes, associations, behaviors, description.Object Oriented Concepts: Introduction to objects and object oriented programming, Abstraction, Encapsulation, Access Modifiers: controlling access to a class, method or variable (public, protected, private).Classes and Data Abstraction: Introduction, structure definition, accessing members of a structure, class scope and accessing class members, separating interface from implementation, controlling access function and utility functions, Constructors, Dynamic memory allocation with new and delete, destructors (Examples form C++), constant object and const member function (use of const in C++), object as member of classes, friend function and friend classes, using “this” pointer, static class member, function overloading (Implementation in C++).

Unit-2Operator Overloading : Introduction, fundamentals of operator overloading, restriction on operators overloading , operator function as class members vs. as friend functions, overloading, <<,>> overloading unary operator , overloading binary operators.Inheritance :Introduction , inheritance : base class, protected members, casting base class pointer to derived- class pointers, using member functions, overriding base – class member in a derived class, public, protected and private inheritance , using constructors and destructors in derived classes, implicit derived class object to base class object+ conversion , composition Vs. inheritance.Virtual Functions and Polymorphism: Introduction to virtual function, abstract base class and concrete class, polymorphism, dynamic binding, virtual destructor, Implementation in C++ using virtual function.Unit-3Files and I/O Streams: Files and streams, creating a sequential access file, reading data from A Sequential access file, updating Sequential Access file, Random Access File , Creating A Random Access File, Writing data Randomly To a random Access file, Reading Data Sequentially from A Random Access File . Stream Input/ Output Class and Objects, Stream Output, Stream Input, Unformatted I/O (With read and write), Stream Manipulator, Stream Format State, Stream Error States.

Page 27: B.Tech Syllabus2008-12 IT

Unit-4Templates: Function Template, Overloading Template Function, Class Template, Class Template and Non- Type Parameters, Templates and Inheritance, Templates and Friend, Templates and Static Member.Exception Handling: Introduction, Basic of C++ Exception Handling: Try, Catch, Throwing, Catching and Re–throwing an Exception , Exception specification, Processing Unexpected Exception , Stack Unwinding, Constructors, Destructor and Exception Handling, Exception and Inheritance. UML: UML class diagram for classes.

Text Books: Object Oriented Programming in Turbo C+ + by Robert Lafore, Pearson

Education, New Delhi. The Complete Reference in C++ by Herbert Schildt, 2002, TMH, New Delhi. Object Oriented Programming Using C++ by Kamthane, Pearson Education, New

Delhi.

Reference books: C + + How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall, India,

New Delhi. Programming with C++ By D Ravichandran , 2003, TMH, New Delhi. Object Oriented Programming with C++ by E Balagurusamy, 2001, Tata

McGraw- Hill, New Delhi. Computing Concept with C++ Essentials by Horstmann, 2003, John wiley, New

Delhi. C++ Programming Fundamentals by Chuck Easttom, Firewall Media.

Page 28: B.Tech Syllabus2008-12 IT

B. Tech (IT) 4th SemesterOperating Systems (IT-210)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

Unit-1 Introductory Concepts: Operating system functions and characteristics, historical evolution of operating system, Real time system, Distributed system, Methodologies for implementation of O/S service, system calls, system programs, Interrupt mechanisms.Processes: Process model, Process states, process hierarchies, implementation of Processes, data structures used such as Process table, PCB creation of processes, context switching, exit of Processes.Inter-process communication: Race conditions, critical sections, problems of mutual exclusion, Peterson’s solution, producer-customer problem, Reader Writer’s Problem, Dining Philosophers Problem, semaphores, monitors, message passing.

Unit-2Process scheduling: objective, preemptive vs. non-preemptive scheduling, comparative assessment of different algorithms such as round robin, priority bases scheduling. FCFS. SJF, multiple queues with feedbackDeadlocks: Conditions, modeling, detection and recovery, deadlock avoidance, deadlock prevention. Memory Management: Multiprogramming with fixed partition, variable partitions, virtual memory, paging, demand paging, design and implementation issues in paging such as page tables, inverted page tables, page replacement algorithms, page fault handling, working set model, local vs. global allocation, page size, segmentation with paging.

Unit-3File systems: File type, attributes, access and security, file operations, directory structures, path names, directory operations, implementation of file systems, implementation of file and file operation calls, implementation of directories, sharing of files, disk space management, block allocation, free space management, logical file system, physical file system.Device management: Techniques for device management, dedicated devices, shared devices, virtual devices; device characteristics, hardware considerations: input & output devices, storage devices: independent device operation, buffering, multiple paths, device allocation considerations.

Unit-4

Page 29: B.Tech Syllabus2008-12 IT

Distributed Systems: Introduction to II/W and S/W concepts in distributed systems, Network operating systems and NFS, NFS architecture and protocol, client – Server model, distributed file systems, RPC – Basic operations, parameter passing, RPC semantics in presence of failures threads and thread packages.Case studies: Unix/Linux: Implementation of processes, memory model, file system, deadlock handling strategies, scheduling, IPC, system calls. WINDOWS-NT: Layered structure, interpretability.

Text Book:

1. Operating System Concepts by Peterson, J.L. & Silberschatz, A. Addison Wesley, New Delhi.

2. Operating System Concept by Ekta Walia, Khanna Book Publication Co., New Delhi.

Reference Books:

1. Operating System Principles by Brinch, Hansen, PHI, New Delhi.2. Operating System by Tanenbaum, A.S., PHI, New Delhi.3. Operating System by Stalling Willams, PHI, Delhi.

Page 30: B.Tech Syllabus2008-12 IT

4th Semester B. Tech. (Information Technology) Data Base Management Systems Lab (IT-214)

L T P Cr Internal Marks : 60- - 3 1.5 External Marks : 40

List of Experiments

1. Study of Oracle Architecture.

2. Create a database and use following commands on it: create, insert, delete, alter,

update, select, desc, drop and truncate

3. Create a database and use not null, check, unique key, primary key and foreign key

constraints.

4. Create a database and execute following functions on it:- lower, upper, initcap,

concat, substr, length, instr, lpad, trim, round, trunc, mod, add_months,

months_between, to_char, to_date, min, max, avg, sum, count, stddev, variance.

5. Use the following commands on a database: order by, group by, and different select

commands

6. Create a database and use set operators, self join and equi join, on it.

7. Create a database’s and use savepoint, commit, rollback and different operators on

it.

8. Create the following views on the given databases:

9. To display details of employees working on more than one projects.

10. To display details of employee not working on any projects.

11. To display employee names and project name for employees on projects <p1&p3>

or <p2&p4>.

12. Using two tables create a view which shall perform equi join.

13. Write a trigger for before and after insertion, deletion and updation process.

14. Write a procedure to give incentive to employees working all projects. If no such

employee give appropriate message.

15. Write a procedure for computing amount telephone bills on the basis of given

conditions.

Page 31: B.Tech Syllabus2008-12 IT

4th Semester B. Tech. (Information Technology)Advanced Data Structures (IT-216)

L T P CR Internal Marks: 60- - 3 1.5 Internal Marks: 40

List of Experiments

1) Revision of programs of Data Structures from pervious semester: Insertion Sort,

Bubble Sort, Selection Sort, Linear Search, Binary Search

2) Write a Program to Implement a Linked List

3) Write a Program to Implement a Doubly Linked List

4) (a) Write a Program to Implement a Stack Dynamically

(b) Write a Program to Implement a Queue dynamically

5) Write a Program to Implement a Circular Linked List

6) Write a Program to Implement Binary Search Tree

7) (a) Write a Program to Implement Inorder

(b) Write a Program to implement Postorder

(c) Write a Program to implement Pretorder

8) Write a Program to implement Heapsort

9) (a) Write a program to implement Breadth First search

(b) Write a program to implement Depth First search

10) Write a Program to insert node in Right In- Threaded Binary Tree

11) Write a Program to implement Kruskals Algorithm

12) Write a Program to implement Dijkstra’s Algorithm

13) (a) Write a Program to Implement Bubble Sort using Recursion

(b) Write a Program to Implement Insertion Sort using Recursion

(c) Write a Program to Implement Selection Sort using Recursion

14 a) Write a Program to Implement Linear Search using Recursion

b) Write a Program to Implement Linear Search using Recursion

Page 32: B.Tech Syllabus2008-12 IT

4th Semester B. Tech. (Information Technology)OOPS LAB (IT-218)

L T P CR Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1) Write a program to calculate the power of a given no. take default argument as 2.

2) Write a program for Function Calculator Using Classes and Objects.

3) Write a program to add two coordinates of a point using structures.

4) Write a program to implement PUSH and POP operation on STACK by using

Constructor and Destructor.

5) Create two classes DM and DB which store the value of distances in meters and

centimeters and DB feet and inches. Write a program that can read value for the

Class object and add one object of DM with another object of DB. Use a Friend

Function to carry out the addition operation.

6) Write a program to overload Binary Operator + to perform addition of two

Complex no’s., Binary Operator – to perform Subtraction of two Complex No’s.,

overload >> operator to enable input through Cin, Overload << operator to enable

output through Cout.

7) Write a program to overload Unary Operator ++ to perform Modulus of two

Complex no’s., Unary Operator -- to perform Conjugate of two Complex No’s.

8) Write a program for Function Overloading by calculating volume of sphere,

rectangle & cuboids.

9) Write a program to implement Hybrid Inheritance for Student Record.

10) Write a program to implement multilevel inheritance for the Employee Record.

11) Create a Base Class called Shape. Use this class to store two double type values

that could be used to compute the area of figures. Derive two specific classes

called triangle from the base shape. Add to the base class, a member function

get_data () to initialize base class data members and another member function

display_area() to compute and display the area of figures. Make display_area() as

a virtual Function and redefine this function in the derived classes to suit their

requirements.

Page 33: B.Tech Syllabus2008-12 IT

12) Write a program to implement THIS pointer to find Elder Person.

13) Write a program to implement Bubble Sort using Template.

14) Write a program to implement files using read and Write Functions.

15) Write a program with the Following:

(a) A Function to read two double type numbers from Keyboard.

(b) A Function to calculate the division of these two numbers.

(c) A try block to detect and throw an exception if the condition “divide-by-zero”

occurs.

(d) Appropriate catch block to handle the exception thrown.

Page 34: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 5th Semester Digital Data Communication (IT-301)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

UNIT 1Introduction: A Communication Model, Data Communications, Data Communication Networking Standards, Making Organizations, Data Transmission: Concepts and Terminology, Analog and Digital Transmission, Transmission Impairments, Transmission Media.Data Encoding: Digital data, digital signals: Encoding schemes: NRZ-L, NRZ-I, Manchester, Diff-Manchester, Pseudo Ternary, Bipolar, AMI, B8ZS, HDB3, Evaluation Factors, Digital data & analog signals: Encoding techniques: ASK, FSK, PSK, QPSK; Performance comparison, Analog data-digital signals: Quantization, Sampling theorem, PCM, Delta Modulation, Errors, Comparison, Analog Data-Analog signals: Need for Modulation, Modulation methods: Amplitude Modulation, Angle Modulation, Comparison.

UNIT 2 Digital Data Communication Techniques: Asynchronous and synchronous transmission, Error Detection techniques: Parity checks, Cycle redundancy checks, Checksum, Error Correcting codes: Forward and backward error corrections. DTE & DCE Interface: Characteristics of DTE-DCE interface. Interfaces: RS-232-C, RS-449/422, A/423-A, X.21, V.35.

UNIT 3Data Link Control: Need for data link control, Line configurations: Topology, duplexity and line discipline, flow control: Effect of Propagation Delay and Transmission Rate, Sliding Window Protocol, Error Control ; Error Detection, ARQ, Bit Oriented Link Control, Necessity Protocols: HDLC, ADCCP, LAP-B, SDLC, Character Oriented Link Control, Binary Synchronous communications, Their Categories & Limitations, Serial Controller 85C30.Multiplexing: Advantages, Types of multiplexing: FDM, Synchronous TDM, Statistical TDM or Asynchronous TDM, Study of their characteristics and carrier systems.

Page 35: B.Tech Syllabus2008-12 IT

UNIT 4Satellite Communication Systems: Satellite Parameters and Configurations, Capacity Allocation: Frequency Division FDMA, Time Division TDMA, Fixed Assigned Multiple Access (FAMA), Demand Assigned Multiple Access (DAMA), The Concept of Spread Spectrum: FHSS, DSSS, CDMA:- Transmission and Reception.

TEXT BOOKS “Data & Computer Communications”, Stallings PHI, New Delhi. “Data Communication & Networking”, Frozen Tata McGraw Hill Publications,

New Delhi.

REFERENCE BOOKS

“Digital Communications”, Proakin, MC Graw Hill Publications, New Delhi. “Wireless Communication and Networks”, W.Stalling, Pearson Education, New

Delhi. “Digital & Data Communication Systems”, Roden, PHI, New Delhi. “Introduction to Digital & Data Communications”, Miler, Jaico Pub., New Delhi. “Satellite Communication”, Pratt, John Wiley, New Delhi.

Page 36: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 5th Semester Microprocessor and Interfacing (IT-303)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

UNIT-1 The 8085 Processor: Introduction to Microprocessor: Architecture, Instruction set, Interrupts Structure, and Assembly Language Programming.Memory Interfacing: Semiconductor Memory and its types – Static and Dynamic RAM, ROM, EPROM, EEPROM and NOVRAM, Interfacing Memory – Interfacing SPRAM, DRAM.

UNIT-2The 8086 Microprocessor: The 8086 microprocessor architecture: Architecture, Block Diagram of 8086, Details of sub- blocks such as EU, BIU, Memory Segmentation and Physical Address Computation, Program Relocation, Addressing Modes, Instruction Formats, Pin Diagram and Description of Various Signals.Instruction Set of 8086: Instruction Execution Timing, Assembler Instruction Format, Data Transfer Instructions, Arithmetic Instruction, Branch Instructions, Looping Instructions, NOP and HLT Instruction, Flag Manipulation Instructions, Logical Instructions, Shift and Rotate Instruction Directives and Operators, Programming Examples.

UNIT-3Interfacing Device: The 8255 PPI CHIP: Architecture, Control Words, Modes and Examples. Interfacing D/A and A/D converters.

UNIT-4DMA: Introduction to DMA Process, 8237 DMA controller. Interrupt and Timer: 8259 Programmable interrupt controller, programmable interval timer chips.

TEXT BOOKS Microprocessor Architecture: Programming & Applications with 8085:

Ramesh .S Gaonkar; Wiley Eastern Ltd, New Delhi. The Intel Microprocessors 8086 – Pentium Processor: Berry, Bray; PHI, New

Delhi.

REFERENCE BOOKS Microprocessors and Interfacing: D.B. Hall: TMH, New Delhi. The 8088 & 8086 Microprocessor – Programming Interfacing, Hardware &

Applications: Triebel & Singh: PHI, New Delhi.

Page 37: B.Tech Syllabus2008-12 IT

Microcomputer Systems: The 8086 / 8088 Family: Architecture, Programming& Design: Yu –chang Liu & Glenn A Gibson: PHI, New Delhi.

Advanced Microprocessors and Interfacing: Badri Ram; TMH, New Delhi.

Page 38: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 5th Semester Analysis & Design of Algorithms (IT-305)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

UNIT-1Introduction: Algorithm, Analyzing algorithm, Designing algorithm, Concept of algorithmic efficiency, Run time analysis of algorithms, Asymptotic Notations.Divide and Conquer: Structure of divide and conquer algorithms; examples; binary search, quick sort, Strassen Multiplication; Analysis of divide and conquer run time, recurrence relations.

UNIT-2Greedy Method: Overview of the Greedy Paradigm, Examples of Exact Optimization solution (minimum cost spanning tree), approximate solution (Knapsack problem), Single source shortest paths.Dynamic Programming: Overview, Difference between Dynamic Programming and Divide and Conquer, Applications: Shortest path in graph, Matrix Multiplication, Traveling salesman Problem, Longest Common sequence.

UNIT-3Back Tracking: Overview, 8-queen problem, Graph Coloring Problem and Knapsack problemBranch and Bound: LC Searching Bounding, FIFO Branch and Bound, LC Branch and Bound Application: 0/1 Knapsack Problem, Traveling Salesman Problem

UNIT-4Graph Searching and Traversal: Overview, Traversal methods(depth first and breadth first search)Trees: Review of Trees, Binary Search Tree, Traversal, Insertion & Deletion in Binary Search Tree, B-Trees, Basic operations on B-TreesComputational Complexity:Complexity measures, Polynomial vs. non-polynomial time complexity; NP-hard and NP-complete classes, examples.

TEXT BOOK1. “Fundamentals of Computer Algorithms.” 2nd Edition, E. Horowitz, S. Sahni, and

S.Rajsekran, University Press, Hyderabad.REFERENCE BOOKS

1. “Introduction of Computer Algorithm,” T. H Cormen, Leiserson, Rivest and Stein, PHI, New Delhi.

2. “Computer Algorithms,” Sara Basse, A.V. Gilder, Addison Wesley, New Delhi.3. “Fundamentals of Data Structure” , E. Horowitz, S. Sahni, and S.Rajsekran

University Press, Hyderabad

Page 39: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 5th SemesterJava Programming (IT-307)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT – I

Introduction to Java & Principles of Object Oriented Programming:

Basic Concepts of OOP and it’s Benefits, Application of OOP, The Creation of Java, Importance of Java for the Internet, Java’s Magic: The Byte-code, Features of Java, Object-Oriented Programming in Java, Java Program Structure

Defining Classes: Definition of a Class, Definition of Methods, Constructors, Creating Objects of a Class, Assigning Object Reference Variables, The keyword “this”, Defining and Using a Class, Automatic Garbage Collection.

Arrays and Strings: Arrays, Arrays of Characters, String Handling Using String Class, Operations on String Handling Using, String Buffer Class.

Extending Classes and Inheritance: Using Existing Classes, Class Inheritance, Choosing Base Class, Access Attributes, Polymorphism, Multiple Levels of Inheritance, Abstraction through Abstract Classes, Using Final Modifier, the Universal Super-class: Object.

Packages & Interfaces: Understanding Packages, Defining a Package, Packaging up Your Classes, Adding Classes from a Package to Your Program, Understanding CLASSPATH, Standard Packages, Access Protection in Packages, Concept of Interface.

UNIT – II

Exception Handling: The Idea behind Exceptions, Types of Exceptions, Dealing with Exceptions, Exception Objects, Defining Your Own Exceptions, Checked and unchecked Exceptions

Input/Output in Java: I/O Basic, Byte and Character Structures, I/O Classes, Reading Console Input, Writing to Console Output, Reading and Writing on Files, Random Access Files, Storing and Retrieving Objects from File, Stream Benefits.

Multithreading Programming: The Java Thread Model, Understanding Threads, The Main Thread, Creating a Thread: extending Thread and implementing Runnable, Creating Multiple Threads, Thread Priorities, Synchronization, Deadlocks Inter-thread communication, Deadlocks

UNIT – III

Creating Applets in Java: Applet Basics, Applet Architecture, Applet Life Cycle, Simple Applet Display Methods, Requesting Repainting, Using The Status Window, The HTML APPLET Tag, Passing parameters to Applets.

Page 40: B.Tech Syllabus2008-12 IT

Networking: Basics, networking classes and interfaces, Using java.net package, doing TCP/IP and Datagram Programming by Server Socket and Socket classes.

Java Data Base Connectivity (JDBC): Database Connectivity – Relational Databases, JDBC API, Reusing Database Objects and Transactions.

UNIT – IV

Working with Windows: AWT Classes, Window Fundamentals, Working with Frame, Creating a Frame Window in an Applet, Displaying Information within a Window, Introduction to Swings

Event Handling: Two Event Handling Mechanisms, The Delegation Event Model, The Event Handling Process, Event Classes, Sources of Events, Event Listener Interfaces, Using the Delegation Event Model, Adapter Classes

Text Books:

1. Java-2 The Complete Reference by Patrick Naughton and Herbert Schlitz, TMH, New Delhi.

2. Beginning JAVA 2 (JDK1.3 Edition), Ivor Horton, WROX Publications, New Delhi.

Reference Books:

1. JAVA 2 UNLEASHED, Tech Media Publications, New Delhi.

2. JAVA 2(1.3) API Documentations.

3. “Programming with Java”, by E Balaguruswamy, TMH, New Delhi.

Page 41: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 5th Semester System Modeling and Simulation (IT-309)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT 1Introduction: A System & its Model, concepts of system modeling, different system models.

Simulation, Basic nature of Simulation, when to Simulate, Simulation vs. Modeling, Simulation & Modeling using computers, Simulation of Pure Pursuit Problem, Simulation of an inventory problem. Need for simulation and limitations of Simulation (Algorithms for simulation of Pure-Pursuit problem and Inventory Problem)

UNIT 2Simulation of continuous system: Simulation of a chemical reactor, Numerical integration vs. continuous system simulation, selection of an integration formula, Runga-Kutta integration formula, simulation of a servo system, simulation of water reservoir system , analog vs. digital simulation.( Algorithms for simulation of chemical reactor, servo system and water reservoir system)

Simulation of discrete systems: Fixed time step vs. event to event model, Simulating Randomness, Generation of random numbers, Generation of non-uniformly distributed random number, Box – Muller transformations, Monte-Carlo Computation, Stochastic Simulation.

UNIT-3Simulation of Queuing system: Introduction to Queuing theory, Simulation of the Single, two Server Queues and general queues (Algorithms for single and two server queuing systems)

Inventory control and forecasting: Elements of Inventory theory, more complex inventory models, Generation of Poission and Erlang variates , forecasting and regression analysis.

UNIT-4Design and Evaluation of the simulation Experiments: - Central Limit Theorem, Variance Reduction Techniques, Experiments layout, Validation.

Simulation languages:-Continuous and Discrete Simulation language, Block Structured, Simulation language, Expression based language, SIMSCRIPT, SIMULA, GPSS and Factors in selection of discrete system simulation language.

Page 42: B.Tech Syllabus2008-12 IT

TEXT BOOKS System Simulation with Digital Computers by Narsingh Deo, PHI, New

Delhi. System Simulation by Gordan, Pearson Education, New Delhi. Discrete Event System Simulation by Jery Banks, Pearson Education, New

Delhi

REFERENCE BOOKS System Simulation by D. S. Hira , S Chand and Co. Ltd. , Delhi. Computer Modeling & Simulation by Don.M. Ingles, Centage Publications,

New Delhi.

Page 43: B.Tech Syllabus2008-12 IT

B. Tech. (IT) 5th Semester Software Engineering (IT-311)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT-1Introduction: Programs vs. software products, emergence of software engineering, software life cycle, models; waterfall, prototype, evolutionary and spiral model, Software Characteristics, Applications, Software crisis.Software project management: Project management concepts, software process and project metrics Project planning, project size estimation metrics, Empirical estimation techniques, COCOMO, A Heuristic estimation techniques, staffing level estimation, team structures, staffing, risk analysis and management, project scheduling and tracking.

UNIT-2Requirement Analysis and specification: Requirements engineering, partitioning Software, prototyping, Prototyping methods and tools, Specification principles, Representation, the software requirements specification and reviews, Analysis Modeling, Data Modeling, Functional Modeling and information flow: Data flow diagrams, Behavioral Modeling, The mechanics of structured analysis: Creating entity/ relationship diagram, data flow model, control flow model, the control and process specification, The data dictionary, Other classical analysis methods.System Design: Design concepts and principles: the design process: Design and software quality, design principles, Design concepts: Abstraction, refinement, modularity, software architecture, control hierarchy, structural partitioning, data structure, information hiding, and Effective modular design: Functional independence, Cohesion, Coupling, Design Heuristics for effective modularity; the design model; Design documentation.

UNIT-3Testing and maintenance: Software Testing Techniques, Software testing fundamentals: objectives principles, testability; test case design, Unit testing: white box testing, basis path testing: Control structure testing: Black box testing, testing for specialized environments, architectures and applications. Software Testing Strategies; Verification and validation, Integration testing, Validation testing, alpha and beta testing, System testing: Recovery testing, security testing, stress testing, performance testing; The art of debugging, process debugging approaches. Software re-engineering: Reverse engineering, restructuring, forward engineering.

Page 44: B.Tech Syllabus2008-12 IT

UNIT-4Software Reliability and Quality Assurance: Quality concepts, Software quality assurance : SQA activities; Software reviews; cost impact of software defects, defect amplification and removal; formal technical reviews: The review meeting, review reporting record keeping, review guidelines; Formal approaches to SQA; Statistical software quality assurance; software reliability: Measures of reliability and availability, The ISO 9000 Quality standards, SEI-CMM Capability Maturity Model.Computer Aided software Engineering: CASE, building blocks, integrated case environments and architecture, repository.

Text Book: Software Engineering - A Practitioner’s Approach, Roger S. Pressman, 1996,

MGH, NEW DELHI., NEW DELHI. Publications, New Delhi.

Reference Books: Fundamentals of Software Engineering, Rajib Mall, PHI, New Delhi. An Integrated Approach to Software Engineering by Pankaj Jalote, 1991 Narosa

Publications, New Delhi. Software Engineering by Ian Summerville, Pearson Education, 5th Edition, 1999,

New Delhi. Software Engineering Fundamentals, Ali Bethforooz and Frederick J. Hudson

Oxford University.

Page 45: B.Tech Syllabus2008-12 IT

5th Semester B. Tech. (Information Technology)Microprocessor and Interfacing Lab (IT-315)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1. Write 8085 program to add two and subtract two 8 bit no’s

2. Write 8085 program to add two 8 bit no’s with carry & subtract two no’s with

borrow

3. Write a program using 8085 for multiplication of two 8 bit no’s by repeated

addition & bit rotation method.

4. Write a program using 8085 for division of two 8 bit no’s by repeated subtraction

method

5. Write a program using 8086 for copying 12 bytes of data from source to

destination

6. Write a program using 8086 for finding largest no. from array

7. Write a program using 8086 for arranging an array of no’s in ascending order

8. Write a program for finding square of no. using look up table

9. Study of 8085 & 8086 microprocessor kit

10. WAP that turns heater off if temperature >=100c & turns heater on if temperature

<100c

11. WAP to display a 4-digit hex or BCD number on LEDs of the SDK-86

12. WAP to read temperature of a cleaning bath solution & lights one of three lamps

according to temperature read.

Page 46: B.Tech Syllabus2008-12 IT

5th Semester B. Tech. (Information Technology)Java Programming Lab (IT-317)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1. (a) Make a program to implement an integer stack, which can hold 10 values.

(b) Implement Function overloading concept.

2.(a) Write a program to implement the concept of inheritance having a base class

representing a person, derived from this class make two classes, one about the

students and other about employees. Input & output this information about students

& employees.

(b) Make a program to implement the concept of Package.

3. Make a program to copy the contents of source file into destination file, properly

handling the exceptions.

4. Make a program to implement the buffering concept in which producer produc es the

data and consumer consumes it using the threading concept.

5. Make a program to implement the matrix multiplication & copying a file using

Multithreading concept.

6. Create an Applet Creating Thread which will move a String Continuously.

7. Make a program using applets which will handle mouse events on client side.

8. Make a program using applets which will handle key events on client side.

9. Make a program which will hold end to end communications between client & server

using connection less service. (Use sockets to make TCP server & clients).

10. Implement UDP server & UDP clients establish connection between them using

ports.

11. Make a program using servlets and a web page using HTML so as to print the

dynamic response from the servlets when the web page is submitted.

12. Create a database using MS-Access and access this database in your program using

JDBC.

13. Make a Frame window having fields regarding user information & extract the values

from the database in that field on the click event of button next.

14. Make a program using JSP & a WEB page using HTML so as to print the dynamic

Page 47: B.Tech Syllabus2008-12 IT

response from the JSP when the web page is submitted. (Using any web server)

15. Make a program which creates a cookie on the server side using servlets & when

server returns a response to the user also send cookies to clients for later retrieve its

data from that client.

Page 48: B.Tech Syllabus2008-12 IT

5th Semester B. Tech. (Information Technology)Analysis & Design of Algorithms Lab (IT-319)

L T P CR Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1. Write a program to implement binary search algorithm.

2. Write a program to implement quick sort algorithm.

3. Write a program to implement depth first spanning tree.

4. Write a program to implement Knapsack problem.

5. Write a program to implement Strassen Multiplication.

6. Write a program to implement Matrix Multiplication using Divide and Conquer

Approach.

7. Write a program to implement Traveling Salesman Problem.

8. Write a program to implement Depth First Search using Traversal Method

9. Write a program to implement Breadth First Search using Traversal Method

10. Write a program to implement basic operations on B-Tree.

Page 49: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 6th SEMESTER Computer Networks (IT-302)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT – 1Introduction of Computer Networks, need and Evolution of computer networks, description of LAN, WAN, MAN & wireless networksBasic terminology of computer networks:- Bandwidth, physical and logical networks ,media-10 baseA,10 base5,10 baset,100 base FX,1000 baseLX and wireless LAN & WAN device-Router, Bridge, switch, HUB, Modem SCU/DSUOSI Reference Model: Laying architecture of networks, OSI model, Function of each layer, Services and Protocols of each Layer.

UNIT-2Physical Layer: Representation of a bit on physical modem that is in wired network, optical network and wireless network .Encoding / Modulation –TTL , Manchester Encoding , AM,FM and PM. Dispersion, Jitter Latency and Collision. Different types of media –twisted pair unshielded twisted pair, coaxial cable, optical Fiber cable and wireless.Data Link Layer: LLC and MAC sub layer, MAC addressing layer 2 devices, framing error control and flow control. Error detection & correction CRC block codes parity and check sum, elementary data link protocol, sliding window protocol, channel allocation problem-static and dynamic. Multiple Access protocol- ALOHA, CSMA/CU, Token ring, FDDI.

UNIT-3

Network Layer: Segmentations and autonomous system path determination, network layer addressing, network layer datagram, IP addressed Classes. Sub netting-Sub network, Subnet mask, Routing algorithm-optionally principle, Shortest path routing, hierarchical routing, Broadcast routing, Multicast routing, routing for mobile host-Concatenated Visual Circuits, tunneling fragmentation and DHCP, Routing protocol-RIP, IGRP, USPF and EIGRP. Network layer in ATM networksTransport layer: Layer-4 protocol TCP & UDP. Three-way hand shakes open connection. ATM AAL layer protocol, session layer design issue, presentation layer issue, and Application layer design issue.

UNIT-4

Introduction to Network Management: Remote Monitoring Techniques: Polling, Traps, Performance Management, Class of Service, Quality of Service, Security Management,

Page 50: B.Tech Syllabus2008-12 IT

Firewalls, VLANs, Proxy Servers, Introduction to Network Operating System: Client- Server Infrastructure, WINDOWS nt/2000.TCP/IP : Introduction History of TCP/IP, Protocols, Internet Protocol , Transmission control, User Datagram Protocol , IP Address classes, Subnet addressing ,Internet Email-SMTP, POP, IMAP, FTP NNTP, HTTP, SNMP, TELNET, Overview of IP version 6.OSI and TCP/IP model with description of data encapsulation & peer to peer communication, comparison of OSI and wireless.

Text Book:1. Computer Networks: Tanebaum, PHI, New Delhi.2. Computer Networks and Their Protocols, Darlex, DLA Labs.

Reference Books:1. Computer Communication and Networks, Freer, East-West-Press.2. Data Communications, Hallsall Fred, 2000, Addition Wesley, New Delhi.3. Business Data Communications, Fitzgerald Jerry Publications.4. Computer Networks –A System Approach, Larry L. Peterson & Bruce S.

Davie, 2nd Edition.5. Computer Networking –E.D. Title, 2002, TMH, New Delhi.

Page 51: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 6th SEMESTER Unix /Linux OS & Shell Programming (IT-304)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

UNIT 1Overview of Unix/Linux, Unix / Linux Startup, User accounts, Logging in and out, Shutting out, Dual Booting , Command line, Getting Help using man and info pages, creating files, Unix / Linux file and directory structure , Browsing the file system , Mail, Unix / Linux Commands .Using Linux GUI- KDE and Gnome, Processes in Unix / Linux , Bash Shell introduction, Command line shortcuts, Standard I/O , Redirecting I/O and errors , using pipes, Using vi-editor.

UNIT 2Linux / Unix file system, Users, groups and the root user, permission types, changing file ownership and permissions, partitions and file system, i-nodes, directories, symbolic links, hard links , fundamental file types, checking free space, mounting and un-mounting file systems and media, mounting other file systems, formatting, archiving and compression.Unix / Linux shell Programming -Shell as command processor, configuring the shell, shell variables, aliases, environmental variables, shell startup, creating shell scripts, conditional execution , loops, functions.

UNIT 3Processes in Linux, starting and stopping processes, initialization processes, rc and init files, job control – at, batch, cron, time, network files, security, privileges, authentication, password administration, Signals and signal handlers, Linux I/O system.Regular Expressions and Filters: Introducing regular expressions patterns, syntax, character classes, quantifiers, using grep, egrep, fgrep, sed. The C Environment, The C compiler, compiler options, managing projects, Memory Management – Dynamic and Static Memory, Use of Makefiles, Dependency Calculations, Building and Using Static and Dynamic Libraries, using ldd, soname, dunamic loader, degugging with gdb.

UNIT 4Kernel tasks, managing kernel modules at run time, kernel configuration and compilation; boot loader – GRUB and LILOLinux Networking: Basic concepts, Network packets, TCP-IP suite, ARP, Telnet, IP address and network mask, subnets and routing; IPV 4 and network classes; ports. Configuring linux machine on network: arp , ipconfig and netstat commands. Network services and tools; telnet, rsh , ftp, rcp, ssh , rsync, inetd.conf , opening and closing ports.

Page 52: B.Tech Syllabus2008-12 IT

Text Books: The Unix Programming Environment, Kernighan W. Brain, Rob Pike: PHI , New

Delhi . Linux Programming Bible, John Goerzen: IDG Books, New Delhi, 2000. Linux Network Administration Guide by Tery Dawson, Gregor N. Purdy, Tony

Bautts – Oreilly. Reference Books:

Your Unix – The Ultimate Guide, Sumitabha Das: TMH, 2000, New Delhi. “UNIX Network Programming”, W. Richard Stevens, PHI, 1999, New Delhi. Professional Linux Programming, Mathew: Vol.1 & 2, Wrox-Shroff, 2001. Running Linux, Welsh & Kaufmann:, O’Reiley & Associates, 2000, New Delhi.

Page 53: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 6th SEMESTER Theory of Computation (IT-306)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT - 1Finite Automata and Regular Expression: Finite State System, Basic Definition Non-Deterministic finite Automata (NDFA), Deterministic finite Automata (DFA), Equivalence of DFA and NDFA Finite Automata with E-moves, Regular expression, Equivalence of finite Automata and expression, Regular expression conversion and vice-versa.

UNIT - 2Introduction to Machines: Concept of basic machines, Properties and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy Machines.Properties of Regular sets: The Pumping Lemma for regular sets, Application of the pumping Lemma, Closure Properties of regular sets, Myhill-Nerode Theorem and minimization of Finite Automata, Minimization Algorithm.

UNIT - 3 Grammars: Definition, Context free and Context sensitive Grammar, Ambiguity regular grammar, Reduced forms, Removal of useless symbols and unit production, Chomsky Normal Form (CNF), Griebach Normal Form (GNF). Pushdown Automata: Introduction to push-down machines.

UNIT - 4Turing Machines, Deterministic and Non-Deterministic Turing Machines, Design of T.M, Halting Problem of T.M., PCP problemChomsky Hierarchy: Chomsky hierarchies of grammars, unrestricted grammar, Context sensitive Language, Relation between languages of classes.Computability: Basic Concepts, Primitive Recursive functions. TEXT BOOKS

Elements of the Theory of Computation, Lewis & Papadimitriou: PHI, New Delhi.

Introduction to Languages and the Theory of Computation, John C. Martin: MGH, New Delhi.

REFERENCE BOOKS Introduction to Computer Theory: Daniel I.A. Cohen: John Wiley, New Delhi. Introduction to Automata Theory Languages and Computation, J.E. Hopcroft and

J.D. Ullman: Narosa Publications, New Delhi.

Page 54: B.Tech Syllabus2008-12 IT

Theory of Automata and Formal Languages by R. B. Patel, & Prem Nath, Umesh Publication, New Delhi.

Introduction to Automata Theory, Languages & Computations, Hopcroaft & O.D.Ullman, R.Motwani.

Theory of Computer Sc. (Automata, Language & Computation): K.L.P.Mishra & N.Chandershekaran.

Introduction to Formal Language & Automata – Peter Linz.

Page 55: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 6th SEMESTER Web & .Net Technologies (IT-308)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT 1 Introduction to .NET Framework: What is Microsoft .Net framework, .Net framework architecture, code management in compile time & run time? Common language runtime (CLR), functions of CLR, .Net class library, common language specifications, common type system, Microsoft intermediate language, Just in Time Compiler, Managed Code, Metadata, Assembly, Assembly Manifest, Namespaces, Introduction to various version of .Net, Hardware & software requirements for .Net framework.

Study of VB Language: Introduction to VB.NET Development Environment, Constants, Enumerations, Variables, Scope of variables, Data types, Arrays, operators, Loop & Conditional statements, Use of switch & with statements, Procedures, Error Handling.

UNIT 2Windows Applications in VB .NET: Windows Forms, Text Boxes, Buttons, Labels, Link labels, Check Boxes, Radio Buttons, List Boxes, Combo Boxes, Checked List Boxes, Picture Boxes, Scrollbars, Splitters, Timer, Menus, Built-in DialogsImage List, Tree Views, List Views, Toolbars, Status Bar and Progress bars, Date time picker, Month calendar, Domain up down, Numeric up down, Context menu strip.

UNIT 3Object Oriented Programming in VB .NET: Classes and Objects, field, Properties, methods and events, Constructors and Destructors, Method overloading, Abstraction, Encapsulation, Inheritance & Polymorphism, Access modifiers: (Public, Private, Protected, Friend) Overloading, Overriding & ShadowingGraphics & File handling: Use Graphics, Pen, Brushes classes for graphics handling, file handling using FileStream, StreamWriter, StreamReader, BinaryReader, BinaryWriter classes. File and Directory Classes

UNIT 4Accessing Databases: What are Databases, Connections, Data adapters, and datasets, Data Reader, Connection to database with server explorer, Accessing data with data adaptors & datasets, working with ADO.NET, Overview of ADO.NET objects, Create & populate a dataset?

Page 56: B.Tech Syllabus2008-12 IT

Data Binding with Controls like Text Boxes, List Boxes, Checkboxes, Comboboxes, checked list boxes, Data grid. Navigating in datasets, Data validation Classes for handling database in code: OleDbConnection, Sqlconnection, OracleConnection, OleDbCommand, SqlCommand, OracleCommand, OleDbDataAdapter, SqlDataAdapter, DataSet, OleDbDataReader, SqlDataReader, Data Table, Data Row, Data Column, Data Relation TEXT BOOKS

Visual Basic .NET Programming- Black Book by Steven Holzner, Wiley-DreamTech, New Delhi.

REFERENCE BOOKS

.NET Programming with VB by James Bradley, TMH, New Delhi. The Complete Reference -Visual Basic.NET – Jeffrey R. Shapiro

Murach’s Publications. Programming Microsoft Visual Basic.NET – Francesco Balena. Visual Basic .NET 2003 in 21 Days. – Steven Holzner, SAMS Publications, New

Delhi.

Page 57: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 6th SEMESTER Computer Graphics (IT-310)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT-1Introduction: What is Computer Graphics, Computer Graphics Applications, Computer Graphics hardware and Software , Two dimensional Graphics primitives: Points and Lines, Point plotting Techniques: Coordinate system , Increment method , Line drawing algorithm : DDA, Bresenham‘s circle drawing algorithm: Using polar coordinates, Mid point circle drawing algorithms, filled area algorithm: Scan line, Polygon filling algorithms, Boundary filled algorithms.Point & Positioning devices: light pen, mouse, Tablet, Input technique, positioning technique, and character recognition.

UNIT-2Two Dimensional Viewing: Viewing pipeline, Window to view port transformation, Window to view port mappingClipping: point & line clipping algorithm, 4 bit code algorithm. 4 bit code algorithm Cohen –Sutherland line clipping algorithms, Liang –Barsky line clipping algorithmsPolygon clipping: Sutherland – Hodge land Polygon clipping algorithm. Curve clipping, Text clipping.

UNIT-3Three Dimensional Viewing: Viewing pipeline, viewing coordinates, Projection: Parallel, perspective Two Dimensional Geometric transformations: Two Dimensional Transformations: Transformations, Translation, Scaling, Rotation, Other Transformations Reflection, shear, Homogenous Coordinate System Raster Graphics: Raster Graphics fundamental, Solid Area, Scan Conversion, Interactive Raster Graphics and Raster Graphics System.

UNIT-4Representation of 3-D curves and surfaces: Curved lines and surfaces, spline representations, interpolation and approximation splines, parametric continuity conditions.Bezier curves and surfaces: Bezier curves, properties of Bezier curves, Bezier surfaces B- spline curves and surfaces. Hidden Surfaces removal: Hidden surface elimination, depth buffer algorithm, scan line coherence algorithm, priority algorithm.

TEXT BOOKS

Page 58: B.Tech Syllabus2008-12 IT

Computer Graphics, 2nd Ed., Hern & Baker –PHI, New Delhi. Computer Graphics Principles and Practice, 2nd Edition by Foley, Van Dam,

Feiner and Hughes.-Addison-Wesley Pub Company. Computer Graphics, Schaum’s Outline Series, MGH Publications.

REFERENCE BOOKS Principles of Computer Graphics Theory & Practice Using Open GL and Maya

University Press,Hyderabad. Computer Graphics - A Programming Approach, Harrington. Principles of Computer Graphics- Rogers- MGH Pub NEW DELHI. Graphics Programming with C By Yashwant Kanetkar, BPB Publications, New

Delhi.

Page 59: B.Tech Syllabus2008-12 IT

6th Semester B. Tech. (Information Technology)Computer Networks Lab (IT-312)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1. To study the physical media of connectivity

2. Study the functioning of Switch, Hub and Router.

3. To study the pin structure of crossover cable.

4. Establish LAN (star topology) for your lab using hubs (8 or 16 port).

5. Install and configure the LAN card.

6. To study different servers and their roles.

7. Write a program to generate 2-D parity Generator.

8. Write a program to generate Hamming Code Generator.

9. Write a program to generate CRC Generator.

10. Write a program to generate Checksum.

11. Study and install the media converting using optical fiber

12. Study and implement the virtual network

Page 60: B.Tech Syllabus2008-12 IT

6th SEMESTER B. Tech. (INFORMATION TECHNOLOGY)Visual Basic & .NET LAB (IT-314)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1. Program for concatenation of two strings

2. Write a program for making a calculator.

3. Write a program for displaying date and time in a form.

4. Write a program for linear search using console applications.

5. Write a program for binary search using console applications.

6. Write a program for encryption and decryption of string.

7. Write a program for displaying flags of particular country.

8. Write a program for generating the random numbers.

9. Write a program for fully functional word processor.

10. Write a program for file handling.

11. Write a program for database handling.

12. Write a program for file watcher.

Page 61: B.Tech Syllabus2008-12 IT

6th Semester B. Tech. (Information Technology)Computer Graphics Lab (IT-316)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1. Write a program to make different geometric shapes.

2. Write a program to implement DDA line drawing algorithm.

3. Write a program to implement Bresenham’s line drawing algorithm.

4. Write a program to implement Bresenham’s Circle drawing algorithm.

5. Write a program to draw a decagon whose all vertices are connected with every

other vertex using lines.

6. Write a program to implement Flood Fill Algorithm.

7. Write a program to show a ball moving on the screen according to the given

requirements

8. Write a Program to implement the midpoint circle drawing algorithm.

9. Write a program to implement Bezier curve.

10. Write a program to implement Line Clipping Algorithm.

11. Write a program to implement Boundary Fill Algorithm.

12. Write a program to implement Polygon Clipping Algorithm.

13. Write a program to Depth Buffer Algorithm.

Page 62: B.Tech Syllabus2008-12 IT

6th Semester B.Tech (Information Technology) UNIX / Linux Programming Lab (IT-318)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

1. Install Linux on the system dual boot with the windows operating System.

2. Do the following tasks:-A. Create, remove, and resize various types of partitions through GUI as well as

command line.B. Configure printers in Linux.

3. Creating ,Removing of Swap space as well as swap file.

4. Implementing Disk Quotas- enabling, creating, mounting, configuring, assigning, Disabling.

5. Managing Users and Groups in Linux- Adding, Modifying, Password aging.

6. Write a shell script to find the factorial value of any number entered through the keyboard.

7. Write a script to create a DMC of a student.

8. To study various file-directories handling commands.

9. To study the various shell commands in Linux.

10. Write a script to Implement Menu driven calculator.

11. Implement Mount,Unmount and Make file systems

Page 63: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 7th SEMESTER Broad Band Communication (IT-401)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

.UNIT-1Introduction: Introduction to Optical Communication, Fibers and their Characteristics, Propagation of Light in Optical fibers: Modal Dispersion, Material Dispersion and Attenuation, Numerical, Aperture, Figure of Merit, Single Mode, Multimode Step Index and Graded Index Fibers.

UNIT-2Fiber manufacture: Light sources, Light Emitting Diodes and their Characteristics Switching speed, spectral and spatial distribution of output, Modulation response.Basics of Lasers Semiconductor lasers, Transmitters and Receivers, Optical multiplexers and Demultiplexer, Optical amplifiers and repeaters, Photo detectors, Introduction to DWDM, ITU channel specification .DWDM Network Topologies

UNIT-3ISDN Overview: A conceptual view of ISDN: ISDN standards, services capability- Teleservice, protocol architecture, facsimile, Teleflex, message handling systems.ISDN Interfaces and functions-Transmission structure –User Network Interface Configuration, ISDN protocol Architecture, ISDN connection, terminal adaptation Addressing & Networking.ISDN Physical layer: line coding techniques, basic user network interface, Primary Safe.User network interfaceISDN Data link layer –LAPD, bearer channel link control 1.465/120.frame mode Bearer service and protocol .ISDN call control, frame relay connection control. Signaling System Number 7: SS& Architecture .Signaling data link level, Signaling Link Level, Signaling Network level, Signaling connection control part –ISDN user part

UNIT-4ATM Networking –ATM as an asynchronous technology, ATM cell and its structure. ATM Networks: ATM position in the OSI reference model, B-ISDN protocol reference Model, ATM functions and layers, ATM signaling principles, ATM performance, merging voice, audio, data and video, ATM operation and Maintenance, ATM reference configurations. ATM protocol stack –The lower layers: Fiber based network, Advantages, fiber modes, ATM physical layer media, The ATM layer, ATM Switching principle, Upper layers: ATM adaptation layer functions, ATM services.

TEXT BOOKS:

Page 64: B.Tech Syllabus2008-12 IT

1. ISDN and Broadband ISDN –William Stallings Mc million Pub Co, New Delhi..2. Broadband Communication-Balaji Kumar –Mc Graw Hill Pub, New Delhi.

REFERENCE BOOKS:1. Integrated Broadband networks-Handel & Huber Addison Wesley, New

Delhi. 2. Introduction to ATM Networking-Walter J Goral Ski- MC Graw Hill Pub Co.,

New Delhi. 3. Optical Network-A Practice Perspective, Rajeev Ramswami, Kumar

Sivaranjan-Morgan Kaufmann Pub.4. High Speed Digital Transmission Networking-Gilberts Held John Wiley Sons,

New Delhi.

Page 65: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 7th SEMESTER Compiler Design (IT-403)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT 1Introduction to System Software: Introduction and types of Assemblers, Linkers, Loaders, Compilers and Translators, The Structure of a Compiler, Different states in the Construction of a Compiler.Lexical Analysis, Design of lexical analyzer, Basic Parsing Techniques: Parsers, Shift-Reduce Parsing, Operator- Precedence Parsing, Top-Down Parsing, Predictive Parsers.

UNIT 2Automatic Construction of Efficient Parsers, L.R. Parsers, Canonical collection of L R (O) items, construction of SLR parsing tables, constructing canonical L.R. Parsing tables, Constructing LALR parsing tables, implementation of L R Parsing tables.Syntax-Directed Translation, Syntax-directed translation schemes, implementation of syntax directed translators, intermediate code, postfix notation, parse trees and syntax trees, three address code, quadruples, and triples, translation of assignment statements, Boolean expressions, and control statements.

UNIT 3Symbol Tables: The contents of a symbol table, Data Structures for Symbol Tables, Representing Scope Information. Run Time Storage Administration.Implementation of a simple stack allocation scheme, implementation of block structured languages, storage allocation in FORTRAN storage allocation in block structured language. Error Detection and Recovery Error, Lexical-phase errors, syntactic- phase errors, semantic errors.

UNIT 4Introduction to Code Optimization: The principle sources of optimization, loop optimization, the DAG representation of basic blocks, value number and algebraic laws, global data-flow analysis,Code Generation: Object programs, problems in code generation, a machine model, a simple code generator, register allocation and assignment, code generation from DAGs, peephole optimization.

Text Books:

1. Principles of Compiler Design, Aho A.V., Sethi and Ullman J.D., Addison Wesley, New Delhi.

2. Compiler Design, Aho, Narosa Pub., New Delhi.

Page 66: B.Tech Syllabus2008-12 IT

Reference Books:

1. System Programming, Donovan, J, TMH, New Delhi.2. Compiler Construction-Principles and Practice, D.M. Dhamdhere: McMillan

India.3. Compiler Construction for Digital Computer, David Gries: PHI, New Delhi.

Page 67: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 7th SEMESTER Multimedia & Virtual Reality (IT-405)

L T P Cr External Marks: 60 3 1 - 3.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT 1Basics of multimedia technology: Computers, Communication and Entertainment; Multimedia -An introduction; Framework for multimedia systems; multimedia devices, CD-Audio, CD-ROM,CD-I; presentation devices and the user interface; multimedia presentation and authoring; professional development tools; LANs & multimedia ;Internet, World Wide Web(World Wide Web) & multimedia ;distribution network-ATM & ADSL; multimedia servers & databases; vector graphics; 3-D graphics programs; animation techniques; shading; anti-aliasing; morphing ;video on demand

UNIT 2Image Compression & Standards: Making still images; editing and capturing images; scanning images; computer color models; color palettes; vector drawing; 3-D drawing and rendering; JPEG-objectives and architecture; JPEG-DCT encoding and quantization, JPEG statistical coding; JPEG predictive lossless coding; JPEG performance; Overview of other image file formats as GIF, TIFF, BMP, PNG etc.

UNIT 3Audio & Video: Digital representation of sound; time domain sampled representation; method of encoding the analog signals; sub band coding; Fourier method; transmission of digital sound; digital audio signal processing; stereophonic & quadraphonic signal processing; editing sampled sound; MPEG Audio; audio compression & decompression; brief survey of speech recognition and generation; audio synthesis; Musical Instrument Digital Interface (MIDI); digital video and image compression; MPEG motion video compression standard; DVI technology; time-based media representation and delivery.

UNIT 4Virtual Reality: Applications of multimedia, Intelligent multimedia system, Desktop Virtual Reality (VR), VR operating System, Virtual environment displays and orientation tracking; visually coupled system requirements; intelligent VR software systems.Applications of environments in various fields viz. Entertainment, manufacturing, business, education, etc.

Text Books: Multimedia Technology & Applications, David Hillman, Galgotia Publications,

New Delhi. Multimedia Systems, John. F. Koegelbuford, AWP.

Page 68: B.Tech Syllabus2008-12 IT

An Introduction to Multimedia System, Villamil & Molina, Multimedia Mc Milan, 1997.

Multimedia: Sound & Video, Lozano, 1997, PHI, Que., New Delhi

Refrence Books: Production, Planning and Delivery, Villamil & Molina, Que., New Delhi. Multimedia on the PC, Sinclair, BPB Pub, New Delhi. Multimedia in Action by Jeff Coate Judith, 1995, PHI, NEW DELHI. Multimedia System by Koegel, AWL.

Page 69: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 7th SEMESTERAdvanced Web Designing (IT-417)

L T P Cr External Marks : 604 1 0 4.5 Internal Marks : 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions will be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one from each unit.

UNIT IHTML AND Dynamic HTMLPhases of Web Site development, HTML Basic Concepts, Structure of HTML documents, HTML Elements – Core attributes, Language attributes, Core Events, Block Level Events, Text Level Events, Linking Basics, Linking in HTML, Images and Anchors, Anchor Attributes, Image Maps, Semantic Linking Meta Information, Image Preliminaries, Image Download Issues, Images as Buttons, Introduction to Layout: Backgrounds, Colors and Text, Fonts, Layout with Tables. Advanced Layout: Frames and Layers, HTML and other media types, Audio Support in Browsers, Video Support, Other binary Formats, Cascading Style Sheets, Positioning with Style sheets, Basic Interactivity and HTML: FORMS, Form Control, New and emerging Form Elements.

UNIT 2JAVASCRIPTFeatures of JavaScript, Variables, Control structures, operators, looping, conditional statements & functions in JavaScript, Core language object- Array, Boolean, Date, Math, String, Global, NumberJavaScript with DOM objects-Event handling through JavaScript, Window, Document & Form, Frame object, Form validation through JavaScript

UNIT 3XMLRelationship between HTML, SGML and XML, Basic XML, Valid Documents, Ways to use XML, XML for Data Files, Embedding XML into HTML documents, Converting XML to HTML for DISPLAY, Displaying XML using CSS and XSL, Rewriting HTML as XML, The future of XML.Introduction to PHP: What is PHP, Basic PHP Syntax, using variable in PHP, operators and Expression, Designing PHP program logic, Iteration & Conditional Statements

UNIT 4Working with Array: array basics, looping through arrays, modifying arrays, sorting arrays, multidimensional arrays, Functions: Declaring and calling functions, passing arguments to functions, returning values from functions, understanding variable scope Making Web Form: accessing form parameters, form processing with functions, validating data, PHP and XML, PHP and HTML

Page 70: B.Tech Syllabus2008-12 IT

Introduction to Databases: Connecting to Database from PHP, Creating Databases and Tables, Retrieving Data using PHP, inserting records using PHP, updating & deleting records in tables.

Text Books:

1. Beginning PHP 5, Dave W Mercer, Allan kent, Steven D. Wowicki, Wiley-India Publication.

2. Learning PHP 5, Michele E. Davis, Jon A. Phillips, O’reilly Publication, August 2007

Reference Books:

1. Managing & Using MySQL, Second Edition, By George Reese, Randy Jay Yarger, Tim KingWith Hugh E. Williams, April 2002

2. Programming PHP, By Rasmus Lerdorf, Kevin Tatroe, March 2002 3. Web Database Applications with PHP and MySQL, Second Edition , By

Hugh E. Williams, David Lane, Ma

Page 71: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 7th SEMESTERAdvanced Java Programming (IT-419)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT-IMulti-threading: Revision, Daemon Threads, Thread Groups, Race Conditions, Locking objects, Read/Write locks, Synchronizers: Barriers, Semaphores

Java Database Connectivity (JDBC): What is RDBMS, Introduction to JDBC, JDBC Driver types, SQL: SELECT, INSERT, UPDATE, java.sql package: DriverManager, Connection, Statement, ResultSet, SQLException, PreparedStatement, meta-data, Transactions: save points, batch updates

UNIT-IIJava Servlets: WWW, HTML Basics, HTTP, CGI, Life cycle of a Servlet, ServletConfig, SevletContext, Reading Servlet parameters, HttpServlet, HttpServletRequest, HttpServletResponse, HttpSession, Handling HTTP request and response, Cookies, Session Tracking.

Java Server Pages: Implicit Objects, JSP Directives, scripting elements, Extracting fields and values, attributes, Sessions in JSP, Cookies

UNIT-IIISwings: Working with Applets, icons, labels, text filds, buttons, Checkbox, radio buttons, Combo box, Tabbed panes, scroll panes, Trees, lists and tables.

Remote Method Invocation (RMI): What is RMI, Object Serialization, RMI layer model, Skelton, Stub, java.rmi package: Remote interface, Naming, RMISecurityManager, RemoteException, java.rmi.registry package: Registry interface, LocateRegistry, java.rmi.server package: RemoteObject, RemoteServer. Parameter passing of non-remote and remote objects, Cloning remote objects, Introduction to IDL, CORBA, Running a java client to access a remote object in C++

UNIT-IVJava Beans: need of beans, basic bean writing, building applications with beans, jar files, naming patterns, Bean property types: simple, indexed, bound, constrained; BeanInfo classes, java beans persistence

Page 72: B.Tech Syllabus2008-12 IT

XML: introduction to XML, structure of XML document, parsing an XML document, Validating an XML document: Document Type Definitions, XML schema, Using namespaces, using SAX Parser, Generating XML documents

TextBooks:1. Java How to Program, 6th Edition, H.M. Deitel, P.J. Deitel, , Pearson Education,

New Delhi2. Core Java 2 Volume II-Advanced Features, Cay S. Horstmann, Gray Cornell, Sun

Microsystems Press, Pearson Education, New Delhi

Refernce Books:1. Java Network Programming, 3rd Edition, Elliotte Rusty Harold, O’Reilly

Publication, New Delhi.2. Herbert Schildt, the Complete Reference. Java, 7th Edition, Tata McGrawHill Pub,

New Delhi.

Page 73: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 7th SEMESTERAdvanced Computer Networks (IT-421)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT - 1Introduction: Overview of computer networks, seven-layer architecture, TCP/IP suite of protocols, etc. MAC protocols for high-speed LANs, MANs, and wireless LANs. (For example, FDDI, DQDB, HIPPI, Gigabit Ethernet, Wireless Ethernet, etc.)

UNIT - 2Fast access technologies: (For example, ADSL, Cable Modem, etc.), IPv6: Why IPv6, basic protocol, extensions and options, support for QoS, security, etc., neighbor discovery, auto-configuration, routing. Changes to other protocols, Application Programming Interface for IPv6, 6 bone.

UNIT - 3Mobility in networks, Mobile IP, Security related issues, IP Multicasting: Multicast routing protocols, address assignments, session discovery, etc. TCP extensions for high-speed networks, transaction-oriented applications, Other new options in TCP. Network security at various layers, Secure-HTTP, SSL, ESP, Authentication header, Key distribution protocols, Digital signatures, digital certificates,

UNIT – 4The Wireless Application Protocol, application environment, wireless application protocol client software, wireless application protocol gateways, implementing enterprise wireless application protocol strategy and Security Issues in Wireless LAN. Wireless network management, GPRS, and VOIP services.Network Management: Introduction, ASN, SNMP, CMIP, Issues in the management of large networks. Multicast: IGMP, PIM, DVMRP

Text Books:1. TCP/IP Illustrated, Volume 1: The Protocols, W. R. Stevens. Addison Wesley,

1994, New Dellhi. 2. Wireless Communications and Networks, William Stalling, Prentice Hall 2002,

New Delhi.

Reference Books: 1. TCP/IP Illustrated, Volume 2: The Implementation, G. R. Wright. Addison

Wesley, 1995, New Delhi.

Page 74: B.Tech Syllabus2008-12 IT

2. TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, and the Unix Domain Protocols, W. R. Stevens. Addison Wesley, 1996, New Delhi.

3. ATM Networks: Concepts, Protocols, Applications, R. Handel, M. N. Huber, and S. Schroeder. Addison Wesley, 1998 New Delhi.

4. Wireless and Mobile Network Architecture, Yi-Bing Lin, Imrich Chlamtac, John Wiley-2001 New Delhi.

5. W-CDMA and CDMA 2000 for 3G Mobile Networks, M. R. Karim, Mohsen Sarraf, McGraw-Hill Professional, 2002 New Delhi.

6. Cryptography and Network Security: Principles and Practice, 2nd Edition, W. Stallings. Prentice Hall, 1998 New Delhi.

7. Mobile IP: Design Principles and Practices,C. E. Perkins, B. Woolf, and S. R. Alpert. Addison Wesley, 1997 New Delhi.

8. IPv6 Clearly Explained, Peter Loshin. Morgan Kauffman, 1999 New Delhi. 9. IPv6 Networks, M. Gonsalves and K. NilesMcGraw Hill, 1998 New Delhi.

Page 75: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 7th SEMESTERObject Oriented Software Engineering (IT-423)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT 1 Review of Object Oriented Systems: Design Objects, Class hierarchy, inheritance, polymorphism, object relationships and associations, aggregations and object containment, object persistence, meta-classes, Object-oriented systems development life cycle, Software development process Object Oriented systems development: a use-case driven approach.

UNIT 2Methodology for Object Oriented Design: Object modeling technique as software engineering methodology, Rumbaugh methodology, Jacobson Methodology, Booch Methodology, Patterns, Frameworks, the unified approach, unified modeling language (UML).

UNIT 3Object Oriented Analysis: Analysis Process, Use-Case Driven Object Oriented Analysis, Use-Case Model, Object Classification, Theory, Different Approaches for identifying classes, Classes, Responsibilities and Collaborators, Identifying Object Relationships, Attributes and Methods, Super-sub Class Relationships, A-Part of Relationships-Aggregation, Class Responsibilities, Object Responsibilities.

UNIT 4Object Oriented Design: Object oriented design process, corollaries, design axioms, design patterns, object oriented design philosophy, UML Object Constraint Language, Designing Classes: The Process, Class Visibility, Refining Attributes, Designing Methods and Protocols, Packages and Managing classes, Designing Interface Objects, View layer interface design, Macro and Micro level interface design process.

TEXT BOOKS:1. Object Oriented Modeling and Design, Rumbaugh Et. al., Pearson Educatin

New Delhi.2. Object Oriented Software Engineering, Ivar Jacobson, Addison-Wesley, 1995.

Reference Books:1. Object Oriented Systems Development, Ali Bahrami, McGraw Hill, 1999

New Delhi.2. Object Oriented Analysis and Design, Grady Booch, Addison-Wesley, 1995

New Delhi.3. Designing Object-Oriented Software, Wirfs-Brock, PHI, 1997 New Delhi.

Page 76: B.Tech Syllabus2008-12 IT

7th Semester B. Tech. Information TechnologyBroadband Communication Lab (IT-407)

L T P Cr Internal Marks: 60- - 3 1.5 External Marks: 40

List of Experiments

1. To study the setting up of Fiber Optic Analog & Digital Link

2. To study the Propagation Loss in Optical Fiber

3. To study the measurement of Numerical Aperture

4. To study of Bending Loss in Optical Fiber

5. To study the Characteristics of E-O Converter (LED)

6. To study the Characteristics of Fiber Optic Communication Link

7. To study the setting up of Fiber Optic voice link using Intensity Modulation

8. To study the setting up of Fiber Optic voice link using Frequency Modulation

9. To study the setting up of Fiber Optic Voice Link using PWM

10. To study the measurement of propagation loss using Optical Power Meter

11. To study the basic principle of Radio Frequency identification & designing of RFID

system

12. To study the theoretical and practical hardware training on Bluetooth

Page 77: B.Tech Syllabus2008-12 IT

7th Semester B. Tech. (Information Technology)Multimedia & Virtual Reality Lab (IT-409)

L T P Cr Internal Marks: 60- - 3 1.5 Internal Marks: 40

List of Experiments

1. Rotating your name in circular path with changes in direction : by animation in flash

2. Rotating a ball around another one: by animation in flash

3. To create Single Masking: by animation in flash

4. To create Double Masking animation in flash.

5. To create pool table by animation in flash.

6. Animate a ball by changing its color, size, shape & position using frame to frame

tweened animation in flash.

7. Make a calculator by using flash script.

8. Create a bouncing ball by using motion guide in flash.

9. Create moving car with smoke in flash

10. Using Adobe Deluxe Photoshop 7.0 Merging two same images and editing effect of

shadow masking.

11. Using Adobe Deluxe Photoshop7.0 edit a digital photo by changing the background

color, changing the theme, changing the part of photo edit them by using stamp

cloning tools & using selection tools.

12. Perform the Movie capturing by using web cam in window movie maker.

13. Cutting & joining audio & video by MP3 cutter & joiner.

Page 78: B.Tech Syllabus2008-12 IT

7th Semester B. Tech. (Information Technology)Advanced Web Designing Lab (IT - 411)

L T P Cr Internal Marks: 60- - 3 1.5 Internal Marks: 40

List of Experiments

1. Write a program in java script to make a registration form, validate all the input

fields and display all user details on new page

2. Write a program in javascript to change the background color by using the mouse

event.

3. Write a program in java enters your birth date and this little scipt will tell you the day

of the week you were born on.

4. Create a PHP program that regenerates sentence one into two, and outputs what it

is doing (and the result) to the user. The two sentences are:

a. now is the time for all good men to come to the aid of their country

b. the time is now to come to the aid of good men in the country

5. Create a PHP program that creates two arrays of numbers and adds the values in each

array to their corresponding values by index number.The two arrays should have the

following values

a 2,4,6,8,10

b. 3,5,7,9,11

6. Write a function that enables the user to construct his/her own web form, with the

capability to choose field names and types, and then allows the users to submit the

form to the page and see what they submitted echoed back to them. Use a swith..case

statement to select various functions within your main functions.

7. Create a text editor that scan through the directory hierarchy and manipulate entries in

it:

For a full list of the file/directory functions, refer to the online PHP function list:

http:// php.net/manual/ref.filesystem.php

8. Create the table in your database using SQL statements in PHP.

9. Create a form in PHP and display in the next page using SQL database.

10. Write a program for copying, rename and deleting files in PHP.

Page 79: B.Tech Syllabus2008-12 IT

11. Write a program to perform following String operation:

Concatenation, to lowercase, to uppercase, comparison, trimming

12. Build a simple PHP E-mail Application.

Page 80: B.Tech Syllabus2008-12 IT

7th Semester B. Tech. (Information Technology) Advanced Java Programming Lab (IT- 411)

L T P Cr External Marks: 40 - - 3 1.5 Internal Marks: 60

List of Experiments

1. Write a program in Java to create multiple threads having race conditions and

hence synchronize those using semaphores and read/write locks.

2. Write a program in Java to create a new Database and drop all the tables if the

database already exists. Create tables for the new database of academic

department of a college or for a tournament of cricket and access it using JDBC.

3. Create a simple servlet which appears on click of a link from another HTML file

and tells you how many times the page has been accessed.

4. Create a JSP page which allows you to login using a password and implements

session handling. The session should automatically expire after 3 minutes if no

information exchange happens.

5. Create a JSP page which saves cookies on your system regarding the interests of

the user and the server presents the first page depending on the interest of the

user.

6. Write a program in Java to display a list of tables in a tabbed pane and on the

click on a particular tab on of the table of database appears in front of the user.

7. Use any tool like Netbeans or Eclipse etc. to create an application using swings

which allows the user to login using password and from the menu, the user is

allowed to access the files and display the properties of the files.

8. Write a program to in java to get the list of all the students who have not paid the

fees from a remote system using RMI.

9. Write a program to create a simple bean and then display its properties.

10. Write a program in java to access an object in C++ using CORBA.

11. Create a simple XML document and create a DTD and also an XML schema for

the document and then validate the document.

12. Write a program to create an XML document and parse it using a java program

using an XML parser.

Page 81: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 8th SEMESTERMobile Communication (IT-402)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

Unit-1Introduction: Introduction cell mobile telephone system, trunking efficiency, mobile radio environment, frequency reuse, co channel interference reduction, handoff mechanism cell cite and mobile antennas, noncochannel interference. Frequency spectrum utility and management channel management, type of handoff and dropped call rate, cell splitting.Analog and digital modulation techniques, performance of various modulations, spectral efficiency, and Bit error rate, GMSK, GFSK, DQPSK modulation technique in wireless system comparison of various modulation techniques.

Unit-2Point to point model propagation over terrains, Losses, Power requirements, Smart Antennas, antennas at cell cite, gain and pattern relationship mobile antennas, tilting effect, parasitic elements usage, diversity techniques.

Unit-3Digital technology, digital speech, digital mobile telephony, GSM, Multiples access techniques, north- American TDMA (ISI36), Japanese cellular TDMA(DDC), CDMA, ISGS North American CDMA standards, PCS, PHS, Advanced system, GPRS, UMTS, IMT, WAP.

Unit-4Satellite system architecture, satellite orbit and constellations, LEO and MEO system, GPS Information, Iridium, MSAT, VSAT, DBS, Orbcomm satellite service, use of mobile communication networks, concepts, advanced mobile communication systems using satellite,

Text Books:1. “Wireless Communication”, Rappapart T.S, Prentice Hall, New Delhi.

Reference Books 1. GSM, CDMA & 3G System-Steel Lee and Gluis, John Willey Pub New Delhi.2. Mobile Satellite Communication Engineering-Richards Addison Wesley, New

Delhi.3. Mobile Communication Engineering, Lee, WCY, TMH, New Delhi.

Page 82: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 8th SEMESTERE-Commerce (IT-404)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT-1ELECTRONIC COMMERCE ENVIRONMENT AND OPPORTUNITIESEvolution of E-Commerce-its setbacks and potential, Types of E-Commerce, business models in B2C, B2B and C2C areas. Categories of E-Commerce Specific Business benefits of E-Commerce.Background – Electronic commerce environment – electronic market place technologies – modes of electronic commerce – electronic data interchange – migration to open EDI – Electronic commerce with WWW/ Internet.

UNIT-2ELECTRONIC COMMERCE PROTOCOLS AND PAYMENT SCHEMESSecure Transport Protocols – Secure Transaction – Secure Electronic Payment Protocol (SEPP) – Secure Electronic Transactions (SET) – Authentication – Security on Web servers and enterprise networks.Internet Monetary Payment and Security Requirements, Payment and Purchase Order, On-line electronic cash and micro payments

UNIT-3INTERNET /INTRANET SECURITY ISSUES AND SOLUTIONSSecurity Need for Computer Security –Threats in the E-Commerce Environment. Intruder Approaches – Strategies – Tools – Encryption – Access to Internet – Antivirus Program – Security Teams.

UNIT-4TECHNOLOGIES FOR ELECTRONIC COMMERCE Master card /Visa Secure Electronic Transaction – E-mail and Secure E-mail – MIME – S/MIME – MOSS – Internet and Web Site Establishment – Internet Resources – Technologies – Tools – Applications – charges – Access and Architecture - Searching. APPLICATIONSadvertising on the Internet –Issues and Technologies- Electronic publishing issues, approaches, legalities, and technologies.

TEXT BOOKS:1. “Web Commerce Technology Handbook” by Daniel Minoli and Emma Minoli,

Tata McGraw Hill Publishing Company limited, New Delhi.

Page 83: B.Tech Syllabus2008-12 IT

REFERENCES BOOKS:

1. Electronic Commerce – Security, Risk management and Control by Greenstein and Feinman, Tata McGraw Hill Publishing Co. Ltd., New Delhi, 2000.

2. E-security and You by Sundeep Oberoi, Tata McGraw Hill Publishing Company limited, New Delhi, 2001.

3. E-Commerce - Business, Technology and Society - Laudon and Traver, Addison Wesley 2002.

4. E-Business and E-Commerce - How to Program, Prentice Hall, 2001:  Dietel, Dietel and Nieto, PHI 2002, New Delhi.

5. E-Commerce, H. Chan, R. Lee, T. Dillon and E. Chang. John Wiley Publ: 

Page 84: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 8th SEMESTERData Warehousing and Data Mining (IT-406)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT-I

Introduction: The Evolution Of Data Warehousing (The Historical Context), The Data Warehouse - A Brief History, Characteristics, Operational Database Systems and Data Warehouse (OLTP & OLAP), Today’s Development Environment, Data Marts, Metadata.

Multidimensional Data Models: Types of Data and their Uses, from Tables and Spreadsheets to Data Cubes, Identifying Facts and Dimensions, Designing Fact Tables, Designing Dimension Tables, Data Warehouse Schemas, OLAP Operations.

UNIT-II

Principles Of Data Warehousing (Architecture And Design Techniques): System Processes, Data Warehousing Components, Architecture for a Data Warehouse, Three-tier Data Warehouse Architecture, Steps for the Design and Construction of Data Warehouses, Conceptual Data Architecture, Logical Architecture, Design Techniques.

Implementation: Methods for the Implementation of Data Warehouse Systems. Tools for Data Warehousing

UNIT-III

Data Mining:Introduction: Motivation, Importance, Knowledge Discovery Process, KDD and Data Mining, Data Mining vs. Query Tools, Kind of Data, Functionalities, Interesting Patterns, Classification of Data Mining Systems, Major issues, From Data Warehousing to Data Mining.

Data Preparation: Preprocess, Data Cleaning, Data Integration and Transformation, Data Reduction. Data Mining Primitives, Languages, and System Architectures.

Page 85: B.Tech Syllabus2008-12 IT

UNIT-IV

Concept Description: An Overview of Descriptive Data Mining, Predictive Data Mining, Methods for Concept Description. Mining Association Rules: Association Rule Mining, Market Basket Analysis, Types of Association Rules, Methods for Mining Association Rules in Transaction Databases, Relational Databases and Data Warehouses.

Classification and Prediction: Methods for Data Classification and Prediction.

Applications and Tools of Data Mining

Text Books:

1. Data Mining and Warehousing, Ken, Hamber, Springer Books.2. Data Mining and Warehousing, Alex Berson, Stephen Smith, Korth Theorling,TMH,

New Delhi

Reference Books:

1. Data Warehousing in the Real World, Anahory, Pearson Education, New Delhi 2. Data Mining, Adriaans, Addison-Wesley Longman, New Delhi.3. Data Mining and Warehousing, Chanchal Singh, Wiley Publications.

Page 86: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 8th SEMESTERDigital Image Processing (IT-418)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT IDigital Image Processing: Definitions, examples of fields that use Digital Image Processing, fundamental steps in Digital image processing, components of digital image processing system. Digital Image Fundamentals: image sensing and acquisition, image sampling and quantization, basic relationship between pixels, linear and nonlinear operations.Image Enhancement in Spatial Domain: Basic gray level transformations, histogram processing, enhancement using arithmetic logic operations, basics of spatial averaging/smoothing spatial filter, sharpening spatial filter, combining spatial enhancement methods. UNIT IIImage Enhancement in Frequency Domain: Smoothing frequency domain filters, sharpening frequency domain filters, homomorphic filtering, Implementation.Image Restoration: Noise models, restoration in the presence of noise only-spatial filtering, periodic noise reduction by frequency domain filtering, linear, position-Invariant degradations, estimating the degradation functions, inverse filtering, minimum mean square error(wiener) filtering, constrained least squares filtering, geometric mean filter, geometric transformations.

UNIT IIIColor Image Processing: Color models, pseudo color image processing, basics of color image processing, color transformations, smoothing and sharpening, color segmentation.Wavelet and Multiresolution Processing: Background, multiresolution expansions, wavelet transformation in one dimension, the fast wavelet transform, wavelet transforms in two dimensions, wavelet packets.

UNIT IVImage Compression: Image compression models, elements of information theory, error free compression, lossy compression, image compression standards.Morphological Image Processing: Preliminaries, dilation and erosion, opening and closing, the hit or miss transformation, some basic morphological algorithms (boundary extraction, region filling, extraction of connected components, convex hull, thinning, thickening, skeletons, pruning).Image Segmentation: Point detection, line detection and edge detection, edge linking and boundary detection.

Page 87: B.Tech Syllabus2008-12 IT

TEXT BOOKS

Digital Image Processing, R.C. Gonzalez, R.E. Woods, Pearson Education, New Delhi.REFERENCES

Fundamentals of Digital Image Processing, K. Jain, PHI, New Delhi. “Practical Algorithm for Image Analysis: Description, Examples and Code”, Michael

Seul, Lawrence O’ Gorman, Michael J. Sammon, Cambridge University.

Page 88: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 8th SEMESTERAdvanced Database Management Systems (IT-420)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

Unit-IIntroduction: Overview of database Management System, E-R Diagram (Entity Relationship Diagram).Advanced Data Modeling Concepts: Enhanced-ER (EER) Model Concepts, EER-to-Relational Mapping, Data Abstraction and Knowledge Representation Concept, Integrity Constraints in Data Modeling Normalization: Integrity constrains, functional dependencies & Normalization (Normal forms-up to 5th Normal forms.

Unit-IIIndexing: Types of Single-Level Ordered Indexes, Multilevel Indexes, Dynamic Multilevel Indexes Using B-trees and B+-treesConcurrency control: Locking Techniques for Concurrency Control, Concurrency Control Techniques Based on Timestamp Ordering.Transactions Processing: Introduction to Transaction Processing, Transaction and System Concepts, Desirable Properties of Transactions, Schedules and Recoverability, Serializability of Schedules.

Unit-IIIRecovery Techniques: Recovery Concepts, Recovery Techniques Based on Deferred Update, Recovery Techniques Based on Immediate Update, Shadow Paging. Oracle architecture: Outline of oracle architecture & its main primary Components, oracle instance- System Global area(Shared pool, Database Buffer cache, Redo log buffer cache, Java pool, large pool) and oracle processes(PMON,SMON, DBWR,LGWR,CKPT and Others). Oracle database-Physical Structure- Data files, control files, Redo log files.

Unit-IVParallel databases: Introduction, I/O parallelism, interquery parallelism, intraquery parallelism, interoperation parallelism, interoperation parallelism, Design of parallel systems.Distributed Databases: Distributed data storage, Network transparency, Distributed query processing, Distributed transaction model, commit protocols, coordinator selection, concurrency control, deadlock handling.

Text Books:

Page 89: B.Tech Syllabus2008-12 IT

Database System Concepts by A. Silberschatz, H.F. Korth and S. Sudarshan, 3rd

Edition, 1997, Pearson Education, New Delhi. Fundamentals of Database Systems by R.Elmasri and S.B.Navathe, 3 rd Edition

Pearson Education New Delhi. An Introduction to Database Systems by C.J.Date, 7 th Edition, Addison-Wesley,

New Delhi.

Reference Books:

Database Management and Design by G.W Hansen, 2nd edition, 1999, Prentice-Hall of India, New Delhi.

Database Management Systems by A,K.Majumdar and P.Bhattacharyya.5th

edition, 1999, Tata McGraw-Hill Publishing Co., New Delhi... A Guide to the SQL Standard, Data, C. and Darwen, H.3rd Edition, Addison-

Wesley, New Delhi. Data Management & File Structure by Looms, 1989, PHI, New Delhi.

Page 90: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 8th SEMESTERCryptography & Security Systems (IT-422)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

UNIT-IIntroduction, Essentials of crypto, essentials of networking and the internet, setting realistic security objectives, appropriate communication security, legal restrictions, encryption basic building blocks, how crypto system fail, choosing between strong and weak cryptography.Security objectives, example in line encryptor, deployment example, point to point encryption, IP routed configuration, key recovery and escrowed encryption, Basic issues in secret key management, random key generation, automatic rekeying, manual key distribution centers, maintaining keys and system security.

UNIT-2Security at IP Layer and VPN: Basic issues with using IPSEC. Cryptographic checksums, Ip security protocol, IPSEC key management, other TCP/IP network security protocols, virtual private networks (VPN), basic issues IPSEC proxy cryptography, IPSEC encrypting router, site to site encryption.IPSEC and Public key crypto, basic issues with IPSEC clients

UNIT-3IPSEC client to server site remote access, internet firewalls, IPSEC firewall, a VPN with a firewall, public key cryptography, secret key exchange with RSA crypto, Secure Socket Layer (SSL)Internet security and public key certificates: Basic issues in internet transaction security, transaction world wise Web, security alternatives for web form, web browser with SSI.

UNIT-4Web server with SSL, vending with exportable encryption, basic issue with e-mail security , technology- offline message keying digital signatures, secure E-mail client distributing public keys, Public key certificates, certificates distribution centralized distribution, centralized certification authority hierarchical certification authority.

Text Books:1. Internet Cryptography, Richard E-Smith, Addison Wesley, 2nd Ed, New Delhi

Reference Books:1. Cryptography and Network Security – Principles and Practice by William

Stallings - Pearson Education, New Delhi. 2. Cryptography and Network Security, Atul Kahate, TMH, New Delhi

Page 91: B.Tech Syllabus2008-12 IT

B.TECH. (IT) 8th SEMESTERDistributed Operating Systems (IT-424)

L T P Cr External Marks: 60 4 1 - 4.5 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit

UNIT-IOperating System Fundamentals: Evolution of Modern Operating Systems, Centralized Operating Systems, Network Operating Systems, Distributed Operating Systems, Cooperative Autonomous Applications.

Interprocess Communication and Coordination: Selection Factors, Message Passing Communication, Pipes, Sockets, Request/Reply Communication, Transaction Communication, Name and Directory Services

UNIT-II Distributed Process Scheduling: A System Performance Model, Static Process Scheduling with Communication, Dynamic Load sharing and Balancing, Distributed process Implementation, Real-time Scheduling.Distributed File Systems: Transparencies and Characteristics of DFS, DFS Design and Implementation, Transaction Service and Concurrency Control, Data and File Replication

UNIT-IIIConcurrency Control: Mutual Exclusion & Critical Regions, Semaphores, Locks, Token Passing/Mutual Exclusion, Deadlocks.Transaction Management & Consistency Models: Transaction Management, ACID Properties of a Transaction, Consistency Models, Two Phase Commit Protocol, Nested Transactions.

UNIT-IVDistributed Shared Memory: Non-Uniform Memory Access Architecture’s, Memory Consistency Models, Multiprocessor Cache Systems, Distributed Shared Memory, Implementation of DSM systems.

Text Books:1. Distributed Operating Systems: Andrew S. Tanenbaum, TMH, Publications, New

Delhi. 2. Distributed Operating Systems: Concepts and Design: Pradeep K. Sinha, BPB

Publications, New Delhi3. Distributed Systems: Principles and Paradigms: Andrew Tannenbaum and Marten

van Steen.

Page 92: B.Tech Syllabus2008-12 IT

4. Distributed Operating Systems and Algorithm Analysis: Randy Chow, Theodore Johnson.

Page 93: B.Tech Syllabus2008-12 IT

8th Semester B. Tech. (Information Technology) Mobile Communication Lab (IT - 410)

L T P Cr Internal marks: 60- - 2 1 External mark: 40

List of Experiments

1. To understand the concept of GPS and establishing link between GPS Satellite &

GPS Trainer kit (ST-2276).

2. To understand the importance of PDOP, HDOP, and VDOP & measurement of

latitude, longitude using GPS Trainer kit (ST-2276).

3. To understand RF environment & study of GSM network by actually connecting

to the GSM environment by any service provider SIM like AIRTEL, IDEA, and

RPG etc. using GSM trainer kit (ST-2133).

4. To understand RF environment & study of GSM network by actually connecting

to the GSM environment by any service provider SIM like AIRTEL, IDEA, and

RPG etc. using GSM trainer kit (ST-2133).

5. To establish audio & video combined link & data communication between

transmitters, receiver satellite transponder simulated in a lab using satellite

communication trainer kit (ST-2272).

6. To establish PC to PC Communication using satellite communication link using

satellite communication trainer kit (ST-2272).

7. To study and observe the difference in uplink & downlink frequency using

satellite communication trainer kit (ST-2272).

8. To calculate antenna gain and antenna beam width using Microstrip Antenna

Trainer kit (ST-2263).

9. To plot the radiation pattern of micro strip antennas using Microstrip Antenna

Trainer kit(ST-2263).

10. To study and observe the antenna matching and antenna radiation with distance

using Microstrip Antenna Trainer kit (ST-2263).