1

SCHEME OF EXAMINATION

and

SYLLABI

for

Bachelor of Technology
Computer Science and Engineering

Offered by

University School of Engineering and Technology

1st SEMESTER TO 8th SEMESTER

Guru Gobind Singh Indraprastha University

Dwarka, Delhi – 110078 [INDIA]
www.ipu.ac.in

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
 3

BACHELOR OF TECHNOLOGY
(COMMON TO ALL BRANCHES)
SECOND SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits Status

THEORY PAPERS
ETMA-102 Applied Mathematics-II 3 1 4 M
ETPH-104 Applied Physics-II 2 1 3
ETEC-106 Electronic Devices 3 0 3 M
ETCS-108 Introduction to Programming 3 0 3 M
ETME-110 Engineering Mechanics 2 1 3 --
ETHS-112 Communication Skills 2 1 3 --
ETEN-114 Environmental Studies 2 1 3 --
PRACTICAL/VIVA VOCE
ETPH-152 Applied Physics Lab-II ------- 2 1
ETCS-154 Programming Lab ------- 2 1 M
ETEC-156 Electronic Devices Lab ------ 2 1 M
ETME-158 Engineering Mechanics Lab ------- 2 1 --
ETEN-160 Environmental Studies Lab ------- 2 1 --
NCC/NSS*# ------- ------ ------ --
TOTAL 17 15 27

M: Mandatory for award of degree

#NUES (Non University Examination System)
*#NCC/NSS can be completed in any one semester from Semester 1 – Semester 4. It will be evaluated internally
by the respective institute. The credit for this will be given after fourth Semester for the students enrolled from the
session 2014-15 onwards. The camps/classes will be held either during Weekends/Holidays or Winter/Summer
Vacations.

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 11

APPLIED MATHEMATICS-III

Paper Code: ETMA-201 L T/P C

Paper: Applied Mathematics-III 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 12.5 marks.

Objectives: The objective of this course is to teach the students the applications of fourier series, fourier
transform, difference equation and numerical methods to solve various engineering problems.

UNIT-I
Fourier series: Definition, Euler’s formula, conditions for Fourier expansion, functions having points of
discontinuity, change of intervals, even and odd functions ,half range series, Harmonic analysis. Fourier
Transforms: Definition, Fourier integral, Fourier transform, inverse Fourier transform, Fourier sine and cosine
transforms, properties of Fourier transforms (linearity, scaling, shifting, modulation), Application to partial
differential equations.
[T2][No. of hrs 11]
UNIT-II
Difference equation: Definition, formation, solution of linear difference equation with constant coefficients
,simultaneous difference equations with constant coefficients, applications of difference equations .Z- transform:
Definition, Z- transform of basic functions, properties of Z-transform (linearity, damping, shifting,
multiplication),initial value theorem, final value theorem, convolution theorem, convergence of Z- transform,
inverse of Z- transform, Application to difference equations.
[T2][No. of hrs 11]
UNIT-III
Numerical Methods: Solution of algebraic and transcendental equations using bisection method, Regula-Falsi
method and Newton – Raphson method. Solution of linear simultaneous equations using Gauss-Jacobi’s iteration
method and Gauss-Seidal’s iteration methods.Finite differences: Forward differences, backward differences and
Central differences. Interpolation: Newton’s interpolation for equi-spaced values. Stirling’s central difference
interpolation formula, Divided differences and interpolation formula in terms of divided differences , Lagrange’s
interpolation formula for unequi-spaced values.
[T1,T2] [No. of hrs 11]
UNIT-IV
Numerical Differentiation, maxima and minima of a tabulated function. Numerical Integration: Newton-Cote’s
quadrature formula, Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule .Numerical
solution of ordinary differential equations: Picard’s method, Taylor’s method,Euler’s method, modified Euler’s
method, Runge-Kutta method of fourth order.
[T1,T2][No. of hrs 11]
Text Books:
[T1] R.K. Jain and S.R.K. Iyengar,” Numerical methods for Scientific and Engineering Computation”,
New Age Publishing Delhi-2014.
[T2] B. S. Grewal,”Higher Engineering Mathematics” Khanna Publications, 2014 Edition.

Reference Books:
[R1] E. kresyzig,” Advance Engineering Mathematics”, Wiley publications
[R2] P. B. Patil and U. P. Verma, “ Numerical Computational Methods”, Narosa
[R3]. Partial Differential Equations” Schaum’s Outline Series, McGraw Hill.
[R4] Michael Greenberg, “ Advance Engineering mathematics” , Pearson.
[R5] Schaum’s Outline on Fourier Analysis with Applications to Boundary Value Problem, Tata McGraw-
Hill

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 12

