P.D.M.

COLLEGE OF ENGINEERING Sarai Aurangabad

SYLLABUS BACHELOR OF ENGINEERING

COMPUTER SCIENCE & ENGINEERING

Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Examination (Semester- 3) Sl . N o 1 Course No. Subject Teaching Schedule L 3 3 T 2 1 P Total 5 4 Theor y 100 100 Examination Schedule (Marks) Sessional 50 50 Practical Total 150 150 Duration of Exam (Hours) 3 3

MATH201-E CSE-201 E CSE-203 E EE-217 E EE-204-E HUM201-E IT-201-E CSE-205E EE-224-E

Mathematics III Data Structures & Algorithms (CSE,ELIT) Discrete Structures (CSE,IT) Digital & Analog Communication (CSE,IT) Digital Electronics (EE,EL,CSE,ELI&C,IT) Economics PC Lab (CSE,IT) Data Structures & Algorithms Lab (CSE,IT) Digital Electronics Lab (EE,EL,CSE,ELI&C,IT) TOTAL

2 3

3 3

1 1

-

4 4

100 100

50 50

-

150 150

3 3

4 5 6 7 8 9

3 3 -

1 1 -

2 2 2

4 4 2 2 2

100 100 -

50 50 25 25 25

25 25 25

150 150 50 50 50

3 3 3 3 3

18

7

6

31

600

375

75

1050

2

Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Examination (Semester- 4) Sl. No. Course No. Subject L 3 Teaching Schedule T 1 P Examination Schedule (Marks) Total 150 Duration of Exam (Hours) 3

1

CSE-202 E CSE-204 E CSE-206 E

2

3

IT-202-E 4 CSE-208 E CSE-210 E

5 6

7 8

CSE212E IT-206-E

9

CSE-214 E

Data Base Management Systems (CSE,IT) Programming Languages (CSE,IT) Theory of Automata & Computation Object-Oriented Programming using C++ (CSE,IT) Internet Fundamentals (CSE,IT) Computer Architecture and Organization COMMON WITH V-SEM EL, IV-SEM CSE Data Base Management Systems Lab. (CSE,IT) C++ Programming Lab. (CSE,IT) Internet Lab. (CSE,IT) TOTAL

Total Theory Sessional Practical 4 100 50 -

3

1

-

4

100

50

-

150

3

3

1

-

4

100

50

-

150

3

3

1

-

4

100

50

-

150

3

3

1

-

4

100

50

-

150

3

3

1

-

4

100

50

-

150

3

-

-

2

2

-

25

25

50

3

-

-

2

2

-

25

25

50

3

18

6

2 6

2 30

600

25 375

25 75

50

3 1050

Note: During summer vacation candidate will carry out self study of Open Source Software available on the internet and will complete a mini-project based upon this study. This project will be evaluated in the 5th semester.

3

ELI& C) Assessment of MiniProject based upon Open Source Software carried out at the end of 4th Sem.ELI& C) Computer Graphics (CSE. 1 3 1 - 4 150 3 3 1 - 4 100 50 - 150 3 3 3 3 4 5 3 3 3 1 1 1 - 4 4 100 100 100 50 50 50 - 150 150 150 - 4 3 3 1 4 100 50 150 3 2 2 25 25 50 3 2 2 2 2 25 25 25 25 50 50 3 7 8 9 10 EE-329-E - - 2 2 - 25 25 50 3 11. Lab (Common with IT IV Sem) Microprocessors and Interfacing Lab.IT) Analysis & Design of Algorithms Web Development (Common with IT VI Sem) Multimedia Technologies (Common with ITIV-Sem) Computer Graphics Lab. CSE-301 E EE-309-E 2 CSE-303 E CSE-305 E CSE 307 E IT-204-E 6 CSE-309 E CSE-311 E IT-208-E Subject L Principles of Operating System (CSE.5) Teaching Schedule Course No.Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Examination (Semester.IT) Multimedia Tech. No . (EL.CSE.IT) Web Development & Core JAVA Lab.IT.IT.EE.CSE. (CSE.EL. (CSE. CSE-313 E - - - - - 25 - 25 3 18 6 8 32 600 425 100 1125 4 . TOTAL T P Total Theor y 100 Examination Schedule (Marks) Session al 50 Practic al Total Duratio n of Exam (Hours) 3 Sl.IT) Microprocessors and Interfacing (EE.

Subject L CSE-302 E CSE-304 E Principles of Software Engineering (CSE. the student will carry out self study of .ELI&C VII ELECTIVE) Intelligent Systems Lab.IT) Intelligent Systems (CSE.EL VI sem) Systems Programming & System Administration (Common with IT V Sem) Wireless Communication (Common with VIII Sem EL) & CSE. No .net technology and implement a mini-project based upon this study.CSE) TOTAL 3 3 T 1 1 P Tota l 4 4 Theor y 100 100 Examination Schedule (Marks) Session al 50 50 Practic al Total 150 150 Duratio n of Exam (Hours) 3 3 Sl.IT VI Sem Digital System Design (EL.Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Examination (Semester. Digital System Design Lab. following this semester. 5 .IT) Operating Systems Lab.EE.6) Teaching Schedule Course No.IT) Computer Networks (Common with IT Vth sem) (CSE. (EL. 1 2 3 IT-305 E IT-303 E 3 1 - 4 100 50 - 150 3 4 3 1 4 100 50 - 150 3 5 EE-402-E 3 1 - 4 100 50 - 150 3 6 EE-310-E 3 1 - 4 100 50 - 150 3 7 8 9 CSE-306 E CSE-308 E EE-330-E 18 6 2 2 2 6 2 2 2 30 600 25 25 25 375 25 25 25 75 50 50 50 1050 3 3 3 - Note: During the vacation period.CSE.ELI&C.EE. This project will be evaluated in the coming 7th semester.IT. (CSE.

Sl.Project based upon . Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Examination (Semester.IT) Compiler Design ELECTIVES-1 ELECTIVES-2 Compiler Design Lab. No .net technology carried out at the end of 6th semester. TOTAL 1 CSE-401 E CSE-403 E CSE-405 E Duratio n of Exam (Hours) 3 3 1 - 4 100 50 - 150 3 2 3 4 5 6 7 3 3 4 4 - 1 1 - 3 3 4 4 4 4 3 3 100 100 100 100 - 50 50 50 50 50 50 50 50 150 150 150 150 100 100 3 3 3 3 3 CSE407E CSE409E CSE-411 E CSE-413 E 8 - - 4 4 - 50 - 50 3 9 CSE-415 E - - - - - 25 - 25 - 17 03 10 30 500 425 100 1025 6 . Visual Programming Lab.7) Examination Schedule Teaching Schedule (Marks) Subject Theor Session Practic L T P Total Total y al al Advanced Computer Architecture Software Project Management (CSE. Major PROJECT Part I OR INDUSTRIAL PROJECT Part I Assessment of Mini. Course No.

Major PROJECT Part I will commence in 7th semester where students will identity the project problem. The project will be completed in 8th semester along with its examinations.Note: 1. ELECTIVES-1 CSE-417 E Data Network Design CSE-419 E Neural Networks IT-465 E Network Technology CSE-421 E Advanced Database Management Systems CSE-423 E Object Oriented Software Engineering EE-407-E Digital Signal Processing HUM-451-E Language Skills for Engineers MATH-451-E Combinatorics & Graph Theory HUM-455-E Entrepreneurship ELECTIVES-2 IT-451 E Data Warehousing and Data Mining IT-467 E Computer Software Testing IT-469 E Introduction to E-commerce & ERP CSE-425 E Natural Language Processing IT-471 E Management Information system IT-453 E System & Network Administration HUM-453-E Oral Communication Competence MATH-455-E Linear Algebra CH-451-E Environmental Science & Engineering 7 . complete the design and arrange the needed hardware/ software.

464 E CSE-412 E IT-466 E IT-468 E CSE-414 E IT-302 E HUM-452-E PHY-452-E HUM-456-E MATH-202-E ELECTIVES-4 HUM-202-E IT-470 E MATH-402-E HUM-454-E IT-472 E CSE-416 E CSE 418 E CSE 420 E Network Security & Management Object Oriented Systems Development Embedded system Design Logic & Functional Programming Digital Image Processing Network Programming Business Communication Laser Technology Marketing Management Numerical Methods Fundamentals of Management Web Engineering Operations Research Indian English Writing Introduction to VLSI Design Social and Professional Issues in IT Human Computer Interaction Fuzzy Logic 8 .IT) Security of Information Systems (CSE. No.Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Examination (Semester.8) Sl. CSE-402 E IT-402-E Teaching Schedule Subject L Distributed Operating System (CSE.IT) ELECTIVES 3 ELECTIVES 4 Advanced JAVA Lab. (Common with IT VII Sem) Major PROJECT Part II OR INDUSTRIAL PROJECT Part II Colloquium General Fitness for the Profession TOTAL T 1 P - Total 4 Examination Schedule (Marks) Sessiona Practic Theory Total l al 100 50 150 Duration of Exam (Hours) 3 1 3 2 3 4 5 3 4 4 - 1 - 3 4 4 4 3 100 100 100 - 50 50 50 50 50 150 150 150 100 3 3 3 3 IT-407-E 6 CSE-404 E CSE-406 E CSE-408 E CSE-410 E - - 6 6 - 100 100 200 3 7 8 14 2 4 13 4 29 400 50 50 450 50 200 50 100 1050 3 ELECTIVES-3 IT. Course No.

CauchyIntegral theorem and formula. Solving linear programming problems using (i) Graphical method (ii) Simplex method (iii) Dual simplex method. Advanced Engg.K.K.MATH-201-E MATHEMATICS-III (COMMON FOR ALL BRANCHES) Class Work : Exam. change of interval. Advanced Engg. Evaluation of real integrals using residues (around unit and semi circle only). half and full rectified wave. Fourier transform of Dirac-delta function. Mathematics : R. Bayes theorem and its applications. Shifting theorem (both on time and frequency axes). Harmonic functions. Mathematics : Michael D. Cauchy-Riemann equations. radius and circle of convergence. Integration of complex functions. Advance Engg. Properties and application of Binomial. Student s tdistribution (applications only). Fourier integrals. Trignometric and Hyperbolic functions.R. Greenberg. Fourier expansion of square wave. Taylor's Maclaurin's and Laurent's series. : Part-A 50 Marks 100 Marks 150 Marks 3 Hours L T P 3 2 - Fourier Series and Fourier Transforms : Euler s formulae. Fourier transforms. TEXT BOOKS : 1. Convolution theorem. tests of significance for large samples. half range sine and consine series. Mathematics : B. : Total : Duration of exam. Power series. S. Limit and Continuity of a function. necessary and sufficient conditions for a function to be analytic. application to flow problems. 2. Differnetiability and Analyticity. Jain.Iyenger. expected value of a random variable. Zeroes and singularities of complex functions. Grewal. Testing of a hypothesis. REFERENCE BOOKS : 1.S. Higher Engg. Fourier transforms of integrals. . Linear Programming : Linear programming problems formulation. rectangular wave. conditions for a Fourier expansion. Residues. 2. Exponential function. Chi-square test of goodness of fit. Mathematics : F Kreyszig. Fourier expansion of odd and even functions. Part-B Functions of Complex Variable : Definition. saw-toothed wave. polar form of the Cauchy-Riemann equations. Poisson and Normal distributions. Fourier transforms of derivatives. Part-C Probability Distributions and Hypothesis Testing : Conditional probability. Logrithmic functions.

three from Part-B and three from Part-C. Note: Examiner will set eight questions. taking two from Part-A. Taha. 4. .A. Students will be required to attempt five question taking atleast one from each part. PHI.3. Probability and statistics for Engineers : Johnson. Operation Research : H.

Implementations.CSE-201 E L 3 T 1 P - Data Structures & Algorithms (CSE. AVL Trees.V. Introduction to Recursion. In. Addison-Wesley. post order. Worst Case. Graph Traversal Breadth first Traversal.AW Fundamentals of computer algorithms by Horowitz Sahni and Rajasekaran. Original edition. M. Binary Traversal pre-order.E. Threaded trees. Array based implementation of Queues / Lists. Evaluating time Complexity. Applications. Best Case. Big Oh . insertions : Bubble sort. Adjacency matrix. Merge sort. Array based implementation of stacks. path matrix implementation. Linked List implementation of Queues / Lists. Linked List based implementation of stacks. postfix. Properties of Binary trees and Implementation. Shell sort. prefix representation. Divide and Conquer Algorithm. PHI Pub. Schaum s outline by TMH Introduction to Computers Science -An algorithms approach . . (recursive & non Searching Algorithms: Straight Sequential Search. Moshe J. Bunt. Sorting by exchange. Unit-1: Introduction to Data Structures: Definition of data structures and abstract data types. Merging of sorted arrays& Algorithms. The Stacks : Definition. Augentem. Unit-6: Sorting Algorithms : Introduction. Aho.M. Straight selection sort. Factors depends on running time.H. Unit-5: Running time: Time Complexity. Hopcroft and T. Unit-2: Queues and Lists: Definition. Examples and real life applications. Richard B. Average Case.D. J. Quick sort Algorithm analysis. Implementations Unit-4: Graphs: Definition of Undirected and Directed Graphs and Networks. Circular implementation of Queues and Singly linked Lists. Heap sort: Heap Construction. The Linked List representation of graphs. selection. Reference Books: Data Structures and Algorithms by A. Balanced multi way search trees. recursive Algorithms) Text Book: Binary Search Data Structures using C by A. Priority Queues. Heap sort. Data Structures and Program Design in C By Robert Kruse. 1983. Efficiency of above algorithms. Tables : Definition. Fundamentals of Data structures by Ellis Horowitz & Sartaj Sahni. Pub. Implementations and Applications. bottom up. Conversions. Unit-3: Trees: Definition of trees and Binary trees. Symour Lipschetz. Static and Dynamic implementations. Examples : Infix. Langsam. Ullman. Depth first Traversal. Theory & Problems of Data Structures by Jr. The Array based implementation of graphs. PHI.IT) Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Shortest path Algorithm. 2002. T. Hash function.notation. Applications. Top down Heap sort approach. 1999. Performance of shell sort. Tenenbaum.order traversal. Running Times.. Jean Paul Tremblay.EL. Low Priced Edition. Binary Search Trees. Straight / circular implementation of doubly linked Queues / Lists.

Data Structure and the Standard Template library Note:

Willam J. Collins, 2003, T.M.H

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

CSE-203 E L 3 T 1 P -

Discrete Structures Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs.

Unit-1: Set Theory: Introduction to set theory, Set operations, Algebra of sets, Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product, Representation of relations, Types of relation, Equivalence relations and partitions , Partial ordering relations and lattices Function and its types, Composition of function and relations, Cardinality and inverse relations Unit-2: Propositional Calculus: Basic operations: AND(^), OR(v), NOT(~), Truth value of a compound statement, propositions, tautologies, contradictions. Unit 3: Techniques Of Counting: Permutations with and without repetition, Combination. Unit-4: Recursion 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-5: Algebric Structures Definition and 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 Unit-6: Graphs 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, Spanning trees, Binary trees and its traversals Text Book: Elements of Discrete Mathematics C.L Liu, 1985, McGraw Hill Reference Books: Discrete Mathematics by Johnson Bough R., 5th Edition, PEA, 2001.. Concrete Mathematics: A Foundation for Computer Science, Ronald Graham, Donald Knuth and Oren Patashik, 1989, Addison-Wesley. 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, Schaums Outline series: Theory and problems of Probability by S. Lipshutz, 1982, McGraw-Hill Singapore Discrete Mathematical Structures, B. Kolman and R.C. Busby, 1996, PHI Discrete Mathematical Structures with Applications to Computers by Tembley & Manohar, 1995, Mc Graw Hill. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all.

Paul B.G.and -wait protocol. Manchester encoding. Digital Communications. Introduction to Digital & Data Communications. Theoretical basis for data communication: Fourier analysis: Fourier series and Fourier Transform (property.division multiplexing Unit-4: Security in data communications: Transmission errors: feedback-.M. Halsall Fred. 2001.Stallings PHI Digital & Data Communication systems. 4th Edi. co-axial-. Computer Networks and Open Systems. Error correction: hamming codes. ESD. half duplex. Digital and analog signals: sign waves. W. New York. parallel-transmission. Low Price edition Reference Books: Business Data Communications. virtual circuits. Unit-2: Data Transmission System: Physical connections: modulation. asynchronous digital subscriber line.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Type of services: connection oriented-. Text Book: Data Communications. amplitude-. data rate of the channels (Nyquist theorem. Behrouz A. Synchronizations: Asynchronous-. Computer Networks and Open Systems Halsall Fred.21 Unit-3: Standards in data communications: Communication modes: simplex. phase. 1996.IT) Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. picketing switching: data gram . Bruce Carlson. TMH. delay distortion. Pratt. forward-error control approaches. wireless media Transmission impairments: attenuation. Properties of signals: amplitude. 7th Ed. 2nd Edition. connectionless-services. Flow control: unrestricted simplex protocol. JW&S. frame check sequences. John Wiley Data & Computer Communications. T. Error detection. AW. public key cryptograph. Shannon limit). Data encoding: binary encoding (NRZ). sliding window protocol. Multiplexing: frequency division-. square waves. PSD and Raleigh) effect of limited bandwidth on digital signal. Telephone Systems: PSTN. Parity check. (4th editon) 2000. by A. Data Communications and Networking. Miller Jaico Pub. frequency. 2002. permanent virtual circuits. fiber optic-cables. block sum check. synchronous-transmission. MGH Satellite Communication. Forouzan. wave. Transmission Media: Twisted pair-. Physical layer interfaces: RS 232. cyclic redundancy check. noise. simplex stop. X. Janet C. Switching systems: circuit switching. frequency-. Huffman encoding. Proakiss. Unit-1: Communication system components: Introduction to Communication: Definition & means of communications.EE-217 E L 3 T 1 P - Digital and Analog Communication (CSE. 4th Ed. Communication Systems. 2003. PHI. limited bandwidth of the channels.modulation. Students will be required to attempt five questions in all. differential Manchester encoding. Rutledge. Crilly.. time-. phase. full duplex. Fitzgerald Jerry. . Data Communications. Addison Wesley. Transmission modes: serial-. Data compression: run length encoding. Roden 1992. J. Data encryption: secret key cryptography. ISDN.

.

Decoders. PHI. UNIT 2 COMBINATIONAL DESIGN USING GATES: Design using gates. master-slave. logic gates: AND. McGraw Hill. Interfacing of CMOS and TTL families. Encoders. MGH 2. sequence generators. HTL. FPGA and CPLDs. T. ASCII. TEXT BOOK : 1. Jain. TTL. EX-NOR. J-K. successive approximation. and CMOS logic families. Decoders / Drivers for display devices. A/D converters : Quantization. EX-OR.EE-204-E L T P 3 1 0 DIGITAL ELECTRONICS CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: 50 100 150 3 HRS UNIT 1 FUNDAMENTALS OF DIGITAL TECHNIQUES : Digital signal. counting type. TMH REFERENCE BOOKS : 1. MOS. shift registers. DTL. Digital Principles and Applications : Malvino & Leach. Students will be required to attempt five questions in all. P. EBCDIC. PAL. specifications for D/A converters. UNIT 6 A/D AND D/A CONVERTERS: Sample and hold circuit. PLA. DCTL. NAND. UNIT 3 COMBINATIONAL DESIGN USING MSI DEVICES Multiplexers and Demultiplexers and their use as logic elements. UNIT 4 SEQUENTIAL CIRCUITS: Flip Flops : S-R. BCD arithmetic circuits. UNIT 7 PROGRAMMABLE LOGIC DEVICES: ROM. Bipolar logic families:RTL. Boolean algebra. Digital Design : Morris Mano. Modern Digital Electronics(Edition III) : R. parallel -comparator. edge triggered. NOR. dual-slope ADC. Asynchronous and Synchronous Ring counters and Johnson Counter. UNIT 5 DIGITAL LOGIC FAMILIES: Switching mode operation of p-n junction. weighted resistor and R -2 R ladder D/A Converters. devices. Design of Synchronous and Asynchronous sequential circuits. Digital Integrated Electronics : Taub & Schilling. ECL. . OR. Error detection and correction codes. Review of Number systems. NOTE : Eight questions are to be set in all by the examiner taking at least one question from each unit. Tristate logic. Adders / Subtractors. bipolar and MOS. Excess-3. NOT. Gray. D. 3. Counters. Karnaugh map and Quine Mcluskey methods of simplification. Binary codes: BCD. specifications of ADCs.

merits and demerits. money cost. UNIT-II Concepts and measurement of utility. shape of demand curve. Internal and External economics and diseconomies of scale. Globalisation of Indian economy . Monopoly. total cost etc.HUM-201-E ECONOMICS (COMMON FOR ALL BRANCHES) L T P Class Work 3 1 Theory Total Duration of Exam.various definitions. Acquaint the student in the basic economic concepts and their operational significance and 2 .Perfect Competition. Law of variable proportions. Law of equi-marginal utility .Fixed cost. . Books Recommended : TEXT BOOKS : 1. Production possibility curve Economic laws and their nature.its practical application and importance. UNIT-IV Meaning of production and factors of production. practical importance & applications of the concept of elasticity of demand. WTO. marginal cost. GATT & TRIPS agreement. Law of demand. Various concepts of cost . 1.merits and demerits. real cost opportunity cost. UNIT-III Meaning of Demand. average cost. Elasticity of demand. Role of Demand & Supply in Price Determinition and effect of changes in demand and supply on prices. in short run and long run. COURSE OBJECTIVE : The purpose of this course is to : : : : : 50 Marks 100 Marks 150 Marks 3 Hrs. Relation between Science. marginal cost. Principles of Economics : P. Law of Diminishing Marginal Utility. Chopra (Kalyani Publishers). Shape of average cost.N.Stimulate him to think systematically and objectively about contemporary economic problems. measurement of elasticity of demand. UNIT-V Meaning of Market. Engineering. Types of Market . Technology and Economics. Privatization . Elementary Concepts of VAT. Monoplistic Competition (Main features of these markets) Supply and Law of Supply. Returns to scale. Oligoply. variable cost. UNIT-I Definition of Economics . factors effecting elasticity of demand. Nature of Economic problem. Individual and Market demand schedule. UNIT-VI Nature and characteristics of Indian economy (brief and elementary introduction).meaning.

. Modern Economic Theory K.L. 4. 3.) Indian Economy : Rudar Dutt & K. Sundhram NOTE: Eight questions are to be set atleast one question from each unit and the students will have to attempt five questions in all.B.Chand) Modern Micro Economics : S.K. 6.M. A Text Book of Economic Theory Stonier and Hague (Longman s Landon) Micro Economic Theory M.K.P. Dewett (S.H. Kalkundrikar (R.L. Mishra (Pragati Publications) Economic Theory . Jhingan (S.N.B.Chand) REFERENCE BOOKS : 1. 2. Kulkarni & A. Ahuja (S. 5.Chand & Co.Chand) Micro Economic Theory .A.2.

To assemble a PC. min and max marks in each subject. study and replace floppy disk drive. TMH Upgrading and Repairing PCs. study and replace CD ROM drive. MS Excel 2000. Mark Mines.t. To make comparative study of motherboards. Preapare a presentation explaining the facilities/infrastructure available in your college/institute. PC Hardware : 1.r. Craig Zacker & John Rouske. To study printer assembly and elementary fault detection of DMP and laser printers. 7. 4. 9. 1999. To remove. To remove. memory and printers etc. To study various cards used in a system viz. connections and parts used in computer communication. BPB publ. 1. 13. Computers and manipulate the database using different forms and reports. To prepare the list of marks obtained by students in different subjects and show with the help of chart/graph the average. 6. PC Hardware: The complete reference. study and replace hard disk. To check and measure various supply voltages of PC. To prepare the Your Bio Data using MS Word 2. MS Power Point 2000. To observe various cables and connectors used in networking. Scott Mueller. To observe and study various cables. drives. 3. Create a database of books in the library on a mini scale w. L - T - P 2 Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. . 3. MS Access 2000. 8. PHI. its circuitry and various presents and some elementary fault detection. Reference Books: Complete PC upgrade & maintenance guide. Troubleshooting exercises related to various components of computer like monitor. 11. To study monitor. To study parts of keyboard and mouse. LAN card etc. display card. Note: At least 5 to 10 more exercises to be given by the teacher concerned. PC Software: Application of basics of MS Word 2000. 12.IT-201 E PC Lab. 5. To remove. 10. 2. 4.

1.CSE-205 E L T P 2 Data Structures & Algorithms Lab. Write the program for implementation of a file and performing operations such as insert. ( Insertion and Deletion in Binary search Tree) Write a program to create a linked list & perform operations such as insert. 11. update. reverse in the link list 4. 9. 10. Write a program which simulates the various tree traversal algorithms. 6. delete. Write a program to perform following operations on tables using functions only a) Addition b) Subtraction c) Multiplication d) Transpose Using iteration & recursion concepts write the programs for Quick Sort Technique Write a program to implement the various operations on string such as length of string concatenation. Write a program to search an element in a two-dimensional array using linear search. Create a linked list and perform the following operations on it a) add a node b) Delete a node Write a program to simulate the various searching & sorting algorithms and compare their timings for a list of 1000 elements. 12. 2. 13. Using iteration & recursion concepts write programs for finding the element in the array using Binary Search Method 3. Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. update a record in the file. 5. reverse of a string & copy of a string to another. Write a program to simulate the various graph traversing algorithms. . delete. Write a program to implement binary search tree. Note: At least 5 to 10 more exercises to be given by the teacher concerned. 7. 8. Write a program for swapping of two numbers using call by value and call by reference strategies.

