SE(Computer)

NORTH MAHARASHTRA UNIVERSITY,

JALGAON (M.S.)

Second Year Engineering

(Computer Engineering)

Faculty of Engineering and

Technology

COURSE OUTLINE

TERM – III

W.E.F 2013 – 2014

Annexure - I SE Semester - III

Name of the Course Group

Teaching Scheme Evaluation Scheme

Credits Theory Practical Total

Theory Hrs / week

Tutorial Hrs / week

Practical Hrs / week

Total ISE ESE ICA ESE

Engineering Mathematics-III A 3 1 --- 4 20 80

--- --- 100 4

Analog & Digital Electronics B 3 --- --- 3 20 80 --- --- 100 3

Discrete Structure & Graph Theory

D 3 1 --- 4 20 80 --- --- 100 4

Microprocessor & Microcontroller

D 3 --- --- 3 20 80 --- --- 100 3

Object Oriented Technology D 3 --- --- 3 20 80 --- --- 100 3

Soft Skills – III C 1 --- 2 3 --- --- 50 --- 50 2

Analog & Digital Electronics Lab B --- --- 2 2 --- --- 50 --- 50 1

Discrete Structure & Graph Theory Lab

D --- --- 2 2 --- --- 25 25 (PR) 50 1

Microprocessor & Microcontroller Lab

D --- --- 2 2 --- --- 25 25 (PR) 50 1

Object Oriented Technology Lab D --- --- 2 2 --- --- 25 25 (PR) 50 1

Total 16 2 10 28 100 400 175 75 750 23

ISE: Internal Sessional Examination ESE: End Semester Examination ICA: Internal Continuous Assessment

SE Semester - IV

Name of the Course Group

Teaching Scheme Evaluation Scheme

Credits Theory Practical Total

Theory Hrs / week

Tutorial Hrs / week

Practical Hrs / week

Total ISE ESE ICA ESE

Data Communication D 3 --- --- 3 20 80 --- --- 100 3

Microprocessor & Microcontroller Interfacing

D 3 1 --- 4 20 80 --- --- 100 4

Data Structures D 3 1 --- 4 20 80 --- --- 100 4

Computer Organization D 3 --- --- 3 20 80 --- --- 100 3

Computer Graphics D 3 --- --- 3 20 80 --- --- 100 3

Application Development Lab B 1 --- 2 3 --- --- 50 --- 50 2

Data Communication Lab D --- --- 2 2 --- --- 50 --- 50 1

Microprocessor & Microcontroller Interfacing Lab

D --- --- 2 2 --- --- 25 25 (PR) 50 1

Data Structures Lab D --- --- 2 2 --- --- 25 25 (PR) 50 1

Computer Graphics Lab D --- --- 2 2 --- --- 25 25 (PR) 50 1

Total 16 2 10 28 100 400 175 75 750 23

ISE: Internal Sessional Examination ESE: End Semester Examination ICA: Internal Continuous Assessment

Engineering Mathematics –III

Second Year Engineering

(Computer Engineering / Information Technology)

UNIT-I: Laplace Transform (08 Hours, 16

marks)

• Definition and Existence of Laplace transforms.

• Laplace Transform of elementary/standard functions.

• Theorems and Properties of Laplace Transform (without proof).

• Inverse Laplace Transform.

• Laplace Transform of Unit step function.

• Solution of differential equations using LT.

UNIT-II: Fourier Transform and Z-Transform (08 Hours, 16

marks)

A) Fourier Transform:

• Introduction to Fourier Integral theorem.

• Fourier Transforms, Fourier Cosine Transforms, Fourier Sine Transform and their

inverse.

B) Z- Transform:

• Definition and standard properties ( without proof )

• Region of Convergence.

• Z-Transform of standard / elementary sequences.

• Inverse Z-transform.

UNIT-III: Statistics and Probability distributions (08 Hours, 16

marks)

• Introduction to Mean, Mode, Median standard deviation, Variance, Coefficient of

Variation.

• Moments, Skewness and kurtosis.

• Correlation and Regression.

• Binominal Distribution.

• Poisson distribution.

• Normal distribution.

UNIT-IV: Testing of Hypothesis and Significance (08 Hours, 16

marks)

• Introduction to population parameters and statistics.

• Testing of Hypothesis, Null Hypothesis and Alternative Hypothesis.

• Level of Significance.

• Test of Significance of large sample.

• Chi-Square test.

UNIT-V: Fuzzy Sets and System (08 Hours, 16

marks)

• Introduction to Fuzzy sets.

• Standard Fuzzy sets operations.

• Crisp sets, Crisp sets verses Fuzzy sets.

• Fuzzy arithmetic.

• Constructing Fuzzy sets and operations on Fuzzy sets and systems

• Applications of Fuzzy sets.

REFERENCE BOOKS:

1. H.K. Dass - Advanced Engineering Mathematics (S. Chand Publication) New Delhi.

2. Erwin Kreyszig - Advanced Engineering Mathematics ( Wiley Eastern Ltd.)

3. B.S. Grewal - Higher Engineering Mathematics, Khanna Publication, Delhi

4. Wylie C.R. & Barrett - Advanced Engineering Mathematics - Mc Graw Hill

5. B.V. Raman - Engineering Mathematics - Tata Mc- Graw – Hill.

6. A Text Book of Engineering Mathematics, By N. P. Bali, Laxmi Publication.

7. Fuzzy Sets and Fuzzy Logic: Theory and Applications, by George J. Klir and Bo Yuan

SECOND YEAR COMPUTER ENGINEERING SYLLABUS

Semester-I Paper I

ANALOG & DIGITAL ELECTRONICS

Teaching Scheme: Examination Scheme:

Theory: 3 Hrs/Week ESE (Th): 80 Marks

ISE: 20 Marks

Paper Duration: 3 Hrs

Credit: 3

UNIT- I

Operational Amplifier Basics & applications – Advantages of ICs over discrete

components, Block diagram of op-amp, Op-amp symbol, Op-amp IC 741- pin diagram,

Summing amplifier, Substractor, Instrumentation amplifier using 3 op-amp , V to I (floating

and grounded load) and I to V converter, its applications, Integrator and Differentiator, Their practical considerations, Sample and hold circuit. (8 Hrs)

UNIT –II

Comparators and Signal Generators-Inverting and non inverting comparator, Zero

crossing detector, Window detector, Schmitt trigger, its advantages, Limitation of op-amp