FOUNDATION OF COMPUTER SCIENCE

Paper Code: ETCS-203 L T C

Paper: Foundation of Computer Science 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, the student may be asked to attempt only 1 question from each unit.
Each question should be 12.5 marks.

Objective: Objective: To give basic knowledge of combinatorial problems, algebraic structures and graph theory.

UNIT- I
Formal Logic: Preposition, Symbolic Representation and logical entailment theory of Inferences and tautologies,
Predicates, Quantifiers, Theory of inferences for predicate calculus, resolution. Techniques for theorem proving:
Direct Proof, Proof by Contraposition, proof by contradiction.
[T1,T2][No. of hrs. 10]
UNIT- II
Overview of Sets and set operations, permutation and combination, principle of inclusion, exclusion (with proof)
and pigeonhole principle (with proof), Relation, operation and representation of a relation, equivalence relation,
POSET, Hasse Diagrams, extremal Elements, Lattices, composition of function, inverse, binary and n-ary
operations.
[ T1,T2][No. of hrs. 12]
UNIT- III
Principle of mathematical induction, principle of complete induction, solution methods for linear and non-linear
first-order recurrence relations with constant coefficients, Graph Theory: Terminology, isomorphic graphs,
Euler’s formula (proof) ,chromatic number of a graph, five color theorem(with proof), Euler &Hamiltonian paths.
[ T1,T2][No of hrs 11]
UNIT-IV
Groups, Symmetry, subgroups, normal subgroups, cyclic group, permutation group and cayles’s theorem(without
proof), cosets lagrange’s theorem(with proof) homomorphism, isomorphism, automorphism, rings, Boolean
function, Boolean expression, representation & minimization of Boolean function.
[ T1,T2][No of hrs 11]
Text Books:
[T1] Norman L. Biggs, “Discrete Mathematics”, Oxford, second edition.
[T2] Keneth H. Rosen, “Discrete Mathematics and Its Applications”, TMH, seventh edition.

Reference Books:
[R1] Kolman, Busby & Ross, “Discrete Mathematical Structures”, PHI, 1996.
[R2] C.L. Liu, “Elements of Discrete Mathematics”, TMH, 2000.
[R3] J. P. Trembly& P. Manohar, “Discrete Mathematical Structures with Applications to Computer
Science”, McGraw Hill, 1997.

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 13

SWITCHING THEORY AND LOGIC DESIGN

Paper Code: ETEC-205 L T/P C

Paper: Switching Theory and Logic Design 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the knowledge of Logic Systems and Circuits,
thereby enabling the student to obtain the platform for studying Digital Systems and Computer Architecture.

UNIT- I
Number Systems and Codes:- Decimal, Binary, Octal and Hexadecimal Number systems, Codes- BCD, Gray
Code, Excess-3 Code, ASCII, EBCDIC, Conversion between various Codes.
Switching Theory: - Boolean Algebra- Postulates and Theorems, De’ Morgan’s Theorem, Switching Functions-
Canonical Forms- Simplification of Switching Functions- Karnaugh Map and Quine Mc-Clusky Methods.
Combinational Logic Circuits:- Review of basic gates- Universal gates, Adder, Subtractor ,Serial Adder,
Parallel Adder- Carry Propagate Adder, Carry Look-ahead Adder, Carry Save Adder, Comparators, Parity
Generators, Decoder and Encoder, Multiplexer and De-multiplexer, ALU, PLA and PAL.
[T2,T3][No. of Hrs. 14]
UNIT- II
Integrated circuits: - TTL and CMOS logic families and their characteristics. Brief introduction to RAM and
ROM.
Sequential Logic Circuits: - Latches and Flip Flops- SR, , D, T and MS-JK Flip Flops, Asynchronous Inputs.
Counters and Shift Registers:- Design of Synchronous and Asynchronous Counters:- Binary, BCD, Decade and
Up/Down Counters , Shift Registers, Types of Shift Registers, Counters using Shift Registers- Ring Counter and
Johnson Counter.
[T2,T3][No. of hrs. 10]
UNIT- III
Synchronous Sequential Circuits:- State Tables State Equations and State Diagrams, State Reduction and State
Assignment, Design of Clocked Sequential Circuits using State Equations.
Finite state machine-capabilities and limitations, Mealy and Moore models-minimization of completely specified
and incompletely specified sequential machines, Partition techniques and merger chart methods-concept of
minimal cover table.
[T1][No. of hrs. 10]
UNIT- IV
Algorithmic State Machine: Representation of sequential circuits using ASM charts synthesis of output and next
state functions, Data path control path partition-based design.
Fault Detection and Location: Fault models for combinational and sequential circuits, Fault detection in
combinational circuits; Homing experiments, distinguishing experiments, machine identification and fault
detection experiments in sequential circuits.
[T1][No. of hrs. 10]
Text Book:
[T1] Zyi Kohavi, “Switching & Finite Automata Theory”, TMH, 2nd Edition
[T2] Morris Mano, Digital Logic and Computer Design”, Pearson
[T3] R.P. Jain, “Modern Digital Electronics”, TMH, 2nd Ed,