1. EX-NOR. To design & realize a sequence generator for a given sequence using J-K flip-flops. Study of TTL gates AND. Study of CMOS NAND & NOR gates and interfacing between TTL and CMOS gates. NOR. NOT. NAND. 10. 9. To design & verify the operation of 3-bit synchronous counter. OR. To design and verify the operation of asynchronous UP/DOWN decade counter using J K flip-flops & drive a seven-segment display using the same. NOTE : At least ten experiments are to be performed. To verify the operation of comparator. To verify the operation of multiplexer & Demultiplexer. 7. Design a 4-bit shift-register and verify its operation . J-K. EX-OR. 11. 5. Verify the operation of a ring counter and a Johnson counter. 8.EE-224-E L T P 0 0 2 DIGITAL ELECTRONICS LAB CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: 25 25 50 3 HRS LIST OF EXPERIMENTS: 1. To verify the operation of bi-directional shift register. 3. To verify the truth tables of S-R. 2. 4. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus. To design and verify the operation of synchronous UP/DOWN decade counter using J K flip-flops & drive a seven-segment display using the same. T & D type flip flops. . Design & realize a given function using K-maps and verify its performance. 6. atleast seven experiments should be performed from above list.

Tata McGraw-Hill Publishing. Introduction to Concurrency control and Recovery systems. Bhattacharyya. Database Management and Design by G. McGraw-Hill. Date. parallel Databases. Majumdar and P.W. Addison-Wesley. 2nd edition. Low Priced Edition. Structured query language with special reference of (SQL of ORACLE). mapping Constraints. Prentice-Hall of India. Btrees Index files. Keys. Text Books: Database System Concepts by A. 1991. Responsibility of Database Administrator. Low Priced Edition. Addision-Wesley. Galgotia Pub. Introduction to Database Languages. and Darwen. Addison-Wesley. Sudarshan. Eastern Economy Edition.CSE-202 E L 3 T 1 P - Database Management Systems Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Advantages of DBMS over file processing systems. Database Management Systems by A. Reference Books: Fundamentals of Database Systems by R. integrity constraints. Silberschatz. functional dependencies & NORMALISATION (up to 4th Normal forms). Students will be required to attempt five questions in all. E-R Diagram (Entity Relationship). 2000. 2000. 1989. Relational Algebra & various operations. index sequential files. data mining & data warehousing. Reduction of E-R diagram into tables. Hashing. Hansen and J. 1999. Navathe. A Guide to the SQL Standard.H. 5th edition. Date. Unit-4: Relational Model. Various views of data. Reading.F. Elmasri and S. Hansen. QBE. PHI Note: Eight questions will be set in all by the examiners taking at least one question from each unit. C. Unit 1:Introduction Overview of database Management System. direct files. An Introduction to Database Systems by C. network model & hierarchical model. 3rd edition. Unit-3: File Organisation: Sequential Files. 3rd edition. MA: 1994. 1999. Unit-2: Introduction to Client/Server architecture.V.J. 3rd edition. . Data Management & file Structure by Looms. 1997. Korth and S. International Edition. H.B. Unit-5: Introduction to Query Languages :QLB . Introduction to Database Management system by Bipin Desai. Relational and Tuple calculus.K. 7th edition. Three levels architecture of Database Systems. data Models. BCNF (Boyce code normal forms) Unit-6: Introduction to Distributed Data processing.

Assignment & initialization. Heap storage management .W. Union. Subprograms . variable & constants. 1989. sets. pointer & programmer defined data objects. Unit-6: Storage Management: Major run time elements requiring storage . Prentice Hall Pub. Specification & implementation of elementary data types. Local data & local referencing environment. enumerations. Declarations . 1984. Programming Languages Principles and Pradigms Allen Tucker . Programming Languages Principles and Paradigms by Allen Tucker & Robert Noonan. Subprogram sequence control: simple call return . block structure. TMH. Unit 4: Sequence Control: Implicit & explicit sequence control .M. specification & implementation of structured data types. Unit-3 : Subprograms and Programmer Defined Data Types: Evolution of data type concept .recursive subprograms. non-procedural . Exception & exception handlers. Elementary data types data objects.abstraction.vector & arrays. Programming languages concepts by C. 2002. co routines. Galgotia publications (Springer Verlag). sequence control . Parameter & parameter transmission schemes. variable size data structures . Characteristics of a good programming language.type checking & type conversions . records Character strings. . Booleans & characters. Unit-1: Introduction: Syntactic and semantic rules of a Programming language. static & dynamic scope. Shared data: dynamic & static scope. Reference Books: Fundamentals of Programming languages by Ellis Horowitz. files.type definitions. sequence control within statement. Unit-2: Structured data objects : Structured data objects & data types . abstract data types. Programming language translators compiler & interpreters . Comparison of C & C++ programming languages. functional and object oriented programming language. Declaration & type checking of data structure . 1996. . Unit-5: Data Control: Names & referencing environment.. Text Book: Programming languages Design & implementation by T. Ghezzi.structured.programmer and system controlled storage management & phases . Stack based storage management. T. data types.sequence control within expressions. Note: Eight questions will be set in all by the examiners taking at least one question from each unit.H. encapsulation & information hiding . Unit-7: Programming Languages: Introduction to procedural. Robert Noonan 2002.CSE-204 E L 3 T 1 P - Programming Languages Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Students will be required to attempt five questions in all. Static storage management .Pratt. Numeric data types.variable & fixed size elements. Wiley Publications.

.

Unit-8: Computability: Basic concepts.Ullman. Introduction to formal Languages & Automata-Peter Linz. Ambiguity regular grammar. PHI.. Languages and computation):K.CSE-206 E Theory of Automata Computation P Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs.P. Closure properties of regular sets. Application of Pushdown Machines Unit-6: Turing Machines: Deterministic and Non-Deterministic Turing Machines. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Narosa Publ.(Automata.Principles and Practice by RamondGreenlaw and H. Basic Definitions Non-Deterministic finite automata (NDFA). Papaditriou. 2001. Equivalence of finite automata and Regular Expressions.M. Minimization Algorithm. R Mothwani.. language & computations. Design of T.R. Regular Expressions. Relation between languages of classes. 1998.Hopcroaft & O. 1998. T. Equivalence of Moore and Mealy machines. Applications of the pumping lemma. L 3 T 1 Unit-1: Finite Automata and Regular Expressions: Finite State Systems. . PCP Problem. Harcourt India Pvt.D.M. Context sensitive languages. Reduced forms. Myhill-Nerode Theorem and minimization of finite Automata. Context free and Context sensitive grammar.L. AW Reference Books: Theory of Computer Sc. Unrestricted grammars. Deterministic finite automata (DFA). PHI.M.Chandrasekaran. Ltd. Unit-4: Grammars: Definition. Unit-3: Properties of Regular Sets: The Pumping Lemma for Regular Sets.Mishra & N. Removal of useless Symbols and unit production. Unit-2: Introduction to Machines: Concept of basic Machine. Unit-7: Chomsky Hierarchies: Chomsky hierarchies of grammars. Properties and limitations of FSM. Text Book: Introduction to automata theory. Primitive Recursive Functions. Chomsky Normal Form (CNF). 2001. Equivalence of DFA and NDFA Finite automata with E-moves. Martin 2003.. Moore and mealy Machines. Fundamentals of the Theory of Computation. Lewis & C.H.H. Conversion of NFA to DFA by Arden s Method. 2000. Elements of theory of Computation by H. Students will be required to attempt five questions in all. Unit-5: Pushdown Automata: Introduction to Pushdown Machines. Regular expression conversion and vice versa. Halting problem of T. James Hoover. Griebach Normal Form (GNF). Introduction to languages and the Theory of Computation by John C.

Reading Data Sequentially from a Random Access File. Unit 3: Classes and Data Abstraction: Introduction.Class Pointers. Other Modifiers. Separating Interface from Implementation. Text Books: C++ How to Program by H M Deitel and P J Deitel. Templates and Static Members. Structure Definitions. Constructors. Abstract Base Classes And Concrete Classes. Using Destructors. Unit-7: Files and I/O Streams: Files and Streams. Illustrative Simple C++ Programs. Overriding Methods. Introduction. Polymorphism. Rethrowing an Exception. or variable (public. Overloading Template Functions. Header Files and Namespaces. Stream Error States. Accessing Members of Structures. method. Stream Manipulators. Polymorphism: Overloading. Function overloading.1994.. Using This Pointer. Using Default Arguments With Constructors. Unit-5: Inheritance: Introduction. Creating A Random Access File. C++ Standard Library. Templates and Inheritance. Creating a Sequential Access File. Destructors and Exception Handling. Templates and Friends. Abstract Classes. Basics of a Typical C++ Environment. Fundamentals of Operator Overloading. The WAITE Group Press. Protected Members. Unformatted I/O (with read and write). Inheritance. 1998. Exceptions and Inheritance. Random Access Files. Implicit Derived Class Object To BaseClass Object Conversion. Unit-8: Templates & Exception Handling: Function Templates. 2003. Unit-2: Object Oriented Concepts : Introduction to Objects and Object Oriented Programming. Reusability. Overloading Binary Operators. Encapsulation (Information Hiding). Unit 6: Virtual Functions and Polymorphism: Introduction to Virtual Functions. Dynamic Binding. Class Template. Using Constructors and Destructors in derived Classes. Processing Unexpected Exceptions. Friend Function and Friend Classes. Class Templates and Non-Type Parameters. Catching an Exception. Composition Vs. as Friend Functions. Using Member Functions. Dynamic Memory Allocation with New and Delete. Class Scope and Accessing Class Members. >> Overloading Unary Operators. Static Class Members. Inheritance. protected. Stream Output. <<.Class Pointers to Derived. Unit-4: Operator Overloading: Introduction. Public. Overriding Base Class Members in a Derived Class. Pre-processors Directives. Object as Member of Classes. Access Modifiers: Controlling access to a class. Polymorphism. Unit 1: Introduction to C++. Reading Data From A Sequential Access File. Stream Input. Controlling Access Function And Utility Functions. Programming with C++ By D Ravichandran. Exception specifications. Proxy Classes. Protected and Private Inheritance. Initializing Class Objects: Constructors. Stream Input/Output Classes and Objects. Inheritance: Base Classes And Derived Classes. Restrictions On Operators Overloading. Stream Format States. Prentice Hall Object Oriented Programming in Turbo C++ by Robert Lafore . T.M. Class s Behaviors. Updating Sequential Access Files. Casting Base. Operator Functions as Class Members vs. Virtual Destructors. Classes : Const(Constant) Object And Const Member Functions. Basics of C++ Exception Handling: Try Throw. New Classes And Dynamic Binding. Overloading.IT-202 E L 3 T 1 P - Object Oriented Programming Using C++ Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Stack Unwinding. library files. Catch.H Reference books: . private. Writing Data Randomly To a Random Access File. package). Container Classes And Integrators. Throwing an Exception.

2003. .Object oriented Programming with C++ by E Balagurusamy. TMH. Tata McGraw-Hill Computing Concepts with C++ Essentials by Horstmann. 2001. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. 2002. Students will be required to attempt five questions in all. John Wiley. The Complete Reference in C++ By Herbert Schildt.

hypertext markup language. Students will be required to attempt five questions in all. Web page installation. XML basics. Unit-6: Privacy and security topics: Introduction. IIS. Microsoft Personal Web Server.secinf. Coast-to-coast surfing. search strategies. 2000. standard address. internet tools. working of the search engines. e-mail addresses. Unit-1: Electronic Mail: Introduction. Deitel. 1996 Note: Eight questions will be set in all by the examiners taking at least one question from each unit. chat rooms. history. Telnet and FTP. Software Complexity. TMH Internet & World Wide Programming. Secure Web document. Working of Internet. Basics of HTML & formatting and hyperlink creation.Modems and time continuum. QUE. Newsgroups. E-mail management. Pass words. Raymond Greenlaw and Ellen Hepp 2001.v6. Firewalls. domain name.Deitel & Nieto. Kironjeet syan -New Rider Pub.CSE-208 E L 3 T 1 P - Internet Fundamentals Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Text Book: Fundamentals of the Internet and the World Wide Web. Client and Server Side Programming in java script. Unit-3 : World Wide Web : Introduction. Web page setup. . communications software. Unit-2 : The Internet: Introduction to networks and internet. internet culture. mailing lists. Internet Congestion. Using FrontPage Express. 1997 Network firewalls.com Alfred Glkossbrenner-Internet 101 Computing MGH. Plug-ins. Aron Weiss. searching the www: Directories search engines and meta search engines. Unit-5 : Servers : Introduction to Web Servers: PWS. mailer features. Email inner workings. www. Accessing & using these servers. Collaborative computing & the internet. Forms and data in java script.hackers. Pearson Education Reference Books: Complete idiots guide to java script. java script language. Introduction to Browser. Apache. Miscellaneous Web Browser details.com www. message components. Unit-4: Languages: Basic and advanced HTML. IP. Mime types.. message composition. Modes of Connecting to Internet. search fundamentals. Internet Service Providers(ISPs). DNS. Internet address. Digital Signatures. business culture on internet. Encryption schemes. Userids. advantages and disadvantages.

computer register. 1999. addressing modes: register. Data Transfer. Control memory. Multiplexers. Instruction set formats (fixed. Sequential logic blocks(Latches.210 E L 3 T 1 P - Computer Architecture & Organization Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. FlipFlops.2002. address sequencing. 2002. Combinational logic blocks(Adders. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Mano. 4th edition. caches.H. variable. Control Flow. structured organization. cost per bit). MIPS. 4th edition. timing and control. Instruction level parallelism (pipelining. Types of interrupts. Zvonko Vranesic. micro architecture. memory/ register) detailed data path of a typical register based CPU. Enhancing performance with pipelining. secondary memory units & I/O. type of instructions. direct. Prentice-Hall of India.4th edition. MISD.S. 5th Edi. TMH. Stack Organization. micro-instruction formats.CSE. Structured Computer Organisation by A. Unit-7: Computer Organization [80x86]: Instruction codes. stack. Static & dynamic memory types).. Cache memory (Associative & direct mapped cache organizations. Kauffmann. indexed. Tanenbaum. Instruction Formats. by Carl Hamacher. accumulator logic. T. Basics of Logic Design. memory expansion. I/O reference. New Jersey Computer Organization. 2001. Language of the machine: 8086 . Prentice-Hall Upper Saddle River. super scaling basic features). Patterson and John L. CPU. Text Books: Computer Organization and Design. 3rd Edi. operating systems. immediate. . main memory and secondary memory. MFLOPS. indirect. de-coder). Flynn s classification of computers (SISD. microinstruction sequencing. Memory Hierarchy. Main memory (Semiconductor RAM & ROM organization. 1998. Unit-3: Instruction Set Architecture: Instruction set based classification of processors (RISC. main memory. Safwat Zaky. ISA. 2nd Ed. throughput enhancement). Encoders.M. register reference. Unit-5: Memory Hierarchy & I/O Techniques: The need for a memory hierarchy (Locality of reference principle. by John P. memory reference. Stallings. Arithmetic and Logical. MIMD). computer instructions. and their comparison). Students will be required to attempt five questions in all. Unit-4: Basic non pipelined CPU Architecture: CPU Architecture types (accumulator. by David A. Computer Architecture. Computer Architecture and Organization. 2001. Prentice-Hall. Computer System Architecture by M. Hayes. Memory hierarchy in practice: Cache. Unit-6: Introduction to Parallelism: Goals of parallelism (Exploitation of concurrency. instruction cycle. Counters) Unit-2: General System Architecture: Store program control concept. Memory parameters: access/ cycle time. hybrid).Nicholas Carter. simulation using MSAM. Performance metrics. Unit-1: Basic Principles: Boolean algebra and Logic gates. CISC. Computer Organisation & Architecture: Designing for performance by W. Reference Books: Operating Systems Internals and Design Principles by William Stallings. micro-program sequencer. Hennessy. Operations in the instruction set. Eastern Economic Edition. register. high level language. Amdahl s law. Morgan 1997. 1996. implementation of control unit. Multilevel viewpoint of a machine: digital logic. Processor level parallelism (Multiprocessor systems overview). FetchDecode-Execute cycle (typically 3 to 5 stage). Registers. Prentice-Hall International edition.

.

Add a record in the database Delete a record in the database Modify the record in the database Generate queries Generate the report List all the records of database in ascending order. . VB. Student information system (e) Academic (f) Finance 4. ORACLE.CSE. 4. 5. 2. VB. ORACLE and/or DB2 2. II Develop a menu driven project for management of database system: 1. VB. IT & MCA Departments (h) Electrical & Mechanical Departments Usage of S/w: 1. 3. MSACCESS 3.212 E Database Management Systems Lab L - T - P 2 Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. Create a database and write the programs to carry out the following operation : 1. Library information system (a) Engineering (b) MCA 2. I. MS SQL SERVER 2000 Note: At least 5 to 10 more exercises to be given by the teacher concerned. D2K 4. Inventory control system (c) Computer Lab (d) College Store 3. Time table development system (g) CSE. 6.

The display should be in the format of feet and inches or metres and cenitmetres depending on the object on display. Create two structure variables of type phone. Include the following public member Functions: constructor with no arguments (default). Finally it should display the result. Create a class rational which represents a numerical value by two double valuesNUMERATOR & DENOMINATOR. Write a program that uses a structure to store these three parts of a phone number separately. and another number. multiplying. Initialize one. DM stores distances in metres and centimeters and DB in feet and inches. depending on the units in which the results are required. or dividing the two numbers. Q2. Use a default argument of 2 for p. Raising a number n to a power p is the same as multiplying n by itself p times. Write a program that can read values for the class objects and add one object of DM with another object of DB. A point on the two dimensional plane can be represented by two numbers: an X coordinate and a Y coordinate. Q 3. The sum of two points can be defined as a new point whose X coordinate is the sum of the X coordinates of the points and whose Y coordinate is the sum of their Y coordinates. and have the user input a number for the other one. (4. an operator. Enter your area code. Define three points. and number: 415 555 1212 My number is (212) 767-8900 Your number is (415) 555-1212 Q 5.L - IT-206 E T P 2 C ++ Programming Lab. so that if this argument is omitted. subtracting. The response can be Y or N . such as (212) 767-8900. The program should request the user to enter a number. Q 6. Call the structure phone. 11 Create the equivalent of a four function calculator. and returns the result as double value. Write a main ( ) function that gets values from the user to test this function. Interaction with the program might look like this: Enter coordinates for P1: 3 4 Enter coordinates for P2: 5 7 Coordinates of P1 + P2 are : 8. the number will be squared. Than set the third point equal to the sum of the other two.5) represents a point 4 units to the right of the origin along the X axis and 5 units up the Y axis.333333 Do another (Y/ N)? Y Enter first number. . The interchange might look like this: Q4. and display the value of the new point. the program should ask if the user wants to do another calculation. can be thought of as having three parts: the area code (212). second number: 10/ 3 Answer = 3. operator. For example. operator. (It should use a switch statement to select the operation). Use a friend function to carry out the addition operation. Write a function called power ( ) that takes a double value for n and an int value for p. Q1. the exchange (767) and the number (8900). Enter first number. Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. Some sample interaction with the program might look like this. and have the user input values to two of them. second number 12 + 100 Answer = 112 Do another (Y/ N) ? N A phone number. Write a program that uses a structure called point to model a point. When it finishes the calculation. Create two classes DM and DB which store the value of distances. exchange. Then display both numbers. It should then carry out the specified arithmetical operation: adding. The object that stores the results maybe a DM object or DB object.

Imagine a tollbooth with a class called toll Booth. Make a class Employee with a name and salary. Make a class Manager inherit from Employee. Q 8. The two data items are a type unsigned int to hold the total number of cars.. Declare pointer to father. Write a program that creates a binary file by reading the data for the students from the terminal. Overload >> operator to enable input through cin. List the information about all the pediatric patients (less than twelve years in age). Create a derived class to store the age of the patients. A hospital wants to create a database regarding its indoor patients. You should also define suitable constructors for these classes. named department. public. assign addresses of objects of the two derived classes to this pointer and in each case. Consider the following class definition class father { protected : int age. The information to store include a) Name of the patient b) Date of admission c) Disease d) Date of discharge Create a structure to store the date (year. call iam ( ) through the pointer to demonstrate polymorphism in action. Add an instance variable. Write a main ( ) to test all the functions in the class. month and date as its members). Now. The member function should include functions to enter information and display a list of all the patients in the database. department and salary. Overload + operator to add two rational number.} virtual void iam ( ) { cout < < I AM THE FATHER.constructor with two arguments. Q 10. The data of each student consist of roll no. father (int x) {age = x. name ( a string of 30 or lesser no. Supply a method to toString that prints the manager s name. Q9. Supply a method to String that prints the string Executive followed by the information stored in the Manager superclass object. my age is : << age<< end1:} }. Successively. Make a class Executive inherit from Manager. of characters) and marks. Q11. Supply a test program that tests these classes and methods. define iam ( ) to write our similar but appropriate messages. Overload << operator to enable output through cout. Create a base class to store the above information. and a type double to hold the total amount of money . List the information about all the to store the age of the patients. void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator and denominator. write a main ( ) that creates objects of the three classes and then calls iam ( ) for them. of type string. Derive the two classes son and daughter from the above class and for each. Q 7.