as comparator. Square wave generator, Triangular wave and Sawtooth wave generator. Timer IC 555: monostable operation, astable operation. (8 Hrs)

UNIT –III

Review of fundamental concepts: Basic gates, Universal gates & Exclusive gates. Digital

signal, Positive & Negative logic, Boolean algebra: Boolean postulate and theorems,

Examples of realization of boolean functions using boolean algebra. Introduction to digital logic families: DTL, TTL & CMOS. (8 Hrs)

UNIT -IV

Combination logic design: Standard representation of logical function, K map

representation of logical function, Simplification of logical function using K map, For 2, 3 &

4 variables. K map with don’t care condition. Design of half adder, full adder, half substractor, full substractor . (8Hrs)

UNIT- V

Combination logic design examples: Various example of combinations logic circuit (truth

table – K map – circuit diagram) with the help of K map and their implementation with the

help of basic/universal gates. Design of multiplexer & demultiplexer: Design of comparator

circuits using logic gates. Design of parity generator & checker circuit using logic gates

Introduction to sequential logic circuit: function of one bit memory cell, truth table and excitation tables of S – R, JK, D & T Flip – Flop. (8 Hrs)

Text Books:

1. D.Roy Chaudhary, Shail Jain “Linear Integrated Circuit”, New Age International, 2/e.

2. R.P. Jain “Modern Digital Electronics”, TMH, 3/e.

Reference Books:

1. Ramakant A. Gaikward “Op amp and Integrated circuit”, PHI, 4th edition, 2012.

2. Coughling, Driscoll “Op amps and Linear Integrated Circuits”, Pearson education, 6/e

3. M. Morris Mano “Digital Logic and Computer Design”, Pearson.

4. A Anandkumar “Fundamentals of Digital Circuits”, Pearson.

5. Sergio Franco “Design with Operational Amplifier and Analog Integrated Circuits”,

TMH- 3 / e.

6. Botkar “Integrated circuits”, Khanna Pub.

Guidelines for ESE:

I. Emphasis should be given to circuit diagram & operation of opamp based circuits.

II. For IC 555functional diagram & operation in both the modes is asked.

III. Simple logical functions may be asked based on above syllabus for simplification

using K map upto 4 variables only.

IV. Implementation of simple combinational circuits using k map & basic gates.


Semester-I Paper I

ANALOG & DIGITAL ELECTRONICS LAB


Practical: 2 Hrs/Week ICA: 50 Marks

Credit: 1

List of Practical:

PART – A (Analog Electronics)

1. Design of inverting & non –inverting summing amplifier

2. Design of instrumentation amplifier.

3. Design of active integrator and differentiator circuits.

4. Find out the hysteresis voltage of Schmitt trigger circuit.

5. Generate square, triangular and saw tooth wave using op-amp.

6. Timer using IC 555 in monostable and astable mode.

PART – B (Digital Electronics)

7. Verification of the truth table of logic gates and verification of De Morgan’s theorem.

8. Construction of basic gates using universal gate (NAND / NOR)

9. Construction of half adder & full adder circuit. Implementation of full adder with the

help of two half adder circuits & one OR gate.

10. Construction of half substractor & full substractor circuit.

11. Conversion of gray to binary and binary to gray code.

12. Verification of truth table of multiplexes & flip flops.

Concerned faculty should suitably frame at least 08 practical (FOUR from PART – A and

FOUR from PART – B) out of the above list. Every student is required to submit the

assignments in the form of journal.

Guidelines for ICA:

ICA will be based on the practical submitted by the students in the form of journal.


Semester-III Paper III

DISCRETE STRUCTURE AND GRAPH THEORY



Tutorial: 1 Hrs/Week ISE: 20 Marks


Credit: 4

Unit - I

Propositions, Sets, Probability:

Propositions, compound proposition, basic logical operations, truth tables, tautology,

contradiction Quantifiers: universal and existential quantifiers, Set Theory: Set,

Combinations of Sets, Mathematical Induction Principle, Cardinality of finite Sets, Rule of

sum, Rule of product, Permutations, Combinations, Discrete Probability. (8

Hrs)

Unit - II

Relation: Definitions, properties of Binary relations, Equivalence Relations and partitions,

Partial ordering relations and lattice, chains and antichains, Transitive Closure and

Warshall’s Algorithm.

Function: Functions Definitions, Composition of Functions, Types of Function, Recursive

Functions, Pigeonhole principle. (8 Hrs)

Unit- III

Recurrence Relation: Recurrence Relation, Linear Recurrence Relations with constant

Coefficients, Homogeneous Solutions, Particular Solutions, total solutions, Solution by the

method of generating functions.

Analysis of Algorithms: Introduction, Largest number algorithm, sorting algorithms:

Bubble sort, Divide and conquer algorithms: binary search algorithm, strassens matrix

multiplication, Time Complexity of Algorithms, Complexity of Problems, Tractable and

Intractable Problems. (8 Hrs)

Unit - IV

Graphs- Basic terminology, multigraphs and weighted graph , paths and circuits , Dijkstra’s

shortest path algorithms, Euler and Hamiltonian Paths and circuits , factors of a graph,

Planner graph.

Trees- Trees, rooted trees, path length in rooted trees, prefix code, binary search trees,

spanning trees and cut set, minimum spanning trees, kruskal’s and prim’s algorithms for

minimum spanning tree. (8 Hrs)

Unit - V

Algebraic system: Semigroup, Subsemigroup, Monoid, Submonid, Groups, Abelian Group,

Subgroups, Isomorphism, Automorphism, Homomorphism, Ring, Integral domain, field.

Boolean algebra: Lattice and Algebraic systems, Principle of duality, basic properties of

lattice defined by lattices, distributive and complemented lattices, Boolean lattices and

Boolean algebras, Boolean functions and Boolean Expressions, Number system and

Interconversion of number systems. (8 Hrs)

Text Books:

1. C.L. Liu , “ Elements of Discrete Mathematics”, 2nd edition, TMH

2. Seymour Lipschutz,Marc Lipson, “ Discrete Mathematics”, 2nd edition, TMH

Reference Books:

1. Kenneth H. Rosen, Discrete Mathematics and its Application, 5th edition, TMH

2. V. K. Balakrishnan, “ Graph Theory”, TMH

3. B. Kolman , R. Busby and S. Ross, “Discrete Mathematical Structures” 4th edition,

Pearson

4. J. Treamblay , R. Manohar ,” Discrete Mathematical structures with application to

5. computer science” , TMH

