You are on page 1of 9

Computer Science and Engineering

LESSON PLAN - Semester: IV


(To serve as guidelines only)
Courtesy - Kongu Engineering College
(Affiliated to Anna University)
Subject : CS 239 INTERACTIVE COMPUTER GRAPHICS

S.NO SUB-TOPICS HOURS NAME OF PAGE


THE BOOK NO.
TEACHING TUTORIAL

UNIT 1: INTRODUCTION

1. Input devices - keyboard, mouse, 1


scanner, touch panels, light pen, data 1 60-71
gloves.
2. Video display devices-random scan,
raster scan, color CRT, direct view 1 36-67
storage tubes, flat panel display.
3. Hard copy devices-printers, plotters 2
1 72-74
4. Line drawing algorithms -
DDA, Bresenham’s algorithm 1 86-92
1
5. Circle drawing algorithms- 1 98-102
midpoint algorithm, DDA 2 27-28
6. Polygon filling-scan-line polygon 1
filling algorithm, inside-outside test,
scan line fill of curved boundary 1 117-130
areas, boundary fill algorithms,
flood-fill algorithms
7. Input functions 1 2 199-209
8. Graphic adaptors 2 4 460-467

UNIT-2: CURVES, SURFACES AND SOLIDS

1. Clipping- point clipping, line 2


clipping, Cohen - Sutherland line 1 225-230
clipping algorithm mid point line
clipping algorithm 2 67-69
2. Color table 1 1 155-157
3. Animation using color table 1 1 586-587
4. Antialising methods- 1 3 132-136
5. B Splines 1 2 320-325
6. Bezier curves 1 1 327-334
7. Quad trees and octrees 2 1 359 – 362
8. Geometric model 1 2 111 – 124
9. Hierarchical model 1 1 265 – 268
10. Fractals 1 1 362 – 386

UNIT 3:TRANSFORMATIONS

1. 2 Dimensional transformations- 2
basic transformation, matrix
representations and homogeneous 1 184-200
transformations, composite
transformation
2. 3 Dimensional transformations- 3
translation, rotation, scaling 1 408-422
3. Perspective viewing- parallel 2
projections and types, perspective
projection, orthographic projection 1 438-446
4. Animation of wire frame model 1 1 297-302
UNIT 4: HIDDEN SURFACE ELIMINATION
1. Hidden surface elimination 1 1 470-471
2. Painter’s algorithm 2 1 478-481
3. Scan line method 2 1 476-478
4. Octree method 1 1 485-487
5. Ray tracing 1 1 487-488
6. Z-buffer 1 1 472-475
UNIT 5: COLOR MODELS
1. Chromacity diagram 1 1 568-571
2. Models- RGB, CMY, HSV, HLS, 3 572-580
CIE models 1
3. Gouraud and Phong shading 2 1 523-527
4. Realism in rendering 1 3 605-615
5. Illumination and shading 2 3 612-613
TOTAL 45

BOOK NO BOOK NAME AUTHOR

1 “COMPUTER GRAPHICS “ Donald Hearn,


M.Pauline Baker
2 “PRINCIPLES OF INTERACTIVE William.M.Neumann
COMPUTER GRAPHICS” Robert F. Sproull

3 “COMPUTER GRAPHICS PRINCIPLES James D. Foley,


AND PRACTICE” Steven K. Feiner
John F.Hughes
4 “LET US C” Yashavant Kanetkar

Subject : MA040 PROBABILITY AND QUEUING THEORY

SL.No Sub Topics Teaching Tutorial Name of the Book


Hours Hours
1 Probability concepts: 3 1 Fundamentals of mathematical
statistics
Sample space, events,
probability axioms addition S.C.Gupta & V.K.Kapoor
theorem, multiplication
theorem, conditional
probability, independent
events, Baye's Formula
2 Random variables: 1 1 Fundamentals of mathematical
statistics
Discrete, conditional
random variables S.C.Gupta & V.K.Kapoor