and put them in a Deque-some at the head of the Deque and some at the tail. The string should be passed to reversit ( ) as an argument. increments the car total but adds nothing to the cash total. and another to count a nonpaying car. The opposite would be true if getRight ( ) were used.collected. Another function. Display the contents of the Deque using the forEach ( ) function and a user written display function. Q13. Using these three classes. Write a function called reversit ( ) that reverses a string (an array of char). Able was I ere I saw Elba) . This program should allow the user to push one key to count a paying car. design a program that will accept dimensions of a triangle or a rectangle interactively and display the area. Add to the base class. a member function called displays the two totals. Finally remove all the items from the Deque using the getLeft ( ) function and display each item. Remember the two values given as input will be treated as lengths of two sides in the case of rectangles and as base and height in the case of triangles and used as follows: Area of rectangle Area of triangle =x*y =½*x*y . Finally. Use this class to store two double type values that could be used to compute the area of figures. and print out the result. Create some objects of the string class. A constructor initializes both these to 0. a member function get_data ( ) to initialize base class data members and another member function display_area ( ) to compute and display thearea of figures. Pushing the ESC kay should cause the program to print out the total cars and total cash and then exit. Derive two specific classes called triangle and rectangle from the base shape. Make display_area ( ) as a virtual function and redefine this function in the derived classes to suit their requirements. Use an input method that allows embedded blanks. call reversit ( ). called nopayCar ( ). then the second and next to last characters and so on. Then search the Deque for a particular string. Use a for loop that swaps the first and last characters.50 to the cash total. The program should get a string from the user. Notice the order in which the items are displayed: Using getLeft ( ). Q 14. Write a program to exercise reversit ( ). A member function called payingCar ( ) increments the car total and adds 0. Include a program to test this class. those inserted on the left (head) of the Deque are removed in last in first out order while those put on the right side are removed in first in first out order. Create a base class called shape. Q12. Test the program with Napoleon s famous phrase. using the first That ( ) function and display any strings that match.