6. Sukhendu dey, “Graph theory and its applications”, Shroff publications.

7. John Dossey,Otto,Spence,Eynden, “Discrete Mathematics”, Pearson

publications,5th edition.

Guidelines for ESE:

1. Emphasis should be given to problem solving.

2. The questions are also to be based on algorithms and complexity issues as well

as alternative solutions.


Semester-III Paper III

DISCRETE STRUCTURE AND GRAPH THEORY



ESE (Pr): 25 Marks

Credit: 1

List of Practical Assignments:

1. A program for logical operations using bitwise operators.

2. A program for set operations: Union, Intersection, Difference, Symmetric difference.

3. A program for generation of Power set of a given set.

4. A program for generation of permutations.

5. A program for generation of combinations.

6. A Program for Bubble sort.

7. A Program for Matrix multiplication.

8. A Program for Binary search.

9. A Program for Shortest Path algorithm using Dijkstra's.

10. A program for implementation of Kruskal's algorithm

11. A program for implementation of Prim's algorithm

12. A program for Inter conversion of number system.

Concerned faculty should suitably frame at least 10 practical assignments out of the above

list. Every assignment should include flowchart, algorithm, print out of code with proper

comments and output. Every student is required to submit the assignments in the form of

journal.

Guidelines for ESE:

ESE will be based on the practical assignments submitted by the students in the form of

journal. In the ESE, the students may be asked to perform the practical assignment with

minor modification.

Evaluation will be based on the paper work of flowchart and algorithm, understanding of

the logic and the syntax, quality of program code, execution of the program code, type of

input and output for the program code.


Semester – III Paper - IV

MICROPROCESSOR AND MICROCONTROLLER


Lectures: 3 Hrs / Week ESE [Th]: 80 Marks

ISE: 20 Marks

Paper Duration: 03 hours

Credit: 3

Unit – I

8086/ 8088 CPU: Architecture, Register organisation, Memory segmentation, Addressing

modes, 8086 instruction set, Assembler directives, DOS and BIOS interrupts, Macros and

Procedures. (08

Hrs)

Unit – II

8086 Configuration: Signal Description, Maximum mode system and Minimum mode

system.

Other Peripherals: 8259A PIC architecture and its operating modes, Basic DMA operation,

8237 DMAC block diagram. (08

Hrs)

Unit – III

Main Memory Design: 8086 CPU Read/Write timing SRAM and ROM interfacing

requirement, Address decoding techniques- full, partial and block, troubleshooting the

memory module.

(08

Hrs)

Unit – IV

Multiprocessor Configuration: Multiprocessor System- closely coupled configuration and

loosely coupled configuration, Bus arbitration schemes.

8087 NDP: 8087 co-processor architecture, 8087 data types, Instruction set and

programming, Interconnection of 8087 with 8086. (08

Hrs)

Unit – V

Microcontroller: Introduction to microcontroller, Different types of microcontrollers,

8051 microcontroller architecture, Programming model, 8051 hardware features:

Input/output pins, Internal RAM organization, Ports and Circuits, External memory,

Counters and Timers, Serial data I/O, Interrupts.

(08 Hrs)

Text Books:-

1. A. Ray, K. Bhurchandi, “Advanced Microprocessors and Peripherals: Architecture,

Programming & Interfacing”, Tata McGraw Hill, 3rd Edition, 2004.

2. Kenneth Ayala, “The 8051 Microcontroller Architecture, Programming & Applications”,

Penram International, 2nd edition, 2006.

Reference Books:

1. Soumitra Kumar Mandal, “Microprocessor and Microcontroller: Architecture,

Programming and Interfacing using 8085, 8086 and 8051”, Tata McGraw-Hill.

2. Douglas V Hall, “Microprocessor and Interfacing, Programming and Hardware”, Tata

McGraw Hill, 2nd edition.

3. Peter Abel, “IBM PC Assembly Language and Programming”, Pearson, 5th edition.

4. Ramesh Gaonkar, “Microprocessor architecture, programming and applications”, 2nd

edition.

5. K Uma Rao, “8051 Microcontroller: Internals, Instructions, Programming and

Interfacing”,

Pearson.

6. John E. Uffenbeck, “The 8086/ 8088 Family: Design, Programming and Interfacing”,

Pearson, 1987.

7. Barry B Bray, “The Intel Microprocessors-Architecture, Programming and Interfacing”.

Pearson LPE/PHI, 7th edition.

8. M.T.Savaliya, “8086 Programming and Advanced Processor Architecture”, Wiley India

9. V Udayashannkra, “8051 Microcontroller”, Mc-Graw-Hill.

10. I. Scott Mackenzie, “The 8051 Microcontroller”, Pearson.

Guidelines for ESE:

1. Emphasis should be given to microprocessor programming and basics of

microcontroller.

2. In microprocessor, emphasis should be given to algorithm, code with proper comments

and input-output.

3. Simple assembly language program codes (for 8086 and 8087only) may be asked based

on above syllabus.

4. In program codes, there may not be any boundary.

5. Program must be written with proper comments and input-output.


Semester – III Paper - IV

MICROPROCESSOR AND MICROCONTROLLER LAB



ESE (Pr): 25 Marks

Credit: 1

List of Experiments:

Assembly language programming of 8086:

1. Program for Macro

2. Program for NEAR procedure

3. Program for FAR procedure

4. Program to find factorial of given number

5. Program for Password verification

6. Program for BCD addition

7. Program to display system time & date

8. Program for HEX to BCD conversion

9. Program for BCD to HEX conversion

10. Program for generating sine wave using 8087 instructions

11. Program for calculation of sum of series such as 1+x/1! – x/2! using 8087

Instructions

12. Program to solve the Quadratic equations using 8087 instructions

13. Program to generate Fibonacci series

14. Program for addition of first 50 BCD numbers

The term work should include minimum 10 experiments. Program based on 8087 are

compulsory.


list. Every assignment should include algorithm, program code with proper comments and

input-output. Every student is required to submit the assignments in the form of journal.

Guidelines for ESE:



minor modification.


Semester-I Paper V

OBJECT ORIENTED TECHNOLOGY (OOT)



ISE: 20 Marks


Credit: 3

UNIT- I:Introduction to Object Oriented Programming Introduction:

Introduction to procedural, modular and object-oriented programming techniques.

Limitations of procedural programming. Need of object-oriented programming.

Advantages, disadvantages and applications of OOP.

Object-Oriented Programming Concepts

Class, Objects, Abstraction, Encapsulation, Data Hiding, Inheritance, Polymorphism and

