Kernighan-lin algorithm and greedy channel routing algorithm


1) Describe all the transformation for the combinational network

2) Explain the various algorithms for delay evaluation and optimization.

3) Describe the Kernighan-Lin algorithm with proper example and diagram.

4) What is meant by Wire length estimation? Describe Steiner tree and spanning tree algorithm.

5) Describe the Greedy channel routing algorithm with suitable example.

6) Explain any two methods adopted for optimized placement of modules in chip.

7) Explain the operation and synthesis of OBDD in detail.

8) Describe the Classification, one dimensional and hierarchical compaction with essential diagrams.

Request for Solution File

Ask an Expert for Answer!!
Computer Networking: Kernighan-lin algorithm and greedy channel routing algorithm
Reference No:- TGS013532

Expected delivery within 24 Hours