Scribd Logo
Upload

Welcome to Scribd!

  • VLSI CAD Question

    Uploaded by

    MCV101
    191 views2 pages
    This document contains a model question paper for an M.Tech degree examination in Electronics and Communication Engineering with a specialization in VLSI and Embedded Systems. The paper covers topics related to VLSI CAD including graph algorithms, VLSI design cycles, placement algorithms, floorplanning algorithms, and routing algorithms. It contains 8 questions with 3 sub-questions each that cover key concepts in these areas of VLSI design automation. Students must answer all questions in the 3 hour examination.

    Original Description:

    Electronics and Communication Engineering VLSI and Embedded Systems

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a model question paper for an M.Tech degree examination in Electronics and Communication Engineering with a specialization in VLSI and Embedded Systems. The paper covers topics related to VLSI CAD including graph algorithms, VLSI design cycles, placement algorithms, floorplanning algorithms, and routing algorithms. It contains 8 questions with 3 sub-questions each that cover key concepts in these areas of VLSI design automation. Students must answer all questions in the 3 hour examination.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    191 views2 pages

    VLSI CAD Question

    Uploaded by

    MCV101
    This document contains a model question paper for an M.Tech degree examination in Electronics and Communication Engineering with a specialization in VLSI and Embedded Systems. The paper covers topics related to VLSI CAD including graph algorithms, VLSI design cycles, placement algorithms, floorplanning algorithms, and routing algorithms. It contains 8 questions with 3 sub-questions each that cover key concepts in these areas of VLSI design automation. Students must answer all questions in the 3 hour examination.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    M.

    TECH DEGREE EXAMINATION


    Model Question Paper
    Branch: Electronics and Communication Engineering
    Specialization: VLSI and Embedded Systems
    First Semester
    MECVE 106-1 VLSI CAD
    (Regular 2013 Admission Onwards)

    Answer all Questions
    Time : 3hrs Maximum Marks:100
    1. (a) State Bellmann-Ford Algorithm. (5 Marks)
    (b) Explain in detail about longest-path algorithm. (8 Marks)
    (c) Describe briefly about VLSI design cycle. (12 Marks)

    OR
    2.(a) What is meant by shortest path algorithm. (5 Marks)
    (b What are the design rules present in the case of physical design. (8 Marks)
    (c) Explain in detail about steps involved different graph algorithms. (12 Marks)

    3 (a). What are : i) Constructive Placement ii) Iterative Improvement. (5 Marks)
    (b) Which are the most common types placement problems. ( 8 Marks)
    (c) Explain in detail about i) Circuit representation
    ii) Wire Length Estimation. ( 12 Marks)
    OR
    4.(a) Explain algorithmic steps present in simulated annealing using an example. (5 Marks)
    (b) Explain in detail the steps involved in Kernighan-Lin algorithm. (8 Marks)
    (c ) Explain about the classification of partitioning algorithms . (12 Marks)

    5. (a) Differentiate between slicing and non-slicing floorplans (5 marks)
    (b) What is optimal channel pin assignment algorithm (8 Marks)
    (c) Explain the classification of floor planning algorithms (12 Marks)
    OR

    6. (a) What are the design style specific floorplanning problems. (5 Marks)
    (b)Describe detail the integer programming based floorplanning. (8 Marks)
    (c)Describe visualization of floorplan based design methodology using Gajskis Y-chart. Also
    give an example using a circuit and its possible floorplan description (12 Marks)

    7. (a)Describe briefly about Left-Edge algorithm (5 Marks)
    (b)What is meant by channel routing? Explain about channel routing algorithms (8Marks)
    (c)What are the design style specific global routing problems (12 Marks)
    OR
    8.(a) What is Mazes algorithm (5 Marks)
    (b)Solve the following channel routing problem:


    (8 Marks)
    (c) Describe visualization of floorplan based design methodology using Gajskis Y-chart. Also
    give an example using a circuit and its possible floorplan description (12 Marks)

    You might also like