Message passing.

The Basics of C++

Basic data types and sizes, User-defined data types, Variable declarations and variable

names. Constants, Standard input and standard output: input with cin, output with cout.

Use of << and >> operators, Operators in C++.

Expressions: What are Expressions? Operator precedence, Precedence and order of

evaluation, Conditional expression, Casting and type conversion.

(8 Hrs)

UNIT –II:Classes and Objects, Function and Operator Overloading Class and Objects:

Concept of a class, defining a class, creating an object, memory allocation for objects, object

scope. Data abstraction and data encapsulation. Scope resolution operator. Accessing of

class members,defining member functions (inside/outside class). Static data and function

members. Nesting of member functions.

Constructors and Destructors:

Constructor, default constructor, parameterized constructors, default argument

constructor, copy constructor and destructors.

Functions in C++:

Introduction, argument passing, inline functions, recursive functions, function with default

argument, call by reference, friend function, passing objects as arguments and returning

object.

Function Overloading:

What is function overloading? , Rules for function overloading.

Operator overloading:

Introduction, rules for operator overloading. Overloading unary and binary operators using

member function and friend function. Converting data types: basic to class type, class to

basic type and class to another class type.

(8 Hrs)

UNIT –III: Pointers and Arrays

Introduction, pointer declaration, void pointers, pointers to class objects, this pointer,

pointers to members, accessing private members with pointers.

Arrays:

Characteristics of arrays, initialization of arrays, arrays within a class, arrays of objects.

Dynamic memory allocation using new and delete operators. One dimensional and two

dimensional arrays using pointers.

(8 Hrs)

UNIT -IV: Inheritance, Virtual functions and Polymorphism

Inheritance:

Introduction, base and derived classes. Inheritance types, access modifiers, single

inheritance, multiple and multilevel inheritance, hybrid, hierarchical, multipath inheritance

and virtual base classes. Overriding base class members. Constructors and inheritance,

calling base class constructor.

Virtual functions and Polymorphism:

Static and dynamic binding. Pointers to base and derived classes. Virtual functions, rules for

virtual functions, working of virtual functions, pure virtual functions. Virtual base classes.

(8 Hrs)

UNIT- V: Files and Streams, Managing Console I/O Operations and

Templates

Files and Streams:

Concept of a file, file stream operations, opening a file using constructor and open function,

closing a file, detecting end-of-file, file modes, file pointers.

Managing Console I/O Operations:

Introduction, C++ streams, stream classes, unformatted and formatted I/O, ios class

functions and flags, manipulators.

Templates:

Introduction, function template and class template, overloading of templates functions,

member function templates and template arguments. (8 Hrs)

Text Books:

1. E. Balagurusamy, “Object Oriented Programming with C++”, Fifth Edition, Tata

McGraw Hill, 2011.

2. Robert Lafore, “Object Oriented Programming in C++”, Fourth Edition, Pearson

Education, 2002.

Reference Books:

7. Ashok N. Kamthane, “Object-Oriented Programming with ANSI and Turbo C++”,

Pearson Education, 2006.

8. Rajesh K. Shukla, “Object-Oriented Programming in C++”, Wiley India, 2008.

9. Bjarne Stroustrup, “C++ Programming Language”, Third Edition, Addison Wesley,

2002.

10. Yashavant P. Kanetkar, “Let Us C++”, Second Edition, BPB Publications, 2003.

11. Venugopal K.R., “Mastering C++”, First Edition, TMH, 1999.

12. Mahesh Bhave, Sunil Patekar, “Object Oriented Programming with C++”, Second

Edition, 2012.

13. Herbert Schildt, “The Complete Reference C++”, Fourth Edition, TMH, 2003.

Guidelines for ESE:

I. Emphasis should be given to logic and syntax.

II. Algorithms may be written in natural English language.

III. Simple programs may be asked based on above syllabus. In each UNIT, at the least

50% of the questions should be based on programs.

IV. In programs, there may not be any boundary of UNITs.

V. In programs, variable declaration must be commented with the purpose of variable

usage.

VI. In programs, every block / statement must be properly commented.


Semester-I Paper V

OBJECT ORIENTED TECHNOLOGY (OOT)



ESE (Pr):25 Marks

Credit: 1


PART - A

1. Write a program for a simple class and object.

2. Write a program for parameterized constructor.

3. Write a program for overloading constructors.

4. Write a program to find the area of rectangle, triangle and sphere using function

overloading.

5. Write a program to overload unary operator using member function.

6. Write a program to overload binary operator using member function.

7. Write a program for arrays of pointers to objects.

8. Write a program using single inheritance, multiple inheritance and hierarchical

inheritance.

9. Write a program using multilevel inheritance and hybrid inheritance.

10. Write a program for virtual base classes.

11. Write a program to read and write class objects from files.

12. Write a program to format output using ios class functions and flags.

13. Write a program to format output using manipulators.

14. Write a program using class template.

15. Write a program for overloading of template functions.

PART – B

1. Write a program for the copy constructor.

2. Write a program to overload unary operator using friend function.

3. Write a program to overload binary + operator using member function for

concatenation of two strings.

4. Write a program for matrix multiplication using new and delete dynamic memory

allocation operators.

5. Write a program to convert class type data to basic type data.

6. Write a program for run time polymorphism using virtual functions.

7. Write a program for bubble sort using template functions.

Concerned faculty should suitably frame at least 10 practical assignments (SIX from PART –

A and FOUR from PART – B) out of the above list. Every assignment should include

algorithm, print out of code with proper comments and output. Every student is required to

submit the assignments in the form of journal.

Guidelines for ESE:



minor modification.

Evaluation will be based on the paper work of algorithm, understanding of the logic and the

syntax, quality of the program, execution of the program, type of input and output for the

program.

Soft Skills – III

COURSE OUTLINE

Course Title Short Title Course Code

Soft Skills – III SK-III

Course Description: Through this course we have tried to prepare the students for the

industry. Most companies test mathematical and logical ability through an aptitude test.

This subject aims at working on these skills of a student through strategies formulae and

practice exercises.

Lecture

Hours per Week No. Of Weeks Total Hours Semester Credits

1 14 14 2

Prerequisite Course(s): Fundamental knowledge of High School Mathematics.

COURSE CONTENT

Aptitude Development-I Semester-III

Teaching Scheme Examination Scheme

Lecture: 1 hour / week Internal Continuous Assessment (ICA): 50 Marks