3 Moments: 1 Fundamentals of mathematical


statistics
Moment generating function
S.C.Gupta & V.K.Kapoor
4 Probability distribution: 1 1 Fundamentals of mathematical
statistics
Binomial, Poisson, geo
metric, Negative binomial, S.C.Gupta & V.K.Kapoor
Exponential, Gamma,
5 Weibull distribution: 1 Fundamentals of mathematical
statistics
Moment generation
functions, Mean, Variance, S.C.Gupta & V.K.Kapoor
6 Function of a random 1 Fundamentals of mathematical
variable statistics
S.C.Gupta & V.K.Kapoor
7 Chebychev Inequalty 1 1 Fundamentals of mathematical
statistics
SL.No Sub Topics Teaching Tutorial Name of the Book
Hours Hours
S.C.Gupta & V.K.Kapoor
8 Marginal distribution 1 Fundamentals of mathematical
statistics
S.C.Gupta & V.K.Kapoor
9 Conditional distribution 1 1 Fundamentals of mathematical
statistics
S.C.Gupta & V.K.Kapoor
10 Stochastic Independence: 3 Fundamentals of mathematical
statistics
Expectation, Conditional
expectation, Conditional S.C.Gupta & V.K.Kapoor
Variance
11 Covariance 1 Fundamentals of mathematical
statistics
Correlation and regression
S.C.Gupta & V.K.Kapoor
12 Transformation of two 2 1 Fundamentals of mathematical
dimensional random statistics
variables, Jacobian S.C.Gupta & V.K.Kapoor
theorem
13 Central limit theorem 1 Fundamentals of mathematical
statistics
S.C.Gupta & V.K.Kapoor

14 Classification 1 1.Probability and Statistics with


Reliability Queuing and computer
Continuous and discrete
science Applications
Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
15 Stationary Process 2 1 1.Probability and Statistics with
Reliability Queuing and computer
WSS, SSS
science Applications
Trivedi K.S
2. Reliability Engineering
Balagurusamy.E
16 Markov Process 1 1 1. Probability and Statistics
with Reliability Queuing and
computer science Applications
Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
SL.No Sub Topics Teaching Tutorial Name of the Book
Hours Hours
17 Binomial Process 1 1.Probability and Statistics with
Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
18 Poisson Process 1 1.Probability and Statistics with
Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
19 Birth and death Process 2 1 1.Probability and Statistics with
Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
20 Renewal Process 1 1.Probability and Statistics with
Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
21 Markov Chain: definition 1 1.Probability and Statistics with
Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
22 Transition probabilities: 2 1 1.Probability and Statistics with
Reliability Queuing and computer
Computation of n-step
science Applications Trivedi K.S
transition probability,
2.Reliability Engineering
Classification and limiting Balagurusamy.E
distribution
23 Concepts of reliability: 3 1 1.Probability and Statistics with
Reliability Queuing and computer
Definition, mean time to
science Applications Trivedi K.S
failure, mean time between
2.Reliability Engineering
failure, reliably in terms of
Balagurusamy.E
hazard rate and failure
density
24 System reliability: 1 1 1.Probability and Statistics with
Reliability Queuing and computer
Series and Parallel systems
science Applications Trivedi K.S
Definition and examples 2.Reliability Engineering
Balagurusamy.E
25 Reliability and availability 1 1.Probability and Statistics with
of Markovian Systems: Reliability Queuing and computer
SL.No Sub Topics Teaching Tutorial Name of the Book
Hours Hours
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E

26 Maintainability 1.Probability and Statistics with


Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
1
27 Preventive Maintenance 1.Probability and Statistics with
Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
28 Markovian Queueimg 2 1 1.Probability and Statistics with
models Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
29 Little's Formula 1 1 1.Probability and Statistics with
Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E

30 Multi-server Queues: 2 1.Probability and Statistics with


