The following ae the some sample program example for practicle:

Write a program to draw the front face of clock by using midpoint ellipse generationalgorithm .draw minitue and hour hand of the clock by DDA line generation algorithm.


Write a program to move a ball along the spiral circle.

A. Implement line drawing algorithm that uses generic logic for all the lines irrespective of slope of line. Implement it in a 4-quadrant system
B. Use built-in functions to draw lines in different style.


1. Implement Bresenham’s algorithm for line drawing with following stylesA. Dotted line(Accept dot ratio from user)B. Thick line(Accept thickness from user)
2. Use built-in functions to do the same


A. Implement mid-point circle drawing algorithm
B.Use any built-in function to fill the circle with different patterns


A. Implement line clipping algorithm that makes use of region code.Implement it in a 4-Quadrant systemB. Draw the clipped line in different styles using built-in functions


A. Implement Liang-Barsky line clipping algorithm
B. Draw the clipped line in different styles using built-in functions

A. Implement Sutherland-Hodgeman polygon clipping algorithm.
B. Mention various built-in functions in graphics.h to draw and fill various objects


A.Implement any 2 curve generating algorithms.
B.Explain the advantage-disadvantage of both


.Draw the following figure using built-in functions1. Use polygon filling algorithm for repainting Red region with Green color


A. Implement any 4 2-D transformations on a hexagon/square /triange(Translation, Pivot point rotation, Pivot point scaling, Reflection, Scaling)
B. Implement composite transformation



A. Implement boundry fill and flood fill polygon filling algorithm.
B. Optimize the above algorithm to reduce computations


A. Implement following 3-D transformations on a cube(Translation, Rotation about X, Y, Z axis, Pivot point Scaling, Reflection aboutX, Y, Z axis)


Implement midpoint ellipse generating algorithm.Use any built-in function for drawing ellipse in Graphics.

A.Clip a line using cohen Sutherland algorithm against rectangular window .
B.Let line be fixed then show the clip line as rectangle is moving.

Practical List for SPCC

1. Design lexical analyzer Check for keywords and literals as token. i/p code will be pre defined in file .
2. I/P assembly program (pre defined in file) and display pseudo Opcode & Location Counter.
3. I/P assembly program (pre defined in file )and display machine opcode and location counter
4. I/P assembly program (pre defined in file) and if pseudo opcode table (pre defined in file) and machine opcode table (pre defined in file ) is present then create symbol table.
5. Implement a macro processor create MNT.
6. Design syntax analyzer and check for any four types of errors (=, (),{}) only
7. Design intermediate code generation
8. Design code optimization. Check for common sub-expression elimination.
9. Design lexical analyzer Check for Operator and terminal as token. I/p code will be pre defined in file.

10. Take postfix expression from user and do code optimization for sub-expression elimination
11. Identify all mnemonic in the program and display the MOT table along mnemonic binary opcode, length.
12. Take assembly program from user. Identify all pseudo opcode and display POT.
13. Identify all symbols and display symbol table along with address
14. Design Symantec analyzer. Check for if condition and initialization of database.

NEW

Practical List
Subject: Analysis of Algorithms
SE COMP


1>Generation of different Patterns

2>Implementation of different Sorting Techniques

3>Implementation based on divide and conquer method
Merge Sort
Quick Sort

4>Implementation on Greedy Approach
Knapsack Problem
Job Sequencing with deadlines
Optimal Storage on Tapes

5>Implementation on dynamic programming
Single Source Shortest Path – Dijkstra’s Algorithm
0/1 Knapsack Problem

6>Implementation of backtracking methods
N-queen’s Problem

7>Implementation of Branch and Bound Concept
0/1 Knapsack algorithm

8>Implementation of Internet Algorithm
Boyer-Moore Algorithm
Knuth-Morris-Pratt Algorithm

Assignment 1

Subject : Computer Graphics


1. State the application of computer graphics .explain any five.