Unit-I: Arithmetic-1 No. of Lect. – 3, Marks: 10

a. Basic Formulae

i. Divisibility Rules

ii. Speed Maths

iii. Remainder Theorem

iv. Different Types of Numbers

v. Applications

b. HCF, LCM and Linear Equations

i. HCF – Successive Division and Prime Factorization Methods

ii. LCM – Successive Division and Prime Factorization Methods

iii. Applications

iv. Linear Equations – Elimination Method

v. Substitution Method

vi. Applications

c. Averages and Mixtures

i. Concept of Average

ii. Faster Ways of Finding It

iii. The Allegation Method

iv. Applications

Unit-II: Arithmetic–II No of Lect. – 3, Marks: 10

a. Percentages

i. Concept of Percentage

ii. Working with Percentages

iii. Applications

b. Profit and Loss

i. Difference between Cost and Selling Price

ii. Concept of Profit Percentage and Loss Percentage

iii. Applications

c. Time and Work

i. Basic Time and Work Formula

ii. Relation between Time and Work

iii. Applications

Unit-III: Arithmetic–III No of Lect. –3, Marks: 10

a. Permutations and Combinations

i. Sum Rule of Disjoint Counting

ii. Product Rule of Counting

iii. Concept of Factorial

iv. Permutations

v. Linear Permutations

vi. Combinations

vii. Circular Permutations

viii. Applications

b. Probability

i. Definition and Laws of Probability

ii. Mutually Exclusive Events

iii. Independent Events

iv. Equally Likely Events

v. Exhaustive Events

vi. Cards

vii. Dice

viii. Applications

c. Time and Distance

i. Speed

ii. Conversion Factors for Speed

iii. Average Speed

iv. Moving Bodies – Passing, Crossing and Overtaking

v. Relative Speed

vi. Boats and Streams

vii. Applications

Unit-IV: Non-Verbal Reasoning No of Lect. 2, Marks: 10

a. Analogies

i. Examples

ii. Applications

b. Classification

i. Examples

ii. Applications

c. Sequences

i. Examples

ii. Applications

Unit-V: Analytical Reasoning No of Lect. – 3, Marks: 10

a. Analytical Puzzles

i. Classification Puzzles

ii. Ordering Puzzles

iii. Assignment Puzzles

iv. Applications

b. Letter and Number Series

i. Different Types of Letter Series

ii. Different Types of Number Series

iii. Mixed Series

c. Coding and Decoding

i. Letter Coding

ii. Number Coding

iii. Mixed Coding

iv. Odd Man Out

v. Applications

Guide lines for ICA:

ICA will be based on credit tests and assignments submitted by the student in the form of

journal.

Reference Books:

1. R. S. Aggarwal, “Quantitative Aptitude”, S. Chand Publication, New Delhi, 2012.

2. R. S. Aggarwal, “A Modern Approach to Verbal Reasoning”, S. Chand Publication,

New Delhi, 2012.

3. R. S. Aggarwal, “A Modern Approach to Non-Verbal Reasoning”, S. Chand

Publication, New Delhi, 2012.


Semester- IV Paper- I

DATA COMMUNICATION


Theory: 3 Hrs / Week ESE (Th): 80 Marks

ISE: 20 Marks


Credit: 3

UNIT- I

Introduction to Data Communication and Signals

Basics of Data Communication: Characteristics and Components, Data representation and

Data flow, Networks, Introduction to ISO-OSI reference model.

Introduction to Signals and Transmission Impairments: Analog and Digital, Periodic analog

signals, Digital signals, Transmission impairment, Data rate limits, Performance.

(8 Hrs)

UNIT –II

Digital transmission and Analog transmission

Digital to Digital Conversion: Line Coding, Block Coding, Analog to Digital Conversion: Pulse

Code Modulation (PCM), Transmission Modes: Parallel transmission, Serial transmission,

Digital-to-analog Conversion: Aspects of Digital-to-Analog Conversion, Modulation:

Amplitude Shift Keying, Frequency Shift Keying, Phase Shift Keying, Quadrature Amplitude

Modulation.

(8 Hrs)

UNIT –III

Multiplexing and Transmission Media

Multiplexing: Frequency-Division Multiplexing, Wavelength-Division Multiplexing,

Synchronous Time-Division Multiplexing, Statistical Time-Division Multiplexing

Guided Media: Twisted-Pair, Coaxial and Fiber-Optic cable, Unguided Media: Wireless, radio

waves, Microwaves, Infrared.

(8Hrs)

UNIT -IV

Switching and Multiple Access

Circuit-switched Networks: Three Phases, Efficiency, and Delay. Datagram networks:

Routing Table, Efficiency, Delay, Virtual-circuit networks: Addressing, Three phases,

Efficiency, Delay in Virtual-Circuit Networks.

Multiple Access: Random Access - MA, CSMA, CSMA/CD, CSMA/CA, Control Access,

Channelization - FDMA, TDMA and CDMA.

(8 Hrs)

UNIT- V

Error Control and Data Link Control

Types of errors: Redundancy, detection versus correction, forward error correction versus

retransmission, coding, modular arithmetic Block coding: error detection, error correction,

hamming distance, minimum hamming distance. Cyclic codes: cyclic redundancy check.

Checksum: idea, one’s complement, Internet checksum.

Flow and error control: Stop and wait ARQ, Go-back-N ARQ, selective repeat ARQ,

Piggybacking

(8Hrs)

Text Books:

1. Behrouz A Forouzan, “Data Communications and Networking”, 4th Edition: Tata

McGraw Hill.

2. P. C. Gupta, “Data Communications”, PHI Publications.

Reference Books:

1. William Stallings, “Data & Computer Communications”, 7th Edition: PHI

Publication.

2. Leon - Garcia, Indra Widijaja, “Communication Networks Fundamental Concepts

and Key Architectures” 2nd Edition: McGraw Hill Education.

3. Achyut Godbole, “Data Communication Networks”, Tata McGraw Hill.

4. Bruce Hartpence, “Packet Guide to Routing and Switching”, O’Reilly.

5. Bruce Hartpence, “Packet Guide to Core Network Protocol” , O’Reilly.

6. James Irvine & David Harle, “Data Communication and Networks: An Engineering

Approach”, Wiley Edition.

Guidelines for ESE:

• In the ESE, the students may be asked to be the data communication concepts and

their practical application.

• Evaluation will be based on the student understanding of the subject, and able to

solve the numerical based on Data communication.


Semester-IV Paper- I