Making a Web page of your college using HTML tags. Exercises involving: Sending and receiving mails.CSE 214 E L T P 2 Internet Lab Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. Using FTP and Tel net server. anchor etc. image.). . Using HTML Tags (table. Chatting on the net. Note: At least 10 exercises to be given by the teacher concerned. form.

2001. Operating System Incorporating With Unix & Windows By Colin Ritche. TMH. Multilevel Queue Scheduling. Introduction to distributed file system. multi user.CSE-301 E L 3 T 1 P - Principles of Operating Systems Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. 1990. 1985. CPU scheduling. Unit 5: Process-Synchronization & Deadlocks: Critical Section Problems. Operating Systems Advanced Concepts By Mukesh Singhal . Shortest-Job-First (SJF). Round Robin(RR). Operating System By Milankovic. scheduling algorithms -First Come First Serve (FCFS). directory structures. Tanenbaum. swapping. segmentation with paging. N. non-contiguous memory allocation paging and segmentation techniques.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Multithreading etc). 1998. Prentice-Hall Reference Books: Operating System By Peterson .. Unit 2: Process Management: Process concept. Demand Segmentation. 1990. Various Operating system services. Unit-1: Introduction: Introduction to Operating System Concepts (including Multitasking. Time-sharing systems. 1974. deadlock recovery. semaphores. process scheduling. Operating Systems by Mandrik & Donovan. Kernel. scheduling criteria. System programs and calls.Demand Paging & PageReplacement Algorithms. Modern Operating Systems by A. 2003. Text Books: Operating System Concepts by Silberchatz et al. multiprogramming.4th edition. virtual memory management . Addison-Wesley. Operating Systems Internals and Design Principles by William Stallings. AWL. contiguous memory allocation. disk scheduling and management and its associated algorithms.G. architecture. Shell interpreter. Prentice-Hall. Transforming I/O requests. Network OS. Unit-6: I/O Systems: I/O Hardware. Performance Issues. 5th edition. Shivaratri. avoidance & detection. Types of Operating Systems: Batch operating system. Real Time OS. 1992. Unit 3: Memory Management: Logical & Physical Address Space. Unit 4: File System: Different types of files and their access methods.M. Application I/O Interface. Windows NT architecture overview. methods for handling deadlocks-deadlock prevention. Students will be required to attempt five questions in all. Distributed OS. TMH Operating Systems By Deitel. various allocation methods. TMH. Priority Scheduling. . operation on processes. AW. Windows NT file system. Unit 7: Unix System And Windows NT Overview Unix system call for processes and file system management. T.

data transfer instructions. UNIT 5. BIU. looping instructions. interrupt structure. flag manipulation instructions. block diagram of 8086. control words. Programmable interval timer chips. addressing modes. shift and rotate instructions. programming examples. Programming & Design : Yu-Chang Liu & Glenn A Gibson. . The 8088 & 8086 Microprocessors-Programming. Microprocessors and interfacing : Hall. TMH 2. pin diagram and description of various signals. INTERRUPT AND TIMER : 8259 Programmable interrupt controller.B . logical instructions.EE-309-E MICROPROCESSORS AND INTERFACING L T P 3 1 0 CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: PART A 50 100 150 3 HRS UNIT1. instruction formats. UNIT2. INTERFACING DEVICE : The 8255 PPI chip: Architecture. DMA : Introduction to DMA process. assembler instruction format. interfacing. THE 8085 PROCESSOR : Introduction to microprocessor. 2. THE 8086 MICROPROCESSOR ARCHITECTURE: Architecture. UNIT3.Hardware & Applications :Triebel & Singh.Pentium processor : Brey. PHI 3. Advanced Microprocessors and Interfacing : Badri Ram. PART B UNIT4. program relocation. branch instructions. memory segmentation and physical address computations. PHI. UNIT6.Students have to attempt any five questions. TMH NOTE: 8 questions are to be set selecting FIVE questions from PART A and THREE questions from PART. and assembly language programming. TEXT BOOKS : 1. arithmetic instructions. NOP and HLT instructions. instruction set. details of sub-blocks such as EU. PHI REFERENCE BOOKS: 1. INSTRUCTION SET OF 8086: Instruction execution timing. Microprocessor Architecture. The Intel Microprocessors 8086. directives and operators. 4. Programming & Applications with 8085 : Ramesh S Gaonkar. 8237 DMA controller. Wiley Eastern Ltd. Microcomputer systems: the 8086/8088 Family: architecture. 8085 microprocessor: Architecture. modes and examples.

.

The Z.Pauline Baker. Unit-6: Illumination. Feiner and Johb F. geometric transformation of images. Unit-1: Introduction to Computer Graphics: What is Computer Graphics. Two dimensional Graphics Primitives: Points and Lines. Sutherland-cohen algorithm. reflection. Computer Graphics Hardware and software. the mathematics of planner geometric projections. PHI Reference Books: Procedural Elements for Computer Graphics David F. Matrix Unit-3: Viewing in 3D: Projections. image processing. 1994.M.H 2002 . boundary filled algorithm. Three dimensional transformations: Three dimensional graphics concept. Circle drawing algorithms: Using polar coordinates.H Second Edition Fundamentals of 3Dimensional Computer Graphics by Alan Watt. composite transformation. BPB Graphics. Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping algorithm. scanline algorithm. representation of 3-D Transformations. GUI. translation. shading. Clipping: point. area sub-division algorithm. mid point circle drawing algorithm. Unit-4: Hidden surface removal: Introduction to hidden surface removal. Line drawing algorithms: DDA. 1999. Hughes.CSE -303 E L 3 T 1 P - Computer Graphics Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. T. coordinate systems. Unit-5: Representing Curves and Surfaces: Parametric representation of curves: Bezier curves. Andeies van Dam. scaling. window to view port mapping. Bresenham s circle drawing. Filled area algorithms: Scanline: Polygon filling algorithm. parametric line clipping algorithm (Cyrus Beck). Computer Graphics Secrets and solutions by Corrign John. BPV Introduction to Computer Graphics By N. Addision Wesley. viewports. clipping line (algorithms):. Rogers.M. shading models for polygons. rotation. Computer Graphics Applications. Bresenham s. transparency. Computer Graphics: Secrets and Solutions by Corrign John. 1999. Two dimensional transformations: transformations.4 bit code algorithm. Foley. Standard Publ. Games & Multimedia Projects in C by Pilania & Mahendra. 2001. Interpolation method. Unit-2: Two/Three Dimensional Viewing: The 2-D viewing pipeline. Composition of 3-D transformation. shadows. image manipulation: Illumination models. Computer Graphics by Donald Hearn and M. Addision Wesley. B-Spline curves.buffer algorithm. 2nd Edition. types of projections. Stevan K. 2000. What is an image? Filtering. windows. Parametric representation of surfaces. Krishanmurthy T. Text Books: Computer Graphics Principles and Practices second edition by James D.

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

minimum spanning trees. Richard B. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. S. qick sort. graph colouring. binary search.H. Johan Wiley & Sons. Hamiltonian cycles. Naresh Publ. 2002. 8 queen s problem. the traveling salesperson problem. TMH Reference Books: The Design and Analysis of Computer Algorithm. J. Students will be required to attempt five questions in all.. union. Ellis Horowitz and Sartaj Sahni. Hopcroft J.CSE -305 E L 3 T 1 P - Analysis and Design of Algorithms Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Introduction To Algorithms. Unit-2: Divide and Conquer: General method. Berlion. P. selection sort. Introduction to Computers Science.E.E. merge sort.. Addison Wesley. single souce paths and analysis of these problems. some lower bounds on parallel computations. Writing Efficient Programs. T. D. Unit-3: Greedy Method: General method.E. Aho A. 1997. 1978. efficiency considerations. Techniques for algebraic problems... O/I knapsack. . Knuth. optimal binary search trees.V. Unit-1: Brief Review of Graphs. O/I knapsack and traveling salesperson problem. Unit-6: Branch and Bound: Method. & Hedetnieni. Unit-4: Dynamic Programming: General method. Goodman.Bunt. Unit-7: NP Hard and NP Complete Problems: Basic concepts.An algorithms approach . 1974.L. knapsack problem.Bizard. Proof and Analysis of Programs. NP hard graph and NP scheduling problems some simplified NP hard problems. Unit-5: Back Tracking: General method. P. Bentley.: 1985. Cook s theorem. Thomas H Cormen. Charles E Leiserson And Ronald L Rivest: 1990. Galgotia Publ. Fundamentals of Algorithms: The Art of Computer Programming Voll. Algorithms-The Construction. Jean Paul Trembley. PHI Introduction to Design and Analysis of Algorithm. Sets and disjoint sets. sorting and searching algorithms and their analysis in terms of space and time complexity. 1986.M. MGH. Strassen s matrix multiplication algorithms and analysis of algorithms for these problems. Text Books: Fundamental of Computer algorithms. analysis of these problems. job sequencing with dead lines.

.

O Reilly. Applications. applications. Cassandra Greer. Intranets by James D. XHTML and the W3C.CSE. SPD) 1st edition HTML & XHTML: The Definitive Guide by Chuck Musciano. Event handling.NET Technology and its comparison with the competing Technologies. Bill Kennedy. plugins and helper applications. Pavel Kulchenko. Jaico Publ. Text books: Beginning XHTML by Frank Boumpery. T. Configuring the server to support CGI. hidden fields. Programming Web services. 2000. miscellaneous topics such as cookies. 2002.307 E L 3 T 1 P - Web Development Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. the doubling code and RDF. HTML and URLs. frames. ordered and unordered lists. Forms processing. Marking up for structure and style: basic page markup. How the browser worksMIME types.M. The VRML idea. Output in JavaScript. Unit-2: Separating style from structure with style sheets: Internal style specifications within HTML. Input/ output operations on the WWW. 1997. T. issues and web development. CGI Programing with Perl 2/e O Reilly. Descriptive markup: Meta tags for common tasks. and images. Gunther Birzniek. . semantic tags for aiding search. 2000. Shishir Gundararam. Reference books: XHTML Black Book by Steven Holzner. page and site design considerations. James Snell. Client side programming: Introduction to the JavaScript syntax.Cimino. Unit-5: Introduction to Microsoft . (using PERL/VBSCRIPT/JavaSCIPT) Unit-4: Other dynamic content technologies: introduction to ASP & JSP. 2000 CGI Programming on the World Wide Web.M. The Java phenomenon-applets and servelets. Hypertext markup language: The anatomy of an HTML document. 2003. WROX press (Indian Shroff Publ. Atul Kahate.. Forms handling. Dave Raggett. Jenny Raggett. Unit-1: Introduction to the Internet. How the web works-HTTP. the JavaScript object model. Doug Tidwell. The world wide web: The idea of hypertext and hyper media.H Scott Guelich. Delivering multimedia over web pages. The standards-HTML. Internet and Web Technologies Raj Kamal. Web Technologies By Achyut S Godbole . O Reilly Associates. Sebastian Schnitzenbaumer & ted Wugofski. 4th Edi. Students will be required to attempt five questions in all.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. embedding images and controlling appearance. table creation and use. Programming languages for server Side Scripting. External linked style specification using CSS. XML. Unit-3: Server side programming: Introduction to Server Side Technologies CGI/ASP/JSP. absolute and relative links. nesting and targeting.

.

TIFF. internet. JPEG performance. color palettes. Buford. intelligent VR software systems. brief survey of speech recognition and generation. Unit-2: Image Compression & Standards: Making still images. Students will be required to attempt five questions in all.PHI. audio compression & decompression. Multimedia in Action by James E Shuman.. Unit-3: Audio & Video: Digital representation of sound. . multimedia an introduction. Multimedia in Practice by Jeff coate Judith. professional development tools. video on demand. JPEG statistical coding. presentation devices and the user interface. editing sampled sound. 1997. digital audio signal processing. time domain sampled representation. intelligent multimedia system. Villamil & Molina.IT-204 E L 3 T 1 P - Multimedia Technologies Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. LANs and multimedia. AWL Multimedia Making it Work by Vaughar. 1997 Multimedia on the PC. Text Books: An introduction.F. Multimedia Communications by Halsall & Fred. shading. VR operating system. time base media representation and delivery. Lozano. 1994. vector drawing. animation techniques. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. audio synthesis. CDAudio. subband coding. fifth edition. Tay Vaughan. visually coupled system requirements. musical instrument digital interface. Applications of environment in various fields. 1997 multimedia: Sound & Video. Multimedia Systems by John . multimedia presentation and authoring.AW. Villamil & Molina. fourier method.Que. virtual environment displays and orientation making. (Que) Reference Books: Multimedia: Production. method of encoding the analog signals. anti aliasing. BMP. 2001. transmission of digital sound. PHI. desktop virtual reality. communication and entertainment. Sinclair. JPEG predictive lossless coding. Unit-1: Basics of Multimedia Technology: Computers. multimedia servers & databases. Multimedia Systems by Koegel. MPEG motion video compression standard. stereophonic & quadraphonic signal processing. Multimedia Mc Milan. scanning images. overview of other image file formats as GIF. Unit-4: Virtual Reality: Applications of multimedia. JPEG-objectives and architecture. digital video and image compression. 2001. World Wide Web & multimedia distribution network-ATM & ADSL. 3D graphics programs. computer color models. framework for multimedia systems. PNG etc. morphing. TMH. CD-I. multimedia devices. 1997. Koegel. MPEG Audio. 1995. JPEG-DCT encoding and quantization. Wadsworth Publ. CD-ROM. vector graphics. planning and delivery. DVI technology.BPB Multimedia: Making it work. editing and capturing images. 3D drawing and rendering. etl.

.

8. Write a program for displaying 3D objects as 2D display using perspective transformation. 3. . Write a program for polygon clipping. 5. Write a program for rotation of a 3D object about arbitrary axis. L - T - P 2 Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. Note: At least 5 to 10 more exercises to be given by the teacher concerned. Write a program for polygon filling as Raster Graphics Display Write a program for line clipping. 2. Write a program for 2D line drawing as Raster Graphics Display. Write a program for Hidden surface removal from a 3D object. 4. 7. 6.CSE-309 E Computer Graphics Lab. List of programs to be developed 1. Write a program for circle drawing as Raster Graphics Display.

H The Java Handbook by Patrick Naughton. Duane W.Delhi . Java Elements Principles of Programming in Java . structures and functions. 2000.CSE-311 E L T P 2 Web Development & Core JAVA Lab. N. Books recommended for Lab.Texts and Animation Programs related to interfaces & packages Input output & Random files programs in java Java programs using Event driven concept Programs related to Network Programming Development of Web site for the college or newspaper agency. and data structures such as arrays . Java programs using classes & objects and various control constructs such as loops etc . Bailey. Duane A. Java programs for creating Applets for display of Images . Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. TMH. T.M. Bailey .

Study the notes of a piano and stimulate them using the key board and store them in a file. 5. 4. An architect may have a Graphics programs draw an Entric building but be interested in only ground floor. can be justified in 30 columns as shown below. 7. Devise a routine to produce the animation effect of a square transforming to a triangle and then to a circle. For example. Write a program by which we can split mpeg video into smaller pieces for the purpose of sending it over the web or by small capacity floppy diskettes and then joining them at the destination. . Create a web page for a clothing company which contains all the details of that company and at-least five links to other web pages. 3. LIST OF EXPERIMENTS: 1.IT-208 E L T P 2 Multimedia Technologies Lab. Write a program to justify a text entered by the user on both the left and right hand side. Write a program to show a bitmap image on your computer screen. Write a program to simulate the game Mine Sweeper. Write a program to read a paragraph and store it to a file name suggested by the author. 8. Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. Write a program to simulate the game of pool table. 2. 6. the test An architect may have a graphics program to draw an entire building but be interested in only ground floor . Write a program to play wave or midi format sound files. 10. 9. Note: At least 5 to 10 more exercises to be given by the teacher concerned.

Finding the largest number from an array. 16-bit subtraction (display borrow) 4. 15. Write a program for finding square of a number using look-up table and verify. Addition of two 8-bit numbers. Study of 8085 Microprocessor kit. b. 12. Write a program using 8086 for copying 12 bytes of data from source to destination and verify. 16. 3. 14. Write a program using 8086 and verify for: a. Write a program using 8086 for finding the square root of a given number and verify. . Write a program using 8086 for division of a defined double word (stored in a data segment) by another double Word division and verify. 7. Study of 8086 microprocessor kit 9. Write a program to interface a two digit number using seven-segment LEDs. 6. . Write a program using 8085 and verify for : a.EE-329-E L T P 0 0 2 MICROPROCESSORS AND INTERFACING LAB CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: 25 25 50 3 HRS LIST OF EXPERIMENTS: 1. 11. 5. Write a program using 8086 for arranging an array of numbers in descending order and verify. 8-bit subtraction (display borrow) b. Write a program using 8085 for multiplication of two 8. Finding the smallest number from an array. 8. Use 8085/8086 microprocessor and 8255 PPI. Write a program using 8085 and verify for : a. Write a program using 8085 for division of two 8.bit numbers by repeated addition method. Check for minimum number of additions and test for typical data. Write a program using 8085 for dividing two 8. 2.bit numbers by repeated subtraction method and test for typical data. Addition of two 8-bit numbers (with carry). 13.bit numbers by bit rotation method and verify. 10.bit numbers by bit rotation method and test for typical data. Write a program using 8086 for arranging an array of numbers in ascending order and verify. b. Write a program using 8085 for multiplication of two 8.

Write a program to control the operation of stepper motor using 8085/8086 microprocessor and 8255 PPI.17. . Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus of EE-309-C. NOTE: At least ten experiments have to be performed in the semester out of which seven experiments should be performed from above list.

Software Characteristics. Unit-3 : Requirements Analysis and specification requirements engineering. Rajib Mall. partitioning Software. Software quality assurance . Test case design. review guidelines. Design Heuristics for effective modularity.restructuring. Unit-2 : Software project management:Project management concepts. Software re-engineering . forward engineering. Pressman. Functional modeling and information flow: Data flow diagrams.architectures and applications. Design documentation. modularity. Statistical software quality assurance. staffing level estimation. the debugging process debugging approaches. stress testing. MGH. Integration testing. Software Engineering David Gustafson. Unit-7: Computer Aided software Engineering: CASE. project estimation Techniques. Effective modular design: Functional independence. Coupling. emergence of software engineering. software products. project scheduling and tracking. performance testing. Analyzing alternative Architectural Designs . System testing: Recovery testing. evolving role of software. Transaction flow. The data dictionary. integrated case environments and architecture. the control and process specification. principles. Unit-6 : Software Reliability and Quality Assurance :Quality concepts. formal technical reviews: The review meeting. Unit-4: System Design: Design concepts and principles: the design process: Design and software quality. information hiding. The ISO 9001 standard. Software Testing Strategies: Verification and validation. review reporting and record keeping. reverse engineering . defect amplification and removal. Text Book: Software Engineering A Practitioner s Approach. staffing. design principles.CSE-302 E L T 3 1 Principles of Software Engineering Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. PHI Software Engineering by Ian sommerville. Unit testing. software testing fundamentals: objectives.architectural complexity. Transform mapping: Refining the architectural design. structural partitioning. Behavioral Modeling. Validation testing. control flow model. software life cycle models. Design concepts: Abstraction. COCOMO. software process and P project metrics Project planning. refinement. 1996. software architecture. project size estimation metrics. Transform flow. The design model. testing for specialized environments . The art of debugging. system modeling and simulation Analysis principles modeling. Unit-1: Introduction: The process. white box testing. empirical estimation techniques. security testing. Mapping requirements into a software architecture. the software requirements specification and reviews Analysis Modeling: Data Modeling. software procedure. Software Configuration Management. SQA activities.. Other classical analysis methods. Cohesion.A Heuristic estimation techniques. Representation. risk analysis and management. AW. Prototyping methods and tools. Architectural Design: Software architecture. Specification principles. Software reviews: cost impact of software defects.H . Data Design: Data modeling. data flow model. software reliability: Measures of reliability and availability . Software crisis. Unit-5 : Testing and maintenance: Software Testing Techniques. Formal approaches to SQA. Roger S. T. 5th edition. Reference Books: Fundamentals of software Engineering. basis path testing: Control structure testing: Black box testing. The mechanics of structured analysis: Creating entity/ relationship diagram.The ISO 9000 Quality standards: The ISO approach to quality assurance systems. building blocks. Pearson Edu. team structures. repository. control hierarchy.M. Applications. databases and the data warehouse. data structures. data structure. 2002. alpha and beta testing. testability. prototyping: . 1999.

Students will be required to attempt five questions in all. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Ali Behforooz and Frederick J. . Hudson 1995 JW&S. An Integrated Approach to software engineering by Pankaj jalote .Software Engineering Fundamentals Oxford University. 1991 Narosa.

game playing. Text Book: Artificial Intelligence: A Modern Approach. Fuzzy reasoning. and current trends in intelligent systems. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. symbolic reasoning under uncertainty. Prentice Hall. semantic nets. review of probability. Russell & Norvig. discovery as learning. .. 1991. Artificial intelligence.. predicate logic. representing knowledge using rules. constraint propagation. genetic algorithms. Artificial Intelligence-A modern approach.Depth first. Ai problems and techniques AI programming languages. Patrick Henry Winston:. neural nets. 1992. TMH. Heuristic methods. partial order planning algorithm. blind search strategies. Baye s probabilistic interferences and Dempster shafer theory. Temporal reasoning. Elain Rich and Kevin Knight. Addition Wesley 3rd Ed. PHI. 1998. 1995. Unit-5: Principles of Natural language processing. representation for planning. rule based systems architecture. Statistical reasoning. explanation based learning.CSE-304 E L 3 T 1 P - Intelligent Systems Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Foundational issues in intelligent systems: Foundation and history of AI. Students will be required to attempt five questions in all. Expert systems.alpha beta pruning. Unit-3: Reasoning under uncertainty. Breadth first. introduction to LISP and PROLOGproblem spaces and searches. Reference Books: Artificial Intelligence.A * algorithm AO* algorithm.game tree. learning from examples. Unit-4: Planning.frames and inheritance. Staurt Russel and peter norvig. Min max algorithms.logic programming. Unit-2: Knowledge representation issues. rules based deduction systems.heuristic search techniques Hill climbing: best first. Non monotonic reasoning. planning in situational calculus. knowledge acquisition concepts. I earning by analogy. AI application to robotics.

Domain Name System. Internet Protocol. Students will be required to attempt five questions in all. Congestion Control. Text Book: Computer Networks (3rd edition). VLANs.IMAP. Unit 4: Wide Area Networks: Introduction of WANs. Channel Access Methods. Security management. NNTP. Larry L. Layers of TCP/IP. . 2nd Edition Computer Networking ED Tittel . Routers. Performance Management. WAN Technologies. International edition. Features of LANs. Switches. Computer Networks and Open Systems (4th edition). ICMP. Components of LANs. History of TCP/IP.IT-305 E L 3 T 1 P - Computer Networks Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. HTTP. Hybrid -. Proxy Servers. Protocols. Layer 2 & 3 switching. Aloha. Synchronous Digital Hierarchy (SDH)/ Synchronous Optical Network (SONET). Types of Networks : Local Area Networks. Services and Protocols of each layer Unit 2: TCP/IP: Introduction. Transmission Control Protocol . Ethernet. Internet Control Protocols.. IP address classes. Fast Ethernet and Gigabit Ethernet. Computer Networks A System Approach. IEEE 802 standards.. Gateways. IP Addressing. 2002. Unit-3: Local Area Networks: Introduction to LANs. Class of Service. Email SMTP. Application Layer. Private Networks. User Datagram Protocol. Layering architecture of networks. Unit-5: Introduction to Network Management: Remote Monitoring Techniques: Polling. Fitzgerald Jerry.H. Davie. Routing. 1996. CSMA/CD. Introduction to Network Operating Systems: Client-Server infrastructure. LAN interconnecting devices: Hubs. FTP.Wireless Links. Tree -. Internet. Star-. Addison Wesley. Peterson & Bruce S. Ring-. Frame Relay. Usage of LANs. Windows NT/2000. Low Price Edition. Unit-1: OSI Reference Model and Network Architecture: Introduction to Computer Networks. CSMA. T. Overview of IP version 6. Network Topologies: Bus-. Metropolitan Area Networks. Subnet Addressing. ARP. Wide Area Networks. Distributed Queue Dual Bus (DQDB).M. POP. Token Ring. Example networks ARPANET. 2000. Token Passing. Halsall Fred. Bridges. Quality of Service. Traps. OSI model.. Firewalls. LAN Standards. Complete -. Tanenbaum Andrew S. Irregular Topology. Business Data Communications. Reference Books: Data Communications. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Asynchronous Transfer Mode (ATM). RARP. Functions of each layer.

macro instructions. Format of Unix commands. 2003. The unix programming environment by Brain Kernighen & Rob Pike. Changing your password. Reference Book: . Characters with special meaning. Looking at the file contents. symbol table. User to user communication. Simple shell programs. Interpreters and program generators. Macros. Splitting files. standard output. overlays. Compilers. Shell variables. File systems and special files. Searching for patterns. absolute loader. Rearranging files. Shell programming constructs. standard error. some Unix directories and files. Backups and restoration. Sorting files. logging in. File structure: CPU scheduling. Maintaining user accounts. Introduction to UNIX and LINUX by John Muster. Overview of the linux. Printing files. single phase and two phase assembler. demand paging. general loader schemes. Operating on files. Unit-6: Test Manipulation: Inspecting files. Subroutine linkage. File statistics. Stopping background process. Loaders. 1984. filters and pipelines. Unit-2: Compiler: Brief overview of compilation process. Unit-5: Getting Started with Unix: User names and groups. macro instruction arguments. looking at the directory contents. Memory management: swapping. macro calls with macro instruction defining macros. Standard input. Wild cards. Unix documentation. Binders. Text editors. TMH. Unit-1: Evolution of Components Systems Programming. finding out about processes. Reallocating loader. Linkers. Comparing files. Role and functions of a system manager. software tools. conditional macro expansion. absolute and relative pathnames. Design of the Unix operating system by Maurich Bach. Booting the system. Linking loader. Direct linkage Loader. Debug Monitors. Standard files. TMH. directory structure. Unit-7: Shell Programming: Programming in the Borne and C-Shell. Assemblers. Loader schemes. 1986. Unit-4: Theoretical Concept of Unix Operating System: Basic features of operating system. Translating characters. Unix editor vi. basic operation on files. Processes. Current directory. interactive shell scripts. inodes. operating system Text Books: Systems Programming by Donovan. changing permission modes. file system: block and fragments. PHI. Assembler: Problem statement. Unit-3: Macro language and macro-processor. Incremental compiler.IT-303 E L 3 T 1 Systems Programming &System Administration P - Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. AWK utility. features of macro facility. Unit-8: System Administration: Definition of system administration. Files and directories. Advanced features. File permissions. Programming environment. PHI & Rob Pike. compile and go Loader.

Advanced Unix programmer s Guide by Stephen Prato. 2002. BPB Unix. Students will be required to attempt five questions in all. T. .M.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit..Concept and applications by Sumitabha Das.

systems. third generation wireless networks. Pearson NOTE: Eight questions are to be set -one question from each unit. space division multiple access. tracking and grade off service. paging systems. WIRELESS NETWORKING: Difference between wireless and fixed telephone networks. CDMA cellular Radio Networks.Y. . applications of intelligent micro-cell Systems. wireless local area networks. wireless data services. handoff Strategies. Students have to attempt any five question. MODERN WIRELESS COMMUNICATION SYSTEMS: Second generation cellular networks. Pearsons. Cordless telephone systems. basic Cellular Systems. FDMA. UNIT 5. comparison of various wireless systems. performance Criteria. ELLULAR SYSTEM DESIGN FUNDAMENTALS: Frequency Reuse. Wireless Communications: Theodore S. UNIT 4. UNIT 6.C. development of wireless networks. analog cellular systems. Spread Spectrum multiple Access.EE-402-E WIRELESS COMMUNICATION L T P : 3 1 0 50 CLASS WORK 100 150 : EXAM : TOTAL : DURATION OF EXAM 3 HRS UNIT 1. Mobile Cellular Telecommunication: W. UNIT 2. common channel signaling. MULTIPLE ACCESS TECHNIQUES FOR WIRELESS COMMUNICATION: Introduction to Multiple Access. Interference and system capacity. ISDN (Integrated Services digital Networks).Lee. TEXT BOOKS: 1. McGraw Hill REFERENCE BOOK: 1. traffic routing in wireless networks. UNIT 3. INTELLIGENT CELL CONCEPT AND APPLICATION: Intelligent cell concept. INTRODUCTION TO WIRELESS COMMUNICATION SYSTEMS: Evolution of mobile radio communications. advanced intelligent networks. INTRODUCTION TO CELLULAR MOBILE SYSTEMS: Spectrum Allocation. improving coverage and capacity. Mobile Communications: Jochen Schiller. TDMA. in-Building Communication. Blue tooth and Personal Area networks. channel assignment strategies. fixed network transmission hierarchy. 2. packet ratio. capacity of a cellular systems. UNIT 7. wireless in local loop. examples of wireless comm. Rappaport. Operation of cellular systems. digital Cellular Systems.

TMH (2002) 7. VHDL-IV Edition :Perry. classes and data types. Modern Digital Electronics. Overloading. Fundamentals of Digital Logic with VHDL Design : Brown and Vranesic. Introduction to Digital Systems : Ercegovac. 6. IEEE Standard VHDL Language Reference Manual (1993). CPLDs and FPGA. UNIT 3. structural layout and generics. PLAs. INTRODUCTION : Introduction to Computer-aided design tools for digital systems. implementation of a simple microcomputer system using VHDL UNIT 6. comparators. TMH (2000) 9. TMH (2003). DESIGN WITH CPLDs AND FPGAs : Progr ammable logic devices : ROM. PALs. 8. 4. PEEL. "VHDL-Analysis & Modelling of Digital Systems : Navabi Z. concurrent statements. Counters etc. 3. Design implementation using CPLDs and FPGAs REFERENCE BOOKS: 1. UNIT 2. decoders. case statement Array and loops. Packages and Libraries. UNIT 4. Prentice Hall 1995. Hardware description languages. VHDL STATEMENTS : Assignment statements. implementation of Boolean functions etc. resolution functions. code converters.P Jain. Operators. architecture of a simple microcomputer system.III Edition: R. John Wiley (1999). data objects. dataflow and structural models. McGraw Hill. encoders. sequential statements and process.Types of delays Entity and Architecture declaration. specifications. Structural Modelling. Introduction to behavioural.Roth . Digital System Design using VHDL : Charles. Digital Design and Modelling with VHDL and Synthesis : KC Chang. Lang & Moreno. IEEE Computer Society Press. Subprograms: Application of Functions and Procedures. "A VHDL Primmer : Bhasker. COMBINATIONAL CIRCUIT DESIGN: VHDL Models and Simulation of combinational circuits such as Multiplexers. Students will be required to attempt five questions in all. DESIGN OF MICROCOMPUTER : Basic components of a computer. H. GAL. introduction to VHDL. logical operators. 2.at least one question from each unit. 5. SEQUENTIAL CIRCUITS DESIGN : VHDL Models and Simulation of Sequential Circuits Shift Registers.EE-310-E L T P 3 1 0 DIGITAL SYSTEM DESIGN CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: 50 100 150 3 HRS UNIT 1. PWS (1998). conditional statements. . NOTE : Eight questions are to be set . UNIT 5. component declaration. Demultiplexers.

6. Solve traveling salesman problem. Solve any problem using best first search. Study of PROLOG. Note: At least 5 to 10 more exercises to be given by the teacher concerned. 2. 1. . Solve any problem using depth first search. 7. Write the following programs using PROLOG.CSE-306 E L T P 2 Intelligent System Lab. Write a program to solve 8 queens problem. Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs. 4. 3. Solve 8-puzzle problem using best first search Solve Robot (traversal) problem using means End Analysis. 5.

Administration of WINDOWS 2000 (including DNS.CSE-308 E Operating Systems Lab. Note: At least 5 to 10 more exercises to be given by the teacher concerned. L - T - P 2 Class Work: 25 Exam: 25 Total: 50 Duration of Exam: 3 Hrs.LDAP. . Writing of Shell Scripts (Shell programming). basic commands pipe & filter commands). shell. AWK programming. Directory Services) Study of LINUX Operating System (Linux kernel. Administration of LINUX Operating System. Study of WINDOWS 2000 Operating System.

check the wave forms and the hardware generated a. full adder 3. shift register 10. register b. Write VHDL programs for the following circuits. check the wave forms and the hardware generated a. check the wave forms and the hardware generated a. Write VHDL programs for the following circuits. half adder b. Write a VHDL program for a FLIP-FLOP and check the wave forms and the hardware generated 8.EE-330-E L T P 0 0 2 DIGITAL SYSTEM DESIGN LAB CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: 25 25 50 3 HRS LIST OF EXPERIMENTS: 1. Write a VHDL program for a comparator and check the wave forms and the hardware generated 6 Write a VHDL program for a code converter and check the wave forms and the hardware generated 7. Design all gates using VHDL. decoder b. check the wave forms and the hardware generated a. 2. encoder 5. Write a VHDL program for a counter and check the wave forms and the hardware generated 9. multiplexer b. Write VHDL programs for the following circuits. . Implement any three (given above) on FPGA/CPLD kit NOTE : Ten experiments are to be performed out of which at least seven experiments should be performed from above list. Write VHDL programs for the following circuits. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus. demultiplexer 4.

interpretation and microprogramming. write policies.Semester-7 CSE-401 E L 3 T 1 P - Advanced Computer Architecture Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Design summary. TMH. Split I and D-Caches. write assembly Cache. open. on chip caches. review and selection of queueing models. processors with cache. Instruction sets. Professor Evaluation Matrix Unit-3: Cache Memory Notion: Basic Notion. Text Book: Advance computer architecture by Hwang & Briggs. technology dependent Cache considerations. processor memory modeling using queuing theory. Basic Instruction Timing. Cache Organization. Unit 2: Time. Type of shared Memory multiprocessors. Students will be required to attempt five questions in all. strategies for line replacement at miss time. Shared Memory Multiprocessors: Basic issues. Virtual to real mapping. Cache Environment. partitioning. Two level Caches. waiting time. closed and mixed-queue models. Addressing and Memory. studies. adjusting the data for cache organization. Vector Memory. Narosa. Unit 4: Memory System Design: The physical memory. The Economics of a processor project: A study. virtual to real translation. performance. Fiynn 1995. other types of Cache. 1993. models of simple processor memory interaction. Basic data types. technology state of the Art. Reference Books: Pipelined and Parallel processor design by Michael J. Cache Data. Multiple Issue Machines. Instructions. Area And Instruction Sets: Time. Unit 1: Architecture And Machines: Some definition and terms. Comparing vector and Multiple Issue processors. Memory Coherence in shared Memory Multiprocessors. and buffer size. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Unit 5: Concurrent Processors: Vector Processors. overlapping the Tcycle in V-R Translation. synchronization and coherency. cost-area. Cache references per instruction. The instruction set. .

risk evaluation. acceptance. identifying project scope and objectives. techniques to help enhance software quality. the importance of software quality. SP Vs. change control. adding the time dimension. visualizing progress. product versus process quality management. reducing the risks. placement. the nature of risk. information and control in organization. review/ publicize plan. risk identification. Selection of an appropriate project report. water fall-. estimate efforts each activity. typical terms of a contract. sequencing and scheduling activities. Prototyping. Unit-3: Project Evaluation & Estimation: Cost benefit analysis. shortening project . representation of lagged activities. prioritizing monitoring. TMH. the place of software quality in project planning.models. selecting the right person for the job. external standards. getting the project back to target. 2001. rapid application development. Unit-7: Software quality: Introduction. analyzing project characteristics. creating the frame work. 2001. categorizing SPs. organizational structures. Ramesh. identifying activity risk. TMH Reference Books: Software Engineering A Practitioner s approach. network planning model. understanding behavior. 1999. selecting a project. earned value. contract management. further exercises. Albrecht function point analysis. publishing the resource schedule. identifying project infrastructure. calculating the z values. ISO 9126. Maylor Managing Global software Projects. activity throat. conclusion. evaluating risks to the schedule. by Bob Hughes and Mike Cotterell. precedence networks. stages in contract. cash flow forecasting. collecting the data. V-process-. Unit-1: Introduction to Software Project Management (SPM): Definition of a Software Project (SP). cost monitoring. being specific. becoming a team. Monitoring the control: Introduction. requirement specification. other types of projects activities covered by SPM. Unit-6: Managing contracts and people: Introduction. project as a system. counting the cost. Choosing technologies. cost schedules. Roger S. the scheduling sequence. delivery.. decision making. cost benefit evaluation techniques. Pressman (5th edi). instruction in the best methods. . structured methods. identifying critical path. scheduling resources creating critical paths.CSE-403 E L T 3 1 Software Project Management P Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Risk Management: Introduction. leadership. 1998. projects and activities. motivation. allocate resources. Unit-5: Resource allocation &Monitoring the control: Introduction. Walker Royce. working in groups. Unit-2: Stepwise Project planning: Introduction. identifying project products and activities. identifying resource requirements. managing risk. spiral. backward and forward pass. defining software quality. project schedule. Addison Wesley. Practical software quality measures. risk analysis. Project Management 2/c. MGH Software Project Management. choice of process model. types of contract. organizational behavior: a back ground. Managing people and organizing terms: Introduction.. the nature of resources. Unit-4: Activity planning & Risk Management: Objectives of activity planning. Unit-8: Study of Any Software Project Management software: viz Project 2000 or equivalent Text Book: Software Project Management (2nd Edition). management control.

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

linked lists. Principles of compiler Design. structure of compiler :its different phases. LALR and Canonical LR parser. Unit 1: Introduction To Compilers: Compilers and translators. System software by Dhamdae. Unit 2: Lexical Analysis: Role of lexical analyzer. Specification and recognition of tokens. operator precedence parsing. Errors. construction of syntax trees. input buffering. and vice versa. Laxmi Publ. Ullman. Unit 4: Parsing Technique: Shift. minimizing number of states of DFA. Unit 7: Symbol Table & Error Detection And Recovery: Symbol tables. Unit 6: Syntax Directed Translations: Syntax directed definition.CSE-405 E L 3 T 1 P - Compiler Design Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Graw Hill. top down par sing. Ravi Sethi & J. syntax directed translation scheme. conversion from regular expression to finite automata. A language specifying lexical analyzer. optimization. Kakde. three address code. implementation of syntax directed translation. semantic error. 1985. lexical phase error. Techniques & Tools . quadruples and triples. Finite automata.Alfread V. register allocation for temporary and user defined variables. Text Books: Compilers Principle. . need of translators. syntactic phase error.G. Unit 5: LR parsers.reduce parsing. Implementation of lexical analyzer. 1986. arrays. its contents and data structure for symbol tables. Narosa Publication Note: Eight questions will be set in all by the examiners taking at least one question from each unit. 1995. Unit 3: Syntax Analysis: Role of parsers. Compiler construction tools. forms of objects code. Tremblay & Sorenson. trees. context free grammars. predictive parsing. Mc. MGH. Reference Books: Theory and practice of compiler writing. AHO. design of lexical analyzer. machine dependent code.D. regular expressions . SLR. Compiler Design by O. Students will be required to attempt five questions in all. hash tables.1998Addison Wesley. definition of parsing. . Unit 8: Code Optimization & Code Generation: Code generation.

Write a program to check whether a grammar is left Recursion and remove left Recursion. 12. 7. 10. 3. 1. 6. To show all the operations of a stack. Write a program to check whether a grammar is operator precedent. To show various operations i. Write a program to compute FIRST of non-terminal. 5.CSE-407 E COMPILER DESIGN LAB L - T - P 3 Class Work: 50 Exam: 50 Total: 100 Duration of Exam: 3 Hrs. Practice of LEX/YACC of compiler writing. Write a program to find leading terminals. Note : At least 10 programs are required to be developed in the semester. Write a program to remove left factoring. 4. 8. . Write a program to compute FOLLOW of non-terminal. 11. Write a program to find trailing terminals. write and modify in a text file.e. 2. red. Write a program to generate a parse tree. Write a program to check whether a string belong to the grammar or not. 9.

11) Write a simple program that displays an appropriate message when the illegal operation is performed using error handling technique in VB. Class Work: 50 Exam: 50 Total: 100 Duration of Exam: 3 Hrs.0. 1) Study Windows API s. 3) Create an SDI application in VC++ that adds a popup menu to your application which uses File drop down menu attached with the menu bar as the pop-up menu.NET and Visual C++ 6.0. 4) Create an SDI application in VC++ using which the user can draw atmost 20 rectangles in the client area. 13) Create a DLL in VB. 7) Write a program in VC++ to create archive class object from CFile class that reads and stores a simple structure (record). If the user tries to draw more than 20 rectangles.CSE-409 E L T P 3 Visual Programming Lab. create an object of excel application and implement any action on it. 6) Write a program in VC++ to implement serialization of inbuilt and user defined objects. With the help of VB. . Study of Visual Basic 6. All the rectangles that are drawn should remain visible on the screen even if the window is refreshed. Make an Active X control of your own using VB. The pop-up menu should be displayed on the right click of the mouse. 12) Write a program in VB to create a notepad.NET. a message should get displayed in the client area that No more rectangles can be drawn 5) Create an application in VC++ that shows how menu items can be grayed. 2) Get familiar with essential classes in a typical (Document. Write a program in VC++ to create a static link library and a dynamic link library. Create a simple database in MS Access Database and a simple database application in VC++ that shows database connectivity through ADO model. disabled and appended at run time.view architecture) VC++ Program and their relationship with each other. 8) Make an Active X control in VC++ derived from a standard control. Bright students may do the following exercises: 14) 15) 16) 17) 18) Write a program in VC++ to implement a simple calculator. Rectangle should be drawn on the second click of the left mouse button out of the two consecutive clicks. 10) Create a simple database in MS Access Database /Oracle and a simple database application in VB that shows database connectivity through DAO and ADO. Find out their relationship with MFC classes. Appreciate how they are helpful in finding complexities of windows programming. 9) Write a program in VB to implement a simple calculator.

