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

WEB ML

assignment 1

Assignment 1
Sub:Web Engg
Year:Third

1. What are the different categories of web application?

2. Explain the characteristic of web application?

3. Where do requirements come from?Explain Requirement engg specifies in web engg?

4. What are the various principle of Requirement Engg?

5. Which type of requirement are important for web application?

6. How the requirement for web application is listed and documented?

7. Explain modeling specifies in web engg?

8. Explain various modeling requirements?

last date of submission:friday 18 sep 09