DATA COMMUNICATION LAB


Practical: 2 Hrs/Week ICA: 50 Mark

Credit: 1


PART- A

1. Comparative analysis of different types of network cables with Specifications

2. Implementation of Network performance calculator.

3. Network related commands such as ARP, IPCONFIG, PING, TRACERT, NSLOOKUP,

GETMAC, NETSTAT etc.

4. I.T Infrastructure planning using Network Connecting Devices.

5. Network Connecting Devices Specifications and configurations.

PART-B

1. Implementation of Stop and Wait Protocol

2. Implementation of Internet checksum

3. Crimping of cross-wire and straight-through UTP cable to inter-connect two

computers.

4. Interconnections of computers in Local Area Network to share resources.

5. Implementation of cyclic redundancy check

(Note: All Assignments are Compulsory.)


Semester-IV Paper - II

MICROPROCESSOR AND MICROCONTROLLER INTERFACING


Theory: 3 Hrs/ Week ESE (Th): 80 Marks

ISE: 20 Marks


Credit: 4

Unit – I

MSDOS FAT, MS DOS device drivers types, Structure of device drivers.

Basic I/O Interface: Introduction, 8255 PPI: Internal block diagram, control word and

status word, modes of operation, numericals on control word design.

Unit – II

8254 PIT: Internal block diagram, Control word format, Operating modes, Numericals on

control word design.

8251 USART: Architecture and signal description, Operating modes, Interfacing with 8086

and numericals.

TSR programs: Concept and implementation.

Unit – III

Functional block diagram of PC,

Motherboard (8086/8088 based) : Motherboard components, Motherboard logic, Reset

logic, Interrupt logic, RAM parity logic, NMI logic, Wait state logic, Bus arbitration logic,

RAM & ROM logic, CPU logic, DMA logic, Keyboard interface block diagram.

Microcomputer display: Raster scan basics, Overview of character display control system.

PC display adapters: CGA, EGA, VGA.

Introduction to LCD and Plasma display.

Unit – IV

Parallel printer Interface, 7 segment display interface,

Disk reading methods: FM, MFM.

Internal structure of floppy disk and hard disk.

Floppy disk controller: Overview, FDC system interface, Overall operation of floppy disk

subsystem, 8272 FDC: Internal block diagram and commands.

Hard disk controller: HDC commands and device control block (DCB).

Unit – V

8051 Microcontroller interfacing: Interfacing LEDs and 7 segment display, Keys and

keyboard interfacing, Interfacing ADC 0808/0809, Interfacing DAC 0808/0809, Interfacing

stepper motors.

Reference Books

1. Douglas V. Hall, “ Microprocessors and Interfacing : Programming and Hardware”, Second

edition , Tata McGraw Hill.

2. A. K. Ray& K. M. Bhurchandi, “Advanced Microprocessor and Peripherals – Architecture,

Programming and Interfacing”, Third edition, Tata Mc Graw Hill.

3. Peter Abel, “ IBM PC Assembly language and programming” , Fifth edition, Pearson

education/ Prentice Hall of India Pvt. Ltd.

4. B. Govindarajalu, “IBM PC Clones”, second edition, Tata McGraw Hill,

5. Ray Duncan, “Advanced MS-DOS Programming”, Second edition, Microsoft Press.

Guidelines for ESE: V. Emphasis should be given to block diagrams.

VI. Simple numericals may be asked in Unit–I and Unit–II. At least one question must be asked

on numericals for these two units.

VII. For Unit-IV and Unit– V, emphasis should be on questions based on interfacing.


Semester-IV

MICROPROCESSOR AND MICROCONTROLLER INTERFACING

LAB


Practical: 2 Hrs/ Week ICA: 25 Marks

ESE (Pr): 25 Marks

Credit: 1


PART - A

Assembly language programming for 8086.

1. Program for mouse interfacing. 2. Program for graphics editor.

3. Program for PC to PC communication using serial port. 4. Program for parallel printer interfacing.

5. Program for ADC interfacing with 8086. 6. Program for DAC interfacing with 8086.

7. Program for stepper motor interfacing. 8. Program for printer device driver.

PART - B

Assembly language programming for 8051.

1. Program for interfacing LEDs.

2. Program for interfacing 7-segment displays.

3. Program for keyboard interfacing.

4. Program for ADC interfacing.

5. Program for DAC interfacing.

6. Program for stepper motor interfacing.

Concerned faculty should suitably frame at least 8 practical assignments (FOUR from each

part) out of the above list. Every assignment should include algorithm, print out of code

with proper comments and output (if possible). Every student is required to submit the

assignments in the form of journal.

Guidelines for ESE:



minor modification.

Evaluation will be based on the paper work of algorithm, understanding of the logic and the

syntax, quality of program code, execution of the program code, type of input and output for

the program code.


Semester-IV Paper III

DATA STRUCTURES



Tutorial: 1 Hrs/Week ISE: 20 Marks


Credit: 4

UNIT - I

Introduction to Data Structures:

Concept of Data, Data objects, Data structure, Abstract Data Type (ADT) and

Implementation of data structure. Basic terminologies with data structures, types of data

structures, data structure operations, Arrays, structures, pointers. (8 Hrs) UNIT – II

Stack and Queue:

Fundamentals of stack, Data Structure of stack, PUSH and POP operations on stack,

Applications of stack like Infix, Postfix and Prefix and their interconversions, Recursion,

Tower of Hanoi, Function call, Multiple stack.

Fundamentals of queue, Data structure of queue, Insert and Delete operations on queue,

Circular queue, priority queue, double ended queue, Applications of queue. (8 Hrs) UNIT – III

Linked Lists:

Fundamentals of Linked Lists, Representation of linked list in memory, Memory allocation

and Garbage collection, Basic operations on linked list like traversal, searching, insertion,

deletion, copy and concatenation. Header linked list, representing polynomials using linked

list, multivariable polynomials using generalized list. Two way Lists (Double Linked list),

Basic operations on two way lists like traversal, searching, insertion and deletion. (8 Hrs) UNIT – IV

Trees:

Fundamentals of Trees, Representation of Tree in memory, Traversing binary trees,

Traversal algorithms using stack, Header nodes, threaded binary tree, Binary search trees,

Basic operations on BST like creation ,searching ,insertion, deletion, AVL search trees,

Insertion and deletion in an AVL search tree, LL,LR,RL and RR Rotations, Path lengths,

Huffman algorithm. (8 Hrs) UNIT – V

Searching and Sorting:

