B.

Tech Syllabus – II, III & IV Year

Computer Science Engineering

Shri Balwant Institute of Technology
(Approved by AICTE, Ministry of HRD, Govt of India & DTE, Govt of Haryana and Affiliated to M. D. University, Rohtak)

Sonepat

M.D. UNIVERSITY, ROHTAK
Scheme of studies & Examination Bachelor of Engineering (Computer Science & Engineering) Semester-III Modified ‘E’ Scheme effective from 2006-07

Teaching Schedule S. No Course No. Subject L Mathematics III (Common for all Branches) Data Structures & Algorithms (CSE,EL,IT,EI) Discrete Structures (CSE,IT) Digital & Analog Communication (CSE,IT) Digital Electronics (CSE,IT) (Common with 4th Sem. – EE,EL,EI & IC) Economics (Common for all branches) PC Lab (CSE,IT) Data Structures & Algorithms Lab (CSE,IT) Digital Electronics Lab (CSE,IT & Common with 4th Sem. – EE,EL,EI & IC) TOTAL T P Total

Examination Schedule (Marks) Marks of Pract Theory Total Class ical works 50 50 50 50 50 50 50 50 25 100 100 100 100 100 100 50 50 25 150 150 150 150 150 150 100 100 50

Duration of Exam (Hours)

1 2 3 4 5 6 7 8 9

MATH-201-E CSE-201 E CSE-203 E EE-217 -E EE-204-E HUM-201-E IT-201-E CSE-205-E EE-224-E

3 3 3 3 3 3 -

2 1 1 1 1 1 -

3 3 2

5 4 4 4 4 4 3 3 2

3 3 3 3 3 3 3 3 3

18

7

8

33

425

600

125

1150

Note: 1. Students will be allowed to use non-programmable scientific calculator. However, sharing of calculator will not be permitted in the examination. 2. The practical hours for the subjects IT-201 E (PC Lab) and CSE-205-E (Data Structure & Algorithms Lab.) has been increased from 2 hours to 3 hours. The marks of class work as well as practical examination in these subjects have been increased from 25 each to 50 each. Thus the total marks for these subjects shall be 100 in place of 50 from the session 2006-07. 3. The grand total of semester marks shall be 1150 in-place of 1050 marks.

M.D. UNIVERSITY, ROHTAK
Scheme of studies & Examination Bachelor of Engineering (Computer Science & Engineering) Semester-IV Modified ‘E’ Scheme effective from 2006-07

Teaching Schedule S. No. Course No. Subject L Data Base Management Systems (CSE,IT) Programming Languages (CSE,IT) Theory of Automata & Computation Object-Oriented Programming using C++ (CSE,IT) Internet Fundamentals (CSE,IT) Computer Architecture and Organization (CSE,IT and Common with 5th Sem. EL,EI,IC) Data Base Management Systems Lab. (CSE,IT) C++ Programming Lab. (CSE,IT) Internet Lab. (CSE,IT) General Proficiency TOTAL T P Total Marks of Class work 50 50 50 50 50

Examination Schedule (Marks) Theory Practical Total

Duration of Exam (Hours)

1 2 3 4 5

CSE-202 E CSE-204 E CSE-206 E IT-202-E CSE-208 E

3 3 3 3 3

1 1 1 1 1

-

4 4 4 4 4

100 100 100 100 100

-

150 150 150 150 150

3 3 3 3 3

6

CSE-210 E

3

1

-

4

50 50 25 25 50 450

100

-

150

3

7 8 9 10

CSE-212E IT-206-E CSE-214 E GPCSE202 E

18

6

3 2 2 7

3 2 2 31

600

50 25 25 100

100 50 50 50 1150

3 3 3

Note:
1. Students will be allowed to use non-programmable scientific calculator. However, sharing of calculator will not be permitted in the examination. The marks of class work as well practical examination in the subject CSE-212 E (Data Base Management Systems Lab.) has been increased from 25 each to 50 each. Thus the total marks for the subject shall be 100 in place of 50 from the session 2006-07. 2. The grand total of semester marks shall be 1150 in-place of 1050 marks. 3. Each student has to undergo practical training of 6 weeks during summer vacation and its evaluation shall be carried out in the V semester will be implemented from 2006-07.

Lab (Common with IT–IV Sem) Microprocessors and Interfacing Lab. Subject Marks of Class work 50 Examination Schedule (Marks) Theory Practic al Total Duration of Exam (Hours) L T P Total 1 CSE-301 E 2 EE-309-E 3 4 5 CSE-303 E CSE-305 E CSE 307 E 6 7 IT-204-E CSE-309 E 8 CSE-311 E 9 IT-208-E 10 11. 3. (CSE.V Modified ‘E’ Scheme effective from 2007-08 Teaching Schedule S.IT.IT) Web Development & Core JAVA Lab. The course number of subject of O. D.S.CSE. EEE. Thus the total marks for the subjects shall be 100 in place of 50 from the session 2007-08. UNIVERSITY. F are to be awarded.M. ROHTAK Scheme of studies & Examination Bachelor of Engineering (Computer Science & Engineering) Semester . (Common with 6th Sem. 12 EE-329-E CSE-313 E CSE-315 E Principles of Operating System (CSE.IT) Microprocessors and Interfacing (EL. Lab. B.e. viva-voce. 2007-08. Course No.IT. (EL. IT) Practical Training-I TOTAL 3 1 - 4 100 150 3 3 1 - 4 50 100 - 150 3 3 3 3 1 1 1 - 4 4 50 50 50 100 100 100 - 150 150 150 3 3 3 - 4 3 - - 3 3 3 50 50 100 - 50 150 100 3 3 - - 2 2 25 - 25 50 3 - - 2 2 25 - 25 50 3 18 5 2 2 2 13 2 2 2 36 25 25 450 600 25 25 150 50 50 1200 3 - Note: 1. The grand total of semester marks shall be 1200 in place of 1150 marks. 4. Students will be allowed to use non-programmable scientific calculator.IVSem) Computer Graphics Lab. IC.S.EI. Lab. report and certificate of practical training obtained by the student from the industry. will be based on seminar. C.f. . (CSE. undergone at the end of IV semester. 5. The marks of class work as well practical examination in the subject CSE-311 E (Web Development & Core Java Lab. However. EEE. 2.IT) Analysis & Design of Algorithms Web Development (Common with IT – VI Sem) Multimedia Technologies (Common with IT.EI. IC. sharing of calculator will not be permitted in the examination. AEI) Computer Graphics (CSE. has been changed from CSE-308-E to CSE-313-E and will be implemented w. Assessment of Practical Training-I.IT) Multimedia Tech.CSE.) has been increased from 25 each to 50 each. No. A student who is awarded ‘F’ grade is required to repeat Practical Training. According to performance letter grades A. AEI) O.