Semester-8 CSE-402 E L 3 T 1 P Distributed Operating System Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs.

Unit-1: Introduction: Introduction to Distributed System, Goals of Distributed system, Hardware and Software concepts, Design issues. Communication in distributed system: Layered protocols, ATM networks, Client Server model ,Remote Procedure Calls and Group Communication. Middleware and Distributed Operating Systems. Unit-2: Synchronization in Distributed System: Clock synchronization, Mutual Exclusion, Election algorithm, the Bully algorithm, a Ring algorithm, Atomic Transactions, Deadlock in Distributed Systems, Distributed Deadlock Prevention, Distributed Deadlock Detection . Unit-3: Processes and Processors in distributed systems: Threads, System models, Processors Allocation, Scheduling in Distributed System, Real Time Distributed Systems. Unit-4: Distributed file systems: Distributed file system Design, Distributed file system Implementation, Trends in Distributed file systems. Distributed Shared Memory: What is shared memory, Consistency models, Page based distributed shared memory, shared variables distributed shared memory. Unit-5: Case study MACH: Introduction to MACH, process management in MACH, communication in MACH, UNIX emulation in MACH. Text Book: Distributed Operating System Andrew S. Tanenbaum, PHI.

Note:

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

IT L 3

402 E T 1 P -

Security of Information Systems

Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Basic Encryption and Decryption: Terminology and Background: Encryption, Decryption and Cryptosystems, Plain Text and Cipher Text, Encryption Algorithms, Cryptanalysis. Introduction to Ciphers: Monoalphabetic Substitutions such as the Caesar Cipher, Cryptanalysis of Monoalphabetic Ciphers, Polyalphabetic Ciphers such as Vigenere Tableaux, Cryptanalysis of Polyalphabetic Ciphers, Perfect Substitution Cipher such as the Vernam Cipher, Stream and Block Ciphers, Characteristics of Good Ciphers: Shannon Characteristics, Confusion and Diffusion, Information Theoretic Tests, Unicity Distance, Unit-2: Secure Encryption Systems: Hard Problems: Complexity: NP-Complete Problems, Characteristics of NP-Complete Problems, The Meaning of NP-Completeness, NP-Completeness and Cryptography. Properties of Arithmetic Operations: Inverses, Primes, Greatest Common Divisor, Euclidean Algorithm, Modular Arithmetic, Properties of Modular Arithmetic, Computing the inverse, Fermat's Theorem, Algorithm for Computing Inverses, Random number generation Public Key (Asymmetric key) Encryption Systems: Concept and Characteristics of Public key Encryption System, Introduction to Merkle-Hellman Knapsacks , Rivest-Shamir-Adelman (RSA) Encryption in Detail, Introduction to Digital Signature Algorithms , The Digital Signature Standard (DSA). Hash Algorithms: Hash Concept , Description of Hash Algorithms , Message Digest Algorithms such as MD4 and MD5 , Secure Hash Algorithms such as SHA1 and SHA2. Secure Secret Key (Symmetric ) Systems: The Data Encryption Standard (DES),Analyzing and Strengthening of DES, Key Escrow and Clipper, Introduction to Advance Encryption Standard (AES) Unit 3: Applied Cryptography, Protocols and Practice: Key Management Protocols:Solving Key Distribution Problem, Diffie-Hellman Algorithm, Key Exchange with Public Key Cryptography. Public Key Infrastructure (PKI): Concept of Digital Certificate, Certificate Authorities and it's roles, X509 Structure of Digital Certificate, Types of Public Key Infrastructures. Legal Issues: Copyrights, Patents, Trade Secrets, Computer Crime, Cryptography and the Law. Unit 4: Operating System, Database and Program Security: Operating Systems Security:Security Policies, Models of Security, Security Features of Ordinary Operating System, Security Features of Trusted Operating System. Database Security: Security Requirements of Databases, Reliability and Integrity, Protection of Sensitive Data, Inference Problem: Direct and Indirect Attacks Program Security: Kinds of Malicious Code, How Viruses Attach and Gain Control, Homes for Viruses, Virus Signatures, Preventing Virus Infection, Trapdoors, Convert Channels, Control Against Program Threats, Java mobile codes. Unit-5: Network Security: Network Security Issues such as Impersonation, Message Confidentiality, Message Integrity, Code Integrity, Denial of Service, Secure Communication Mechanisms such as IPSec, PKI based Authentication and Kerberos Authentication, Biometrics Authentication Mechanisms, Access Control Mechanisms, Firewalls Web Security: Solving Privacy Problems, Solving Authentication Problems, Secure Socket Layer (SSL) Protocol, Secure Electronic Transaction (SET) Protocol , Safe Guarding Web Servers. Secure Electronic Mail: Privacy Enhanced Email (PEM), Pretty Good Privacy (PGP), Public Key Cryptography Standards-PKCS#7, Secure/Multipurpose Internet Mail Extensions (S/MIME) Text Books:

"Security in Computing (Second Edition)", Charles P. Pfleeger, 1996, Prentic-Hall International, Inc., "Applied Cryptography Protocols, Algorithms, and Source Code in C (Second edition)", Bruce Schneier, 1995, John Reference Books: "Security Technologies for the World Wide Web", Rolf Oppliger, Artech House, Inc. "Digital Certificates Applied Internet Security", Jalal Feghhi, Jalli Feghhi and Peter Williams, Addison Wesley Longman, "The World Wide Web Security FAQ", Lincoln D. Stein, World Wide Web Consortium, [Online] Available at http://www.w3.org/Security/Faq/www-security-faq.html Cryptographic Message Syntax Standard, Public-Key Cryptography Standards, RSA Laboratories, [Online] Available at http://www.rsasecurity.com/rsalabs/pkcs/pkcs7/index.html Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all.

Class Work: 50 Exam: 50 Total: 100 Duration of exam: 3 hrs.IT 407 L T P 3 Advanced JAVA Lab. Development of programs relating to : JDBC Servlets Beans RMI JSP .

FDDE Vs SMDS Unit-4: Network Design for Access: Campus network design. circuit switching. D L Spolin. Mc-Graw Hill. . 1993.25 remote access network design.25 reporting Ethernet traffic. networking hardware. performance issues of packet networks. Network Design & Case Studies CISCO Systems Inc. B-ISDN. X. Unit-1: Review of OSI layers. leased line and radio modems. Microsoft & HP. CISCO routers & Nortel switches. Data. 1981 Note: Eight questions will be set in all by the examiners taking at least one question from each unit. DDR & ISDN Access Network design. Fax. managing bridges & routers. packet switching X. protocols & interface comparisons. network & transport layers. TCP. traffic pattern calculations. Soft & hard design examples for IP Technology networks. Mc-Graw Hill Inc. IP Networks for Voice. EIGRP.25. architecture & topology areas of internetworks. common protocols & interfaces in physical. circuit types & services.ELECTIVES-I CSE-417 E L 4 T P Data Network Design Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. availability and reliability Unit-3: Comparisons: circuits Vs. 1993 Designing Data Networks by PHI. Text Book: Data Network Design. B-ISDN. Unit-5: Network Design for Backbone: Identification & selection of internetworking devices. data. SMDs ATM. . delay. multiplexing. Framerelay interfaces & traffic shaping VSAT & Wlan network design. performance analysis. Video. NMS Tools. Introduction to storage area networks and network attached storage. frame relax. Scaling access networks OS: protocols. topologies. Unit-2: Switching technologies. ICMP. Reference Books: SNMP Feit 1995. packets vs frame vs cell Technologies & services. X. CISCO Press. network design for digital video broadcast Unit-6: Data Network Management Systems: Managing IP. SMDs Vs. switching comparisons. Students will be required to attempt five questions in all. UDP. Case Studies: selected from design. traffic matrix.Network Design for convergence: UDP broadcasts.

learning rules. 1998. training & classification using discrete perceptron. Hopfield networks. Simon Haykin. 1992. Training & Examples. recall mode. delta learning rule. 2002. perception learning rule. Liang. Unit-7: Self organizing networks: UN supervised learning of clusters. T. Error backpropagation training. House. etc. By directional associative memory. Unit-4: Multi-layer Feed forward Networks: linearly non-seperable pattern classification. Kosko. Delta learning rule for multi-perceptron layer. Basic Concepts of recurrent Auto associative memory: rentrieval algorithm. AW Neural Networks . Unit-5: Single layer feed back Networks: Basic Concepts. Features & Decision regions. Unit-3: Single layer Perception Classifier: Classification model. Bose . Hebbian learning rule. Widrow-Hoff learning rule. . Architecture. Generalized delta learning rule.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Winner lake all elarning rule. single layer continuous perceptron networks for linearlyseperable classifications. Neural Network Fundamentals N. 1994. Zurada. algorithm. winner-take-all learning. Unit-1: Overview of biological neurons: Structure of biological neurons relevant to ANNs. seperability limitations Text Books: Introduction to artificial Neural systems by Jacek M. Unit-2: Fundamental concepts of Artificial Neural Networks: Models of ANNs. P. Jaico Publ. Examples. storage algorithm.M. learning factors.CSE-419 E L 4 T P - Neural Networks Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-6: Associative memories: Linear Association. Stability. PHI. Initialisation of weights. correction learning rule. Students will be required to attempt five questions in all. Reference Books: Neural Networks :A Comprehensive formulation . Association encoding & decoding.K. Feedforward & feedback networks.

IT-465 E L 4 T P - Network Technology Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. VB script and other internet development tools. ) Network Security and Management. devices. TCP/IP. Veronica. 2003. Unit-3: Application Layer Services and protocols (RPC. FTP. PERL. Mosaic. PHI. WAIS. E mail talent. FTP. Transmitter and receiver of IBASE5 (Starian). PHI. Usenet. Transport Layer issues. ISDN: Technology. Reference Books: Data communication & Networking by Furouzan. Unit-1: Overview of Internet: Address and domain Management. TELENET). SMTP. Archie. HTML. Connecting LANs and WANS. FTP. Monitoring of 8251A. Control logic of USART. Gateway. ATM. NFC. CGI. SLIP/PPP Dedicated lines. WWW undergoing technology. USART-Processor Interface Data Buffer Block of 8251A. internet networking TCP/IP protocols . TMH. 2000. Internet searching tools. writing characters to be transmitted to 8251A. Lynx. VRML. JAVA. 1995. Unit-2: Security issues. Serial Communication. Unit-4: Serial Communication Circuits. Read status. Node. Twisted pair Ethernet. Data and Network communications by Miller (Delmer) Communication Networks: Fundamentals Concepts & Key Architectures by Alberto Leon. gopher. SYNDET/BRKDET ion 8251A. Synchronous Modems and Asynchronous Modems. TMH Note: Eight questions will be set in all by the examiners taking at least one question from each unit. LAN Manager. Principles of IBASE5 (Strain). Computer Networks by Black. Monitoring of 8251A. Transmitter. Receiver. PROTOCOLS. Architecture Protocols. Dial-up. . Review of LAN. Modems. 10BASE5 Ethernet and 10BASE2 (Cheaper net). Students will be required to attempt five questions in all. Flow Control Error detection and Correction. SNMP. Technology. Inter Networking SDH/SONET. Text Book: Computer Networks by Tanenbaum. WWW. Software of IBASE5 Node.

Sudarshan. Fragmentation and Distribution. 1997. Transaction and System Concepts. Silbershatz. Heuristics in Query Execution. Distributed database design. Korth and S. Prolog/Datalog Notation. McGraw-Hill. Database Backup. GOOD. Elmasri R. Heterogeneous and Federated Database Systems. Cost Estimation in Query Execution. 3rd edition. Recovery Techniques. Unit-1: Data Models: EER model and relationship to the OO model. Unit-2: Client Server Computing: Client Server Concepts. 2-Tier and 3-Tier Client Server Systems. Object Oriented data model and ODMG standard. Students will be required to attempt five questions in all. View Integration. Application Development in Client Server Systems. and Navathe S. Serializability of Schedules.F. Client /Database Server Models. Note: Eight questions will be set in all by the examiners taking at least two questions from each unit.B. Semantic Query Optimisation. International Edition. Transaction Support in SQL. Other data models . Temporal database. H. Schedules and Recoverability. Desirable Properties of a Transaction. Digital libraries. Distributed algorithms for data management..CSE-421 E Advanced Database Management Systems L 4 T - P - Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Text Book: Fundamentals of Database Systems (3 edition). Mobile database. Granularity of Data Items. Distributed Databases: Reliability and Commit protocols. ORM. Multimedia database. Client/Server Architecture and the Internet. Basic inference Mechanism for Logic Programs. Deductive Database Systems. Technology Components of Client Server Systems. Unit-3: Deductive Databases: Recursive Queries.NIAM. Concurrency Control Techniques. Low Priced Edition. Reference Book: Database System Concepts by A. 2000. Locking techniques for Concurrency Control. Database Transactions and Recovery Procedures: Transaction Processing Concepts. . Concurrency control. Commercial and Research Prototypes: Parallel database. Deductive Object Oriented Database Systems. Query Optimisation: Query Execution Algorithms. Addison Wesley.

object responsibilities. use-case model. inheritance. object oriented systems development life cycle. Rumbaugh et. Suresh K. view layer interface design. UML object constraint language. designing classes: The process. identifying object relationships. PHI. design axioms. object relationships and associations. super sub class relationships. MGH. Ivar Jacobson. Galgotia Publ. Booch Methodology. polymorphism. Unit-4: Object oriented design process. unified modeling language (UML). corollaries.CSE-423 E Object Oriented Software Engineering L 4 T - P - Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. the unified approach.al. Ali Bahrami. Jacobson Methodology. designing interface objects. Reference Books: Object Oriented systems development.part of relationships aggregation. object oriented design philosophy. object classification. packages and managing classes. Macro and Micro level interface design process Text Book: Object Oriented software Engineering. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. meta classes.1997. 1999. Object Oriented Modeling and Design. 1995. use case driven object oriented analysis. 1995. Rumbaugh methodology. Patterns. responsibilities and collaborators. Unit-1: Review of object oriented systems: Design objects. aggregations and object containment. refining attributes. A. Addison Wesley. design patterns. different approaches for identifying classes. Basandra. Frameworks. classes. Software development process object oriented systems development: a use case driven approach. Grady Booch. designing methods ad protocols. Addison Wesley Object Oriented Software Engineering by Subhash Mehta. class responsibilities. theory. Students will be required to attempt five questions in all. Object Oriented analysis and Design. class visibility. attributes and methods. object persistence. class hierarchy. Unit-3: Object Oriented Analysis: Analysis process.. Unit-2: Methodology for object oriented design: Object modeling technique as software engineering methodology. .