Linear search, Binary search, Hashing, Hash functions, Collision resolution, open

addressing, linear probing and modifications, chaining.

Time and Space complexity of an algorithm, Big ‘O’,Ω,Ѳ notation

Sorting: Bubble sort, Insertion sort, Selection sort, Merge sort, Quick sort, Radix sort, Heap

sort.

Best, worst and average case time complexity of each of sorting and searching technique.

(8 Hrs)

Text Books:

3. Seymour Lipschutz, “Data Structures”, Schaums Outlines Tata McGraw Hill, 2006.

4. Ellis Horowitz and Sartaj Sahani, “Fundamentals of Data Structures”, Galgotia

Publication.

Reference Books:

14. G.S.Baluja, “Data Structures through C”, Dhanpatrai Publications.

15. Ashok N. Kamthane, “Introduction to Data structures in C”,Person Publications,2007.

16. Aarom Tanenbaum,Yedidyah Langsam,Moshe Augenstein, “ Data structures using

C”,Pearson Publications.

17. Alfred Aho,John Hopcroft,Jeffrey Ullman, “Data Structures and Algorithms”,Pearson

Publications.

18. E.Balagurusamy, “Data structures using C”,Tata McGraw Hill publications.

19. P.S.Deshpande,O.G.Kakde,”C and Data Structures”,dreamtech press publications.

20. Rajesh K.Shukla, “Data Structures using C and C++” ,Willy India Publication.

21. Larry Nyhoff, “ADTs’ Data Structures and prolems with C++”, Pearson Publications.

Guidelines for ESE:

VIII. Emphasis should be given to logic and syntax.

IX. Algorithms may be written in natural English language.

X. Simple program codes may be asked based on above syllabus. In each UNIT, at least

50% of the questions should be based on program codes.

XI. In program codes, there may not be any boundary of UNITs.

XII. In program codes, variable declaration must be commented with the purpose of

variable usage.

XIII. In program codes, every block / statement must be properly commented.


Semester-IV Paper III

DATA STRUCTURES



ESE (Pr): 25 Marks

Credit: 1

Practicals are to be conducted in C language.


13. Implementation of Stack Using Array or Linked List.

14. Implementation of Queue Using Array or Linked List.

15. Implementation of Circular Queue Using Array or Linked List.

16. Conversion of Infix Expression to Postfix Expression.

17. Conversion of Postfix Expression to Infix Expression.

18. Addition of two single variable polynomials using Linked List.

19. Implementation of double linked list & perform insertion, deletion and searching.

20. Creation of binary tree & perform all non-recursive traversals.

21. Creation of binary search tree & perform insertion, deletion and printing in tree

shape.

22. Create a Hash table and handle the collision using linear probing with or without

replacement.

23. Implementation of Quick Sort

24. Implementation of Radix Sort.

25. Implementation of Merge Sort.

26. Conversion of Infix Expression to Prefix Expression.


list. Every assignment should include flowchart, algorithm, print out of code with proper

comments and output. Every student is required to submit the assignments in the form of

journal.

Guidelines for ESE:



minor modification.

Evaluation will be based on the paper work of flowchart and algorithm, understanding of

the logic and the syntax, quality of program code, execution of the program code, type of

input and output for the program code.


Semester-IV Paper V

COMPUTER ORGANIZATION



ISE: 20 Marks


Credit: 3

Unit – I

Introduction to system concepts: Functional Units, Basic operational concepts, Bus

structure (Single, Two and Multiple), Instruction formats- zero, one, two, three and one &

half address, Expanding op-codes, General addressing modes. (8 Hrs)

Unit – II

Arithmetic: Number representation- Signed & magnitude, 1s & 2s compliment, Sign

addition & subtraction, Multiplication of positive numbers using sequential circuit binary

multiplier, Booths algorithm, Bit pairing of multipliers, Restoring and non-restoring

division algorithm.

Floating Point system: Single and double precision, IEEE floating point format. (8 Hrs)

Unit – III

Processing Unit: Single and three bus organization inside CPU, Execution of complete

instruction (no timing diagram).

Control Unit: Hardwired control, Micro programmed control, Microinstructions,

Microprogram sequencing, Wilkes design. (8 Hrs)

Unit – IV

Memory: Some basic concept, SRAM, DRAM, ROM, PROM EPROM, EEPROM, Inroduction of

SDRAM, RDRAM, DDRSDRAM (without any figure & organization), Memory hierarchies.

Cache Memories: Concepts, Mapping functions, Virtual memory, Memory interleaving,

Introduction to flash memory. (8 Hrs)

Unit – V

System Organization: Bus Concept, Bus arbitration techniques, Daisy chaining, Polling,

independent requesting, PCI Bus, SCSI Bus, USB, RISC & CISC concepts, RISC Vs CISC, RAID

concepts. (8 Hrs)

Text Book:

1. Hamacher, Vransic, Zaky, “Computer Organization”, 5th Ed., McGraw Hill

international.

Reference Books:

1. P. Hayes, “Computer Architecture and Organization”, 3rd Ed. McGraw Hill

international.

2. Sajjan Shiva, “Computer Organization Design & Architecture”, CRC Press

Publication.

3. Tanenbaum, “Structured Computer Organization”, Pearson.

4. William Stallings, “Computer Organization and Architecture”, 6th Ed, Pearson.

5. Swati Saxena,”Computer Organization” Dhanpat Rai Publication.

6. Murdocca, Heuring, “Computer Architecture & Organization”, 2nd Ed, Wiley.

Guidelines for ESE:

I. Emphasis should be cover basic operational concepts.

II. Appropriate example will be cover based on above syllabus.

III. Appropriate questions may be asked on basis of above syllabus.


Semester-IV Paper V

COMPUTER GRAPHICS



ISE: 20 Marks


Credit: 3

Unit – I

Basic Concepts: Introduction to computer graphics, Application of computer graphics.

Graphics Hardware Devices: Input and output devices.

Linear and Circle Generation: Line generation – DDA and Bresenhams algorithm

Antialiasing, Circle generation – DDA and Bresenhams algorithm, Character generation –

Stroke principal, Starburst principle, Bitmap method. (8 Hrs)

Unit – II

Polygons: Types, Representations, Entering polygon, Polygon filling: Edge flag, Seed fill,

Flood fill, Scan conversion algorithm, An Inside outside test.

Scan conversion: Real time scan conversion, Solid area scan conversion, Run length

encoding and Cell encoding.

