Scribd
Upload
10 views3 pages

Se Carry On Ia-II QB

The document contains a question bank for three subjects: Data Structures (DS), Computer Graphics (CG), and Digital Systems and Computer Technology (DSGT) for Semester III. Each subject includes various questions covering key concepts such as AVL Trees, Topological Sorting, Huffman Encoding, 3D transformations, polygon clipping algorithms, and cache memory. The questions aim to assess understanding of algorithms, data structures, graphics transformations, and computer architecture principles.

Uploaded by

sinhasumit200508shriram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views3 pages

Se Carry On Ia-II QB

The document contains a question bank for three subjects: Data Structures (DS), Computer Graphics (CG), and Digital Systems and Computer Technology (DSGT) for Semester III. Each subject includes various questions covering key concepts such as AVL Trees, Topological Sorting, Huffman Encoding, 3D transformations, polygon clipping algorithms, and cache memory. The questions aim to assess understanding of algorithms, data structures, graphics transformations, and computer architecture principles.

Uploaded by

sinhasumit200508shriram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

SUB:DS SEM III

QUESTION BANK

1. What is an AVL Tree? Explain how rotations (LL, RR, LR, RL) are used to maintain
balance in an AVL Tree with suitable examples.
2. What is Topological Sorting? Explain the algorithm with an example on a Directed
Acyclic Graph (DAG).
3. Explain Linear Search and Binary Search algorithms. Compare them based on time
complexity and give suitable examples.
4. Describe Huffman Encoding. Construct a Huffman Tree for the characters with
frequencies: A–5, B–9, C–12, D–13, E–16, F–45. Show the resulting codes.
5. Define the following graph terminologies with examples: Degree, Path, Cycle,
Connected Graph, and Directed Graph.
6. Apply Binary Search on the following sorted array to find the position of element 23:
[4, 7, 12, 16, 23, 29, 34, 40]
7. What is hashing? Explain the concept of hash functions and discuss any two collision
resolution techniques.
8. Explain the different types of binary tree traversals with examples. Write the Inorder,
Preorder, and Postorder traversals of the following binary tree.
SUB:CG SEM III
QUESTION BANK

1. Explain the viewing transformation pipeline in 2D graphics. Describe how the


Window-to-Viewport transformation is carried out.
2. Explain the basic 3D geometric transformations: Translation, Scaling, and Rotation.
Represent each transformation using homogeneous matrices.
3. What is key framing in animation? Explain its role in character and facial animation.
4. Compare the Sutherland-Hodgeman and Weiler-Atherton polygon clipping
algorithms. State which one is better suited for concave polygons and why.
5. What is a Bezier curve? Derive the Bezier curve equation for 4 control points and
sketch a rough curve.
6. Describe the Back-Face Detection method and Area Subdivision method for visible
surface detection. Compare their advantages and limitations.
7. What is key framing in animation? Explain its role in character and facial animation.
Also, describe how deformation is applied in animations.
8. Differentiate between parallel and perspective projection in 3D. Give matrix
representations and explain how objects appear under each.
SUB: DSGT SEM III
QUESTION BANK

1. What is a Microprogrammed Control Unit? Explain micro-instruction format and the


steps involved in microinstruction sequencing and execution.
2. Explain the memory hierarchy in a computer system. Compare different types of
memory (Registers, Cache, RAM, Hard Disk) based on speed, cost, and size.
3. What are data hazards in pipelined architecture? Explain the types of data hazards and
how they can be resolved.
4. Explain the State Table Method used in Hardwired Control Unit design. Design a
simple state table for a 2-step instruction execution cycle.
5. What is Cache Memory? Explain different cache mapping techniques with diagrams.
6. Explain Flynn’s Classification of computer architectures. Provide one example for
each category.
7. What is cache coherence? Describe any two write policies used in cache memory and
discuss how they affect memory consistency.
8. Write a microprogram to perform the fetch and decode cycle of an instruction.
Describe each micro-operation involved.

You might also like