2. Explain DDA algorithm .Solve(1,1) to (5,3) using DDA algorithm

3. Derive Bresenham’s line drawing algorithm .plot line(20,10)(30,18)

4. Consider the line from (0,0) to (6,7).use bresenham’s algorithm to rasterize aline.

5. Differentiate between DDA and Bresenham’s algorithm

6. Derive midpoint ellipse algorithm hence state the algorithm.Solve rx=8 and ry=6

7. Derive midpoint circle algorithm .state the algorithm.

8. Derive Bresenham’s circle algorithms



last date :22 /2/10

Technologies for web engg practical:

1. design a page using HTML
2. CSS(ALL TYPE)
3. JSP
4. JAVA SCRIPT
5. validation of forms
6. CONNECTIVITY with data base

Chapter 1:

• Basic structure of computer
• Introduction of computer system and its sub modules,
• Basic organization of computer and block level description of thefunctional units.
  Von newmann model,
• Introduction to buses andconnecting I/O devices to CPU and memory,
• Asynchronous and synchronous bus,
• PCI,
• SCSI.

1> Basic structure of computer
Introduction of computer system and its sub modules,

• Basic organization of computer and block level description of the
  functional units.
• Von newmann model,
• Introduction to buses andconnecting I/O devices to CPU and memory,
• Asynchronous and synchronous bus, PCI, SCSI.
• 2 >Arithmetic and Logic Unit.
  Arithmetic and logical unit hardware implementation,
• Booth’s Recoding,
• Booth’s algorithm for signed multiplication ,
• Restoring division and non restoring division algorithm,
• IEEE floating point number representation and operations.
• 3 >Central processing unit.
  CPU architecture, Register organization ,
• Instruction formats and addressing modes (Intel processor).,
• Basic instruction cycle,Instruction interpretation and sequencing,
• Control Unit operation,Hardwired control unit design methods and design examples,
  Multiplier control unit, Micro programmed control unit, basic concepts, Microinstruction sequencing and execution , Micro operations, concepts of nanoprogramming,
• Introduction to RISC andCISC architectures, design issues and examples of RISC processors.
  
  4 >Memory Organization.
• Characteristics of memory system and hierarchy, concepts of
  semiconductor memories, main memory, ROM, EPROM, RAM,
  SRAM, DRAM, SDRAM, RDRAM, , Flash memory, Stack
  Organization.
• High speed memories: Cache memory organization
  and mapping, replacement algorithms , cache coherence,
• Interleaved and associative memories ,
• Virtual memory, main memory allocation , segmentation paging,
• Secondary storage, optical memory, CDROM, DVD
• RAID,.
  5 >I/O Organization.
• Input/Output systems, Programmed I/O, Interrupt driven I/O,
• I/O channels, DMA, Peripheral Devices, U.S.B.
  6 >Multiprocessor Configurations.
• Flynn’s classifications, parallel processing concepts,
• Introduction to pipeline processing and pipeline hazards, design issues of pipeline
  architecture, Instruction pipeline, Instruction level parallelism and
  advanced issues.
  7 >SPARC
  Static and Dynamic data flow design, Fault tolerant computers,
  Interprocessor communication and synchronization, cache
  coherence, shared memory
  multiprocessor.
  8 >Systolic Architectures
  Systolic arrays and their applications, wave front arrays.

TERM WORK:
Based on above syllabus at least 10 experiments and one written test of 10 marks
to be conducted.

Text Books:
1. Miles Murdocca, “Computer Architecture and Organization”, Wiley India
2. William Stallings, “Computer Organization and Architecture: Designing and
performance”: Prentice-Hall India
3. Carl Hamacher, Zvonko Vranesic and Safwat Zaky “Computer Organization”,
McGraw Hill
Reference Books:
1. John L. Hennessy and David Patterson,” Computer Architecture A Quantitative
Approach”, Morgan Kaufman
2. Andrew S. Tanenbaum,” Structured Computer Organization”, Prentice-Hall India