Reference Books:
[R1] A Anand Kumar, “Fundamentals of Digital Logic Circuits”, PHI
[R2] Taub ,Helbert and Schilling, “Digital Integrated Electronics”, TMH

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 14

CIRCUITS & SYSTEMS

Paper Code: ETEE 207 L T/P C

Paper: Circuits & Systems 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions. It should be of 25 marks.
2. Apart from Q. No.1 rest of the paper shall consist of four units as per the syllabus, every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 12.5 marks.

Objective: The purpose of this course is for each student to learn and further explore the techniques of advanced
circuit analysis. The concepts and analytical techniques gained in this course (e.g., signals, Laplace
transformation, frequency response) will enable students to build an essential foundation of many fields within
electrical engineering, such as control theory, analog electronic circuits, signal processing.

UNIT-I
Introduction to signals, their classification and properties, different types of systems, LTI systems and their
properties, periodic waveforms and signal synthesis, properties and applications of Laplace transform of complex
waveform.
[T1,T2][No. of Hours: 10]
UNIT-II
System modeling in terms of differential equations and transient response of R, L, C, series and parallel circuits
for impulse, step, ramp, sinusoidal and exponential signals by classical method and using Laplace transform.
[T1,T2][No. of Hours: 12]
UNIT-III
Graph theory: concept of tree, tie set matrix, cut set matrix and application to solve electric networks.
Two port networks – Introduction of two port parameters and their interconversion, interconnection of two 2-port
networks, open circuit and short circuit impedances and ABCD constants, relation between image impedances and
short circuit and open circuit impedances. Network functions, their properties and concept of transform
impedance, Hurwitz polynomial.
[T1,T2][No. of Hours: 10]
Unit IV
Positive real function and synthesis of LC, RC, RL Networks in Foster’s I and II, Cauer’s I& II
forms, Introduction of passive filter and their classification, frequency response, characteristic impedance of low
pass, high pass, Band Pass and Band reject prototype section.
[T1,T2][No. of Hours: 10]
Text Books:
[T1] W H Hayt “Engineering Circuit Analysis” TMH Eighth Edition
[T2] D. R. Choudhary, “Networks and Systems” New Age International, 1999.

Reference Books
[R1] S Salivahanan “Circuit Theory ” Vikas Publishing House 1st Edition 2014
[R2] Valkenburg, “ Network analysis” PHI, 2000.
[R3] Bhise, Chadda, Kulshreshtha, “ Engineering network analysis and filter design” Umesh publication,
2000.
[R4] Kuo, “Network analysis and synthesis” John Weily and Sons, 2nd Edition.
[R5] Allan H Robbins, W.C.Miller “Circuit Analysis theory and Practice”Cengage Learning Pub 5th
Edition 2013
[R6] Bell “Electric Circuit” Oxford Publications 7th Edition

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 15

DATA STRUCTURES

Paper Code: ETCS-209 L T C

Paper: Data Structures 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, the student may be asked to attempt only 1 question from each unit.
Each question should be 12.5 marks.

Objective: To understand the programming and the various techniques for enhancing the programming skills for
solving and getting efficient results.