Reliability Queuing and computer
M/G/1 Queues - Problems
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E
31 Pollaczek-Khintchine 4 1 1.Probability and Statistics with
Formula-Derivation Reliability Queuing and computer
science Applications Trivedi K.S
2.Reliability Engineering
Balagurusamy.E

References:

1. Allen A.O.” Probability Statistics and Queuing Theory “, Academic Press, 1981.

2. Dr.A.M.Natarajan and Dr.A.Tamilarasi “ Probability, Random Process and


Queuing Theory ”, New Age International Publishers 2002,New Delhi.
Subject: CS238 Computer Architecture I

UNIT I: Introduction
SL. No. Sub Topics Hours Name of the Page no.
Teaching Tutorial book
1 Basic 1 - Ref 2 17 - 35
structure of
computer h/w
– evolution of
computers
2 Von Neumann 1 - Ref 2 17 – 20
Architecture
[IAS
Computer]
3 Functional 1 - Text 1 1 - 11
Units
4 Instruction 2 1 Text 2 33 – 47
Formats and
Types
5 Addressing 1 1 Text 2 48 – 50
Modes
Total: 6 2

UNIT II: Arithmetic and Logic Units


SL. No. Sub Topics Hours Name of the Page no.
Teaching Tutorial book
1 Fixed Point 1 1 Text 2 251 – 270
Arithmetic –
addition,
subtraction
Multiplication 1 1 Text 2 270 – 279
Division 1 Text 2 280 – 284
2 Floating Point 2 1 Text 2 296 – 298
Arithmetic
Operations –
Addition,
subtraction
Multiplication, 1 Text 2 298 - 299
Division
3 Design Of 2 1 Ref 2 252 - 265
ALU –
Combination,
sequential
4 Bit sliced 1 Ref 2 260 - 262
processors
Total: 9 4

UNIT III: Processor Unit


SL. No. Sub Topics Hours Name of the Page no.
Teaching Tutorial book
1 Data path 1 Ref 2 303 - 304
Implementatio
n
2 Control Unit - 4 1 Ref 2 308 – 331
Hardwired
control
Micro 4 1 Ref 2 332 - 353
programmed
control
Nano 1 1 Ref 2 361 - 364
programming
3 Concepts of 2 0 Ref 2 364 - 371
pipelining
Total: 12 3

UNIT IV: Memory System


SL. No. Sub Topics Hours Name of the Page no.
Teaching Tutorial book
1 Memory 1 Text 2 310 - 312
Hierarchy
2 Internal 2 1 Text 2 312 - 326
organization
of: RAM
ROM 1 Text 2 326 - 328
Interleaved 1 1 Text 2 334 - 340
memory
3 Cache and 2 Text 2 349 - 358
associative
memory
4 Virtual 2 1 Text 2 358 - 369
Memory
Total: 9 3

UNIT V: Input/Output and Peripherals


S. No. Sub Topics Hours Name of the Page no.
Teaching Tutorial book
1 Basic concepts 1 Text 2 377 - 380
2Total number ofProgrammed
hours: 602 1 Text 2 380 - 390
I/O
3 Interrupts 2 Text 2 391 - 399
4 DMA 1 1 Text 2 399 - 402
5 I/O Processor 1 1 Ref 2 523 – 529
6 Input devices 1 Text 1 330 - 346
7 Display
devices
8 Printer
9 Magnetic disk 1 Text 1 346 - 361
drives
10 Optical drives
Total: 9 3

Total number of teaching hours: 45


Total number of tutorial hours: 15

Text Books:

1. Carl Hamacher V. Zvonko G. Vranesic, Safwat G. Zaky. “ Computer


Organization ”, TATA McGraw Hills, Latest edition.
2. Heuring V. P, Jordan H. F. “ Computer System design and Architecture ”,
Addison Wesley, 1999.

References:

1. Patterson and Hennessey, “ Computer Organization and design ”, the hardware


software interface, Harcourt Asia Morgan Kaufmann 1999.
2. Hayes. “ Computer Architecture and Organization ”, TATA McGraw Hill 1998.

You might also like