Segments: Concepts, Segment table, Segment creation, Deletion, Renaming, Closing. (8 Hrs)

Unit – III

2D and 3D Geometry: 2D transformations -Translation, Scaling, Rotation, Rotation about

an arbitrary point, Shearing, 3 D transformations- Translation, Scaling, Rotation, Rotation

about an arbitrary axis, Shearing, Parallel and Perspective projections, 2D viewing transformation. (8 Hrs)

Unit – IV

Clipping Fundamentals: Types of clipping, Line clipping: Cohen Sutherland algorithm, Mid-

point subdivision algorithm, Generalized clipping with Cyrus Beck algorithm. Polygon clipping:

Sutherland-Hodgman algorithm.

Hidden Surfaces and Lines: Introduction, Back face removal algorithm, Z-buffer algorithm,

Warnock’s algorithm, Painter algorithm. (8 Hrs)

Unit – V

Light and Color: Basic illumination models-Diffused illumination, Point source illumination,

Color models: RGB, HVS, and CYM.

Graphics Standard: Introduction to graphics kernel system with basic primitives.

Curves and Fractals: Bezier curve, Fractals, Fractal Surfaces and lines, B Spline and corner.

(8 Hrs)

Text Books:

1. "Computer graphics", ISRD group, THM publications, eleventh reprint 2012.

Reference Books:

1. David F. Rogers, “Procedural Elements for Computer Graphics, Tata McGraw Hill, 2nd

Ed.

2. Shirley, Marshner, “Fundamentals of Computer Graphics”, 3rd Ed, CRC Publication/

A.K. Peters.

3. Steven Harringtom, “Computer graphics A Programming Approach”, MGH.

4. Maurya, “Computer Graphics: with virtual reality system”, Wiley India.

5. Foley, Vandam, Feiner, Hughes, “Computer Graphics Pricipals & Practice”, Pearson,

2nd Ed.

6. Donald Hearn and Pauline Baker,” Computer Graphics”, Pearson LPE, 2nd Ed.

7. Rao and Prasad,” Graphics user interface with X windows and MOTIF”, New Age.

8. Mukherjee, “Fundamentals of Computer Graphics and Multimedia”, PHI.

Guidelines for ESE:

XIV. Emphasis should be given to logic and syntax.

XV. Appropriate algorithms and example will be taken based on above syllabus.

XVI. Algorithms may be written in natural English language.

XVII. Simple program codes may be asked based on above syllabus.


Semester-IV Paper V

COMPUTER GRAPHICS


1. Study of various Graphics Commands

2. Line generation using DDA

3. Different Line Style using Bresenham’s Algorithm

4. Circle Generation using Bresenham’s Algorithm

5. Program for Polygon Filling

6. Program for 2D Transformations (Translation, Rotation and Scaling)

7. Program for Segmentation

8. Program for line clipping

9. Program for Polygon clipping

10. Program for 3D rotation

11. Program for Parallel Projections

12. Program for Perspective Projection

13. Program for Animation

14. Program for Bezier Curve

15. Mini Project: Developing some Graphics application

16. Study assignment on any latest GUI application or mini-project.

Concerned faculty should suitably frame at least 10 practical assignments.

Guidelines for ESE:

I. Emphasis should be given to logic and syntax.

II. Algorithms may be written in natural English language.

III. Simple program codes may be asked based on above syllabus.


Semester-IV

APPLICATION DEVELOPMENT LAB


Theory: 1 Hrs/Week ICA: 50 Marks

Credit: 2

UNIT- I

Html: Introduction to HTML, HTML Editors, HTML Headings, HTML Paragraphs, HTML

Links, HTML Images, HTML Elements, Attributes and text formatting. (3 Hrs.)

UNIT –II

CSS, Tables, Lists, Layouts, Forms and Input, Java & VB Scripts, Entities, Uniform Resource

Locators (URL's), Multimedia (Audio, Video and Image). (3 Hrs.)

UNIT –III

XML: XML Basics, XML Elements, Working with DTD. (3 Hrs.)

UNIT -IV

Adding Style, Using Schemas. (3 Hrs.)

UNIT- V

Java: Input/output, Applet Class, Event handling, Introduction to AWT: working with

windows, Graphics and Text. (3 Hrs.)

Text Books:

5. Jon Duckett, “Beginning HTML, XHTML, CSS, and JavaScript”, John Wiley & Sons

publication, 2010.

6. Heather Williamson, “XML: The Complete Reference”, 1st Edition, Tata McGraw-Hill

Education, 2001.

7. Herbert Schildt, “Java: The Complete Reference”, 7th Edition, Tata McGraw-Hill

Education, 2006.

Reference Books:

22. Thomas A. Powell, “HTML & CSS: The Complete reference”, 5th edition, TMH 2010.

23. Elliotte Rusty Harold, “XML 1.1 Bible”, 3rd edition, Willey Publication, 2004.

24. Steven Holzner, “XML: A Beginner's Guide”, 1st Edition, TMH, 2009.

25. Herbert Schildt, “Java: A Beginners Guide”, 5th Edition, TMH, 2011.

26. Yashavant Kanetkar, “Let Us Java”, BPB Publication, 2011.

Guidelines for ICA:

XVIII. Emphasis should be given to logic and syntax.

XIX. Algorithms may be written in natural English language.

XX. In program codes, there may not be any boundary of UNITs.


Semester-IV

APPLICATION DEVELOPMENT LAB




1. Develop a complete web page using HTML basic tags.

2. Design a web form containing CSS, Table and Layout.

3. Design a single page web site for a university containing a description of the

courses offered, it should also contain some general information about the

university such as its history, the campus and its unique features.

4. Demonstration of Tables, Frames and Hyperlinks in an HTML Document.

5. Implementation of calculator using VB or Java script.

6. Develop a web page for student information using XML.

7. Create a web page on Menu (Food/Books/Cars) in XML without any Style Sheet

Information.

8. Create a web page on CD Catalog in XML with external Style Sheet attached.

9. Create a well formed application using XML and DTD.

10. Program to sort the numbers in an array.

11. Program to implement simple java application using Key Listener.

12. Implementation of calculator using Applet.

13. Design a form using AWT.

Concerned faculty should conduct at least 10 practical assignments from above list. Every

assignment should include flowchart, algorithm, print out of code with proper comments

and output. Every student is required to submit the assignments in the form of journal.

SE(Computer)

Documents

computer graphics lab

data communication lab

data structures lab

computer graphics d

computer organization

data structures d

inverse laplace transform

b z transform