UNIT – 1:
Introduction to programm ing methodologies and design of algorithms. Abstract Data Type, array, array
organization, sparse array. Stacks and Stack ADT, Stack Manipulation, Prefix, infix and postfix expressions, their
interconversion and expression evaluation. Queues and Queue ADT, Queue manipulation. General Lists and List
ADT, List manipulations, Single, double and circular lists.
[ T1,T2][No. of hrs. 12]
UNIT – II:
Trees, Properties of Trees, Binary trees, Binary Tree traversal, Tree manipulation algorithms, Expreession trees
and their usage, binary search trees, AVL Trees, Heaps and their implementation.
[T1,T2][No. of hrs. 12]
UNIT – III:
Multiway trees, B-Trees, 2-3 trees, 2-3-4 trees, B* and B+ Trees. Graphs, Graph representation, Graph traversal.
[T1,T2][No. of hrs. 12]
UNIT – IV:
Sorting concept, order, stability, Selection sorts (straight, heap), insertion sort (Straight Insertion, Shell sort),
Exchange Sort (Bubble, quicksort), Merge sort (only 2-way merge sort). Searching – List search, sequential
search, binary search, hashing concepts, hashing methods (Direct, subtraction, modulo-division, midsquare,
folding, pseudorandom hashing), collision resolution (by open addressing: linear probe, quadratic probe,
pseudorandom collision resolution, linked list collision resolution), Bucket hashing.
[T1,T2][No. of hrs. 12]
Text Books:
[T1] R. F. Gilberg, and B. A. Forouzan, “Data structures: A Pseudocode approach with C”, Thomson
Learning.
[T2] A .V. Aho, J . E . Hopcroft, J . D . Ulman “Data Structures and Algorithm”, Pearson Education.

Reference Books:
[R1] S. Sahni and E. Horowitz, “Data Structures”, Galgotia Publications.
[R2] Tanenbaum: “Data Structures using C”, Pearson/PHI.
[R3] T .H . Cormen, C . E . Leiserson, R .L . Rivest “Introduction to Algorithms”, PHI/Pearson.
[R4] A.K.Sharma, “Data Structures”, Pearson
[R5] Ellis Horowitz and Sartaz Sahani “Fundamentals of Computer Algorithms”, Computer Science Press.

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 16

COMPUTER GRAPHICS & MULTIMEDIA

Paper Code: ETCS-211 L T C

Paper: Computer Graphics & Multimedia 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, the student may be asked to attempt only 1 question from each unit.
Each question should be 12.5 marks.

Objective: To understand various aspects of media and to learn the concept of sound, images and videos.

UNIT- I
Introduction, Applications areas, Components of Interactive Computer Graphics System. Overview of Input
devices, Output devices, raster scan CRT displays, random scan CRT displays. DDA and Bresenham’s Line
Drawing Algorithms, Bresenham’s and Mid Point Circle Drawing Algorithms. Homogeneous Coordinate System
for 2D and 3D, Various 2D, 3D Transformations (Translation, Scaling, Rotation, Shear).
[T1,T2][No. of hrs. 12]
UNIT- II
Clipping Algorithms, Sutherland-Cohen line Clipping Algorithm Bezier Curves, B-Spline Curves. Parallel
Projection, Perspective Projection, Illumination Model for diffused Reflection, Ambient light, Specular Reflection
Model, Reflection Vector.
[T1,T2][No. of hrs. 11]
UNIT- III
Shading Models, Flat shading, Gourard Shading, Phong Model. Visible surface detection, Back Face Detection,
Depth Buffer (Z-Buffer, A-Buffer) Method. Overview of multimedia: Classification, basic concepts of
sound/audio MIDI: devices, messages, software. , Authoring tools, Video and Animation: controlling animation,
display and transmission of animation
[T1,T2][No of hrs 10]
UNIT- IV
Data Compression: storage space, coding requirements, Basic compression techniques: run length code, Huffman
code, Lempel-Ziv JPEG: Image preparation, Lossy sequential DCT, expanded lossy DCT, Lossless mode,
Hierarchical mode. MPEG, Media synchronization, Media Integration, Production Standards.
[T1,T2][No of hrs 11]
Text Books:
[T1] Donald Hearn and M.Pauline Baker, “Computer Graphics C version”, Second Edition, Pearson
Education.
[T2] Ralf Steinmetz & Klara Nahrstedt, “Multimedia Computing Communication & Applications”, Pearson
Education.

Reference Books:
[R1] C, Foley, VanDam, Feiner and Hughes, “Computer Graphics Principles & practice”, 2nd Edition
[R2] R. Plastock and G. Kalley, Schaum’s Series, “Theory and Problems of Computer Graphics”, McGraw
Hill, 2nd edition.
[R3] Fred Halsall, “Multimedia Communications Applications, Networks, Protocols & Standards”, Pearson
Education.
[R4] David F. Rogers, “Procedural elements for computer graphics”, McGraw- Hill.

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 17

SWITCHING THEORY AND LOGIC DESIGN LAB

Paper Code: ETEC-253 L T/P C

Paper: Switching Theory and Logic Design Lab 0 2 1

List of Experiments:

1. Realize all gates using NAND & NOR gates

