You are on page 1of 132

P.D.M.

COLLEGE OF ENGINEERING Sarai Aurangabad SYLLABUS BACHELOR OF ENGINEERING COMPUTER SCIENCE & ENGINEERING

Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Exa mination (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 Prac tical 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-22 4-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) Digita l 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

(CSE.IT) Theory of A utomata & Computation Object-Oriented Programming using C++ (CSE.IT) Computer Architecture and Organization COMMON WITH V-SEM EL.IT) Programming Languages (CSE.IT) TOTAL Total Theory Sessional Practical 4 100 50 3 1 4 100 50 150 3 3 1 4 100 .IT) C++ Programming Lab. Subject L 3 Teaching Schedule T 1 P Ex amination 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.Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Exa mination (Semester. (CSE. No. (CSE .IT) Internet Fu ndamentals (CSE.4) Sl. Course No. IV-SEM CSE Data Base Management Systems Lab.IT) Internet Lab.

50 150 3 3 1 4 100 50 150 3 3 1 4 100 50 150 3 3 1 4 100 50 150 .

This project will be evaluated in the 5th semester.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 t his study. .

3 .

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 Princip les of Operating System (CSE.E LI& C) Computer Graphics (CSE.EE.ELI& C) Assessment of MiniProject based upon Open Source Software carried out at the end of 4th Sem. IT.EL. TOTAL T P Total Theor y 100 Examination Schedule (Marks) Session al 50 Practic al Total Duratio n of Exam (Hours) 3 Sl. 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 .IT) Multimedia Te ch.IT) Microprocessors and Interfacing (EE. (CSE.5) Teaching Schedule Course No.Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Exa mination (Semester.CSE.IT.IT) Analysis & Design of Algorithms Web Developmen t (Common with IT VI Sem) Multimedia Technologies (Common with ITIV-Sem) Compute r Graphics Lab. Lab (Common with IT IV Sem) Microprocessors and Interfacing Lab. (EL. No .IT) Web Development & Core JAVA Lab.CSE. (CSE.

CSE-313 E 25 25 3 18 6 8 32 .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.

600 425 100 1125 4 .

IT.ELI&C VII ELECTIVE ) Intelligent Systems Lab.Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Exa mination (Semester.EE. 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 .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 (H ours) 3 3 Sl. (EL.IT VI Sem Digital System Design (EL.EL VI sem) Systems Programming & Syst em Administration (Common with IT V Sem) Wireless Communication (Common with VII I Sem EL) & CSE. No .EE.IT) Operating Systems Lab.ELI&C.6) Teaching Schedule Course No.IT) Intelligent Systems (CSE.IT) Compu ter Networks (Common with IT Vth sem) (CSE. Digital System Design Lab. Subject L CSE-302 E CSE-304 E Principles of Software Engineering (CSE. (CSE.CSE.

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. following this semester. the student will carr .

net technology and implement a mini-project based upon this study.y out self study of . This project will be evaluated in the coming 7th semester. 5 .

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 - . No .7) Examination Schedule Teaching Schedule (Marks) Subject Th eor Session Practic L T P Total Total y al al Advanced Computer Architecture Sof tware Project Management (CSE. Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Exa mination (Semester. Visual Programming Lab. Major PROJECT Part I OR INDUSTRIAL PROJEC T Part I Assessment of Mini. Course No.Project based upon .IT) Compiler Design ELECTIVES-1 ELECTIVES-2 Compil er Design Lab.Sl.net technology carried out at t he end of 6th semester.

4 4 50 50 3 9 CSE-415 E 25 25 17 03 10 30 500 425 100 1025 6 .

Note: 1. ELECTIVES-1 CSE-417 E Data Network Design CSE-419 E Neural Networks IT-4 65 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 Sys tem & 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 hardwar e/ software. The project will be completed in 8th semester along with its examin ations. Major PROJECT Part I will commence in 7th semester where students will identity the project problem.

IT) Security of Information Systems ( CSE. CSE-402 E IT-402-E Teaching Schedule S ubject L Distributed Operating System (CSE. Course No.Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Exa mination (Semester.8) Sl.IT) ELECTIVES 3 ELECTIVES 4 Advanced JAVA Lab. (Common with IT VII Sem) Majo r PROJECT Part II OR INDUSTRIAL PROJECT Part II Colloquium General Fitness for t he 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 . No.

100 200 3 7 8 14 2 4 13 4 29 400 50 50 450 50 200 50 100 1050 3 ELECTIVES-3 IT.464 E CSE-412 E IT-466 E IT-468 E CSE-414 E IT-302 E HUM-452-E P HY-452-E HUM-456-E MATH-202-E ELECTIVES-4 HUM-202-E IT-470 E MATH-402-E HUM-454E IT-472 E CSE-416 E CSE 418 E CSE 420 E Network Security & Management Object Oriented Systems Development Embedded syste m Design Logic & Functional Programming Digital Image Processing Network Program ming Business Communication Laser Technology Marketing Management Numerical Meth ods Fundamentals of Management Web Engineering Operations Research Indian English Wr iting Introduction to VLSI Design Social and Professional Issues in IT Human Com puter Interaction Fuzzy Logic 8 .

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

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

Hash function. Pub. Running Times. 2002. AVL Trees.IT) Class Work: 50 Exam: 100 Total: 150 Dur ation of Exam: 3 Hrs. Binary Search Trees. Merging of sorted arrays& Algorithms. Binary Traversal pre-order. . (recursive & non Searching Algorithms: Straight Sequential Search. Big Oh . Introduction to R ecursion.order traversal . Original edition. Sorting by exchange. Data Structures a nd Program Design in C By Robert Kruse. Unit-2: Queues and Lists: Definition. Langsam. Unit-3: Trees: Definition of trees and Binary trees. 1983. Tables : Definition.H. Addison-Wesley. Implementations and Applications. Augentem. insertions : Bubb le sort. Examples and real life appli cations.EL. M. Conversions. Ullman. Theory & Problems of Data Structure s by Jr. The Stacks : Definition. Heap sort. Implementations. Adjacen cy matrix. PHI Pub. post order. Symour Lipschetz. Linked List implementation of Queues / List s. T op down Heap sort approach. recursive Algorithms) Text Boo k: Binary Search Data Structures using C by A. Best Ca se. Tenenbaum. Threaded trees. Linked L ist based implementation of stacks. Depth first T raversal. Jean Paul Tremblay. Shell sort. prefix representa tion. postfix. Heap sort: Heap Construction. Schaum s outline by TMH Introduction to Computers Sci ence -An algorithms approach . Moshe J. T. Merge sort. Static and Dynamic implementations. Fundame ntals of Data structures by Ellis Horowitz & Sartaj Sahni. Balanced multi way searc h trees. Evaluating time Complexity.notation. Examples : Infix. Unit-6: Sort ing Algorithms : Introduction. Quic k sort Algorithm analysis. Unit-1: Introduction to Data Structures: Definition of data structures and abstr act data types. bottom up. J. Properties of Binary trees and Implementation. Applications. PHI. Aho. In. Applications. Bunt. Array based implementation of stacks. Reference Books: Data Structures and Algorithms by A. Priority Queues. Graph Traversal Breadth first Traversal. Efficiency of above algorithms. Circular implementation of Queues and Singly linked Lists. 1999. Average Case. Hopcroft and T. Straight selection sort. Implementations Unit-4: Graphs: Definition of Undirected and Directed Graphs and Networks.AW Fundamen tals of computer algorithms by Horowitz Sahni and Rajasekaran.CSE-201 E L 3 T 1 P Data Structures & Algorithms (CSE. Worst Case. Shortest path Algorithm. Unit-5: Running time: Time Complexity.D. Richard B. The Array based implementation of graphs.V. Array bas ed implementation of Queues / Lists. path matrix implementation.. Low Priced Edition. Factors depends on running time.M. P erformance of shell sort. Straight / circula r implementation of doubly linked Queues / Lists. selection. The Linked List representation of graphs.E. Divide and Conquer Algorithm.

Collins.Data Structure and the Standard Template library Note: Willam J.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. T. 2003.M. .

L Liu. Truth v alue of a compound statement. Mc Graw Hill. 1995. Introduction to AP. Spanning trees. A ddison-Wesley. Cardinality and inverse relations Unit-2: Propositional Calculus: Basic operations: AND(^). Note: Eight questions will be set in all by the exa miners taking at least one question from each unit. Lipshutz. Subgroups and Normal subgroup s. McGraw-Hi ll Singapore Discrete Mathematical Structures. Homogeneous solutions. 1995. partial fractions. Shortest path in weighted graphs. 1989. Hamilton paths and circuits. Combination. Judith L. Semigroup. Finite and Infinite sets. tautologies. Computer Science Press. Applied Discrete Structures for Computer Science. Ronald Graham. Diggle (Modular Mathematics series). Concrete Mathematics: A Foundat ion for Computer Science. Schaums Ou tline series: Theory and problems of Probability by S. Chtewynd and P. Paths and circuits. Duality. propositions. GP and AG series. Cyclic groups. Equivalence rela tions and partitions . Representation of relations.C. Gersting. London. Busby. Cosets. Subgraphs. Unit-1: Set Theory: Introduction to set theory. Eurelian p ath and circuits. (Chicago: 1985. Total solution of a recurrence relation using generating functions. 5th Edition. Doerr and Levasseur. Edward Arnold. Unit-4: Recursion And Recurrence Relation :Polynomials and their evaluation. Set operations. 2001. Composition of function and relations.CSE-203 E L 3 T 1 P Discrete Structures Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Euler s formula. Directed and Undirected graphs. OR(v). P HI Discrete Mathematical Structures with Applications to Computers by Tembley & Manohar. Integral domain and fields. Kolman and R. Unit 3: Techniques Of Counting: Permutations with and without repetition. Particular soluti ons. Partial ordering relations and lattices Function and its types. 1985. linear recurren ce relation with constant coefficients. Isomorphism and Automorphism. 1982. Homomorphism. Unit-5: Algebric Structures Definition and examples of a monoid. Seq uences. Classes of sets. 1996. Students will be required to attempt five questions in all. 1993. Lagrange s theorem Unit-6: Graphs And Trees: Introduction to graphs. . contradictions. Donald Knuth and Oren Patashik. McGraw Hill Reference Books: Discrete Mathemati cs by Johnson Bough R. Homom orphic and Isomorphic graphs. Car tesian Product. Binary trees and its traversals Text Book: Elements of Dis crete Mathematics C. Mathematical Structures for Computer Science. B. Multigraph and Weighted graph. Types of relation. Planar graphs. NOT(~).SRA Discrete Mathematics by A.. Power Sets. T rees. Cut points and Bridges. PEA. Multi sets.. Groups and rings. Algebra of sets.

.

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

.

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

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

Chand) Micro Econo mic Theory .N. A Text Book of Economic Theory Stonier and H ague (Longman s Landon) Micro Economic Theory M. 6. Ahuja (S.L. Kulkarni & A.) Indian Economy : Rudar Dutt & K.2. Kalkundrikar (R.Chand & C o.A.H. 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. 3. Mishra (Pragati Publications) Economic Theory . 4. .K.K.B.P.L. Dewett (S.B.Chand) REFERENCE BOOKS : 1.Chand) Modern Micro Economics : S.M. Jhingan (S. Modern Economic Theory K. 5. 2.

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

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

EX-NO R. Verify the operation of a ring counter and a Johnson counter. 11. 4. 6. 7. NOT. 3. 1. 5. To design & verify the operation of 3-bit synchronous counter. To verify the operat ion of comparator. T & D type flip fl ops. 9. OR. To verify the operation of multiplexer & Demultiplexer. Design a 4-bit shift-register and verify its op eration . atleast seven experiments should be performed from above list. To design & realize a sequence generator for a given sequence using J-K flip-flops. Design & realize a given function using K-maps and verify its performance. NAND. EX-OR. Study of CMOS NAND & NOR gates and interfacin g between TTL and CMOS gates. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the sc ope of the syllabus. To design and verify the operation of synchronous UP/DOWN decade counter using J K flip-flops & drive a s even-segment display using the same. 2. NOR. 10. NOTE : A t least ten experiments are to be performed. To verify the truth tables of S-R.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 design and verify the operation of as ynchronous UP/DOWN decade counter using J K flip-flops & drive a seven-segment d isplay using the same. 8. To verify the operation of bi-directional shift register. J-K. Study of TTL gates AND.

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

abstraction.vector & arrays. 1996. Ghezzi. Heap storage management . data types. static & dynamic scope. Unit-3 : Subprograms and Programmer D efined Data Types: Evolution of data type concept . Local data & local referencing environm ent.type definitions. Reference Books: Fundamentals of Programming languages by Ellis Horowitz.. encapsulation & information hiding . pointer & pro grammer defined data objects. abstract data types. Static storage manag ement . Galgotia publications (Springer Verlag). Declarat ions .variable & fixe d size elements. Declaration & type checking of data structure . Elementary data types data objects. 198 9. Ch aracteristics of a good programming language. records Character strings.CSE-204 E L 3 T 1 P Programming Languages Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hr s.W. . Robert Noonan 2002. Exception & exception handlers. 2002.sequence control within expressions. variable size data structures . TMH. Unit-2: Structured data objects : Structured data objects & data types . Stack based storage management. Unit-1: Introduction: Syntactic and semantic rules of a Programming language. Com parison of C & C++ programming languages. Shared data: dynamic & static scope. co rout ines. Programming language translators c ompiler & interpreters . Assignment & initialization. Text Book: Programming languages Desig n & implementation by T. 1984. Parameter & parameter transmission sch emes. sets. specification & implementation of struct ured data types. Unit-5: Data Control: Names & referencing environment. Numeric da ta types. files. . Union. Programming languages concepts by C. Subprogram sequence control: si mple call return . Prentice Hall Pub. Unit-7: Programming Languages: Introduction to procedural. Subprograms . Note: Eight questions will be set in all by the examiners taking at least one question from each unit. T.M. block structure. Programming Languages Principles and Pradigms Allen Tuck er . functional and object oriented programming language. nonprocedural .H. enumerations. Booleans & characters.Pratt. sequence control . variable & constant s.recursive subprograms. Unit-6: Storage Management: Major run time elements requiring storage . Specification & implementation of elementary data types.structured. sequence control within statement.type checking & type conversions . Wiley Publications.pro grammer and system controlled storage management & phases . Programming Language s Principles and Paradigms by Allen Tucker & Robert Noonan. Unit 4: Sequence Control: Implicit & explicit sequence control . Students will be required to attempt five questions in all.

.

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

Templates and Stati c Members. Encapsulation (Information Hiding). I nitializing Class Objects: Constructors. D estructors and Exception Handling. Programm ing with C++ By D Ravichandran.Class Pointers to Derived. Stream Input/Output Classes and Objects. >> Overloading Unary Operators. Proxy Classes. Accessin g Members of Structures. package). Catch. Class Scope and Accessing Class Members. Class Template. Unit-8: Templates & Exception Handling: Function Templates . Controlling Access Function And Utility Functions.M. Implicit Derived Class Object To BaseClass Object Conversio n. Reusability. T. Other Modifiers. Unit 6: Virtual Functions and Polymorphism: Intr oduction to Virtual Functions. Templates and Inheritance. 1998. Unit-2: Object Oriented Concepts : Introduction to Objects and Object Oriented Programming. Exceptions and Inheritance. Separating Int erface from Implementation. Constructors. Object as Member of Classes. Header File s and Namespaces. Class Templates and Non-Type P arameters. Stack Unwinding. <<.1994. p rotected. Pre-processors Directives. Stream Manipulators. Updating Sequenti al Access Files. U nformatted I/O (with read and write). Polym orphism. The WAITE Group Press. Inheritance. Overloading Binary Operators. Abstract Base Classes And Concrete Classes. Inheri tance. Thr owing an Exception. as Friend Functions. Using Destructors. Using Member Functions. Stream Input. Unit-5: Inheritance: Introduction. Uni t 3: Classes and Data Abstraction: Introduction. Function overloading. private. Protected Members. Dynamic Memory Allocation with New and Delete. Public.H Reference books: . Processing Unexpected Exceptions. Unit-7: Files and I/O Streams: Files and Streams. Creating a Seque ntial Access File. New Classes And Dynamic Binding. Reading Data Sequentially from a Random Acce ss File. Polymorphism. Exception sp ecifications. Unit-4: Op erator Overloading: Introduction. Basics of C++ Exception Handling: Try Throw. Restrict ions On Operators Overloading. Stream Error States. Unit 1: Introduction to C++. Access Modifiers: Controlling access to a class. C++ Standard Library. Friend Function and Friend Classes. Inheritance: Base Classes And Deri ved Classes. Random Access Files. Using Default Arguments With Constructo rs. Composition Vs. Virtual Destructors. Structure Definitions. Dyn amic Binding. library files. Polymorphism: Overloading. Static Class Members. Overriding Base Class Members in a Derived Clas s. Fundamentals of Operator Overloading. Class s Behaviors. Overloading Template Functions. Creating A Random Access File.. 2003. Co ntainer Classes And Integrators. Introduction. Using This Pointer. Stream Format States. Text Books: C++ H ow to Program by H M Deitel and P J Deitel. Illustrative Simple C++ Programs. Protected and Private Inheritance. Reading Data From A Sequential Access File. Templates and Friends. Stream Output. Writing Dat a Randomly To a Random Access File.Class P ointers. or variable (public. Abstract Classes. Overloading. Rethrowing an Exception. method. Catching an Exception. Classes : Const(Constant) Object And Const Member Functio ns. Prentice Hall Object Oriented Programming in Turbo C++ by Robert Lafore .IT-202 E L 3 T 1 P Object Oriented Programming Using C++ Class Work: 50 Exam: 100 Total: 150 Durati on of Exam: 3 Hrs. Using Constructors and Destructors in derived Classes. Operator Functions as Class Members vs. Casting Base. Basics of a Typical C++ Envir onment. Overriding Methods.

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

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

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

.

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

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

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

Derive two specific cl asses called triangle and rectangle from the base shape. Another f unction. called nopayCar ( ). The program should get a string from the user. The opposi te would be true if getRight ( ) were used. Q13. Include a program to test this class. This program should allow the user to push one key t o count a paying car. A member function called p ayingCar ( ) increments the car total and adds 0. increments the car total but adds nothing to the c ash total. Use an input method that allows embedded blanks. Display the contents of the Deque using the forEach ( ) function and a user wr itten display function. Finally. Use a for loop that swaps the first and last characters. Use this class to store two double type values that could be used to compute the area of figures.50 to the cash total. Able was I ere I saw Elba) . call reversit ( ). Write a program to exercise reversit ( ). Write a function called reversit ( ) that reverses a string (an array of char). Add to the base class. using the first That ( ) function and display any strings that match. design a progr am that will accept dimensions of a triangle or a rectangle interactively and di splay the area. a member function called displays the two totals. and print out the result. and put them in a Deque-some at the head of the Deque and some at the tail . N otice the order in which the items are displayed: Using getLeft ( ). Create some objects of the string c lass. then the second and next to last characters and so on. Test the program with Napoleon s famo us phrase. Pushing the ESC kay should cause the program to print out the total cars and total cash and then exi t. Remember the two values given as input will be treated as length s of two sides in the case of rectangles and as base and height in the case of t riangles and used as follows: Area of rectangle Area of triangle =x*y =½*x*y . Using these three classes. Q12. a member function get_data ( ) to initialize base class data members and another member function display_area ( ) to compute and display thearea of figures. The string should be passed to reversit ( ) as an argument. and another to count a nonpaying car. A constructor initializes both these to 0. Create a base class called shape. Q 14.collected. those inser ted 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. Then search the Deque for a particular string. Finally remove all the items from the Deque using the getLeft ( ) function and display each item. Mak e display_area ( ) as a virtual function and redefine this function in the deriv ed classes to suit their requirements.

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

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

8237 DMA control ler. Microprocessor Architecture. PHI REFERENCE BOOKS: 1. branch instructions. TMH 2. . Programming & Design : Yu-Chang Liu & Glenn A Gibson. control words. flag manipulation instructions. Wiley Eastern Ltd. THE 8086 MICROPROCESSOR ARCHITECTURE: Architecture. s hift and rotate instructions. UNIT2. directives and operators. TEXT BOOKS : 1. details of sub-blocks such as EU. instruction set. logical instructions. PA RT B UNIT4. block diagram of 8086. Programming & Applications with 8085 : Ramesh S Gaonkar. modes and examples. interfacing. pin diagram and description of various signals. INTERFACING DEVICE : The 8255 PPI chip: Architecture. 4.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. 2. arithmetic instructions. DMA : Introduction to DMA process. BIU. programming examples. Microcomputer sys tems: the 8086/8088 Family: architecture. 8085 microprocessor: Architecture. assembler instruction format. program relocation. Programmabl e interval timer chips. INTERRUPT AND TIMER : 8259 Programmable interrupt controller. N OP and HLT instructions. PHI. memory segmentation and physica l address computations.Students have to attempt any five questions. TM H NOTE: 8 questions are to be set selecting FIVE questions from PART A and THREE questions from PART. PHI 3. data transfer ins tructions. The Intel Mi croprocessors 8086. UNIT3. INSTRUCTION SET OF 808 6: Instruction execution timing. and assembly language progr amming. interrupt structure. UNIT6. The 8088 & 8086 Microprocessors-Programming .Pentium processor : Brey. looping instructions. UNIT 5.Hardware & Applications :Triebel & Singh. Microproce ssors and interfacing : Hall.B . addressing modes. instruction format s. Advanced Microprocessors and Interfacing : Badri Ram. THE 8085 PROCESSOR : Introduction to microprocessor.

.

BPB Graphics. Addision Wesley. Computer Graphics Secrets and solutions by Corri gn John. Text Books: Computer Graphics Principles and Practices second editi on by James D. Computer Graphics Hardware and software. Three dimensional transformations: Three dimensional graphic s concept. The Z.4 bit code algorithm. shading models for polygons. Two dimensional G raphics Primitives: Points and Lines. Unit-6: Illumination. representation of 3-D Transformations. Circle drawing algorithms: Using polar coordinates. Parametric repr esentation of surfaces. Interpolation method. shadows.H 2 002 . 1999. 1999. 1994. B-Spline curves. boundary filled algorithm. types of projections. Rogers. BPV Introduction to Computer Graphics By N. shading. tran sparency. area sub-division algorithm. mid point circle drawing algorithm. Composition of 3-D transformat ion. Unit-4: Hidden surface removal: Introduction to hidden surface removal. Unit-5: Representing Curves and Surfaces: Para metric representation of curves: Bezier curves. Addision Wesley. the mathematics of pla nner geometric projections. ima ge manipulation: Illumination models.M. Computer Graphics by Donald Hearn and M. T. clipping line (algorithms):. What is an image? Filtering. Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping algorithm. Two dimensional tran sformations: transformations. Foley. rotation. Andeies van Dam. compos ite transformation. windows. geometric transformatio n of images. scanline algori thm.CSE -303 E L 3 T 1 P Computer Graphics Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. scaling. viewports. Computer G raphics Applications. Unit-2: Two/Three Dimensional Viewi ng: The 2-D viewing pipeline.M. Krishanmurthy T. Sutherland-co hen algorithm. C lipping: point. coordinate systems. image processing. Matrix Unit-3: Viewing in 3D: Projections. Line drawing algorithms: DDA. PHI Reference Books: Procedural Elements for Computer Graphics Davi d F. Filled area algorithms: Scanline: Polygon f illing algorithm. Hughes. 2nd Ed ition. Unit-1: Introduction to Computer Graphics: What is Computer Graphics.buffer algorithm. parametric line clipping algorithm (Cyrus Beck). 2001. Bresenham s circle drawing.Pauline Baker.H Second Edition Fundamentals of 3Dimensional Computer Gr aphics by Alan Watt. Stevan K. translation. Bresenham s. reflection. Games & Multimedia Projects in C by Pil ania & Mahendra. Computer Graphics: Secrets and Solut ions by Corrign John. GUI. Feiner and Johb F. 2000 . window to view port mapping. Standard Publ.

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. .

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

.

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

.

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

.

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

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

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

16-bit subtraction (display borrow) 4. Write a program using 8085 and verify for : a. 2. Write a program using 8086 for copyi ng 12 bytes of data from source to destination and verify.bit numbers by bit rotatio n method and verify. Findin g the smallest number from an array. 14. 8.bit nu mbers by repeated subtraction method and test for typical data. Write a program using 8085 for multiplication of two 8. 5. b. Study of 8085 Microprocessor kit. Write a program using 8086 for finding the sq uare root of a given number and verify. 6. Write a program using 808 6 for division of a defined double word (stored in a data segment) by another do uble Word division and verify.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. 3. Write a program using 8086 for arranging an array of numbers in ascending order and verify. 11. 7. 15. Study of 8086 microprocessor kit 9. Write a program u sing 8086 and verify for: a. 8-bi t subtraction (display borrow) b. Write a program usi ng 8085 and verify for : a. Wr ite a program using 8085 for multiplication of two 8. 10.bit numbers by bit rotation method and test fo r typical data. Write a program using 8086 for arrangin g an array of numbers in descending order and verify. 13. Check for minimum number of additions and test for typical data. Addition of two 8-bit numbers. .bit numbers by repeated additio n method. Wri te a program to interface a two digit number using seven-segment LEDs. . Finding the largest number from an array. Use 8085/ 8086 microprocessor and 8255 PPI. Write a progr am using 8085 for dividing two 8. Addition of two 8bit numbers (with carry). Write a program for finding square of a number using look-up table and verify. b. 12. Write a program using 8085 for division of two 8. 16.

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

CSE-302 E L T 3 1 Principles of Software Engineering Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Introduction: The process, software products, emergence of software engineering, evolving role of software, software life cycle models, Software Characteristics, Applications, Software crisis. Unit-2 : Software proje ct management:Project management concepts, software process and P project metric s Project planning, project size estimation metrics, project estimation Techniqu es, empirical estimation techniques, COCOMO- A Heuristic estimation techniques, staffing level estimation, team structures, staffing, risk analysis and manageme nt, project scheduling and tracking. Unit-3 : Requirements Analysis and specific ation requirements engineering, system modeling and simulation Analysis principl es modeling, partitioning Software, prototyping: , Prototyping methods and tools ; Specification principles, Representation, the software requirements specificat ion and reviews Analysis Modeling: Data Modeling, Functional modeling and inform ation flow: Data flow diagrams, Behavioral Modeling; The mechanics of structured analysis: Creating entity/ relationship diagram, data flow model, control flow model, the control and process specification; The data dictionary; Other classic al analysis methods. Unit-4: System Design: Design concepts and principles: the design process: Design and software quality, design principles; Design concepts: Abstraction, refinement, modularity, software architecture, control hierarchy, structural partitioning, data structure, software procedure, information hiding; Effective modular design: Functional independence, Cohesion, Coupling; Design H euristics for effective modularity; The design model; Design documentation. Arch itectural Design: Software architecture, Data Design: Data modeling, data struct ures, databases and the data warehouse, Analyzing alternative Architectural Desi gns ,architectural complexity; Mapping requirements into a software architecture ; Transform flow, Transaction flow; Transform mapping: Refining the architectura l design. Unit-5 : Testing and maintenance: Software Testing Techniques, softwar e testing fundamentals: objectives, principles, testability; Test case design, w hite box testing, basis path testing: Control structure testing: Black box testi ng, testing for specialized environments ,architectures and applications. Softwa re Testing Strategies: Verification and validation, Unit testing, Integration te sting,; Validation testing, alpha and beta testing; System testing: Recovery tes ting, security testing, stress testing, performance testing; The art of debuggin g, the debugging process debugging approaches. Software re-engineering , reverse engineering ,restructuring, forward engineering. Unit-6 : Software Reliability and Quality Assurance :Quality concepts, Software quality assurance , SQA activi ties; Software reviews: cost impact of software defects, defect amplification an d removal; formal technical reviews: The review meeting, review reporting and re cord keeping, review guidelines; Formal approaches to SQA; Statistical software quality assurance; software reliability: Measures of reliability and availabilit y ,The ISO 9000 Quality standards: The ISO approach to quality assurance systems , The ISO 9001 standard, Software Configuration Management. Unit-7: Computer Aid ed software Engineering: CASE, building blocks, integrated case environments and architecture, repository. Text Book: Software Engineering A Practitioner s Appr oach, Roger S. Pressman, 1996, MGH. Reference Books: Fundamentals of software En gineering, Rajib Mall, PHI Software Engineering by Ian sommerville, Pearson Edu, 5th edition, 1999, AW, Software Engineering David Gustafson, 2002, T.M.H

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

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

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

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

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

in-Building Communication. a pplications of intelligent micro-cell Systems. Pearsons. systems. common channel sign aling. Students have to attempt any five question. TEXT BOOKS: 1. advanced intelligent network s. development of wireless networks. UNIT 3. . examples of wireless comm. pac ket ratio. wireless in local loop. Rapp aport. ISDN (Integrated Services digital Networks). INTRODUCTION TO WIRELESS COMMUNICA TION SYSTEMS: Evolution of mobile radio communications. pa ging systems. comparison of various wireless systems . performance Criteria. Interference and system capacity. McGraw Hill RE FERENCE BOOK: 1.Y. WIRELESS NETWORKING: Difference between wireless and fixed telephone net works.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. analog cellular systems. wireless local area networks. UNIT 7. channe l assignment strategies. UNIT 4. INTRODUCTION TO C ELLULAR MOBILE SYSTEMS: Spectrum Allocation. Blue tooth and Personal Area networks.C. Cordless telephone systems. digital Cellu lar Systems. FDMA. MODERN WIRELESS COMMUNICATION SYSTEMS: Second generation cellular netw orks. capacity of a cellular systems. t racking and grade off service. 2. Spread Spectrum multiple Access. UNIT 6. TDMA. space division multiple access. improving coverage and capacity. Pearson NOTE: Eight que stions are to be set -one question from each unit. t raffic routing in wireless networks. CDMA c ellular Radio Networks. Mobile Cellular Telecommunication: W. basic Cellular Systems. MULTIPLE ACCESS TECHNIQUES FOR WIRELESS COMMUNICATION: Introduction to Multiple Access. Wireless Communications: Theodore S. fixed network transmission hierarchy. handoff Strategies. ELLULAR SYSTEM DESIGN FUNDAMENTALS: Frequency Reuse. Mobile Communications: Jochen Schiller. third generation wireless networks. INTELLIGENT CELL CONCEPT AND APPLICATION: Intelligent cell concept. Operation of cellular systems. UNIT 2. wireless data services.Lee. UNIT 5.

4. implementation of Boolean functions etc. UNIT 4. UNIT 5. UNIT 3. PLAs. Modern Digital Electronics. TMH (200 0) 9. 8. sequential stat ements and process.Roth . TMH (2003). GAL. INTRODUCTION : Introduction to Computer-aided design tools for digital s ystems. architecture of a simple microcomputer system. Introduction to Digital Systems : Ercegovac. encoders. Hardware description languages. PWS (1998).at least one question from each unit. DESIGN OF MICROCOM PUTER : Basic components of a computer. structural layout and generics. conditional statements. 2. Prentice Hall 1995. Packages and Libraries. 6.P Jain. case statement Array and loops. UNIT 2.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. Operators. DESIGN WITH CPLDs AND FPGAs : Progr ammable logic devices : ROM. comparators. Design implementation using CPLDs and FPGAs RE FERENCE BOOKS: 1. VHDL STATEMENTS : Assignment statements. implementation of a simple microcomputer system using VHD L UNIT 6. logical operators. Introduction to behavioural. TMH (2002) 7. 3. Lang & Moreno. concurrent statements. Fundamentals of Digital Logic with VHDL Design : Brown and Vranesic. CPLDs and FPGA. Digita l Design and Modelling with VHDL and Synthesis : KC Chang. Demultiplex ers. component declarati on. PEEL. NOTE : Eigh t questions are to be set . Overloading. Counters etc. . SEQUENTIAL CIRCUITS DESIGN : VHDL Models and Simulation of Sequential Circuits Shift Registers. Subprograms: Ap plication of Functions and Procedures. PALs. dataflow and str uctural models. John Wiley (1999). IEEE Computer Society Press. IEEE Standard VHDL Language Reference Manual (1993). Structural Modelling. specifications. Students will be required to attempt five questions in all. 5. "VHDL-Analysis & Modelling of D igital Systems : Navabi Z. introduction to VHDL. code converters. data objects. McGraw Hill.Types of delays En tity and Architecture declaration.III Edition: R. reso lution functions. VHDL-IV Edition :Perry. "A VHDL Primmer : Bhasker. Digital System Desi gn using VHDL : Charles. decoders. COMBINATIONAL CIRCUIT DESIGN: VHDL M odels and Simulation of combinational circuits such as Multiplexers. H. clas ses and data types.

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

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

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. Design all gates using VHDL. 2. full adder 3. encoder 5. . 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. demultiplexer 4. Write VHDL programs for the following circuits. Write a VHDL program for a comparator and che ck the wave forms and the hardware generated 6 Write a VHDL program for a code c onverter and check the wave forms and the hardware generated 7. register b. Write VHDL programs for the following circuits. Write a VHDL pro gram for a FLIP-FLOP and check the wave forms and the hardware generated 8. half adder b. Writ e a VHDL program for a counter and check the wave forms and the hardware generat ed 9. check the wave forms and t he hardware generated a. Implement any three (giv en above) on FPGA/CPLD kit NOTE : Ten experiments are to be performed out of whi ch at least seven experiments should be performed from above list. check the wave forms and the hardware generated a. Write VHDL programs for the following circuits. Remaining thr ee experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus. shift register 10. decoder b. multiplexer b.

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

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

. 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.

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

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

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

the Bully algorithm. Client Server model . Distrib uted Deadlock Detection . process management in MA CH.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-3: Processes and Processors in distributed system s: Threads. Unit-4: Distributed file systems: Distributed file system Design. U nit-2: Synchronization in Distributed System: Clock synchronization. Tanenbaum. Unit-1: Introduction: Introduction to Distributed System. Students will be required to attempt five questions in all. Page based distributed shared memory. System models. Hardware and Software concepts. Distributed file system Implementation. Mutual Excl usion. Distributed Shared Memory: What is shared memory. Distributed Deadlock Prevention. Middleware and Distributed Operating Systems. ATM networks. a Ring algorithm. UNIX emulation in MACH. Atomic Transac tions. Deadlock in Distributed Systems. Consistency m odels. Processors Allocation. . Trends in Distribut ed file systems. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Election algorithm. communication in MACH. shared variables distributed shared memory.Remote Procedur e Calls and Group Communication. Design issues. Real Time Distributed Systems. Communication in distribut ed system: Layered protocols. Unit-5: Case study MACH: Introduction to MACH. PHI. Text Book: Distributed Operat ing System Andrew S. Scheduling in Distributed Syst em. Goals of Distributed s ystem.

Public Key Cryptography Standards-PKCS#7. Solving Authentication Problems. Preventing Virus Infection. Unicity Distance. The Digital Signature Standard (DSA). Cryptography and the Law. Unit-1: Basic Encry ption and Decryption: Terminology and Background: Encryption. Database Security: Security Requirements of Databases. Secure Comm unication Mechanisms such as IPSec. Properties of Arithmetic Op erations: Inverses. Patents. Characteristics of NP-Complete Problems. Se cure Socket Layer (SSL) Protocol. Types of Public Key Infrastructures. How Viruses Attach and Gai n Control. Models of Security. NP-Completeness and Cryptography. Decryption and Cry ptosystems. Stream and Block Ciphers. Polyalphabetic Ciphers such as Vigenere Tableaux. Message Integrity. Random number generation Public Key ( Asymmetric key) Encryption Systems: Concept and Characteristics of Public key En cryption System. Reliability a nd Integrity. Denial of Service. Inference Problem: Direct and Indire ct Attacks Program Security: Kinds of Malicious Code. Safe Guarding Web Servers. Hash Algorithms: Hash Concept . Certificate Au thorities and it's roles. Protection of Sensitive Data. In troduction to Ciphers: Monoalphabetic Substitutions such as the Caesar Cipher. Biometrics Authentication Mechanisms. Cryptanalysis of Polyalphabetic Ciphers. Introduction to Advance Encryption Standard (AES) Unit 3: Applied Crypt ography. Confusion and Diffusion. Sec urity Features of Ordinary Operating System. Message Digest Algorithms such as MD4 and MD5 . Convert Channels. X509 Structure of Digital Certificate. Database and Program Security: Operating Systems Security:Security Policies. Primes. Introduction to Merkle-Hellman Knapsacks . Unit-2: Secure Encryption Systems: Hard Problems: Complexi ty: NP-Complete Problems. The Meaning o f NP-Completeness.Analyzing and Strengthening of DES. Computer Crime. Key Exchange with Public Key Cryptography. Secure/Mu ltipurpose Internet Mail Extensions (S/MIME) Text Books: . Pretty Good Privacy (PGP). Rivest-Shamir-Adelma n (RSA) Encryption in Detail. Secure Secret Key (Symmetric ) Systems: The Da ta Encryption Standard (DES). Encryption Algorithms. PKI based Authentication and Kerberos Authen tication. Homes for Viruses. Fermat's Theorem. Cryptanalysis. Plain Text and Cipher Text. Access Control Mechanisms. Security Features of Trusted Operat ing System. Properties of Modular Arithmetic. Computing the inverse. Virus Signatures. Control Against Program Threats. Information Theoretic Tes ts. Greatest Common Divisor. Trade Secrets. Modula r Arithmetic. Key Escrow and Clipper. Characteristics of Good Ciph ers: Shannon Characteristics. Secure Electronic Mail: Privacy Enhanced Email (PEM) . Uni t-5: Network Security: Network Security Issues such as Impersonation. Perfect Substitution Cipher s uch as the Vernam Cipher. Introduction to Digital Signature Algorithms . Trap doors. C ryptanalysis of Monoalphabetic Ciphers. Description o f Hash Algorithms . Legal Issues: Copyrights. Unit 4: Operating System. Diffie-Hellman Algorithm. Algorithm for Computing Inverses.IT L 3 402 E T 1 P Security of Information Systems Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Java mobile codes. Firew alls Web Security: Solving Privacy Problems. Secure Hash Algorithms such as SHA1 and SHA2. Euclidean Algorithm. Protocols and Practice: Key Management Protocols:Solving Key Distributi on Problem. Secure Electronic Transaction (SET) Protocol . Message Co nfidentiality. Code Integrity. Public Key Infrastructure (PKI): Concept of Digital Certificate.

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

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

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

CSE-419 E L 4 T P Neural Networks Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Overview of biological neurons: Structure of biological neurons relevant to ANNs. Unit-2: Fundamental concepts of Artificial Neural Networks: Models of ANNs; Feedforward & feedback networks; learning rules; Hebbian learning rule, pe rception learning rule, delta learning rule, Widrow-Hoff learning rule, correcti on learning rule, Winner lake all elarning rule, etc. Unit-3: Single layer Perce ption Classifier: Classification model, Features & Decision regions; training & classification using discrete perceptron, algorithm, single layer continuous per ceptron networks for linearlyseperable classifications. Unit-4: Multi-layer Feed forward Networks: linearly non-seperable pattern classification, Delta learning rule for multi-perceptron layer, Generalized delta learning rule, Error backpro pagation training, learning factors, Examples. Unit-5: Single layer feed back Ne tworks: Basic Concepts, Hopfield networks, Training & Examples. Unit-6: Associat ive memories: Linear Association, Basic Concepts of recurrent Auto associative m emory: rentrieval algorithm, storage algorithm; By directional associative memor y, Architecture, Association encoding & decoding, Stability. Unit-7: Self organi zing networks: UN supervised learning of clusters, winner-take-all learning, rec all mode, Initialisation of weights, seperability limitations Text Books: Introd uction to artificial Neural systems by Jacek M. Zurada, 1994, Jaico Publ. House. Reference Books: Neural Networks :A Comprehensive formulation , Simon Haykin, 1 998, AW Neural Networks , Kosko, 1992, PHI. Neural Network Fundamentals N.K. Bos e , P. Liang, 2002, T.M.H 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-465 E L 4 T P Network Technology Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Overview of Internet: Address and domain Management, SNMP, Transport Lay er issues, TCP/IP, FTP, WWW undergoing technology, E mail talent, FTP, Gateway, Dial-up, SLIP/PPP Dedicated lines, Internet searching tools, gopher, Archie, Ver onica, WWW, Lynx, Mosaic, WAIS, Usenet. Unit-2: Security issues, CGI, PERL, HTML , VRML, JAVA, VB script and other internet development tools, internet networkin g TCP/IP protocols . ) Network Security and Management. Unit-3: Application Laye r Services and protocols (RPC, NFC, SMTP, FTP, TELENET), Review of LAN, Principl es of IBASE5 (Strain), Transmitter and receiver of IBASE5 (Starian), Node, LAN M anager, Software of IBASE5 Node, 10BASE5 Ethernet and 10BASE2 (Cheaper net), Twi sted pair Ethernet, Serial Communication, Connecting LANs and WANS. Unit-4: Seri al Communication Circuits, Modems, USART-Processor Interface Data Buffer Block o f 8251A, Control logic of USART, PROTOCOLS, Transmitter, Receiver, Synchronous M odems and Asynchronous Modems. SYNDET/BRKDET ion 8251A, Monitoring of 8251A, wri ting characters to be transmitted to 8251A, Monitoring of 8251A. Read status, IS DN: Technology, devices, Architecture Protocols, Flow Control Error detection an d Correction, ATM, Technology, Inter Networking SDH/SONET. Text Book: Computer N etworks by Tanenbaum, 2003, PHI. Computer Networks by Black, 1995, PHI. Referenc e Books: Data communication & Networking by Furouzan, 2000, TMH. Data and Networ k communications by Miller (Delmer) Communication Networks: Fundamentals Concept s & Key Architectures by Alberto Leon, TMH 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.

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

the unifi ed approach. M GH. Suresh K. object oriented systems dev elopment life cycle. super sub class relationships. refining attributes. UML object constraint language. use case driven object oriented analysis. Grady Booch. Addison Wesley Object Oriented Softw are Engineering by Subhash Mehta. Object Oriented Modeling and Design. Rumbaugh et. 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. Unit-4: Object oriented de sign process. Ivar Jacobson. A.. view layer interface design.al. packages an d managing classes. Object Orien ted analysis and Design. cl ass visibility. responsibilities and collaborators. Rumbaugh metho dology. different approaches for identifying classes. attribut es and methods. designing classes: The process. object relationships and associations. designing interface objects. Ali Bahrami. class hierarchy. object persistence. corollaries. . Galgotia Publ. object oriented desig n philosophy. Jacobson Methodology. 1995. design patterns. Ma cro and Micro level interface design process Text Book: Object Oriented software Engineering. identifying object relationships. 1995. meta classes. Frameworks. designing methods ad protocols. aggregations and o bject containment. obje ct classification. unified modeling language (UML). theory. Software development process object oriented systems develo pment: a use case driven approach. Unit-2: Methodology for object oriented desig n: Object modeling technique as software engineering methodology. Unit-3: Object Oriented Analysis: Analysis process. PHI. classes . class responsibilities. Reference Books: Object Oriented systems development.1997. polymorphism. Unit-1: Review of object oriented systems: Design objects. inhe ritance. Booch Methodology. Patterns. use-case model. design axioms. Addison We sley. object responsibilities.CSE-423 E Object Oriented Software Engineering L 4 T P Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. 1999. Basandra.part of relationships aggregat ion.

properties. properties of the region of convergence.PHI 2. changin g the sampling rate using discrete time processing. UNIT5. DISCRETE-TIME SYSTEMS : Classification.EE-407-E L T P 3 1 0 DIGITAL SIGNAL PROCESSING CLASS WORK : EXAM : TOTAL : DURATION OF EXAM: 50 100 1 50 3 HRS UNIT1. applications of Z-transform. Digital Signa l Processing: Alon V. sampling rate conversion. Stud ents have to attempt five questions. PHI 2.at least one from each unit. MULTIRATE DIGITAL SIGNAL PROCESSING: Introduction to m ultirate digital signal processing. Digital Signal Processi ng: Salivahanan. Digital Signal processing(II-Edition): Mi tra. discrete time random signals. multistage decimator and interpolators. digital filter banks. infinite impulse response (IIR) system. filter structures. TMH NOTE: Eight questions are to be set . Oppenhelm. BASICS OF DIGIT AL FILTERS : Fundamentals of digital filtering. analysis of f inite word length effects in DSP. properties of the Z-transform. D igital Signal Processing : Proakis and Manolakis. Z-TRANSFORM : Introdu ction.TMH REFERENCE BOOKS: 1. UNIT4. properties of Fourier transform. frequency domain represent ation. . DSP algorithm implementation consideration. i nversion of the Z-transform. time i nvariant system. UNIT6. various types of digital filters . DISCRETE-TIME SIGNALS: Signal classifications. representation of sequences by Fourier transf orm. Ap plications of DSP. finite impulse Response (FIR) system. SAMPLING OF TIME SIGNALS: Sampling theorem. TEXT BOOKS : 1. energy and p ower theorems. UNIT2. bi-linear tra nsformation and backward difference methods for IIR filter design. f requency domain representation of sampling. design techniques of digital filters : window technique for FIR. reconstruction of band limited signa l from its samples. discrete time processing of continuous time signals. time domain representation. application. Vallavaraj and Gnanapriya. UNIT3.

UNIT III Punctuation and Mechanics : End Punctuation. They. find themselves competing for job/ P.Redman.prepared for such tests.The real challenge before the students starts when they cross the threshold of t he college after completing their degree. Verbal ability forms a major portion of these tests. voice and subject. discussion on topics of contemporary relevance. synonyms and h omonyms. the common run of such tests as C AT.Extempore. Word Punctuation. sequencing of ideas). Dof f/jones. Delhi. Sentenceconstructions (unity. Clauses. . Working with Words by R. 2. And in the context of LPG. Foundation Books (Cambridge university Press).consistency of number and person. The course would e xpose students to almost all variety of items. tense. Gerunds. verbal idioms. problems involving modifiers (dangling and misplaced modifiers). the students with engineering backgroun d find themselves almost under. Without sound language ski lls and its semantic-syntactic know-how. sequence of tenses. Meanings into Words Upper Intermediate Students Book. spelling. conciseness. Internal Punctuation. logic and consistency. this cutting edge competence becomes im perative. Findings and Conclusions. avoidance of choppy and rambl ing sentences. SUG GESTED READING: 1. COUR SE CONTENT: UNIT I Remedial English: Parts of speech. GMAT etc. and no professional education can afford to overlook this aspect. this course is proposed to make them technically proficient i n handling the language skills required in competitive exams. Sentenc e errors . prefixes and suffixes. With this difficulty of students in mind.etymological roots.agreement between verb and subject. mood.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 H rs L T P 4 . UNIT V Presentation: Oral presentat ion . Cambridge Univer sity Press. London. pronoun and antecedents. Shi fts in point of view . Deduction and Analogy. UNIT II Vocabulary: Met hods of building vocabulary . Illustration and Inductive Logic. through various entrance tests and interviews. participles and i nfinitives. all of a sudden. Commonl y used foreign words and phrases.G.Gairns and S. interviews. UNIT IV Comprehension : Abstracting. Parallelism. words often confused. Observations. Omissions and mixed constructions. Degrees. Summarising. one word substitutes.

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

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

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

will have to attempt five questions in all. .

John Wil ey & Sons. ROLAP vs MOLAP.Gassey. data warehouse back end to ols. tuning and testing of data w arehouse. Multimedia databases. 2001. W. complex aggregation at multiple granularities.Inman. Building the Data Warehouse.C. modelling OLAP data. John Wiley & Sons.Klelly. W. Multidimensional data mode. Unit-6: Data mining techniques: Association rules. John Wiley & Sons. Unit-4: Data mining definition & task. . Unit-2: Data ware house process & architecture. Spatial databases. 1996. mining Text Databases and mining Word Wide Web.Concepts & Techniques.2001.L. Morgan Kaufma nn. Jiawei Han & Micheline Kamber. Unit-5: Data mining query languages. data mi ning techniques. Data War ehousing.H Ionhman. Time series and Sequence data. data mining languages and standardisation o f data mining. Pearson. types of OLAP.H.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. 2000. computation of d ata cubes. pattern present ation & visualisation specification. Students will be required to attempt five qu estions in all. . Mc Graw Hill. Support Victor Machines and Fuzzy techniques. usage and trends. Arun Pujar. da ta specification. snowflakes and fact constellations. 1997. Unit-7: Mining complex data objects. Data cubes. Developing the Data Warehouses. Unit-3: Data warehouse implementation. Metadata. Managing the Data Warehouses. hierarchy specification. Schemas for Multidi mensional Database: stars. Sam Anahory & Dennis Murray. Mc Graw Hill. data warehouse manager. Data Miniing and OLTP. Data warehousi ng System. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Pieter Adriaans & Dolf Zantinge. Inman. Text Books: Data Warehousing In the Real World. Refere nce Books: Data Mining. University Press. specifying knowledge.H. Data Mining Techniques. 1997. 1997. OLTP vs OLAP. Unit-1: Data warehousing Definition. Alex Berson. distributed and virtual data warehouses. KDD versus data mining. DBMS vs data warehouse. D ata marts. W. serve rs. OLAP queries manager. Rough Sets. tools and applications. 3-Tier data warehouse architecture. Mallach. Pearson Data M ining. Hyderbad. Decision tree knowledge discovery through Neural Networks & Genetic Alg orithm. C. Clustering tec hniques.

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

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

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

rlog Note: Eight questions will be set in all by the examiners taking at least one question from each unit. tutoring and authoring sy stems. 1989. pragmatics: word level representation of natural languages prosoty & natural languages. Unit-3: Computat ion linguistics: recognition and parsing of natural language structures: ATN & R TN. Earley & Tomitas algorithm. Unit-2: Formal languages and grammars: chomsky hierarchy. Gazder. Introduction of Formal Language Theory. Text Book: Natural Language Understanding ub. cummings P as a cognitive process . user interfac es. 1988.. AW Natural Language processing in . Springer Ve . natural language querying.CSE-425 E L 4 T P Natural Language Processing Class Work: 50 Exam: 100 Total: 150 Duration of Exam : 3 Hrs. graph models and optimization. syntax. Man-Machine interfaces. Comp. ambiguous grammars. Students will be required to attempt five questions in all. Unit-5: App lication of NLP: intelligent work processors: Machine translation.Benjamin-1995. speech recognition. Ltd. James Allen . Reference Books: Language d 1983. resolution of ambiguities. Unit-4: Seman tics-knowledge representation semantic networks logic and inference pragmatics. prolog for natural language semantic. semanti cs. Unit-1: Components of natural language processing: lexicography. commercial use of NLP.General techniques of parsing: CKY. Terry Winogra prolog G. Addison Wesley Mdlj Arbib & Kfaury. Left-Assoc iative grammars.

Robert G. develop forms for da ta collection and information dissemination. Jawade kar. mana gerial overviews. de termine the degree of automation of each operation. PHI Reference books: M anagement Information System. project managem ent of MIS detailed design . McGraw Hill Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Unit-5: Implementation evaluation and mai ntenance of the MIS: Plan the implementation. evaluate the MIS control and maintain the system. computer related acquisitions. Stud ents will be required to attempt five questions in all. Unit-3: Conceptual system design: Define the problems. Procurem ent Management System. RDBMS and Telecommunicat ion. Pitfalls in MIS development . cut-over. Tata McGraw Hill. Management information and the systems approach. Unit-4: Detailed system desi gn: Inform and involve the organization.IT-471 E L 4 T P Management Information System Class Work: 50 Exam: 100 Total: 150 Duration of Ex am: 3 Hrs. . Information System for Modern Management (3rd editi on). develop the files test the system. acquire floor space and plan space layouts. tr ain the operating personnel. prepare the conceptual design report. C R M . TMH Management Information System by Davi s Olson Mac Graw Hill Management Information System by Stasllings. Unit-1: Foundation of Information System: Introduction to Information System and MIS. organize for implementation. Alter Addison We sley Introduction to Information System. MIS organization within company. DBMS. computer hardware & software. Claggett. S. inform and involve the organ ization again. inputs outputs and processing. sketch the detailed operating sub systems and information flow. document the det ailed design revisit the manager user. ha rdware and tools propose an organization to operate the system. develop procedures for implementation. establish system constraints. O Brian. Text Books: Management Information System by W. define the sub systems. Decision support and decision making systems. Ross & James R. Supply Chain Management. early system testing. software. identify dominant and trade of criteria. systems approach.(Maxwell Mc Mi llman Publishers) Information System. document the system. 2002. . Unit-2: Information Technology: A manager s overview. Loel E. determine information needs determine informati on sources. a Management Perspective. aim of detailed design. the system s view of business. Unit-6: Advanced Concepts in Information Systems: Enterprise Resources Management(ERP). Murdick. set systems objectiv e. develop alternative conceptual design and select one document the sy stem concept.

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 : Introducti on to Systems and Network Administration: The Scope of Systems and Network Admin istration, The Goals of Systems and Network Administration, System Components an d their Management: Operating Systems: Windows and Unix Variants, File Systems a nd Standards (UFS, NFS, NTFS), Processes and Job Control, Privileged, User and G roup Accounts, Logs and Audits, Systems Performance Tuning: Host Management: Boo ting and Shutting down of an Operating System, Formatting, Partitioning and Buil ding 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, S uperuser/Administrator Privileges, User Management, Adding/Removing users, Contr olling User Resources, Disk Space Allocation and quotas, Process Management and Monitoring, Scheduling Processes, Killing/Stopping processes, Restarting a Proce ss, Monitoring Process Activity, Maintaining Log Files, File System Repair, Back up and Restoration, , Handling Man Pages/Help System, Kernel Customization, Inte grating Multiple Operating Systems, System Sharing, User IDs, Passwords and Auth entication. UNIT-2 : Network Administration: Introduction to Network Administrat ion Approaches, Addressing and Subnetting : Fixed Vs Variable Masks, VLAN Princi ples and Configuration, Routing Concepts, Static and Dynamic Routing, Routing Pr otocols: 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 S erver, Configuring a Proxy Server, TCP/IP Troubleshooting: ping, traceroute, ifc onfig, 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 a nd Prevention of Denial of Service (DOS) Attacks, Automatic Identification of Co nfiguration Loop Holes, Security Information Resources: CERT, Installing and Upg rading System Software, Use of Scripting tools: Shell Scripting, Perl/Python Scr ipting, Use of Make Option UNIT-4 : Security Planning, Categories of Security: C1, C2, C3, C4, password sec urity, 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), Cr aig Hunt, O Reilly and Associates Inc., 2002. Windows 2000 Administration , Geor ge Splading, 2000, McGraw-Hill. Linux Network Administrator s Guide , Olaf Kirch and Terry Dawson, (2nd Edition), O Reilly and Associates Inc., 2000, (Shroff Pu blishers and Distributors, Culcutta),

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

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

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

summarised or to be analysed. Also they can be asked to face interviews in mock Situ ations. (B) PRACTICAL: 40 Marks There w ill 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-mee ting or Group Discussion. The time duration for this exam for every batch of 15 students will be o f 3 hrs. this test will look for how well the components of body language and para-language are integrated with t he linguistic means. The questions may be set on the theory part of th e elements from the units or students may be given some mock situations to be wo rked on. The students are required t o attempt any three questions. fluency and spontaneity of the language. Besides evalu ating clarity. For the unit on Reading Skills. A panel of examiners appointed by the University will evaluate the oral competence of the students. they may be given a manageable short te xt to be reviewed.

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

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

Structure of management information and TMN information model. HFC. Students will be required to attempt five ques tions in all. narrow band Unit-4: Security: Hash function Authentication: Protocols Digital Signature stan dards. Unit-2: Stream Ciphers: Rotor based system shift register based system s Design considerations for stream ciphers Cryptanalsysis of stream ciphers Comb ined eneryption and encoding. Web security: Secure Socket Layer & Transport Laye r security. SNMP v1. ASN Text Books: Cryprotog raphy and Network Security: Principal & Practices. TMN management lay ers. Mani (AWL) S NMP.H. RM ON1 & 2. PHI Network Management Principles & Practices by Subramanian. Public key systems Knacksack systems RSK Diffle Hellman Exchange Authenticatio n and Digital signatures. Unit-1: Introduction: Codes and Ciphers Some Classifical systems Stiatistical th eory of cipher systems-Complexity theory of crypto systems Stream ciphers. Management servicing and functions. modes of use of DES . D lack (MGH) Note: Eight questions will be set in all by the examiners taking at l east one question from each unit. Block Ciphers DES and variant. 2nd Edition by Upper Saddle R iver. data Compressio n technique. Block ciphers. IP Security: Architecture. DSL). Willian (AWL) Reference Books: SNMP: A Guide to Network Managemen t (MGH) Telecom Network Management by H. Unit-5: Telecommunication Network Architecture. Firewalls Design principle. Stalling. . Management information Model. Secure electronics transactions. Unit-3: System Identific ation and clustering: Cryptology of speech signals and wide band systems Analogu e & Digital Systems of speech encryption.ELECTIVE-3 IT-464 E L 4 T P Network Security & Management Class Work: 50 Exam: 1 00 Total: 150 Duration of Exam: 3 Hrs. Electronics Mail Security PGP (Pretty Good Privacy) MIME. establi shed systems. Wang (MGH) Network Management by U. Elliptic curve based systems. Authentication Leader. SNMP2 & SNMP3. Broadband Network Management (ATM. Encapsulating sec urity Payload Key Management.

The Process View. Goals. Grady Booch. Types of Relationships. Polymorphism. Association. Identity of Objects. Inheritance. Unit-6: The Itera tion Planning Process: Benefits.Relationships . Designing for Inheritance. Transitions. Ivar Jac obson. Visual Modeling with Rational Rose 2000 and UMLBy T erry Quatrani Foreword by Grady Booch. States Unit5: Checking the Model: Making the Model Homogeneous.CSE-412 E L 4 T P Object Oriented Systems Development Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Types of Interaction Diagrams. Text Books: UML User Guide . Swimlanes Unit-3: Identifying Classes . Package Relationships. and Documenting t he Iteration. Capabili ties of Rational Rose Case Tool. Consistency Checking. Classes. Introductio n to Rational Rose CASE tool: Introduction Importance of Rational Rose. Scenario Walk-through. Usage of UML. Design the User Interface. Packages. Naming Relationships. Reflexive Relations hips.. Testing. Creating and Documenting Clas ses in rational Rose. Overview of UML Capabilities. Aggregation. Eliminating Classes.Packages and drawing a Class Diagram: State. The Deployment View. Elaboration Stag e. The Emergence of Patterns. Coding. Splittin g Classes. 2000 Reference Books: . Eve nt Tracing. Decision Points. The 4+1 view of Architecture.Diagrams in Ratio nal Rose. Designing Attribut es and Operations. Introduction to Unified Modelling Languag e (UML): History of UML. States and Tran sitions. Association and Aggregation Relationships . Visual Modelling using Unified Modelling Language (UML): What is Visual Modelling? Object Oriented Modelling. James Rumbaugh. Creating Attributes & o perations and documenting them. Drawing a Class Diagram Specifying Relationships : The Need of Defining Relationships. The Logical view. Activity Diagrams Activities. Behavi our. Associatio n Classes. Analysing Object Behaviour: Modelling Dynamic Behaviour. Enc apsulation. Combining Classes. Use Case Relationships. Finding Relationships. Additional Use Case . Advantages of Obj ect Oriented Methodologies over Traditional Methodologies. The Use Case view. Objects. Documentation Review. The Component V iew. Unit-1: Introduction: Review of the Traditional Methodologies. 2000. Adding Behavi our and Structure: Representing Behaviour and Structure. Phases and Iterations. Role Names. Transition Stage. Unit-2: Introduction to Objectory Software Deve lopment Process: Introduction. Inheritance. Benefits. Adding Design Classes. Addison Wesley. Use Case Diagrams: Cr eating Main Use Case -. Creating Use Case Diagrams: Actors and Use Cases. Creating Relati onships in Rational Rose Unit-4: Discovering Object Interactions: Documenting Sc enarios using Interaction Diagrams. Multiplicity Indicators. Stereotypes and Classes. Displaying attributes and operations. Construction Stage. Designing the System Architecture : The need f or Architecture. Designing Relationships.

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

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

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

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

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

2. Tata M acgraw Hill Publication. Pattanshetti. Chand & Co. New Delhi. Public Service Announcements. B usiness Correspondence and Report Writing by R. IV Edition. Executive Summary Proposals and project Proposals. . Proposal Formats.The course proposes to help students develop business and technical communicatio n competence. Tenders. Credit and Collection letters. Agenda and Minutes of Meeting.. Writing problem-Solving Prop osals. 4. Shruter.S. Pa ttern and formats of Reports. Function. New Delhi. E-mail and Netiquette format. Quotations. and Formal Reports. South-Western College Publishing. Unit-IV Public Relatio ns and Advertising Documents: Press Releases. New Delhi. SUGGESTED READING: 1. Sales letters. Notes. Typical Business Reports. Unit-II Business Reports and Proposals: Importance. Unit-III Meetings: Wri ting of Memorandum. Tata Macgraw Hill. Cincinnati.C. Designing of Classified and Display Advertis ing copies. The inevitability of introducing this course to Engineering students is embodie d in that it has comparatively a high concentration of certain complex writing t echniques and procedures. Business Communication: Process & Product by H ary Ellen Guffey. Sharma & Krishna Mohan.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 . Ramesh and C. Adve rtising Strategy and its objective. Application Letters for vacant situatio ns with emphasis on Resumes and Curriculum Vitae. claim and adjustment letters. Orders. style and tone. Report Organisation and Presentation. R. Effecti ve Letters in Business by Robert by C. COURSE CONTENT: Unit-I Business correspondence: Characteristics and Formats of B usiness letter.C. 3. Effective Business English and Correspond ence by M. It focuses on writing skills and strategies for specific purposes.

One question will cover the theoretical aspect of business letter writing and will carry 10 marks. Anncree. 9. Printed in India by Replika Pr ess Pvt. Cambridge University Press. Un it-II: 35 Marks There will be two questions from this unit. International Bu siness English by Leo Jones & Richard Alexander. One question will co ver the theoretical aspect of report/proposal writing and will carry 15 marks. Delhi. Orient Longman. Lon don.W.K. Wing & D. 10. Unit-III: 15 Marks Th ere 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 g iven in the exam. Writte n Communication in English by Sarah Freeman. There will be enough choice taki ng care of the justice to be given to both the aspects of the letter writing. Inc. English Business Letters by F. Cambri dge University Press. The other question will be on writing the letter in a proper for mat on a subject given and will be of 20 marks. 8. T he other question will be on preparing the report/proposal on a topic/subject gi ven and will be of 20 marks. SCHEME OF EXAMINATION: There will be six questions in all. U. 7. All questions will be compulsory and will have enough i nternal choice. 6. General and Business English by Sweet Stephen. How to Write and Present Technical Information. One part will be on theory and will be of 5marks and the other will require the drafting an advertisement copy of a produ ct or service or a public announcement and will carry 15 marks.Strategies for Engineering communication. There will be enough choice taking care of the just ice to be given to both the aspects of the report writing... Susan St evenson/Steve Whitmore. John Wiley and Sons. Sides. Ltd. covering all the units. The question can be split into parts. . Orient Longman. Charles H.5. Unit-I: 30 Marks There will be two questions from this unit. Unit-IV: 20 Marks There will be one question having two parts. Sir Issac Pitman & Sons Ltd.

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

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

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

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

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

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

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

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

No question will be based on literary theory. Delhi. 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 TEX TS BOOKS: 1. I t will have four reference to context type questions covering all the texts. 2. devoid of human values.Technological skills. Besides the first. political.HUM-454-E INDIAN ENGLISH WRITING SEMESTER VIII (ELECTIVE) Class Work : 50 Marks Theory : 1 00 Marks Total : 150 Marks Duration of Exam: 3 Hrs L T P 4 . th ere will be eight more questions (covering all the four texts) out of which the students will be required to attempt any four. tend to turn professionals into me re automatons. . Delh i/Faber&Faber. Penguin Book s. Th is course. Fire and Rain by Girish Karnard. 3. choosing at least one question fr om each text. Delhi. Delhi. The questions will be so framed as to evaluate the knowledge of th e text for various social. Penguin Books. Her e students first hand reading of the texts will be tested. 4. It is imperative to sensitise them to social and human values. OUP. SCHEME OF EXAMINATION: The students will be required to attempt five questions i n all. Ravi Dayal. All questions will carry equal marks. Delhi. Question no 1 will be compulsory. Seven Steps in the Sky by Kundanika Kapaadia. cultural and human issues from readers poi nt of view. through formal exposure to literature. Countdown by Amitav Ghosh . aims at achieving this much-ne eded holistic balance. English August by Upamanyu Chatterjee.

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

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

e. 1. MS Windows. 5.g. Information architecture. Dialog input and output techniques and purposes . Three pillars of design . Computer architecture. sound and speec h output. HCI . Macintosh. Human cognitive and sensory limits 2. navigation and orientation. Unit 1: Introductions & overview of HCI. Performance characteristics of humans and syste ms. color ra nge of devices Unit 3: Interaction models and metaphors: Use of abstract metapho rs for describing interface behavior. Mechanics of particular devices. Techniq ues for task analysis. human-system interaction: Input an d output devices. User-centered design overview. Implic ations for software organizations . Computer graphics . 3. Structuring t he information. Exam ples of accessibility adaptations. Hypermedia and WWW Unit 4: P rinciples guiding well-designed human-system interaction: Paradigms for interact ion. Wireframes. Reconciling UCD and usability testing Unit 6: The design process . Use cases. Dialog issues: response time. Screen layout issues.. comps. Mo ckups. Wind ows manager models.history and intellectual root Human information processing limitatio ns. control. multimedia a nd non-graphical dialogues. human decision making.CSE 418 L 4 T P Human Computer Interaction Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. User and process flows. actual). Principles to support usability. scenarios. Layers model of architecture of design and windowing systems. What s driving software accessibility. color maps. Color representation. X. Human memory Human problem solving Skill acquisition Users conceptual models (me ntal models) Decision making Unit 2: Computer systems and user interfaces. Color issues. standards. Use of metaphors to support user understan ding. Accounting for users with disabilities Uni t 5: The design process overview: The typical software development lifecycle (id ealized vs.task and user needs analysis: Task analysis definition. 4. 6. Di alog interaction: types and techniques. Other methods of conveying structure and function Unit 8: Designin g for universal access: What is accessibility? What is accessible software. Sources of information Unit 7: The design process making use of task and user data for system design. Speech input.: History of computer user interf aces. lo ok and feel . Us ability engineering overview.

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

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

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