TMH NOTE: Eight questions are to be set . Students have to attempt five questions. Digital Signal Processing: Alon V. finite impulse Response (FIR) system. Applications of DSP.TMH REFERENCE BOOKS: 1. changing the sampling rate using discrete time processing. PHI 2. properties of the Z-transform. MULTIRATE DIGITAL SIGNAL PROCESSING: Introduction to multirate digital signal processing. design techniques of digital filters : window technique for FIR. BASICS OF DIGITAL FILTERS : Fundamentals of digital filtering. properties of the region of convergence.EE-407-E L T P 3 1 0 DIGITAL SIGNAL PROCESSING CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: 50 100 150 3 HRS UNIT1. Z-TRANSFORM : Introduction. frequency domain representation. digital filter banks. time invariant system.PHI 2. infinite impulse response (IIR) system. discrete time processing of continuous time signals. energy and power theorems. DISCRETE-TIME SIGNALS: Signal classifications. Vallavaraj and Gnanapriya. TEXT BOOKS : 1. bi-linear transformation and backward difference methods for IIR filter design. sampling rate conversion. representation of sequences by Fourier transform. Digital Signal Processing: Salivahanan. properties of Fourier transform. multistage decimator and interpolators. SAMPLING OF TIME SIGNALS: Sampling theorem. time domain representation. UNIT6. DISCRETE-TIME SYSTEMS : Classification. application. Digital Signal processing(II-Edition): Mitra. filter structures. . various types of digital filters. DSP algorithm implementation consideration. UNIT5. UNIT3. reconstruction of band limited signal from its samples. UNIT4. Digital Signal Processing : Proakis and Manolakis. analysis of finite word length effects in DSP.at least one from each unit. applications of Z-transform. Oppenhelm. UNIT2. discrete time random signals. inversion of the Z-transform. properties. frequency domain representation of sampling.