2. Realize Half Adder, Full Adder, Half subtracter, Full subtracter
3. Realize a BCD adder
4. Realize a Serial Adder
5. Realize a four bit ALU
6. Realize Master-Save J K Flip-Flop, using NAND/NOR gates
7. Realize Universal Shift Register
8. Realize Self-Starting, Self Correcting Ring Counter
9. Realize Multiplexer and De-Multiplexer
10. Realize Carry Look ahead Adder / Priority Encoder
11. Simulation of PAL and PLA
12. Simulation Mealy and Moore State machines

NOTE: - At least 8 Experiments out of the list must be done in the semester

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 18

CIRCUITS AND SYSTEMS LAB

Paper Code: ETEE 257 L T C
Paper: Circuits and Systems Lab 0 2 1

List of Experiments

1. Study the transient response of series RLC circuit for different types of waveforms on CRO and verify
using MATLAB
2. Study the time response of a simulated linear system and verify the unit step and square wave response of
first order and second order, type 0,1 system
3. Using MATLAB determine current in various resistors connected in network using mesh current and
node voltage analysis.
4. To determine Z and Y parameters of the given two port network.
5. To determine ABCD parameters of the given two port network.
6. To verify Reciprocity Theorem for the given two port network.
7. To determine Hybrid parameters of the given two port network.
8. To design Cascade Connection and determine ABCD parameters of the given two port network.
9. To design Series-Series Connection and determine Z parameters of the given two port network.
10. To design Parallel-Parallel Connection and determine Y parameters of the given two port network.
11. To design Series-Parallel Connection and determine h parameters of the given two port network
12. Study the frequency response of different filter circuits.

NOTE:- At least 8 Experiments out of the list must be done in the semester.

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 19

DATA STRUCTURES LAB

Paper Code: ETCS-255 L T/P C

Paper: Data Structures Lab 0 2 1

List of Experiments :

1. Perform Linear Search and Binary Search on an array.

Description of programs:

a.Read an array of type integer.

b.Input element from user for searching.
c.Search the element by passing the array to a function and then returning the position of the element from
the function else return -1 if the element is not found.
d. Display the position where the element has been found.
2. Implement sparse matrix using array.
Description of program:

a. Read a 2D array from the user.

b. Store it in the sparse matrix form, use array of structures.
c. Print the final array.
3. Create a linked list with nodes having information about a student and perform
I. Insert a new node at specified position.
II. Delete of a node with the roll number of student specified.
III. Reversal of that linked list.
4. Create doubly linked list with nodes having information about an employee and perform Insertion at front of
doubly linked list and perform deletion at end of that doubly linked list.
5. Create circular linked list having information about an college and perform Insertion at front perform Deletion
at end.
6. Create a stack and perform Pop, Push, Traverse operations on the stack using Linear Linked list.
7. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and Display
the queue elements.
8. Create a Binary Tree (Display using Graphics) perform Tree traversals (Preorder, Postorder, Inorder) using the
concept of recursion.
9. Implement insertion, deletion and display (inorder, preorder and postorder) on binary search tree with the
information in the tree about the details of a automobile (type, company, year of make).
10. To implement Insertion sort, Merge sort, Quick sort, Bubble sort, Bucket sort, Radix sort, Shell sort, Selection
sort, Heap sort and Exchange sort using array as a data structure.

NOTE:- At least 8 Experiments out of the list must be done in the semester.

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.
 20

COMPUTER GRAPHICS & MULTIMEDIA LAB

Paper Code: ETCS-257 L T C

Paper: Computer Graphics & Multimedia Lab 0 2 1

List of Experiments:

1. Study of Fundamental Graphics Functions.

2. Implementation of Line drawing algorithms: DDA Algorithm, Bresenham's Algorithm

3. Implementation of Circle drawing algorithms: Bresenham's Algorithm, Mid Point Algorithm.

4. Programs on 2D and 3D transformations

5. Write a program to implement cohen Sutherland line clipping algorithm

6. Write a program to draw Bezier curve.

7. Using Flash/Maya perform different operations (rotation, scaling move etc..) on objects

8. Create a Bouncing Ball using Key frame animation and Path animation.

NOTE:- At least 8 Experiments out of the list must be done in the semester.

Scheme and Syllabi for B. Tech-CSE, 1st year (Common to all branches) w.e.f batch 2014-15 and (2nd, 3rd & 4th years) w.e.f batch 2013-14
approved in the 22nd BOS of USET on 30th June, 2014 and approved in the 37th AC Sub Committee Meeting held on 10th July, 2014.