However. Thus the grand total marks of the semester shall be 1050 in place of 1200. 2.IT) Computer Networks (CSE. ROHTAK Scheme of studies & Examination Bachelor of Engineering (Computer Science & Engineering) Semester .e. EL) Digital System Design (EL. IT & Common with 8th Sem. The practical hours for the subjects CSE-306 E (Intelligent System Lab. sharing of calculator will not be permitted in the examination. Students will be allowed to use non-programmable scientific calculator. the session 2007-08.EI.VI Modified ‘E’ Scheme effective from 2007-08 Examination Schedule (Marks) Marks of Class work 50 50 50 Practi cal Duration of Exam (Hours) Teaching Schedule S. Subject L T P Total Theory Total 1 2 3 CSE-302 E CSE-304 E IT-305 E 4 IT-303 E 5 6 7 8 9 EE-402-E EE-310-E CSE-306 E EE-330-E GPCSE-302E Principles of Software Engineering (CSE.CSE. IC. No.e. – IT.EE. Each student has to undergone practical training of 6 weeks during summer vacation and its evaluation shall be carried out in the VII semester. this session 2007-08. Course No. (EL.f. EL & Common with 5th Sem.D. – IT) Wireless Communication (CSE. (CSE.S.IT) Digital System Design Lab.EI. IC.CSE. UNIVERSITY.M. AEI) Systems Programming & System Administration (Common with 5th Sem. AEI) Intelligent Systems Lab. .f.) and EE-330 E (Digital System Design Lab) have been increased from 2 hours to 3 hours w. 4. 3. lab. AEI) General Proficiency TOTAL 3 3 3 1 1 1 - 4 4 4 100 100 100 - 150 150 150 3 3 3 3 1 4 50 100 - 150 3 3 3 1 8 1 1 6 3 3 6 4 4 3 3 30 50 50 25 25 50 400 100 100 600 25 25 50 150 150 50 50 50 1050 3 3 3 3 3 - Note: 1. is deleted w. O.IT) Intelligent Systems (CSE.

. According to performance. Subject L CSE-401 E CSE-403 E CSE-405 E CSE-407E CSE-411-E CSE-409-E CSE-413 E CSE-415 E Advanced Computer Architecture Software Project Management (CSE. HUM-451-E HUM-453-E HUM-457-E HUM-455-E PHY-451-E PHY-453-E ME-451-E Subject Language Skills for Engineers Human Resource Management Business Communication Entrepreneurship Nano technology Laser Technology Mechatronics Systems 8 9 10 11 12 13 14 Course No. No. F are to be awarded.M. IT) PROJECT Mini Project TOTAL 3 3 3 4 3 16 T 1 1 1 1 4 P 3 3 4 2 12 Total 4 4 4 4 4 3 3 4 2 32 Examination Schedule (Marks) Marks Pract Total of Class Theory ical work 50 50 50 50 50 25 25 50 350 100 100 100 100 100 500 50 50 100 150 150 150 150 150 75 75 50 950 Duration of Exam (Hours) 1 2 3 4 5 6 7 8 9 3 3 3 3 3 3 3 3 - List of Open Electives S.IT) Compiler Design OPEN ELECTIVES-1* Neural Networks Compiler Design Lab. 3. ROHTAK Scheme of studies & Examination Bachelor of Engineering (Computer Science & Engineering) Scheme of studies / Examination SEMESTER VII Modified ‘E’ Scheme effective from 2006-07 Teaching Schedule S. *Student will be permitted to opt for any one elective run by the other departments. 1 2 3 4 5 6 7 Course No. complete the design/procure the material/start the fabrication/complete the survey etc. carried out at the end of VI semester. UNIVERSITY. Visual Programming Lab. The choice of the students for any elective shall not be a binding for the department to offer. However. sharing of calculator will not be permitted in the examination. will be based on seminar. letter grades A. No. Project load will be treated as 2 hours per week for Project Coordinator and 1 hour for each participating teacher. if the department does not have expertise. viva-voce and project report of the student from the industry. depending upon the nature of the problem. . B. CSE-451-E CSE-303-E IC-455-E IC-403-E CH-453-E IT-471-E IT-204-E Subject Artificial Intelligence & Expert Systems Computer Graphics Intelligent Instrumentation for Engineers Embedded Systems Pollution & Control Management Information System Multimedia Technologies Note: 1. However. Course No. Project will commence in VII semester where the students will identify the Project problem. C. (CSE. Assessment of Mini Project. A student who is awarded ‘F’ grade is required to repeat Practical Training. Project will continue in VIII semester. Students will be allowed to use non-programmable scientific calculator.D. 4. 2. the departments will offer only those electives for which they have expertise.

UNIVERSITY. a student will select a topic from emerging areas of Computer Sc. ELECTIVES I DEPT. which has been commenced by students in VII semester will be completed in VIII semester. HOD of concerned department and external examiner appointed by University shall carry out the evaluation of the student for his/her General Fitness for the Profession. IT) INDEPENDENT STUDY SEMINAR PROJECT GENERAL FITNESS FOR THE PROFESSION TOTAL T P Total Examination Schedule (Marks) Marks Pract of Theory Total Class -ical work 50 50 50 50 50 50 50 50 400 100 100 100 100 400 50 100 100 250 150 150 150 150 100 50 150 150 1050 3 Duration of Exam (Hrs) 1 2 3 4 5 6 7 8 CSE-402 E CSE-404-E 3 3 4 4 14 1 1 2 3 4 8 15 4 4 4 4 3 4 8 31 3 3 3 3 3 DEPT. sharing of calculator will not be permitted in the examination 5) *The subject GFCSE-410-E (General Fitness for the Profession) code has been changed to GFCSE-402-E and will be effective from 2006-07. ROHTAK Scheme of studies & Examination Bachelor of Engineering (Computer Science & Engineering) Semester . ELECTIVES-I IT. No.448 E Human Computer Interaction Fuzzy Logic Natural Language Processing Object Oriented Software Engineering Note: 1) Project load will be treated as 2 hrs. (CSE. case studies etc. 4) Students will be allowed to use the non-programmable scientific calculator. ELECTIVES II CSE-406-E CSE-408 E CSE-413 E GFCSE402 E* ADVANCE JAVA LAB.. However. & Engineering and study it thoroughly and independently. 3) A team consisting of Principal/Director. 2) For the subject CSE-408 E. Project involving design. Course No. ELECTIVES-II CSE-442 E CSE-444 E CSE-446 E CSE.IT) ADVANCE JAVA (CSE.D. fabrication. . Later he will give a seminar talk on the topic. testing.464 E CSE-432 E CSE-434 E Network Security & Management Digital Image Processing Advanced Database Management Systems DEPT.VIII Modified ‘E’ Scheme effective from 2006-07 Teaching Schedule S. per week for the project coordinator and 1 hour for each participating teacher. computer simulation. IT) DEPT.M. Subject L DISTRIBUTED OPERATING SYSTEM (CSE.

Exponential function.Tech Syllabus (CSE) – II Year . Jain. Testing of a hypothesis. MDU B. Advance Engg.K. REFERENCE BOOKS: 1. Fourier transform of Dirac-delta function. application to flow problems. Integration of complex functions. radius and circle of convergence. rectangular wave. Part-C Probability Distributions and Hypothesis Testing: Conditional probability. sawtoothed wave.A. Chisquare test of goodness of fit. change of interval. 2. Fourier transforms of derivatives. Convolution theorem. TEXT BOOKS: 1. Mathematics : R. Students will be required to attempt five question taking at least one from each part. Power series.Iyenger. polar form of the Cauchy-Riemann equations. Logrithmic functions. half and full rectified wave. 3. conditions for a Fourier expansion. Zeroes and singularities of complex functions. Limit and Continuity of a function. Higher Engg. Note: Examiner will set eight questions. Taha. solving linear programming problems using (i) Graphical method (ii) Simplex method (iii) Dual simplex method. Evaluation of real integrals using residues (around unit and semi circle only). Cauchy-Integral theorem and formula. Properties and application of Binomial. Advanced Engg. : 3Hours Part-A Fourier Series and Fourier Transforms : Euler’s formulae. Grewal. Residues. Mathematics : Michael D. Fourier integrals. Fourier transforms. 4.K. Poisson and Normal distributions. Shifting theorem (both on time and frequency axes). Linear Programming: Linear programming problems formulation. Part-B Functions of Complex Variable : Definition. Operation Research : H. Taylor's Maclaurin's and Laurent's series. Bayes theorem and its applications. necessary and sufficient conditions for a function to be analytic. 2. expected value of a random variable. Mathematics : F Kreyszig. Greenberg. Student’s t-distribution (applications only). PHI. Fourier expansion of square wave. Advanced Engg. S. Mathematics : B. Probability and statistics for Engineers : Johnson.R. taking two from Part-A. Trignometric and Hyperbolic functions.S. three from Part-B and three from Part-C. Fourier expansion of odd and even functions. Cauchy-Riemann equations.MATH-201-E L 3 T 2 P - Mathematics-III (Common For All Branches) Class Work : 50 Marks Exam : 100 Marks Total : 150 Marks Duration of exam. Differnetiability and Analyticity. half range sine and consine series. Fourier transforms of integrals. Harmonic functions. tests of significance for large samples.

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

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

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

Students will be required to attempt five questions in all. Decoders. MDU B. McGraw Hill. FPGA and CPLDs. Unit 4 Sequential Circuits: Flip Flops : S-R. successive approximation. Gray. sequence generators. ASCII. D. Boolean algebra. EBCDIC. Binary codes: BCD. Encoders. weighted resistor and R -2 R ladder D/A Converters. Error detection and correction codes. Text Book: 1. Modern Digital Electronics(Edition III) : R. Adders / Subtractors. dual-slope ADC. Digital Integrated Electronics : Taub & Schilling. devices. Unit 2 Combinational Design Using Gates: Design using gates. NOT. Unit 5 Digital Logic Families: Switching mode operation of p-n junction. Tristate logic. T. NOR. ECL. MGH 2. Digital Design : Morris Mano. A/D converters : Quantization. PAL.Tech Syllabus (CSE) – II Year . J-K. Design of Synchronous and Asynchronous sequential circuits. 3. shift registers. PHI. P. Jain. NAND. PLA. Review of Number systems. Unit 7 Programmable Logic Devices: ROM. counting type. TTL. and CMOS logic families. DCTL. Counters synchronous and Synchronous Ring counters and Johnson Counter. HTL. Karnaugh map and Quine Mcluskey methods of simplification. specifications for D/A converters. EX-NOR. BCD arithmetic circuits. Bipolar logic families:RTL. edge triggered. logic gates: AND. Unit 6 A/D And D/A Converters: Sample and hold circuit.E-204-E L 3 T 1 P 0 Digital Electronics Class Work : Exam : Total : Duration of Exam : 50 Marks 100 Marks 150 Marks 3 Hrs Unit 1 Fundamentals Of Digital Techniques : Digital signal. Decoders / Drivers for display devices. TMH Reference Books : 1. Unit 3 Combinational Design Using Msi Devices Multiplexers and Demultiplexers and their use as logic elements. EX-OR. DTL. MOS. Excess-3. note: Eight questions are to be set in all by the examiner taking at least one question from each unit. specifications of ADCs. OR. Digital Principles and Applications : Malvino & Leach. bipolar and MOS. master-slave. interfacing of CMOS and TTL families. parallel -comparator.

Production possibility curve Economic laws and their nature. Types of Market . variable cost.N.L.M. Nature of Economic problem. Law of equi-marginal utility .merits and demerits. Role of Demand & Supply in Price Determinition and effect of changes in demand and supply on prices. in short run and long run. Shape of average cost. Sundhram Note: Eight questions are to be set at least one question from each unit and the students will have to attempt five questions in all. UNIT-VI Nature and characteristics of Indian economy (brief and elementary introduction). UNIT-I Definition of Economics . UNIT-II Concepts and measurement of utility. UNIT-IV Meaning of production and factors of production. Principles of Economics : P. WTO. A Text Book of Economic Theory Stonier and Hague (Longman’s Landon) 2. Law of variable proportions. Oligoply. real cost opportunity cost. Various concepts of cost . merits and demerits. L 3 T 1 P - COURSE OBJECTIVE : The purpose of this course is to : 1.Perfect Competition. practical importance & applications of the concept of elasticity of demand. average cost. 2. UNIT-III Meaning of Demand. total cost etc. Law of Diminishing Marginal Utility.Chand) 4. Dewett (S. Modern Micro Economics : S. Monoplistic Competition (Main features of these markets) Supply and Law of Supply.B.P. Mishra (Pragati Publications) 5. MDU B.its practical application and importance. marginal cost. UNIT-V Meaning of Market.) 6.Chand & Co. Micro Economic Theory – M. Privatization . Relation between Science. Engineering.B. measurement of elasticity of demand.Stimulate him to think systematically and objectively about contemporary economic problems.K.Indian Economy : Rudar Dutt & K. Elementary Concepts of VAT.A. Chopra (Kalyani Publishers). Globalisation of Indian economy .various definitions.Chand) 3. Law of demand. Modern Economic Theory – K.Chand) Reference Books: 1. Monopoly. Jhingan (S.L.meaning. Kalkundrikar (R. Acquaint the student in the basic economic concepts and their operational significance and 2 . Returns to scale. Ahuja (S.HUM-201-E Economics (Common For All Branches) Class Work : 50 Marks Theory : 100 Marks Total : 150 Marks Duration of Exam. Books Recommended: Text Books: 1. Micro Economic Theory . shape of demand curve. marginal cost. Individual and Market demand schedule. Internal and External economics and diseconomies of scale. Elasticity of demand.K.H. factors effecting elasticity of demand.N. : 3 Hrs. Kulkarni & A. Technology and Economics.Tech Syllabus (CSE) – II Year . money cost.Fixed cost. GATT & TRIPS agreement. Economic Theory .

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

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

9. NOR. J-K. To verify the operation of comparator. 3. MDU B.EE-224-E L 0 T 0 P 2 Digital Electronics Lab Class Work : Exam : Total : Duration of Exam 25 25 50 : 3 Marks Marks Marks HRS List Of Experiments: 1.Tech Syllabus (CSE) – II Year . 7. 4. OR. Study of CMOS NAND & NOR gates and interfacing between TTL and CMOS gates. To design and verify the operation of synchronous UP/DOWN decade counter using J K flip-flops & drive a seven-segment display using the same. at least seven experiments should be performed from above list. Verify the operation of a ring counter and a Johnson Counter. To verify the truth tables of S-R. To design & verify the operation of 3-bit synchronous counter. To design and verify the operation of asynchronous UP/DOWN decade counter using J K flip-flops & drive a seven-segment display using the same. To verify the operation of bi-directional shift register. EX-OR. 12. 2. 10. Note At least ten experiments are to be performed. 11. Design & realize a given function using K-maps and verify its performance. EX-NOR. NOT. T & D type flip flops. Design a 4-bit shift-register and verify its operation. 6. 5. NAND. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus. 8. To verify the operation of multiplexer & Demultiplexer. Study of TTL gates – AND. To design & realize a sequence generator for a given sequence using J-K flip-flops.

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

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

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

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

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

CSE-210 E
L 3 T 1 P -

Computer Architecture & Organization
Class Work : Exam : Total : Duration of Exam 50 Marks 100 Marks 150 Marks : 3 Hrs.

Unit-1: Basic Principles:

Boolean algebra and Logic gates, Combinational logic blocks(Adders, Multiplexers, Encoders, de-coder), Sequential logic blocks(Latches, Flip-Flops, Registers, Counters)

Unit-2: General System Architecture: Store program control concept, Flynn’s classification of computers (SISD, MISD, MIMD); Multilevel viewpoint of a machine: digital logic, micro architecture, ISA, operating systems, high level language; structured organization; CPU, caches, main memory, secondary memory units & I/O; Performance metrics; MIPS, MFLOPS. Unit-3: Instruction Set Architecture: Instruction set based classification of processors (RISC, CISC, and
their comparison); addressing modes: register, immediate, direct, indirect, indexed; Operations in the instruction set; Arithmetic and Logical, Data Transfer, Control Flow; Instruction set formats (fixed, variable, hybrid); Language of the machine: 8086 ; simulation using MSAM.

Unit-4: Basic non pipelined CPU Architecture: CPU Architecture types (accumulator, register, stack, memory/ register) detailed data path of a typical register based CPU, Fetch-Decode-Execute cycle (typically 3 to 5 stage); microinstruction sequencing, implementation of control unit, Enhancing performance with pipelining. Unit-5: Memory Hierarchy & I/O Techniques: The need for a memory hierarchy (Locality of reference
principle, Memory hierarchy in practice: Cache, main memory and secondary memory, Memory parameters: access/ cycle time, cost per bit); Main memory (Semiconductor RAM & ROM organization, memory expansion, Static & dynamic memory types); Cache memory (Associative & direct mapped cache organizations.

Unit-6: Introduction to Parallelism: Goals of parallelism (Exploitation of concurrency, throughput enhancement); Amdahl’s law; Instruction level parallelism (pipelining, super scaling –basic features); Processor level parallelism (Multiprocessor systems overview). Unit-7: Computer Organization [80x86]: Instruction codes, computer register, computer instructions,
timing and control, instruction cycle, type of instructions, memory reference, register reference. I/O reference, Basics of Logic Design, accumulator logic, Control memory, address sequencing, micro-instruction formats, micro-program sequencer, Stack Organization, Instruction Formats, Types of interrupts; Memory Hierarchy.

Text Books:
• • • Computer Organization and Design, 2nd Ed., by David A. Patterson and John L. Hennessy, Morgan 1997, Kauffmann. Computer Architecture and Organization, 3rd Edi, by John P. Hayes, 1998, TMH. Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001, Prentice-Hall Upper Saddle River, New Jersey Computer Organization, 5th Edi, by Carl Hamacher, Zvonko Vranesic,2002, Safwat Zaky. Structured Computer Organisation by A.S. Tanenbaum, 4th edition, Prentice-Hall of India, 1999, Eastern Economic Edition. Computer Organisation & Architecture: Designing for performance by W. Stallings, 4th edition, 1996, Prentice-Hall International edition. Computer System Architecture by M. Mano, 2001, Prentice-Hall. Computer Architecture- Nicholas Carter, 2002, T.M.H.

Reference Books:
• • • • •

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.

MDU B.Tech Syllabus (CSE) – II Year

CSE-212 E
L T P 3

Database Management Systems Lab
Class Work : Exam : Total : Duration of Exam 50 Marks 50 Marks 100 Marks : 3 Hrs

I.

Create a database and write the programs to carry out the following operation :
1. 2. 3. 4. 5. 6. Add a record in the database Delete a record in the database Modify the record in the database Generate queries Generate the report List all the records of database in ascending order.

II

Develop two menu driven projects for management of database system:
1. Library information system (a) Engineering (b) MCA Inventory control system (c) Computer Lab (d) College Store Student information system (e) Academic (f) Finance Time table development system (g) CSE, IT & MCA Departments (h) Electrical & Mechanical Departments

2.

3.

4.

Usage of S/w:
1. VB, ORACLE and/or DB2 2. VB, MSACCESS 3. ORACLE, D2K 4. VB, MS SQL SERVER 2000

Note:
At least 5 to 10 more exercises to be given by the teacher concerned.

MDU B.Tech Syllabus (CSE) – II Year

IT-206 E
L T P 2

C ++ Programming Lab.
Class Work : Exam : Total : Duration of Exam 25 25 50 : 3 Marks Marks Marks Hrs.

Q1.

Raising a number n to a power p is the same as multiplying n by itself p times. Write a function called power ( ) that takes a double value for n and an int value for p, and returns the result as double value. Use a default argument of 2 for p, so that if this argument is omitted, the number will be squared. Write a main ( ) function that gets values from the user to test this function. A point on the two dimensional plane can be represented by two numbers: an X coordinate and a Y coordinate. For example, (4,5) represents a point 4 units to the right of the origin along the X axis and 5 units up the Y axis. 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. Write a program that uses a structure called point to model a point. Define three points, and have the user input values to two of them. Than set the third point equal to the sum of the other two, and display the value of the new point. Interaction with the program might look like this: Enter coordinates for P1: 3 4 Enter coordinates for P2: 5 7 Coordinates of P1 + P2 are : 8, 11

Q2.

Q 3.

Create the equivalent of a four function calculator. The program should request the user to enter a number, an operator, and another number. It should then carry out the specified arithmetical operation: adding, subtracting, multiplying, or dividing the two numbers. (It should use a switch statement to select the operation). Finally, it should display the result. When it finishes the calculation, the program should ask if the user wants to do another calculation. The response can be ‘Y’ or ‘N’. Some sample interaction with the program might look like this. Enter first number, operator, second number: 10/ 3 Answer = 3.333333 Do another (Y/ N)? Y Enter first number, operator, second number 12 + 100 Answer = 112 Do another (Y/ N) ? N A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212), the exchange (767) and the number (8900). Write a program that uses a structure to store these three parts of a phone number separately. Call the structure phone. Create two structure variables of type phone. Initialize one, and have the user input a number for the other one. Then display both numbers. The interchange might look like this: Enter your area code, exchange, and number: 415 555 1212 My number is (212) 767-8900 Your number is (415) 555-1212 Create two classes DM and DB, which store the value of distances. DM stores distances in meters and centimeters and DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another object of DB. Use a friend function to carry out the addition operation. The object that stores the results maybe a DM object or DB object, depending on the units in which the results are required. The display should be in the format of feet and inches or metres and cenitmetres depending on the object on display. Create a class rational which represents a numerical value by two double values- NUMERATOR & DENOMINATOR. Include the following public member Functions: • constructor with no arguments (default). • constructor with two arguments.

Q4.

Q 5.

Q 6.

MDU B.Tech Syllabus (CSE) – II Year

“Able was I ere I saw Elba)”. Add an instance variable. and print out the result. Use an input method that allows embedded blanks. The two data items are a type unsigned int to hold the total number of cars. Q11. Supply a test program that tests these classes and methods. A hospital wants to create a database regarding its indoor patients.50 to the cash total. The information to store include a) Name of the patient b) Date of admission c) Disease d) Date of discharge Create a structure to store the date (year. • Overload + operator to add two rational number. • Q 8. called nopayCar ( ). Q 7. The member function should include functions to enter information and display a list of all the patients in the database.. Make a class Executive inherit from Manager. Write a program to exercise reversit ( ). then the second and next to last characters and so on. Supply a method to String that prints the string “Executive” followed by the information stored in the Manager superclass object. define iam ( ) to write our similar but appropriate messages. Q 9. named department. This program should allow the user to push one key to count a paying car. father (int x) {age = x. Write a main ( ) to test all the functions in the class. Finally. Use a for loop that swaps the first and last characters. Q12. of characters) and marks. • Overload << operator to enable output through cout. A constructor initializes both these to 0. assign addresses of objects of the two derived classes to this pointer and in each case. public. a member function called displays the two totals. You should also define suitable constructors for these classes. The string should be passed to reversit ( ) as an argument. Supply a method to toString that prints the manager’s name. Create a base class to store the above information. Create a derived class to store the age of the patients. Consider the following class definition class father { protected : int age. List the information about all the pediatric patients (less than twelve years in age). Include a program to test this class. name ( a string of 30 or lesser no. and a type double to hold the total amount of money collected. A member function called payingCar ( ) increments the car total and adds 0. • Overload >> operator to enable input through cin.void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator and denominator. write a main ( ) that creates objects of the three classes and then calls iam ( ) for them. MDU B.Tech Syllabus (CSE) – II Year . and another to count a nonpaying car. Pushing the ESC kay should cause the program to print out the total cars and total cash and then exit. Make a class Manager inherit from Employee. Successively. Write a program that creates a binary file by reading the data for the students from the terminal. Make a class Employee with a name and salary. Derive the two classes son and daughter from the above class and for each. call iam ( ) through the pointer to demonstrate polymorphism in action. Write a function called reversit ( ) that reverses a string (an array of char). my age is : ”<< age<< end1:} }. Q 10. Another function. month and date as its members). Imagine a tollbooth with a class called toll Booth. List the information about all the to store the age of the patients. department and salary. of type string. Test the program with Napoleon’s famous phrase. call reversit ( ). Now. increments the car total but adds nothing to the cash total.} virtual void iam ( ) { cout < < “I AM THE FATHER. Declare pointer to father. The data of each student consist of roll no. The program should get a string from the user.

Tech Syllabus (CSE) – II Year . The opposite would be true if getRight ( ) were used. Display the contents of the Deque using the forEach ( ) function and a user written display function. Create some objects of the string class. a member function get data ( ) to initialize base class data members and another member function display area ( ) to compute and display the area of figures. Using these three classes. Derive two specific classes called triangle and rectangle from the base shape. design a program that will accept dimensions of a triangle or a rectangle interactively and display the area. Add to the base class. Create a base class called shape. Make display area ( ) as a virtual function and redefine this function in the derived classes to suit their requirements.Q13. Use this class to store two double type values that could be used to compute the area of figures. Remember the two values given as input will be treated as lengths of two sides in the case of rectangles and as base and height in the case of triangles and used as follows: Area of rectangle = x * y Area of triangle = ½ * x * y Q 14. Then search the Deque for a particular string. MDU B. using the first That ( ) function and display any strings that match. Notice the order in which the items are displayed: Using getLeft ( ). and put them in a Deque-some at the head of the Deque and some at the tail. Finally remove all the items from the Deque using the getLeft ( ) function and display each item. those inserted on the left (head) of the Deque are removed in “last in first out” order while those put on the right side are removed in “first in first out” order.

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

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

branch instructions. data transfer instructions. PHI Reference Books: 1. Wiley Eastern Ltd. The 8088 & 8086 Microprocessors-Programming. The Intel Microprocessors 8086. Unit2. PART B Unit4. logical instructions. block diagram of 8086. pin diagram and description of various signals. assembler instruction format. Interfacing Device : The 8255 PPI chip: Architecture. instruction set. Microcomputer systems: the 8086/8088 Family: architecture. interfacing. Microprocessors and interfacing : Hall. 2. NOP and HLT instructions. Microprocessor Architecture. programming examples. and assembly language programming. modes and examples. Unit6.B . 8237 DMA controller. PHI. instruction formats.EE-309-E L 3 T 1 P 0 Microprocessors and Interfacing Class Work : Exam : Total : Duration of Exam PART A 50 Marks 100 Marks 150 Marks : 3 HRS Unit1. Advanced Microprocessors and Interfacing : Badri Ram.Pentium processor : Brey. addressing modes. The 8085 Processor : Introduction to microprocessor. Programmable interval timer chips. shift and rotate instructions.Tech Syllabus (CSE) – III Year . BIU. Text Books : 1.Students have to attempt any five questions. PHI 3. Interrupt And Timer : 8259 Programmable interrupt controller. arithmetic instructions. looping instructions. program relocation. flag manipulation instructions. TMH Note: 8 questions are to be set selecting FIVE questions from PART A and THREE questions from PART. control words. 4. Unit 5. The 8086 Microprocessor Architecture: Architecture. directives and operators. Programming & Design : Yu-Chang Liu & Glenn A Gibson. Programming & Applications with 8085 : Ramesh S Gaonkar.Hardware & Applications :Triebel & Singh. interrupt structure. memory segmentation and physical address computations. details of sub-blocks such as EU. Dma : Introduction to DMA process. Unit3. Instruction Set Of 8086: Instruction execution timing. 8085 microprocessor: Architecture. MDU B. TMH 2.

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

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

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

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

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

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

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

10. . 8. Study of 8086 microprocessor kit 9. Note: At least ten experiments have to be performed in the semester out of which seven experiments should be performed from above list. Write a program using 8086 and verify for: a. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus of EE-309-C. Write a program using 8085 and verify for : a. 13. 15. 3. 16-bit subtraction (display borrow) 4. Finding the largest number from an array. Write a program using 8086 for arranging an array of numbers in ascending order and verify. Write a program using 8085 for multiplication of two 8.bit numbers by bit rotation method and test for typical data. Write a program using 8086 for division of a defined double word (stored in a data segment) by another double Word division and verify. Write a program for finding square of a number using look-up table and verify. Write a program using 8085 for dividing two 8. b. 17. Addition of two 8-bit numbers.bit numbers by bit rotation method and verify. MDU B. 2. 7. 5. Write a program using 8085 for multiplication of two 8. 11. 14.bit numbers by repeated addition method. 8-bit subtraction (display borrow) b.bit numbers by repeated subtraction method and test for typical data. 12. Write a program to interface a two digit number using seven-segment LEDs. Addition of two 8-bit numbers (with carry). 6. Study of 8085 Microprocessor kit. Write a program using 8086 for arranging an array of numbers in descending order and verify. Write a program using 8085 and verify for : a. Write a program using 8086 for copying 12 bytes of data from source to destination and verify. Use 8085/8086 microprocessor and 8255 PPI. b.EE-329-E L 0 T 0 P 2 Microprocessors and Interfacing Lab Class Work : Exam : Total : Duration of Exam 25 25 50 : 3 Marks Marks Marks Hrs List Of Experiments: 1. Check for minimum number of additions and test for typical data. Finding the smallest number from an array.Tech Syllabus (CSE) – III Year . Write a program to control the operation of stepper motor using 8085/8086 microprocessor and 8255 PPI. Write a program using 8086 for finding the square root of a given number and verify. 16. Write a program using 8085 for division of two 8.

commands). Class Work : Exam : Total : Duration of Exam 25 Marks 25 Marks 50 Marks : 3 Hrs.CSE-313 E L T P 2 Operating Systems Lab. AWK programming. Administration of WINDOWS 2000 (including DNS. • • • • • • Study of WINDOWS 2000 Operating System. Directory Services) Study of LINUX Operating System (Linux kernel. shell. basic commands pipe & filter Administration of LINUX Operating System.LDAP.Tech Syllabus (CSE) – III Year . Writing of Shell Scripts (Shell programming). MDU B.

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

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

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

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

Wireless Communications: Theodore S. TDMA. fixed network transmission hierarchy. Rappaport. improving coverage and capacity. digital Cellular Systems. Pearsons. Intelligent Cell Concept And Application: Intelligent cell concept. Unit 2. basic Cellular Systems. FDMA.Y. paging systems. Unit 4. 2. third generation wireless networks. Unit 7. wireless local area networks. development of wireless networks. wireless data services. Mobile Cellular Telecommunication: W. CDMA cellular Radio Networks. Text Books: 1. examples of wireless comm. MDU B.EE-402-E L 3 T 1 P 0 WIRELESS COMMUNICATION Class Work : Exam : Total : Duration of Exam 50 Marks 100 Marks 150 Marks : 3 HRS Unit 1. Operation of cellular systems. Introduction To Wireless Communication Systems: Evolution of mobile radio communications. channel assignment strategies. McGraw Hill Reference Book: 1. Wireless Networking: Difference between wireless and fixed telephone networks. Pearson Note: Eight questions are to be set -one question from each unit. traffic routing in wireless networks. comparison of various wireless systems. handoff Strategies. Mobile Communications: Jochen Schiller. wireless in local loop. Unit 3. Students have to attempt any five question. Spread Spectrum multiple Access. advanced intelligent networks. Unit 5. ISDN (Integrated Services digital Networks).Lee. capacity of a cellular systems. analog cellular systems. tracking and grade off service.C.Tech Syllabus (CSE) – III Year . space division multiple access. common channel signaling. in-Building Communication. Unit 6. Blue tooth and Personal Area networks. Introduction to Cellular Mobile Systems: Spectrum Allocation. performance Criteria. Modern Wireless Communication Systems: Second generation cellular networks. Cordless telephone systems. Interference and system capacity. systems. applications of intelligent micro-cell Systems. Multiple Access Techniques For Wireless Communication: Introduction to Multiple Access. Ellular System Design Fundamentals: Frequency Reuse. packet ratio.

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

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

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

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

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

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

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

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

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

UNIX emulation in MACH. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Client – Server model . Tanenbaum. System models.Tech Syllabus (CSE) – IV Year . Processors Allocation. Election lgorithm. Students will be required to attempt five questions in all. communication in MACH.Remote Procedure Calls and Group Communication. Scheduling in Distributed System. D es ign iss ue s. Real Time Distributed Systems. Distributed Shared Memory: What is shared memory. Text Book: • Distributed Operating System – Andrew S. Unit-2: Synchronization in Distributed System: Clock synchronization. Trends in Distributed file systems. Unit-1: Introduction: I n tro d u c t i o n to D is t r ib u ted S ys t e m. process management in MACH. Unit-5: Case study MACH: Introduction to MACH.CSE-402 E L 3 T 1 P - Distributed Operating System Class Work : Exam : Total : Duration of Exam 50 Marks 100 Marks 150 Marks : 3 Hrs. Consistency models. Distributed file system Implementation. Distributed Deadlock Detection . Mutual Exclusion. Unit-4: Distributed file systems: Distributed file system Design. Unit-3: Processes and Processors in distributed systems: Threads. Middleware and Distributed Operating Systems. a Ring algorithm. ATM networks. MDU B. the Bully algorithm. G o a l s o f D is tr ib u t e d s ys t e m. Deadlock in Distributed Deadlock Prevention. shared variables distributed shared memory. H ardwa re and Sof twa re con c ep ts . Atomic Transactions. Distributed Systems. Communication in distributed system: Layered protocols. Page based distributed shared memory. PHI.

Gary Cornelll Pearson Publisher. Drag and Drop UNIT 7: JAVABEANS COMPONENTS Beans. Harvey. Multithreading. Areas. 2nd Edition. Paint. Making URL Connections. Security Managers and Permissions.Tech Syllabus (CSE) – IV Year . Java IDL and CCRA. Shapes. Control Statements. : 100 Marks Total : 150 Marsk Duration of Exam. The Bean-Writing Process. Data types. Progress Indicators. Coordinate Transformations. Professional Java Programming by Brett Spell. AVVT & Apolet Programming. Arrays. Prentice Hall Note: Eight questions are to be set – at lease one from each unit Students have to attempt any five. I/O streams. Strokes. Sending E-Mail. Parameter Passing in Remote Methods Server Object Activation. Using Beans to Build an Application. The Structured Query Language. Setup for Remote Method Invocation. Classes & Methods. M. Transparency and Composition. variables. Naming Patterns for Bean Components and Events Bean Property Tubes Beaninfo Classes Property Editors Cuatomizes UNIT 8: SECURITY Class Loaders. Row Sets. Remote Method Calls with SOAP UNIT 5: SWING Lists. MDU B. UNIT 2: NETWORKING Connecting to a Server. Bytecode Verification. The Clipboard. Remote Method Invocations. Exception Handling. Rendering Hints. Scrollable and Updatable Result Sets. Tables. Inheritance. Advanced Socket Programming UNIT 3: DATABASE NETWORKING The Design of JDBC. Image Manipulation. Printing. 2. Volume II-Advanced Features. Transactions. UNIT 1: CORE JAVA Introduction to Java. Styled Text Components. WROX Publication Advanced Java 2 Platform. How to Program. Collections. Component Organizers UNIT 6: AWT The Rendering Pipeline. 7th Edition by Cay Horetmann. Implementing Servers. Matadata. 2004 REFERENCE BOOKS: 1.CSE-404-E L 3 T 1 P 0 ADVANCED JAVA Class Work : 50 Marks Exam. Basic JDBC Programming Concepts. Code Signing. Clipping. Introduction of LDAP UNIT 4: DISTRIBUTED OBJECTS The Roles of Client and Server. Digital Signatures. : 3 hrs. Dietal. Trees. Advanced Connection Management. Readers and Writers for Images. Encryption TEXT BOOK: Core JavaTM 2. Query Execution. JDBC Installation. operators.

Class Work : Exam : Total : Duration of exam 50 Marks 50 Marks 100 Marks : 3 hrs.Tech Syllabus (CSE) – IV Year .464 E CSE-432 E CSE-434 E Network Security & Management Digital Image Processing Advanced Database Management Systems DEPT.CSE-406-E L T P 3 Advanced JAVA Lab.448 E Human Computer Interaction Fuzzy Logic Natural Language Processing Object Oriented Software Engineering MDU B. ELECTIVES-I IT. Development of programs relating to : • • • • • JDBC Servlets Beans RMI JSP DEPT. ELECTIVES-II CSE-442 E CSE-444 E CSE-446 E CSE.

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

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

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

look and feel . color maps.Tech Syllabus (CSE) – IV Year .: History of computer user interfaces. B Addison-Wesley 1990 Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Implications for software organizations Unit 9: Speech user interfaces: Attributes of speech user interfaces. human-system interaction: Input and output devices. Color representation. Use cases. Usability engineering overview. Dialog issues: response time.g. “Three pillars of design”. J. Windows manager models. Accounting for users with disabilities Unit 5: The design process – overview: The typical software development lifecycle (idealized vs. Prentice Hall 1993 Graphical User Interface Design and Evaluation Redmond-Pyle. Information architecture. Reconciling UCD and usability testing Unit 6: The design process . multimedia and non-graphical dialogues. Human cognitive and sensory limits Human memory Human problem solving Skill acquisition Users’ conceptual models (mental models) Decision making Unit 2: Computer systems and user interfaces. HCI . (1988). 5. Speech input. Use of metaphors to support user understanding. What’s driving software accessibility.CSE 442-E L 4 T P - Human Computer Interaction Class Work : Exam : Total : Duration of Exam 50 Marks 100 Marks 150 Marks : 3 Hrs. Publ. Structuring the information. Mechanics of particular devices. Bel Shneiderman. 3rd edition. John New York: Wiley & Sons. J. Layers model of architecture of design and windowing systems. X. 6. 3. (1998). MS Windows. & Redish. human decision making. A et al. Wireframes. Sources of information Unit 7: The design process – making use of task and user data for system design. A. Mockups. Screen layout issues. User and process flows. Computer architecture. & Moore. Addressing the effects Text books: Hackos. control. Hypermedia and WWW Unit 4: Principles guiding well-designed human-system interaction: Paradigms for interaction.history and intellectual root Human information processing limitations. Techniques for task analysis. color range of devices Unit 3: Interaction models and metaphors: Use of abstract metaphors for describing interface behavior. scenarios. MDU B. D. 4.T. Students will be required to attempt five questions in all. Performance characteristics of humans and systems. 2. The design of everyday things. e. Dialog interaction: types and techniques. navigation and orientation. Unit 1: Introductions & overview of HCI. Dialog input and output techniques and purposes . Reference Books: Designing the User Interface: Strategy for Effective Human Computer Interaction. User-centered design overview. 1. Effects of automation. actual). Macintosh. Evaluating speech user interface quality Unit 10: HCI in mission-critical and high-risk environments: Safety implications of human-computer interaction.task and user needs analysis: Task analysis definition. standards. sound and speech output. Prentice Hall 1995 The Art of Human-Computer Interface Design Laurel. Norman. Principles to support usability. Color issues. D. comps. Computer graphics . User and task analysis for interface design. Perason Edu. 2000 Human Computer Interaction Dix. Other methods of conveying structure and function Unit 8: Designing for universal access: What is accessibility? What is accessible software..C. Examples of accessibility adaptations. New York: Basic Books.

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

. ambiguous grammars. graph models and optimization.Benjamin-1995. prolog for natural language semantic. Unit-5: Application of NLP: intelligent work processors: Machine translation. resolution of ambiguities. semantics. user interfaces. 1988.Tech Syllabus (CSE) – IV Year .CSE-446 E L 4 T P - Natural Language Processing Class Work : Exam : Total : Duration of Exam 50 Marks 100 Marks 150 Marks : 3 Hrs. Earley & Tomitas algorithm. Unit-2: Formal languages and grammars: chomsky hierarchy. pragmatics. Unit-1: Components of natural language processing: lexicography. “ Introduction of Formal Language Theory. MDU B. Springer Verlog Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Reference Books: • • • “Language as a cognitive process”. 1989. natural language querying. Unit-3: Computation linguistics: recognition and parsing of natural language structures: ATN & RTN.General techniques of parsing: CKY. Terry Winograd 1983. Mdlj Arbib & Kfaury. AW “Natural Language processing in prolog” G. speech recognition. tutoring and authoring systems. cummings Pub. Addison Wesley. Comp. Students will be required to attempt five questions in all. Man-Machine interfaces. Ltd. Text Book: • “Natural Language Understanding” James Allen . Gazder. Unit-4: Semantics-knowledge representation semantic networks logic and inference pragmatics. syntax. word level representation of natural languages prosoty & natural languages. Left-Associative grammars. commercial use of NLP.

Packages and drawing a Class Diagram: State. Unit-6: The Iteration Planning Process: Benefits. Designing Attributes and Operations.2000 . Ivar Jacobson. Documentation Review. Visual Modelling using Unified Modelling Language (UML): What is Visual Modelling? ObjectOriented Modelling. Additional Use Case . Testing.Tech Syllabus (CSE) – IV Year . Role Names. James Rumbaugh. Activity Diagrams Activities. Behaviour. Use Case Diagrams: Creating Main Use Case -. Capabilities of Rational Rose Case Tool. Splitting Classes. Introduction to Unified Modelling Language (UML): History of UML. Grady Booch. Coding. Drawing a Class Diagram Specifying Relationships : The Need of Defining Relationships. Unit-2: Introduction to Objectory Software Development Process: Introduction. Inheritance. and Documenting the Iteration. Naming Relationships. Reflexive Relationships. Design the User Interface. Decision Points. Event Tracing. Elaboration Stage. Aggregation. Usage of UML. Overview of UML – Capabilities. Creating Relationships in Rational Rose Unit-4: Discovering Object Interactions: Documenting Scenarios using Interaction Diagrams. Students will be required to attempt five questions in all. Creating and Documenting Classes in rational Rose. Addison Wesley. Polymorphism. Analysing Object Behaviour: Modelling Dynamic Behaviour. “The Objectory Software Development Process”. Objects. Designing the System Architecture : The need for Architecture. Benefits. The Use Case view.2000 Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Ivar Jacobson. James Rumbaugh. Creating Attributes & operations and documenting them. • • “UML User Guide”. Packages. The Process View. Multiplicity Indicators. Identity of Objects. Association.. Grady Booch. Adding Design Classes. Addison Wesley. Scenario Walk-through. 2000. Unit-1: Introduction: Review of the Traditional Methodologies.Relationships . Eliminating Classes. 2000.Second Edition Sams Teach Yourself “UML” In 24 Hours By Joseph Schmuller . Visual Modeling with Rational Rose 2000 and UMLBy Terry Quatrani Foreword by Grady Booch. Association and Aggregation Relationships. Goals. Adding Behaviour and Structure: Representing Behaviour and Structure. Inheritance. The Emergence of Patterns. Displaying attributes and operations. James Rumbaugh. Creating Use Case Diagrams: Actors and Use Cases. Construction Stage. Types of Interaction Diagrams. Introduction to Rational Rose CASE tool: Introduction–Importance of Rational Rose. MDU B. Stereotypes and Classes. Swimlanes Unit-3: Identifying Classes . Classes. Combining Classes. Use Case Relationships. Consistency Checking. Designing Relationships. The Deployment View.CSE-448 E L 4 T P - Object Oriented Systems Development Class Work : Exam : Total : Duration of Exam 50 Marks 100 Marks 150 Marks : 3 Hrs. Types of Relationships. Transitions. Grady Booch. Advantages of Object Oriented Methodologies over Traditional Methodologies. The Component View. Finding Relationships. Encapsulation. Package Relationships. Addison Wesley. States and Transitions. States Unit-5: Checking the Model: Making the Model Homogeneous. The Logical view. 2000 Text Books: Reference Books: • • • • “UML Reference Guide”. The “4+1” view of Architecture. Ivar Jacobson.Diagrams in Rational Rose. Phases and Iterations. UML Distiled by Maxtin Fowler with Kendall Scott. Association Classes. 1999. Designing for Inheritance. Transition Stage.

Sign up to vote on this title
UsefulNot useful