one word substitutes.agreement between verb and subject. this course is proposed to make them technically proficient in handling the language skills required in competitive exams.HUM-451-E LANGUAGE SKILLS FOR ENGINEERS SEMESTER VII (ELECTIVE) Class Work : 50 Marks Exam : 80 Marks Practical/Presentation : 20 Total : 150 Marks Duration of Exam : 3 Hrs L T P 4 .Redman. mood. avoidance of choppy and rambling sentences.etymological roots. UNIT II Vocabulary: Methods of building vocabulary . through various entrance tests and interviews. UNIT IV Comprehension: Abstracting. Gerunds. COURSE CONTENT: UNIT I Remedial English: Parts of speech. Delhi. Foundation Books (Cambridge university Press).consistency of number and person.Gairns and S. sequence of tenses. Verbal ability forms a major portion of these tests. Degrees. Illustration and Inductive Logic. 2. Without sound language skills and its semantic-syntactic know-how. prefixes and suffixes. GMAT etc. Observations. conciseness. pronoun and antecedents. spelling. Word Punctuation. this cutting edge competence becomes imperative. Summarising. Deduction and Analogy. problems involving modifiers (dangling and misplaced modifiers). The course would expose students to almost all variety of items. tense. With this difficulty of students in mind. sequencing of ideas). logic and consistency. discussion on topics of contemporary relevance. And in the context of LPG. participles and infinitives. the students with engineering background find themselves almost under. Findings and Conclusions. words often confused. Commonly used foreign words and phrases. Cambridge University Press. SUGGESTED READING: 1. UNIT III Punctuation and Mechanics: End Punctuation. synonyms and homonyms. Shifts in point of view .prepared for such tests.- The real challenge before the students starts when they cross the threshold of the college after completing their degree. They. London. Internal Punctuation. interviews.Extempore. Sentenceconstructions (unity. . Doff/jones. Omissions and mixed constructions. Clauses. find themselves competing for job/ P. Working with Words by R. Sentence errors . verbal idioms.G. Parallelism. Meanings into Words Upper Intermediate Students Book. the common run of such tests as CAT. UNIT V Presentation: Oral presentation . voice and subject. all of a sudden. and no professional education can afford to overlook this aspect.

Orient Longman..J. III: (30. (B) PRACTICAL (Presentation): There will be an oral test carrying 20 marks. Advanced English Practice by B. Longman.Structural Essentials of English by H. A Practical Guide to Colloquial Idiom by W.. New Delhi.A. Hill. OUP. 4. Unit-IV: 20 Marks The question from this unit will test comprehension competence (in the form of various elements mentioned in the unit) of the text given. choose the right alternative. Thomson and A. A guide to Correct English by L. These 110(60+40+10) questions will cover all the first three units (I.e. Hence. The questions may be in the form of multiple choices. Ltd.. Delhi.20 and 10 marks respectively. Unit-I. supply the right word/choice. II. III) of the syllabus and would carry 30. Three hours for a group of 15 students are required for this test.20. 7. New Delhi. Whitehall.Group Discussion. Sudha Publication Pvt. Ball.Public Speaking.. . Longman.D.3. II. II. Delhi. 5. Graver. 10. there is no need to include this unit in theory exam. Examine your English by Margaret M. Maison.e. Ltd. Oxford. A Practical English Grammar by A. do as directed etc.10 Marks respectively) The first section of the question paper will have 110 objective type questions with no choice at all. Martinet. as far as the units I. fill-in-the-blank.J. The presentation part of the section i. OUP. 6.V. SCHEME OF EXAMINATION: (A) THEORETICAL: The pattern of the exam would be more or less like the pattern of the competitive exams. New Delhi. Test can be in the form of any of the activities mentioned in the Unit-V. Sudha Publication Pvt. OBJECTIVE TYPE) like CAT G-MAT etc. (i. 9. 8. Unit-V will be covered in this test. III and IV are concerned. A panel of examiners appointed by the University will evaluate the presentation.

Rooted and binary trees. Fundamental circuit matrix. Recurrence Generating functions. Kuratowski's two graphs. cut-set matrix and relationship between all three above. Note : Examiner will set eight questions. decision trees. IT) Class Work : 50 Marks Exam. Unit-VIII : Directed graphs and their types. connected graphs. Travelling salesman problem. P. isomorphism. Unit-III : Trees. operations on graphs. subgraphs. Books Recommended : 1. taking one from each unit. Spanning trees in a weighted graph.: 3 Hours L T P 4 . chromatic number. properties of trees.. Disconnected graphs and component Euler's graph. 1isomorphism and 2-isomerphism. walks. vector space of graph. connectivity and separability. : 100 Marks Total : 150 Marks Duration of exam.I. incidence and degree. Directed paths and connectedness. different representation of a planer graph. Addison-Wesley. Unit-IV : Cut-sets. Unit-VII : Colouring. Binary relation. chromatic polynomials.- Unit-I : Permutations and combinations.H. Five color theorem. Fundamental circuits and cut-sets. Unit-V : Planer graphs. Pendant vertices in tree. relations. Unit-VI : Matrix representation of graphs. Hamiltonian paths and circuits. four color problem. Detection of planarity. Euler's digraph. Fundamental circuits. . 2. Graph Theory by Narsingh Deo.MATH-451-E COMBINATORICS AND GRAPH THEORY (ELECTIVE FOR CSE. Students will be required to attempt any five questions. Spanning trees. paths and circuits. Network flows. incidence matrix. Graph Theory by Harry P. Unit-II : Graphs. submatrix of incidence matrix. properties of cut-sets.

Managerial. Finance. UNIT-IV : Financing of Small Industries Importance and need : Commercial Banks and term lending in India. Industrial Finance Corporation of India. definition and functions of an entrepreneur. Technical. New Delhi) 2. Pricing Methods. Banks and under-writing of capital issues. Environment and Entrepreneur Tandon B.C. Power. Process of preparing project reports. Cultural factors in developing entrepreneurship. Rehabilitation of Sick Mills. Marketing Uncertainties and risk. UNIT-I : Promotion of Entrepreneurship Meaning. Brief description about the role of other financial agencies viz. Causes of under utilization. Raw Material. UNIT-V : Problems Faced by Small Enterprises Problems connected with Marketing. 6. State Financial Corporation. Government measures for the promotion of small scale industries with special reference to Haryana. UNIT-II : Ownership and Location of Industrial Units Different forms of Industrial Organisation. Management of New Products. Recommended Books : 1. Banker & Small Scale Industries Bhattacharya Hrisnikes. Emerging Trends in Entrepreneurship Development Theories & Practices Singh P. Entrepreneurship of Small Scale Industries Deshpande Manohar D. UNIT-III : Size of Firm and Pricing Concept of optimum firm. NOTE: Eight questions are to be set atleast one question from each unit and the students . New Delhi) 5. factors determining Optimum size. New Delhi). Policies and procedures. Role of Entrepreneur in economic development. Unit Trust of India. Industrial Development Bank of India. Under-utilization of capacity. (Chaitanya.HUM-455-E L 3 T 1 P - ENTREPRENEURSHIP VIITH SEMESTER (ELECTIVE) Class Work Theory Total Duration of Exam.Narendra (International Founder. Theories of Industrial location. Entrepreneurship & Growth of Enterprise in Industrial Estates Rao Gangadhara N. (Asian Publishers. International Marketing with special reference to export documentation. The Industrial Economy of India Kuchhal S. : : : : 50 Marks 100 Marks 150 Marks 3 Hrs. Allahabad). (Asian Publishers. qualities of a good entrepreneur. Entrepreneur. 4.C. 3. UNIT-VI : Government and Business (a) (b) Highlights of Industrial Policy and Licensing Policy.

will have to attempt five questions in all. .

Mc Graw Hill. Data cubes.C. W. C. data warehouse manager.H Ionhman. Sam Anahory & Dennis Murray. complex aggregation at multiple granularities. tools and applications. . types of OLAP. Unit-3: Data warehouse implementation. Clustering techniques.H. data specification. Arun Pujar. Morgan Kaufmann. Alex Berson. Pearson Data Mining. Jiawei Han & Micheline Kamber. W.Concepts & Techniques. Text Books: Data Warehousing In the Real World. usage and trends. Reference Books: Data Mining.L. Note: Eight questions will be set in all by the examiners taking at least one question from each unit.2001. Mc Graw Hill. Data warehousing System. servers.H. KDD versus data mining. Unit-7: Mining complex data objects. Unit-4: Data mining definition & task. University Press. OLAP queries manager. data mining techniques. Managing the Data Warehouses.Gassey. pattern presentation & visualisation specification.Inman. ROLAP vs MOLAP. Hyderbad. Rough Sets.Klelly. Spatial databases. Data Warehousing. 3-Tier data warehouse architecture. Unit-2: Data warehouse process & architecture. data mining languages and standardisation of data mining. computation of data cubes. OLTP vs OLAP. data warehouse back end tools. Metadata. 1997. hierarchy specification. . 1997. Inman. Unit-5: Data mining query languages. Pearson. Pieter Adriaans & Dolf Zantinge. Data Mining Techniques. specifying knowledge. Multidimensional data mode. John Wiley & Sons.ELECTIVES-2 IT-451 E Data Warehousing And Data Mining L 3 T 1 P - Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. John Wiley & Sons. W. Data Miniing and OLTP. Schemas for Multidimensional Database: stars. distributed and virtual data warehouses. Decision tree knowledge discovery through Neural Networks & Genetic Algorithm. Time series and Sequence data. Building the Data Warehouse. 1996. 2001. modelling OLAP data. Mallach. Students will be required to attempt five questions in all. John Wiley & Sons. 1997. tuning and testing of data warehouse. Data marts. Unit-6: Data mining techniques: Association rules. Multimedia databases. Unit-1: Data warehousing Definition. Support Victor Machines and Fuzzy techniques. Developing the Data Warehouses. DBMS vs data warehouse. mining Text Databases and mining Word Wide Web. snowflakes and fact constellations. 2000.

independent test agencies Text Book: Testing Computer Software. Students will be required to attempt five questions in all. Testing User Manuals. Software errors. Spelling rules. saving. Rulers and measurements. User Interface freeze. mechanics of the database Unit-4: Test Case Design: Characteristics of a good test. Regression Testing. Culture-bound Graphics and output. Sizes of paper. Managing and role of a testing group. Legal consequences of defective software. Translucent box testing Overall objective of the test plan: product or tool? Detailed objective . Fundamentals and Testing types: First. second and later cycles of testing. Jack Falk. Final integrity testing. Overview of S/W development stages. General issues in configuration testing. Glass box code. (Second Edition). Automated acceptance and regression tests. Data formats and setup options. Quality-related costs. load testing. European product compatibility. documentation tester s objective. Error message identifiers. equivalence classes and boundary values. automated testing. Text filters. The development time line. Regression and Black box testing. Pub: Wiley. CPU s and video. Uppercase and Lowercase conversion. type of test. users of the tracking system. visible state transitions. Planning and Design stages and testing during these stages. Printers. standards. Product design. Pre-final.Hung Quoc Nguyen. alpha. tasks of the system. Beta. by Cem Kaner. Unit-1: Objectives and limits of testing. Race conditions and other time dependencies. Function equivalence testing.IT-467 E L 4 T P - Computer Software Testing Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Hot keys. importing. documenting test materials Unit-7: S/W Development tradeoffs and models. Hyphenation rules. printer testing Unit-5: Localization and User Manuals testing: Translated text expands. Loading. strategy for developing components of test planning documents. Categories of software error. Character sets. How testing documentation contributes to software reliability Unit-6: Testing Tools and Test Planning: Fundamental tools. Problem tracking overview. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. 1999. Operating system Language. Project post-mortems. Memory availability. Making a bug reproducible Unit-3: Problem Tracking System: Objective of Problem Tracking System. Error guessing. Rodents. Pre-beta. Keyboards. Content and Characteristics of Problem Report. components of test planning documents. Effective documentation. analysis and Tactics for analyzing a reproducible bug. Sorting Rules. Unit-2: Reporting and analyzing bugs: Problem reports. . and exporting high and low ASCII.

On-line Commerce Environments: Servers and commercial environments. Return on Investment.. Unit-4: Digital Currencies: Operational process of Digicash. Risk management and Control .H Electronic Commerce Security . Critical success factors in ERP System. BPR. Reference Books: The SAP/3 Handbook.K. Manufacturing. Sales and Distribution. private data networks. Addision Wesley. Production Control.K. Strategies. Unit-3: Electronic Commerce Providers: On-line Commerce options: Company profiles. MRP. Transiting environment. Virtual Enterprise. Management. Pre and Post Implementation Issues. Inventory. digital currencies and payment systems. Material Planning and Control. Text Book: Frontiers of electronics Commerce Ravi lalakota.H . 1998. Electronic Payment Systems: Digital payment systems.IT-469 E L 4 T P - Introduction to E-commerce & ERP Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Forecasting. Introduction to basic Modules of ERP System: HRD.M. Network Structure. Unit-7: ERP . Training and Development. Sharma Asset International Net Commerce TMH E Commerce: The Cutting Edge of Business Bajan And Nag TMH E-Commerces. TMH. MIS Integration for disciplines.1996. Online commercial environments. Part-A Unit-1: Introduction and Concepts: Networks and commercial transactions Internet and other novelties.M. T. Client Server Integrator System. Information Communication Technology. Ecash Trail. Shopping techniques and online selling techniques. Personnel Management. Feinman. ERP Selection issues.An Enterprise Perspective: Production Finance. Internet environment internet advantage. Information/Workflow. Offline secure processing. Techniques and Tools. worlds wide web and other internet sales venues. Garg and N. Part. Implication. Resistance to change. Unit-8: ERP-Key Managerial issues: Concept Selling.Information System perspective: Introduction to OLAP (Online Analysis and Processing). ERP Culture Implementation Issues. Ecommerce servers. Fernandz. Greenstein. TP. Resource Management in global scenario. KBS. Andrew Whinston . John Antonio. Model for commercial transactions. Production Planning. of ERP Systems on Business Organization. Rayport . 2002. EDI versus Internet and EDI over Internet. Enterprise Resource Planning-Concepts and Practice. cyber cash model. Production Scheduling. Diwan. 2002. First virtual internet payment system. Jaworski. The E-Business Revolution Denial amor Addision Wesley From Edi to E-Commerce: A Business Initiative Sokol TMH E Commerce Greenstein and Feinman TMH E Commerce Excel.B Unit-5: ERP. Finance. Skill Inventory. Online commerce solutions. SCM. CRM. Venkita Krishna. Personnel disciplines and their relationship. PHI. Security protocols. IT Infrastructure. networks and electronic transactions today. REP. T. Unit-2: Electronic Payment Methods: Updating traditional transactions.Jaffrey F. Smart cards. Bernard J. OAS. V. Electronic Data Interchange: basics. Using Ecash. Unit-6: ERP Resource Management Perspective: Functional and Process of Resource. Secure online transaction models.

.Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all but at least two from each Part A & Part B.

CSE-425 E L 4 T P -

Natural Language Processing Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs.

Unit-1: Components of natural language processing: lexicography, syntax, semantics, pragmatics: word level representation of natural languages prosoty & natural languages. Unit-2: Formal languages and grammars: chomsky hierarchy, Left-Associative grammars, ambiguous grammars, resolution of ambiguities. Unit-3: Computation linguistics: recognition and parsing of natural language structures: ATN & RTN,General techniques of parsing: CKY, Earley & Tomitas algorithm. Unit-4: Semantics-knowledge representation semantic networks logic and inference pragmatics, graph models and optimization, prolog for natural language semantic. Unit-5: Application of NLP: intelligent work processors: Machine translation, user interfaces, Man-Machine interfaces, natural language querying, tutoring and authoring systems, speech recognition, commercial use of NLP.

Text Book: Natural Language Understanding James Allen ,Benjamin-1995, cummings Pub. Comp. Ltd., Reference Books: Language as a cognitive process , Terry Winograd 1983, AW Natural Language processing in prolog G. Gazder, 1989, Addison Wesley. Introduction of Formal Language Theory, Mdlj Arbib & Kfaury, 1988, Springer Verlog

Note:

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

IT-471 E L 4 T P -

Management Information System Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs.

Unit-1: Foundation of Information System: Introduction to Information System and MIS, Decision support and decision making systems, systems approach, the systems view of business, MIS organization within company, Management information and the systems approach. Unit-2: Information Technology: A manager s overview, managerial overviews, computer hardware & software, , DBMS, RDBMS and Telecommunication. Unit-3: Conceptual system design: Define the problems, set systems objective, establish system constraints, determine information needs determine information sources, develop alternative conceptual design and select one document the system concept, prepare the conceptual design report. Unit-4: Detailed system design: Inform and involve the organization, aim of detailed design, project management of MIS detailed design , identify dominant and trade of criteria, define the sub systems, sketch the detailed operating sub systems and information flow, determine the degree of automation of each operation, inform and involve the organization again, inputs outputs and processing, early system testing, software, hardware and tools propose an organization to operate the system, document the detailed design revisit the manager user. Unit-5: Implementation evaluation and maintenance of the MIS: Plan the implementation, acquire floor space and plan space layouts, organize for implementation, develop procedures for implementation, train the operating personnel, computer related acquisitions, develop forms for data collection and information dissemination, develop the files test the system, cut-over, document the system, evaluate the MIS control and maintain the system. Pitfalls in MIS development . Unit-6: Advanced Concepts in Information Systems: Enterprise Resources Management(ERP), Supply Chain Management, C R M , Procurement Management System. Text Books: Management Information System by W. S. Jawadekar, 2002, Tata McGraw Hill. Information System for Modern Management (3rd edition)- Robert G. Murdick, Loel E. Ross & James R. Claggett. PHI Reference books: Management Information System; O Brian; TMH Management Information System by Davis Olson Mac Graw Hill Management Information System by Stasllings,(Maxwell Mc Millman Publishers) Information System; a Management Perspective; Alter Addison Wesley Introduction to Information System; McGraw Hill Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all.

IT- 453 E L 3 T 1 P -

Systems & Network Administration

Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. UNIT-1 : Introduction to Systems and Network Administration: The Scope of Systems and Network Administration, The Goals of Systems and Network Administration, System Components and their Management: Operating Systems: Windows and Unix Variants, File Systems and Standards (UFS, NFS, NTFS), Processes and Job Control, Privileged, User and Group Accounts, Logs and Audits, Systems Performance Tuning: Host Management: Booting and Shutting down of an Operating System, Formatting, Partitioning and Building a File System, File System Layout, Concept of swap space, Cloning Systems, OS Installation, Installation and configuration of devices and drivers, Software Installation and Structuring Software, Open Source Software: The GNU Project, Superuser/Administrator Privileges, User Management, Adding/Removing users, Controlling User Resources, Disk Space Allocation and quotas, Process Management and Monitoring, Scheduling Processes, Killing/Stopping processes, Restarting a Process, Monitoring Process Activity, Maintaining Log Files, File System Repair, Backup and Restoration, , Handling Man Pages/Help System, Kernel Customization, Integrating Multiple Operating Systems, System Sharing, User IDs, Passwords and Authentication. UNIT-2 : Network Administration: Introduction to Network Administration Approaches, Addressing and Subnetting : Fixed Vs Variable Masks, VLAN Principles and Configuration, Routing Concepts, Static and Dynamic Routing, Routing Protocols: RIP, OSPF, BGP, Network Address Translation (NAT), Configuring a Linux/Windows Box as a Router, Dial-up configuration and Authentication: PPP, Radius, RAS, Configuring a DNS Server, Configuring Sendmail Service, Configuring a Web Server, Configuring a Proxy Server, TCP/IP Troubleshooting: ping, traceroute, ifconfig, netstat, ipconfig, Network Management. UNIT-3 : Host and Network Security :Security Planning, Categories of Security: C1, C2, C3, C4, Password Security, Access Control and Monitoring: Wrappers, Firewalls: Filtering Rules, Detection and Prevention of Denial of Service (DOS) Attacks, Automatic Identification of Configuration Loop Holes, Security Information Resources: CERT, Installing and Upgrading System Software, Use of Scripting tools: Shell Scripting, Perl/Python Scripting, Use of Make Option

UNIT-4 : Security Planning, Categories of Security: C1, C2, C3, C4, password security, Access Control and Monitoring.

BOOKS RECOMMENDED Principles of Network and System Administration , Mark Burgess, 2000, John Wiley and Sons Ltd, TCP/IP Network Administration (3rd Edition), Craig Hunt, O Reilly and Associates Inc., 2002. Windows 2000 Administration , George Splading, 2000, McGraw-Hill. Linux Network Administrator s Guide , Olaf Kirch and Terry Dawson, (2nd Edition), O Reilly and Associates Inc., 2000, (Shroff Publishers and Distributors, Culcutta),

Students will be required to attempt five questions in all. .Software Requirements : Microsoft Windows 2000. Perl/Python Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Linux.

Foundation Books (Cambridge University Press). Hyderabad. University Press (India) Limited. Dialogues. University Press (India) Limited. Unit IV Reading Skills: Basic concepts. . University Press (India) Limited. Cambridge Univ. not only of every day oral interaction but also with the situation based oral competence. facial expressions. It is not only the what but the how of knowledge communication that assumes utmost importance once the professional students enter the job market. Furnham. rhythm etc. Unit III Listening Skills: Essentials of good listening. Listening Skills by I. MacKay. Presentation Skills by S. COURSE CONTENT: Unit I Oral Communication: Basic concepts. Public Speaking and Formal Presentations. 2. Body Language Sudha Publications pvt. Documentaries. New Delhi. University Press (India) Limited. Siddons. Body Language at Work by A. Hyderabad.London. Reading for various purposes. Listening for various purposes. UNIT V Body language and Paralanguage: Gestures. Meetings and Group Discussion. 3. S/he has to be well-versed with the nuances and complexities. tone.. 6. Movies). scope and significance. Ltd. This course is designed with this need of the professional students in mind. UNIT VI: Oral Skills for Specific Situations: Interviews.Delhi.D. UNIT II Fundamental of Spoken English: Essentials of Good Speaking. It is also helpful to those students who appear for TOEFL and IELTS. Better English Pronunciation by J. SUGGESTED READING: 1. jay and R. Reading print and visual texts (Advertisements.. Press.- Oral communication forms the major chunk of social and professional interaction.HUM-453-E ORAL COMMUNICATION COMPETENCE SEMESTER VII (ELECTIVE) Class Work : 50 Marks Theory : 60 Marks Practical/Presentation : 40 Marks Total : 150 Marks Duration of Exam : 2 Hrs L T P 4 . Connor. pitch. 7. Fiction/non-fiction. Hyderabad. 4. Reading Between the Lines by McRae. Effective Presentation by A.O. Hyderabad. postures.Jay. 5.

Group Discussions/Interviews at a Glance. Cambridge practice Tests for IELTS 1 Book with 2 Cassettes by Jakeman.Delhi . New Delhi. Ltd. Foundation Books (Cambridge University Press).. 9. Sudha Publications pvt. 10. Foundation Books (Cambridge University Press). Cambridge Preparation for the TOEFL Test by Gear.8. New Delhi.

A panel of examiners appointed by the University will evaluate the oral competence of the students. (B) PRACTICAL: 40 Marks There will be an oral test to evaluate the spoken skills of the students.SCHEME OF EXAMINATION: (A) THEORETICAL: 60 marks There will be five questions of 20 marks each covering all the units except unit V. The students may be evaluated through presentation/mock-meeting or Group Discussion. For the unit on Reading Skills. The students are required to attempt any three questions. Also they can be asked to face interviews in mock Situations. . this test will look for how well the components of body language and para-language are integrated with the linguistic means. summarised or to be analysed. The questions may be set on the theory part of the elements from the units or students may be given some mock situations to be worked on. Besides evaluating clarity. fluency and spontaneity of the language. The time duration for this exam for every batch of 15 students will be of 3 hrs. they may be given a manageable short text to be reviewed.

Unit-III & IV : Vector spaces and their examples. Unit-VIII : Transpose of a matrix and special types of matrices. consequences of Rank nullity theorem. linear independence. operations on sets.MATH-455-E LINEAR ALGEBRA (ELECTIVE FOR CSE. Krishnamurti et. rank and nullity of a matrix. space L(U.IT) Class Work Exam. : 50 Marks : 100 Marks : 150 Marks : 3 Hours L T P 4 . rank and nullity. elementary row operations. Total Duration of exam. range and kernel of a linear map. composition of linear maps. Note : Examiner will set eight questions. Unit-VI : Inverse of a linear transformation.- Unit-I & II : Sets and examples of sets. operator equations. linear dependence. operations on functions. relations.V). algebraic structures. matrix inversion. 2. Unit-V : Definition and examples of a linear transformation. linear operations in Mm. An Introduction to Linear algebra by V. linear map associated with a matrix. system of linear equations.al (EWP). taking one from each unit. functions.n matrix multiplication. Unit-VII : Matrix associated with a linear map. . Linear Algebra by Hoffman & Kunze (PHI). span of a set. Books Recommended : 1. dimension and basis. Students will be required to attempt any five questions. subspaces. binary operations.

CSE & IT) Sesstional 50 marks Theory 100 marks Total 150 marks L T P 4 . Ecology .Principle of ecology. Control measures Hydrocarbons: Nature. Wiley Eastern. control measures. ecological pyramids. 4. Metcaf . A. sources and properties of solid waste. Goel Publishing . . Peavy & others. Oxides of Sulphur and Nitrogen : Sources. environmental pollution. component of environment. Types of ecosystem. secondary treatment aerobic (activated sludge. biosphere. segments of environment. BOOKS SUGGESTED: 1. control measures.- Environment & Ecology : Introduction. aerated lagoons. harmful effects on human health.ME. phosphorus cycle. Elementary discussion on resource and energy recovery. trickling filter. Solid Waste: Types. classification of pollutants.K. settling properties. Environmental Engg: by Howard S. Environmental Chemistry. Meerut. mode of formation. Environmental Chemistry by B. roughing filter. environment and eco-factors (Medium & Biotic). solid waste management Generation. primary treatment.K. effects on human health and plants. atmosphere lithosphere. control Carbon Monoxide: Source. types of pollutants. Biogeochemical cycles in environment (sulphur cycle.Sharma. Note: Eight questions will be set and students will be required to attempt five questions in all. oxygen cycle. Collection and techniques for ultimate disposal. Waste Water & Its treatment processes : Waste-water characteristics. UASB) Air pollution : Classification of air pollutants Particulates: Physical characteristics. factors affecting environment objectives of environment management. MGH International 2. Nitrogen cycle).EL. effluent standards.DE. sources. hydrological cycle-H cycle. hydrosphere.CH-451E ENVIRONMENTAL SCIENCE & ENGINEERING (Elective for EE.EDDY-Waste-water engineering revised by George Teholonobus (TMH) 3. rotating biological contactor) anaerobic (contact process.

Management information Model. Encapsulating security Payload Key Management. established systems. Unit-5: Telecommunication Network Architecture. Public key systems Knacksack systems RSK Diffle Hellman Exchange Authentication and Digital signatures. Wang (MGH) Network Management by U. 2nd Edition by Upper Saddle River. Dlack (MGH) Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Secure electronics transactions. RMON1 & 2. Willian (AWL) Reference Books: SNMP: A Guide to Network Management (MGH) Telecom Network Management by H. Unit-3: System Identification and clustering: Cryptology of speech signals and wide band systems Analogue & Digital Systems of speech encryption. Mani (AWL) SNMP. DSL). modes of use of DES. narrow band Unit-4: Security: Hash function Authentication: Protocols Digital Signature standards. HFC. Web security: Secure Socket Layer & Transport Layer security. data Compression technique. Stalling. Elliptic curve based systems. Unit-2: Stream Ciphers: Rotor based system shift register based systems Design considerations for stream ciphers Cryptanalsysis of stream ciphers Combined eneryption and encoding. Firewalls Design principle. Electronics Mail Security PGP (Pretty Good Privacy) MIME. Broadband Network Management (ATM.ELECTIVE-3 IT-464 E L 4 T P Network Security & Management Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. ASN Text Books: Cryprotography and Network Security: Principal & Practices. Structure of management information and TMN information model. Authentication Leader. SNMP v1. IP Security: Architecture. SNMP2 & SNMP3. Students will be required to attempt five questions in all.H. Block Ciphers DES and variant. Management servicing and functions. Unit-1: Introduction: Codes and Ciphers Some Classifical systems Stiatistical theory of cipher systems-Complexity theory of crypto systems Stream ciphers. Block ciphers. . TMN management layers. PHI Network Management Principles & Practices by Subramanian.

States and Transitions. Text Books: UML User Guide . Visual Modelling using Unified Modelling Language (UML): What is Visual Modelling? Object Oriented Modelling. Addison Wesley. Elaboration Stage. The Logical view. Designing the System Architecture : The need for Architecture. Transition Stage. Grady Booch. Unit-2: Introduction to Objectory Software Development Process: Introduction. The 4+1 view of Architecture. Additional Use Case .CSE-412 E L 4 T P - Object Oriented Systems Development Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. States Unit-5: Checking the Model: Making the Model Homogeneous. Creating Use Case Diagrams: Actors and Use Cases. The Deployment View. Creating Attributes & operations and documenting them.Relationships . Goals. The Component View. Combining Classes. Aggregation. Unit-6: The Iteration Planning Process: Benefits. Encapsulation. Introduction to Rational Rose CASE tool: Introduction Importance of Rational Rose. Activity Diagrams Activities. Designing for Inheritance.Packages and drawing a Class Diagram: State. Usage of UML. Construction Stage. Identity of Objects. The Process View. Ivar Jacobson. Designing Relationships. The Use Case view. Coding. Analysing Object Behaviour: Modelling Dynamic Behaviour. Inheritance. Adding Behaviour and Structure: Representing Behaviour and Structure. Creating and Documenting Classes in rational Rose. Multiplicity Indicators. Displaying attributes and operations. Reflexive Relationships. 2000. Swimlanes Unit-3: Identifying Classes . Transitions. Overview of UML Capabilities. Decision Points. Types of Interaction Diagrams. Polymorphism. Adding Design Classes. Classes. Design the User Interface. Documentation Review. Advantages of Object Oriented Methodologies over Traditional Methodologies. and Documenting the Iteration. Phases and Iterations. Visual Modeling with Rational Rose 2000 and UMLBy Terry Quatrani Foreword by Grady Booch. Event Tracing. Consistency Checking. Association and Aggregation Relationships. Benefits. The Emergence of Patterns. Testing.Diagrams in Rational Rose.. Capabilities of Rational Rose Case Tool. 2000 Reference Books: . Splitting Classes. Use Case Relationships. Packages. Package Relationships. Drawing a Class Diagram Specifying Relationships : The Need of Defining Relationships. Association Classes. Designing Attributes and Operations. Behaviour. Types of Relationships. Objects. Naming Relationships. Finding Relationships. James Rumbaugh. Scenario Walk-through. Introduction to Unified Modelling Language (UML): History of UML. Stereotypes and Classes. Use Case Diagrams: Creating Main Use Case -. Inheritance. Unit-1: Introduction: Review of the Traditional Methodologies. Creating Relationships in Rational Rose Unit-4: Discovering Object Interactions: Documenting Scenarios using Interaction Diagrams. Role Names. Eliminating Classes. Association.

2000.Second Edition Sams Teach Yourself UML In 24 Hours By Joseph Schmuller . Grady Booch. James Rumbaugh. 1999. Ivar Jacobson.2000 . Addison Wesley. The Objectory Software Development Process . UML Distiled by Maxtin Fowler with Kendall Scott. James Rumbaugh. Ivar Jacobson.UML Reference Guide . Grady Booch.2000 Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all. . Addison Wesley.

exposure to Windows CE. Micro kernels and c/OS of introduction to process models. QNX. 1999.11. AW. serial communication interface device driver. Unit-2: 16 & 32 bit microprocessor and micro-controller and DSP hardware with reference to Embedded system. Addison-Wesley Programming for Embedded system by Dreamtech software team. 1999. gce compiler. simulation speed of emulators. cross compilers. John wiley.IT-466 E L 4 T P - Embedded Systems Design Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. TCP/IP. Students will be required to attempt five questions in all. encapsulating semaphores and queues. cross assemblers and tool chairs. Blue tooth IEEE 8. . Unit-1: Real time operating system overview. Unit-3: Embedded software development tools and compilers host and target machines. 2002 Real time programming: A guide to 32 bit embedded development. linker/ locators for embedded software. JTAG OCD Unit-5: Communication protocols with special reference to embedded system. Interrupt routines in an RTOs environment. Text Books: An embedded system primer by David E Simon. saving memory space. Unit-4: System synthesis of Hardware/ software co-emulation. basic concept of device drivers.8. 2002 Reference Books: TCP/IP Lean: Web servers for embedded systems by Jeramy Bentham. hard real-time scheduling considerations. Rick Grehan. IRDA. VDP wireless protocols. Note: Eight questions will be set in all by the examiners taking at least one question from each unit.

Advanced Tree Representation. built-in predicates. Note: Eight questions will be set in all by the examiners taking at least one question from each unit.IT-468 E L 4 T P - Logic & Functional Programming Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Procedural and non-procedural lang.by Mueller. Controlling Back Tracking. Constraint logic programming. Unit-4: Prolog in Artificial Intelligence: writing programs for search techniques.. Structures. Unit-2: Syntax of PROLOG. Unit-3: Input and Output.PHI. Text Book: Prolog Programming for Artificial Intelligence by Ivan Bratko. Meta Programming. Inductive Logic Programming. Machine Learning. Language Processing. Applications of LISP & PROLOG in designing expert system. 1998 Programming in turbo PROLOG by Lee Teft . Lists. 2001. Qualitative Reasoning. prolog vs LISP. Game Playing. Knowledge representation and expert system. . Unit-5: Planning. Operators. Pearson Edu. Students will be required to attempt five questions in all. JW. Arithmetic. Expert System Shell. Operation on Data Structures. Reference Books: Symbolic Computing with Lisp & PROLOG .

Smoothing and Sharpening Frequency-Domain filters. Unit-8: Recognition: Pattern and pattern Classes. Unit-3: Image Restoration: Image Degradation/Restoration Process. Unit-7: Representation. 1995. Components of Digital Image Processing System. Minimum Mean Square Filtering. Unit-4: Color Image Processing: Color Fundamentals. Lossy compression. Introduction to Fourier Transform and the Frequency Domain. Histogram processing. Basic relationship between pixels. Students will be required to attempt five questions in all. Unit-5: Image Compression: Fundamentals.-PHI Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Geometric mean filter. Origin of Digital Image Processing.CSE-414E Digital Image Processing L 4 T - P - Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. topological descriptors. . Error free compression. Unit-2: Image Enhancement in the Spatial Domain & Frequency domain: Background. Basics of spatial filtering. Noise models. Smoothing and Sharpening Spatial filters. Image sampling. quantization and representation. Text Book: Digital Image Processing by Rafael C. Basis of full color image processing. Unit-1: Introduction and Fundamental to Digital Image Processing: What is Digital Image Processing. Inverse Filtering. Unit-6: Image Segmentation: Detection of Discontinuities. shape numbers.simple. Restoration in presence of noise. polygonal approximation and skeletons. Region oriented segmentation. Pattern and Pattern classesRecognition based on matching techniques. Image compression models. Boundary descriptors-simple descriptors. Thresholding.K.Gonzalez & Richard E. Decision-Theoretic Methods. Color transformations. Pearson Education Reference Book: Digital Image Processing by A. Basic gray level transformation. Discrete Fourier Transform. Description and Recognition: Representation-chain codes. Geometric transformations. Regional descriptors. Examples that use Digital Image Processing. Fundamental steps in Digital Image Processing. Edge linking and boundary detection. Image sensing and acquisition. Jain. Color models. Woods 2002.

analogy between RPC of client and server. I/O functions. Unit-5: Network file system concept of data link access. Unit-2: Socket introduction.Routing sockets. FINGER. Unit-1: Introduction to networking. Text Books: Unix Network programming Vol -2nd edition. UDP and TCP/data grams . select& poll functions. multi service servers (TCP. super netting. elementary node and address conversions.authentication. ICMP its purpose . Unit-3: Algorithm and issues in server software design :iterative connectionless servers. Internetworking TCP/IP Vol III Doubles E comer. broadcasting to mobile network. Iterative. . TRACERT. Vol II Note: Eight questions will be set in all by the examiners taking at least one question from each unit.IT-302 E Network Programming L 3 T 1 P - Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. (UDP). TC/IP Protocol architecture.UDP). Unit-4: Remote procedure call concept (RCP) :RPC models. dynamic port mapping . single process. address resolution Protocol (RAP) and RARP. ROUTE. W. connection oriented servers (TCP). echo service (TCP and UDP).Richard Stevens Internet working with TCP/IP Vol-1. Ping. remote programs and procedures.Stevens Reference Book: Internetworking with TCP/IP. IP datagram format. socket options elementary UDP sockets. David L. debugging techniques . their multiple versions and mutual exclusion communication semantics. NET STAT details & IPconfig.UDP). elementary TCP sockets. TCP client sever. subnets. Classful internet addresses. Doubles e-commer. Students will be required to attempt five questions in all. RPC retransmits. concurrent servers multiprotocol servers (TCP.

Cincinnati. Chand & Co.. Business Correspondence and Report Writing by R. Report Organisation and Presentation. Tata Macgraw Hill Publication. Advertising Strategy and its objective. . Pattanshetti. Notes. Credit and Collection letters.HUM-452-E BUSINESS COMMUNICATION SEMESTER VIII (ELECTIVE) Class Work Theory Total Duration of Exam : : : : 50 Marks 100 Marks 150 Marks 3 Hrs L T P 4 . 2. New Delhi. COURSE CONTENT: Unit-I Business correspondence: Characteristics and Formats of Business letter. 3. Writing problem-Solving Proposals. Effective Letters in Business by Robert by C. New Delhi. Agenda and Minutes of Meeting. Effective Business English and Correspondence by M. Application Letters for vacant situations with emphasis on Resumes and Curriculum Vitae. Ramesh and C. The inevitability of introducing this course to Engineering students is embodied in that it has comparatively a high concentration of certain complex writing techniques and procedures. Typical Business Reports. style and tone.S. Designing of Classified and Display Advertising copies. Quotations. It focuses on writing skills and strategies for specific purposes. Pattern and formats of Reports.C. 4. IV Edition. Sharma & Krishna Mohan. Unit-IV Public Relations and Advertising Documents: Press Releases.C. Shruter. and Formal Reports. Executive Summary Proposals and project Proposals. Tata Macgraw Hill. Proposal Formats. claim and adjustment letters. R. Function.- The course proposes to help students develop business and technical communication competence. Public Service Announcements. Tenders. Orders. South-Western College Publishing. SUGGESTED READING: 1. Unit-III Meetings: Writing of Memorandum. Sales letters. E-mail and Netiquette format. New Delhi. Unit-II Business Reports and Proposals: Importance. Business Communication: Process & Product by Hary Ellen Guffey.

K. Inc. One question will cover the theoretical aspect of report/proposal writing and will carry 15 marks. Anncree. International Business English by Leo Jones & Richard Alexander. Orient Longman.. The other question will be on preparing the report/proposal on a topic/subject given and will be of 20 marks. Sides. Sir Issac Pitman & Sons Ltd. Delhi. 10.. Unit-II: 35 Marks There will be two questions from this unit. Cambridge University Press. Unit-I: 30 Marks There will be two questions from this unit. How to Write and Present Technical Information. General and Business English by Sweet Stephen. Unit-IV: 20 Marks There will be one question having two parts. 8. 9. Susan Stevenson/Steve Whitmore. One part will be on theory and will be of 5marks and the other will require the drafting an advertisement copy of a product or service or a public announcement and will carry 15 marks. 6. The other question will be on writing the letter in a proper format on a subject given and will be of 20 marks. London. There will be enough choice taking care of the justice to be given to both the aspects of the report writing. English Business Letters by F. Written Communication in English by Sarah Freeman. One question will cover the theoretical aspect of business letter writing and will carry 10 marks. Printed in India by Replika Press Pvt. The question can be split into parts. All questions will be compulsory and will have enough internal choice. Unit-III: 15 Marks There will be a question on theoretical aspects of the various items of this unit or students can be asked to draft a specimen of any of these from the material given in the exam. . There will be enough choice taking care of the justice to be given to both the aspects of the letter writing. Orient Longman.W. Ltd. John Wiley and Sons. U.Strategies for Engineering communication. 7. Wing & D. covering all the units. SCHEME OF EXAMINATION: There will be six questions in all.5. Cambridge University Press. Charles H.

Gain and Gain saturation. 4. Co2 Laser. Silfvast Cambridge University. Specific Excitation Parameters Associated with Optical and particle Pumping.Population Inversions. Exponential Growth factor. steady-state inversions and three and four-level systems. 2.PHY-452-E LASER TECHNOLOGY (Elective for EE. Laser Amplifiers.IT. Laser Fundamentals by William T.IC) Class Work Exam. Saturation intensity. All questions will carry equal marks. Semiconductor Diode Laser. Excitation or Pumping Threshold Requirements. : : : : 50 Marks 100 Marks 150 Marks 3 Hours. Development and Growth of a Laser Beam. Pumping Pathways. (PHI) 3.- Conditions for Producing Laser. Transient Population Inversions. Ghatak (TMH) Note : Eight questions will be set and students will be required to attempt any five questions in all.EL. Total Duration of Exam. Laud. Concept of coherence Special and temporal. Threshold Requirement for a Laser. L T P 4 . Press. Factors effecting population inversion. Introductory University Optics by John Beynon. RECOMMENDED BOOKS: 1. Einstein coefficient.CSE. Optics A. . Helium-Neon Laser. Ruby Laser. Inversions and two-level systems. Laser B.K.B.

Pricing practices and methods. Unit-I Definition of Marketing and Marketing Management-Nature. Market segmentation-Meaning. Product life cycle. New Product development and its process. The Evolution of concepts in Marketing. responsibilities. duties. marketing channel decisions and their importance.importance. market segmentation Vs target marketing. Training & methods of training. types. Target marketing. Unit-VI Marketing Promotion-Meaning. Unit-IV Pricing-Objectives and importance. The Societal concept. Unit-II Elements of marketing mix.The Production concept. Salesmanship . The Marketing System.: 3 Hrs. Publicity-their concepts and relative importance. Selection of media.HUM-456-E MARKETING MANAGEMENT VIIITH SEMESTER (ELECTIVE) L T P 4 . Sales Promotion. Unit-V Distribution-Process of distribution. The modern Marketing Concept. importance and basis of market segmentation. The Selling concept. Advertising. scope and importance of Marketing.- Class Work Theory Total Duration of Exam : 50 Marks : 100 Marks : 150 Marks . . Marketing communication. packaging and trademark decisions. Unit-III Product-concepts and types. Branding. strategies.

J. K. J. Marketing Management S. Chhabra.N. Modern Marketing .Rustam S. Reference Books : 1. Nair. Marketing Management Phlip Kotler Prentice Hall of India Pvt. Marketing Management T. Text Books : 1. Chandra & Co.Unit-VII Marketing Information System-Meaning.John .K. Pillai & V. . Modern Marketing Management . Marketing Research-Meaning.R. Grover Dhanpat Rai & Co. Bombay Basic Marketing Cundiff and Still PHI India.C.Chandra & Co. 2. 4. Objective and its process. George.Himalya Publishing House. Introduction to Marketing & Salesmanship . Ltd.N. Bagvati . Dawar . Sinha R. 3. S. Note:Eight questions are to be set atleast one question from each unit and the students will have to attempt five questions in all. 2. Modern Marketing management .Universal Book Stall. 3.A.S. Sherlekar Himalaya Publishing House.J.C. techniques and importance.S. 5.C.

Numerical Method : E. : 100 Marks Total : 150 Marks Duration of exam: 3 Hours Part-A Interpolation and curve fitting : Interpolation problem. Power method for Eigen values by iteration. Numerical Methods in Engg. taking four from Part-A and four from Part-B. TEXT BOOKS : 1. Lagrangian polynomials. Least square approximations. Divided differences.K. Jacobi's method. Extrapolation techniques.K.K. Bezier curves and B-spline curves.EL. Simultaneous Linear Equations : Elimination method. Grewal.MATH-202-E NUMERICAL METHODS (COMMON FOR EE. Newton-cotes integration formula. Iyenger and R. Boole's rule and Weddle's rule. one-dimensional heat equation (Schmidt method. & Science : B. Gauss-Seidal method. solution of Laplace equation (Standard 5-point formula only). Gerald and Patrick G.H. Jain. Numerical Differentiation and Integration : Derivatives from differences tables. Non-Linear Equations : Bisection method. Education Ltd. Part-B Numerical Solution of Ordinary Differential Equations : Taylor series method. Relaxation method. Dufort and Frankel method) and wave equation.M.IC & ELECTIVE FOR CSE. 3. Introductory Methods of Numerical Analysis S. Higher order derivatives. Balagurusamy T.IT IN 8th SEM. Jain-Wiley Eastern Ltd.S.) L T P 3 1 Sessional : 50 Marks Exam. Computations : M.S. Note: Examiner will set eight questions. Muller's method. Newton's method. Sastry. fixed-point method. Euler and modified Euler method. REFERENCE BOOKS : 1. Linear Interpolation methods. Runge-Kutta methods. P.I. Applied Numerical Analysis : Curtis F. Trapezoidal rule. Milne's method. 2. Numerial Solution of Partial Differential Equations : Finite difference approximations of partial derivatives. Students will be required to attempt five questions taking atleast two from each part. . Crank-Nicolson method. Romberg's Integration.R.EI. S. Wheatley-Pearson.CHE. Gauss and GaussJordan method. Interpolating with a cubic spline.H. 2. Numerical Methods for Scientific and Engg. Adams-Moulton method. Simpson's rules.

objectives & Functions of marketing. Marketing concept. The Management Functions. its importance and various methods. criticism.D. Brief introduction to the concepts of material management. Administration. (Kalyani Publishers) 2. functions. Principles and Practice of Management .S. Advertising . Objectives. Recruitment. Importance of Management. Definitions of Management. Gupta. Organisation and Management . Objectives of Financial Management. Management-Art. Characteristics of management. Inter-relationship of Managerial functions. Selection. B. Functions and Importance of Financial Management. inventory control.meaning of advertising. Importance.R. Science and Profession.ELECTIVES-4 HUM-202-E L 3 T 1 P FUNDAMENTALS OF MANAGEMENT Class Work Theory Total Duration of Exam. Process. Marketing Research . objectives. UNIT-V Introduction of Financial Management.R. Training . UNIT-I Meaning of management.Sharma. Promotion . Production Planning and Control. Brief Introduction to the concept of capital structure and various sources of finance.Meaning. BOOKS RECOMMENDED : TEXT BOOKS : 1. Aggarwal (Tata Mc Graw Hill) REFERENCE BOOKS : .objectives and types of training. Merit. Principles of Management. Management Vs. objectives.D.Definition of marketing.Seniority Vs. Functions and Scope. Limitations. Definition. N. Manpower planning.S. Development of Management thoughts. UNIT-IV Marketing Management . UNIT-III : : : : 50 Marks 100 Marks 150 Marks 3 Hrs. Functions of personnel management. its significance. Production Management : Definition. stages in production planning and control. Bhalla. Personnel management. UNIT-II Nature and Significance of staffing. Process of manpower planning.

I. Pandey (Vikas Publishing House. 2. Stoner & R. 5.Graw Hill). Principles & Practices of Management L. 3.M.Edward Freeman. Marketing Management S.A.M.James A.1.F. NOTE: Eight questions are to be set atleast one question from each unit and the students will have to attempt five questions in all. Sherlikar (Himalaya Publishing House. 4. New Delhi) Management . Financial Management . PHI. . Bombay). Prasad (Sultan Chand & Sons) Management Harold. Koontz and Cyrilo Donell (Mc.

Searching Systems. Students will be required to attempt five questions in all. Semantic Linking Meta Information. Cookies. Integrating Script. Creating and Reading Cookies. Creating Cohesive Organization Systems Designing Navigation Systems. . Organizing Information. Linking Basics. configuring and troubleshooting. Web Technology. Positioning with Style sheets. Pavel Kulchenko. HTML and other media types. Image maps. Advanced Layout: Frames and Layers. Unit-2: Dynamic HTML and Web Designing: HTML Basic Concepts. Searching your Web Site. Collaboration and Communication. Integrated Navigation Elements. Structure of HTML documents. Image Preliminaries. Audio Support in Browsers.: Request and response objects. Shishir Gundavaram. Unit-1: Information Architecture: The role of the Information Architect. Types of Navigation systems. Using application Objects and Events. Text Level Events. PHI Note: Eight questions will be set in all by the examiners taking at least one question from each unit. High-Level Architecture Blueprints. Retrieving the contents of a an HTML form. O Reilly Doug Tidwell. Organizing Web sites and Intranets. Conceptual Design. Gunther Birzniek. New and emerging Form elements. Image Download Issues. TMH CGI Programming with Perl 2/e. Other binary Formats. Phases of Web Site development. Designing the Search Interface. Style Sheets. Scott Guelich. Form Control. Introduction to Layout: Backgrounds. Design Sketches. Anchor Attributes. Designing Elegant Navigation Systems. Programming Web Services with SOAP.IT-470 E L 4 T P - Web Engineering Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Indexing the Right Stuff. Basic Interactivity and HTML: FORMS. O Reilly Pardi. Retrieving a Query String. Image as Buttons. Process of Web Publishing. Grouping Content. Layout with Tables. XML in Action. Block Level Events. Unit-4: Overview of advance features of XML Text Books: HTML The complete Reference. To search or Not To Search. Colors and Text. Remote Navigation Elements. Unit-3: Java Server Pages and Active Server Pages: Basics. Language attributes. Video Support. Organizational Challenges. Core Events. JSP/ASP Objects and Components. Good Web Design. Images and Anchors. Linking in HTML. James Snell. Fonts. HTML Elements-Core attributes. Architectural Page Mockups.

Books Recommended : 1. Pure Birth & Death model. Lowest-Cost Entry method and Vogel's Approximation method. Unit-II : Big-M method. Shortestroute problem (Floyd's Algorithm and Dijkstras algoritham).IT. Students will be required to attempt any five questions.EL) Class Work : 50 Marks Exam. Unit-VI : Network models. taking one from each unit. TMH. Impact of OR. . Unit-III : Definition of the dual problem. Transportation problem and its mathematical formulation. solution of assignment problem (Hyngarian method). John Wiley. Optimization Theory and Application : S. Initial basic feasible solution of transportation problem by North-West corner rule. Dual Simplex method. Rao. Unit-VII : Introduction to Dynamic Programming. Taha. Graphical solution. Maximal flow problem.R. Elective for CSE. Generalized Poisson Queuing model. Alternate optima.MATH-402-E L T P 3 1 - OPERATIONS RESEARCH (Compulsory for Chemical Engg. Introduction to CPM & PERT.EE. Optimal solution of transportation problem. 3. Phases of an O. : 100 Marks Total : 150 Marks Duration of exam: 3 Hours Unit-I : The origin of OR. Formulation of Linear-programming model.S. primal-dual relationship. Unit-VIII : Elements of a Queuing model. Specialized Poisson Queues. Postoptimal and sensitivity analysis. Introduction to Operations Research by Hiller and Dieherman. Operations Research by Hamdy A. study. Minimal spanning tree algorithm. Static Economic Order Quantity (EOQ) Models. Unit-IV & V : Assignment problem and its mathematical formulation. 2. General inventory Model. Converting the linear programming problem to standard form. Simplex method. Degeneracy. Note : Examiner will set eight questions. unbounded and infeasible solution. Two-Phase method.

tend to turn professionals into mere automatons. No question will be based on literary theory. cultural and human issues from readers point of view. COURSE CONTENT: English August by Upamanyu Chatterjee Seven Steps in the Sky by Kundanika Kapaadia Fire and Rain by Girish Karnard Countdown by Amitav Ghosh TEXTS BOOKS: 1. there will be eight more questions (covering all the four texts) out of which the students will be required to attempt any four. SCHEME OF EXAMINATION: The students will be required to attempt five questions in all. Delhi. It is imperative to sensitise them to social and human values. Besides the first. The questions will be so framed as to evaluate the knowledge of the text for various social. Penguin Books. Question no 1 will be compulsory. Delhi/Faber&Faber. 4. English August by Upamanyu Chatterjee. 3. Delhi. It will have four reference to context type questions covering all the texts. choosing at least one question from each text. devoid of human values.- Technological skills. Delhi. Penguin Books. Ravi Dayal. Here students first hand reading of the texts will be tested. Seven Steps in the Sky by Kundanika Kapaadia. aims at achieving this much-needed holistic balance. Fire and Rain by Girish Karnard. through formal exposure to literature. This course. . Countdown by Amitav Ghosh. OUP. 2. All questions will carry equal marks. Delhi.HUM-454-E INDIAN ENGLISH WRITING SEMESTER VIII (ELECTIVE) Class Work : 50 Marks Theory : 100 Marks Total : 150 Marks Duration of Exam: 3 Hrs L T P 4 . political.

Lithography: Photolithography. Range Theory. constant source and limited source diffusion. Sputtcring. Fick s one dimensional diffusion equation. Unit-1: Crystal Growth: MGS. Czochralspi crystal Puller. Ghandhi Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Silicon shaping. Unit-5: Metallization: Metallization applications. n MOS IC fabrication Process Sequence. Feature Size control and anisotropic etching. Implantation Equipment Anncaling. design considerations. Physical Vapour Deposition.IT-472 E L 4 T P - Introduction to VLSI Design Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Package fabrication technologies. EGS. Choices. Wafer Preparation. Metallization Problems. X ray Lithography. diffusion apparatus. Unit-6: Isolation techniques: Bipolar IC fabrication Process Sequence. Oxide Properties. Students will be required to attempt five questions in all.K. Future trends. Epitaxial Layer evaluation Molcullar Beam Epitaxy.M. Di-electric and Poly-Silicon Film Deposition: Deposition Processes for Poly-Si. e-beam lithography. diffusion of Grp3 and 5 impurities in Silicon Impurity sources. Text Books: VLSI Technology. Unit-2: Oxidation: Thermal Oxidation Kinetics. Sze . Unit-3: Reactive Plasma Etching: Plasma Properties. Oxidation techniques. Assembly & Packaging: Package Types. S. Plasma assisted Depositions. . Oxidation induced Defects. SiO3N4. S. Unit-4: Diffusion: A Qualitative view of atomic diffusion in Solids. Characterization of diffused layers. Plasma etching techniques and equipment. Ion Implantation: Introduction. diffusion mechanisms. SiO2. MGH VLSI Fabrication Principles. Epitaxy: Vapour Phase Epitaxy. 1998.

Text Book: Professional Issues in Software Engineering (2nd edition. Introduction of Viruses. Basic outline of Criminal and Civil Laws. Trade Marks and laws relating to designs.htm ACS code of Ethics http://203. Hacking. Hall T. devices to overcome protection Software Licensing . timeliness and use of resources. arbitration. Intellectual property rights. Case study of some professional body such as Computer Society of India / BCS(UK). Basic understanding of the Types of Agreements in large computerization projects Implementation Agreements. Professional development. Cyber crime. Enforcement issues. Unit-3: Other Professional Issues: Duties of a professional.58. Basic human rights.bcs. Students will be required to attempt five questions in all. Concepts relating to laws of Contract and Commercial Law. Unit-1: Legal Issues: Introduction to legal concepts. Are computer professionals Professionals .197. Public interest. Accountability for quality. Professional relationships.).pdf BCS Code of Practice: http://www1. Bott F. The need for professional ethics. Duties to profession. License Agreements. Methods of licensing.. professional skill. et al. UCL Press. Originality. Unit-2: Multimedia. Trade marks and passing off. Ethics and the Internet. Employees and freelance programs. Public awareness.. Contribute towards advancement of human welfare. dispute resolution. Intellectual property Issues. Confidentiality and privacy. Acting with responsibility. Myers C..CSE-416 E L 4 T P - Social and Professional Issues in IT Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. The Responsible Software Engineer: Selected Readings in IT Professionalism. Privacy. Data protection principles and implications of the European Union Data Protection Directive. Characteristics of professions. comply with law. Codes of Ethics: Relationship between Code of ethics and professional conduct. 1997. Health and safety issues. Internet related issues. Avoiding computer misuse.org/docs/01100/1194/pdf/codeofc. Human relationships and change management. Copyright and Industrial Property.209/acs/events_admin/static/national/pospaper/acs131. Confidentiality. relations. due care. Environmental protection. standards. knowledge of law. Duties to Employer. . 1995.org/docs/01100/1194/Cop. Contract issues and Law.bcs. Maintenance agreements etc. Integrity & Honesty. Substantive Legal Issues. legislative action. Patents. Duties to client. licensing and related issues: Protection of Databases. Copyright problems posed by electronic publishing. Dealing with Copyright. Ethics and Codes of Professional Conduct. and Pitt D.htm Note: Eight questions will be set in all by the examiners taking at least two question from each unit. Public interest and Social implications. Duties to society. unauthorized access and types of Computer Crime. Software Protection and piracy. Fraud and types of Computer Fraud. independence. Reference Books: (Eds). Conflicting responsibilities and misconduct. Exception to Copyright infringement.. Copyright and electronic publishing . judgment. Springer * BCS code of conduct: http://www. Netiquette and Policy approaches. Competence.

Wireframes. Dialog issues: response time.. Use of metaphors to support user understanding. Layers model of architecture of design and windowing systems. Windows manager models. User and process flows. Information architecture.CSE 418 L 4 T P - Human Computer Interaction Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. human-system interaction: Input and output devices. Computer architecture.history and intellectual root Human information processing limitations. control. Hypermedia and WWW Unit 4: Principles guiding well-designed human-system interaction: Paradigms for interaction. Macintosh. Speech input. e. Sources of information Unit 7: The design process making use of task and user data for system design. Implications for software organizations . color maps. color range of devices Unit 3: Interaction models and metaphors: Use of abstract metaphors for describing interface behavior.: History of computer user interfaces. comps. sound and speech output. Reconciling UCD and usability testing Unit 6: The design process .task and user needs analysis: Task analysis definition. Usability engineering overview. Examples of accessibility adaptations. scenarios. Use cases. 6. Other methods of conveying structure and function Unit 8: Designing for universal access: What is accessibility? What is accessible software. Structuring the information. Three pillars of design . 3. 1. Screen layout issues. Dialog input and output techniques and purposes . Techniques for task analysis. Dialog interaction: types and techniques. HCI . multimedia and non-graphical dialogues. What s driving software accessibility. Unit 1: Introductions & overview of HCI. actual). Human memory Human problem solving Skill acquisition Users conceptual models (mental models) Decision making Unit 2: Computer systems and user interfaces. standards. Human cognitive and sensory limits 2. navigation and orientation. Color representation. Accounting for users with disabilities Unit 5: The design process overview: The typical software development lifecycle (idealized vs. 5. MS Windows. Principles to support usability. X. human decision making. look and feel . User-centered design overview. 4. Color issues. Performance characteristics of humans and systems. Computer graphics . Mockups. Mechanics of particular devices.g.

Perason Edu. Publ. Students will be required to attempt five questions in all. John New York: Wiley & Sons. Prentice Hall 1993 Graphical User Interface Design and Evaluation Redmond-Pyle. D. D.Unit 9: Speech user interfaces: Attributes of speech user interfaces. The design of everyday things. A et al.T. (1988). Prentice Hall 1995 The Art of Human-Computer Interface Design Laurel. & Redish. & Moore. Norman. User and task analysis for interface design. New York: Basic Books. 2000 Human Computer Interaction Dix. Reference Books: Designing the User Interface: Strategy for Effective Human Computer Interaction. A. B Addison-Wesley 1990 Note: Eight questions will be set in all by the examiners taking at least one question from each unit.C. Bel Shneiderman. Effects of automation. . J. (1998). Evaluating speech user interface quality Unit 10: HCI in mission-critical and high-risk environments: Safety implications of human-computer interaction. Addressing the effects Text books: Hackos. J. 3rd edition.

Fuzziness of Fuzzy Sets. Fuzzy Equations. Intersections. Unit . Binary Fuzzy Relations. 1995. Binary Relations on single set. Unit 7 Uncertainty based Information: Information & Uncertainity.4 Fuzzy Relations: Crisp & Fuzzy Relations. Properties of a-cuts. Unit . Membership Function. Unit 6 Fuzzy Logic: Classical Logic.J. PHI. 1988. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Nonspecificity of Fuzzy & Crisp sets. PHI. Lattice of Fuzzy Numbers. Decomposition. Evidence & Possibility Theory. Aggregation Operations Unit . Compatibility & Ordering Relations.2 Operations on Fuzzy Sets: Compliment. Folyger. Uncertainty & Information by G.A. Possibility versus Probability Theory. Fuzzy sets & Fuzzy logic by G. Theorems. Unit 5 Possibility Theory: Fuzzy Measures. Extension Principle.J. Arithmetic Operations on intervals & Numbers.3 Fuzzy Arithmetic: Fuzzy Numbers.1 Classical and Fuzzy Sets: Overview of Classical Sets. Fuzzy Propositions.Klir & B. Multivalued Logics. Unions. Combinations of Operations. a-cuts. Fuzzy Relation Equations.Yuan. Projections & Cylindric Extensions.Klir & T. Linguistic Hedges. Morphisms. Equivalence. Fuzzy Qualifiers. Linguistic Variables. Unit . Students will be required to attempt five questions in all. Text / Reference books : Fuzzy Sets. .CSE 420 E L 4 T P - Fuzzy Logic Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit 8 Applications of Fuzzy Logic in soft computing.

The unregistered version of Win2PDF is for evaluation or non-commercial use only.This document was created with Win2PDF available at http://www.daneprairie.com. .

Sign up to vote on this title
UsefulNot useful