1

VIVA QNTS FOR SEM 3

Computer Graphics
Here is a set of 50 viva questions with short answers covering all 5 units of
Computer Graphics:

Unit 1: Introduction to Computer Graphics (10 Questions)

1. What is Computer Graphics?
Ans: The field of study that deals with creating and manipulating visual
content using computers.
2. What are the different types of graphics systems?
Ans: Raster Graphics (pixel-based) and Vector Graphics (mathematically
defined shapes).
3. What is a Refresh CRT?
Ans: A display that continuously redraws images to maintain a stable
picture.
4. Differentiate between Raster Scan and Random Scan displays.
Ans:
o Raster Scan: Refreshes pixel by pixel in a fixed order.
o Random Scan: Draws images directly using a set of predefined
points.
5. What are the advantages of Flat-Panel Displays over CRTs?
Ans: Lower power consumption, compact size, and better resolution.
6. What are the different input devices used in graphics?
Ans: Mouse, Keyboard, Joystick, Light Pen, Graphics Tablet, Trackball.
7. What is a Hard Copy Device in computer graphics?
Ans: A device used to print graphical images on paper, e.g., plotters,
printers.
 2

8. What is the role of Graphics Software?

Ans: Provides tools for rendering, modeling, and manipulating images
(e.g., OpenGL, DirectX).
9. What is a DVST (Direct View Storage Tube)?
Ans: A type of display device that stores images directly on the screen
without refreshing.
10.What is the difference between Raster and Vector Graphics?
Ans:
o Raster: Pixel-based (e.g., photographs).
o Vector: Defined by mathematical equations (e.g., logos).

Unit 2: Output Primitives (10 Questions)

11.What is an output primitive?
Ans: A basic graphical element like points, lines, circles, and polygons.
12.What is the Digital Differential Analyzer (DDA) algorithm?
Ans: An incremental method for line drawing that calculates pixel
positions.
13.What is Bresenham’s Line Algorithm?
Ans: A more efficient method for drawing lines using integer calculations.
14.What is the Midpoint Circle Algorithm?
Ans: An algorithm used to plot circles by determining the next pixel
position using a midpoint approach.
15.Why is Bresenham’s Algorithm preferred over DDA?
Ans: It uses only integer operations, making it faster and more efficient.
16.What is character generation in computer graphics?
Ans: The process of displaying text characters using pixel-based or
vector-based techniques.
17.What is the difference between Stroke and Bitmap fonts?
Ans:
 3

o Stroke Fonts: Defined using vector lines.

o Bitmap Fonts: Defined using a grid of pixels.
18.What is Rasterization in graphics?
Ans: The process of converting vector graphics into a raster image
(pixels).
19.What is an anti-aliasing technique in line drawing?
Ans: A method used to smooth out jagged edges of lines and curves.
20.What is the purpose of Scan Conversion?
Ans: The process of converting mathematical line and shape
representations into pixels.

Unit 3: 2D Geometric Transformations & Viewing (10 Questions)

21.What are the basic 2D transformations?
Ans: Translation, Scaling, and Rotation.
22.What is a composite transformation?
Ans: A combination of multiple transformations applied in sequence.
23.What is the purpose of homogeneous coordinates?
Ans: To represent transformations in matrix form for easier computation.
24.What is the difference between Reflection and Shear?
Ans:
o Reflection: Flipping an image over an axis.
o Shear: Skewing an image along an axis.
25.What is the viewing pipeline in 2D graphics?
Ans: The process of transforming world coordinates into device
coordinates for display.
26.What is a Window-to-Viewport transformation?
Ans: Mapping a selected part of a scene (window) onto a display area
(viewport).
 4

27.What are the different types of clipping in graphics?

Ans: Point Clipping, Line Clipping, and Polygon Clipping.
28.What is the Cohen-Sutherland Line Clipping Algorithm?
Ans: A method for clipping lines by dividing the region into 9 areas and
using region codes.
29.What is the Sutherland-Hodgman Polygon Clipping Algorithm?
Ans: A polygon clipping algorithm that processes one edge at a time
against a clipping boundary.
30.What is Text Clipping?
Ans: The process of removing parts of text that lie outside a defined
clipping region.

Unit 4: 3D Concepts and Object Representation (10 Questions)

31.What are 3D Display Methods?
Ans: Wireframe, Surface Rendering, Solid Modeling.
32.What is Polygon Surface Representation?
Ans: Representing 3D objects as a set of connected polygonal faces.
33.What is Sweep Representation?
Ans: Creating 3D objects by sweeping a 2D shape along a path.
34.What is Constructive Solid Geometry (CSG)?
Ans: A technique for modeling 3D objects using Boolean operations like
union and intersection.
35.What are Octrees and Quadtrees?
Ans:
o Octree: A hierarchical structure used to represent 3D objects.
o Quadtree: A similar structure for 2D objects.
36.What is a wireframe model?
Ans: A skeletal representation of a 3D object using lines and curves.
 5

37.What are the advantages of Polygonal Modeling?

Ans: Simple to process, efficient rendering, widely supported in graphics
hardware.
38.What is the purpose of 3D clipping?
Ans: To remove parts of objects that are outside the viewing volume.
39.What is the difference between Perspective and Parallel Projection?
Ans:
o Perspective Projection: Objects appear smaller as they move
further away.
o Parallel Projection: Objects maintain their relative size.
40.What is the Z-Buffer Algorithm?
Ans: A depth-buffer technique used for hidden surface removal in 3D
graphics.

Unit 5: Computer Animation (10 Questions)

41.What is Computer Animation?
Ans: The process of generating moving images using computer graphics.
42.What is the difference between Raster Animation and Vector
Animation?
Ans:
o Raster Animation: Uses bitmap images, frame-by-frame.
o Vector Animation: Uses mathematical formulas to move objects
smoothly.
43.What are Keyframes in animation?
Ans: Frames that define important positions in an animation sequence.
44.What is Morphing?
Ans: A technique for smooth transformation between two images or
shapes.
 6

45.What is Motion Capture?

Ans: Recording real-world motion and applying it to a digital character.
46.What is Tweening in animation?
Ans: The process of generating intermediate frames between keyframes.
47.What are the different types of animation?
Ans: Traditional Animation, 2D Animation, 3D Animation, Stop Motion.
48.What is a Skeleton Animation?
Ans: A technique where an object is animated using a hierarchical
structure of bones.
49.What is the role of Physics in Animation?
Ans: It helps create realistic movements using gravity, collision, and
motion dynamics.
50.What is a Motion Specification?
Ans: A method for defining object movements in an animation
sequence.

Microprocessors and Computer Hardware

Here is a set of 50 viva questions with short answers covering all 5 units of
Microprocessors and Computer Hardware:

Unit 1: Introduction to Microprocessors (10 Questions)

1. What is a Microprocessor?
Ans: A microprocessor is a central processing unit (CPU) on a single chip
that performs arithmetic and logic operations.
2. What are the key features of the Intel 8085 microprocessor?
Ans: 8-bit processor, 16-bit address bus, 74 instructions, operates at 3
MHz.
3. What is the instruction cycle of 8085?
Ans: The cycle includes Fetch, Decode, Execute, and Store.
 7

4. What is the function of the accumulator in 8085?

Ans: It is an 8-bit register used for arithmetic and logical operations.
5. What are the different types of interrupts in 8085?
Ans: TRAP, RST7.5, RST6.5, RST5.5, INTR.
6. What is the role of the Program Counter (PC)?
Ans: It holds the address of the next instruction to be executed.
7. What is the function of the Stack Pointer (SP)?
Ans: It is a 16-bit register that points to the top of the stack.
8. What is a Timing Diagram in 8085?
Ans: It is a graphical representation of signals during execution.
9. How many general-purpose registers are in 8085?
Ans: Six registers (B, C, D, E, H, L) used in pairs.
10.What is the role of ALE (Address Latch Enable)?
Ans: It distinguishes between address and data signals.

Unit 2: Instruction Set of 8085 (10 Questions)

11.What is an instruction set?
Ans: A set of commands a microprocessor can execute.
12.What are the types of instructions in 8085?
Ans: Data transfer, Arithmetic, Logical, Branch, Control.
13.What is an addressing mode?
Ans: The way an operand is specified in an instruction.
14.What are the different addressing modes in 8085?
Ans: Immediate, Register, Direct, Indirect, Implicit.
15.What is the significance of status flags in 8085?
Ans: Indicate the outcome of operations (e.g., Zero, Carry, Sign, Parity).
16.What is the difference between CALL and RET instructions?
Ans: CALL transfers control to a subroutine; RET returns to the main
program.
 8

17.What is the difference between JMP and JNZ instructions?

Ans: JMP is unconditional; JNZ jumps only if the zero flag is not set.
18.What does the NOP instruction do?
Ans: No operation; used for delays.
19.What is the function of the RST instruction?
Ans: Resets the program counter to a predefined address.
20.How does the HLT instruction work?
Ans: Stops execution and places 8085 in a halt state.

Unit 3: Motherboard Components (10 Questions)

21.What is a motherboard?
Ans: The main circuit board that connects all computer components.
22.What is the function of expansion slots?
Ans: Used to connect additional hardware (e.g., graphics cards).
23.What is the role of the processor socket?
Ans: It houses the CPU and connects it to the motherboard.
24.What is a coprocessor?
Ans: A secondary processor that handles specific tasks like floating-point
calculations.
25.What is BIOS?
Ans: Basic Input/Output System, initializes hardware at startup.
26.What is CMOS?
Ans: A small memory chip that stores BIOS settings.
27.What are the different types of system buses?
Ans: Processor bus, Memory bus, I/O bus.
28.What are PCI and AGP used for?
Ans:
o PCI: Connects peripherals like sound cards.
o AGP: Designed for high-speed graphics processing.
 9

29.What is the purpose of the Super I/O chip?

Ans: Manages legacy I/O devices like serial and parallel ports.
30.What factors should be considered when selecting a motherboard?
Ans: CPU compatibility, RAM support, expansion slots, chipset,
connectivity options.

Unit 4: Hard Disk Drives (10 Questions)

31.What is a hard disk drive (HDD)?
Ans: A data storage device that uses magnetic disks to store data.
32.What are the basic components of an HDD?
Ans: Platters, Spindle, Read/Write Head, Actuator.
33.What is disk formatting?
Ans: Preparing a disk for storing data by creating a file system.
34.What are the different types of file systems used in HDDs?
Ans: FAT16, FAT32, NTFS.
35.What is the difference between FAT32 and NTFS?
Ans:
o FAT32: Simpler, used in older systems.
o NTFS: More secure, supports larger files.
36.What is disk partitioning?
Ans: Dividing a hard disk into separate sections for different uses.
37.What is the function of the hard disk controller?
Ans: Manages communication between the motherboard and HDD.
38.What are the types of HDD interfaces?
Ans: SATA, PATA, SCSI.
39.What is the purpose of disk defragmentation?
Ans: Organizes data to improve read/write speed.
40.What is the difference between an HDD and an SSD?
Ans:
 10

o HDD: Uses spinning disks, slower.

o SSD: Uses flash memory, faster.

Unit 5: Types of Memory (10 Questions)

41.What is physical memory?
Ans: The actual RAM installed in a computer.
42.What are memory modules?
Ans: Physical components that contain RAM chips (e.g., SIMM, DIMM,
RIMM).
43.What is the difference between SIMM and DIMM?
Ans:
o SIMM: Older, single data path.
o DIMM: Newer, dual data path.
44.What is upper memory area?
Ans: Memory between 640KB and 1MB used in older PCs.
45.What is extended memory?
Ans: Memory above 1MB in modern systems.
46.What is expanded memory?
Ans: Memory beyond conventional RAM, accessed using special
software.
47.What is cache memory?
Ans: A small, high-speed memory between CPU and RAM to store
frequently used data.
48.What is virtual memory?
Ans: A portion of the hard drive used as additional RAM.
49.What is volatile and non-volatile memory?
Ans:
o Volatile: Loses data when power is off (e.g., RAM).
 11

o Non-volatile: Retains data without power (e.g., ROM, SSD).

50.What is the role of the memory controller?
Ans: Manages data flow between the CPU and memory.

Operating Systems
Here is a set of 50 viva questions with short answers covering all 5 units of
Operating Systems:

Unit 1: Introduction to Operating Systems (10 Questions)

1. What is an Operating System (OS)?
Ans: An OS is system software that manages hardware and software
resources.
2. What are the main functions of an OS?
Ans: Process management, memory management, file management,
device management, security, and user interface.
3. What are the different types of operating systems?
Ans: Batch OS, Time-Sharing OS, Distributed OS, Real-Time OS,
Embedded OS.
4. What is kernel in an OS?
Ans: The core component of the OS that manages system resources.
5. What is the difference between monolithic and microkernel?
Ans:
o Monolithic: All OS services run in kernel mode.
o Microkernel: Only essential services run in kernel mode; others in
user mode.
6. What are system calls?
Ans: Interfaces that allow user programs to request OS services.
 12

7. What are the types of system calls?

Ans: Process control, file management, device management,
communication, and information maintenance.
8. What is the function of an OS shell?
Ans: It provides a user interface to interact with the OS.
9. What is multitasking?
Ans: Running multiple processes simultaneously.
10.What is the role of an OS in resource allocation?
Ans: It ensures fair and efficient distribution of CPU, memory, and I/O
devices.

Unit 2: Process Management (10 Questions)

11.What is a process?
Ans: A program in execution.
12.What are the different states of a process?
Ans: New, Ready, Running, Waiting, Terminated.
13.What is process scheduling?
Ans: Deciding which process gets CPU time.
14.What are the types of scheduling?
Ans: Long-term, Short-term, and Medium-term scheduling.
15.What are the different CPU scheduling algorithms?
Ans: FCFS, SJF, Round Robin, Priority Scheduling, Multilevel Queue.
16.What is context switching?
Ans: Saving and restoring process state during a switch between
processes.
17.What is inter-process communication (IPC)?
Ans: A mechanism that allows processes to communicate and share
data.
18.What are multiple processor scheduling techniques?
Ans: Asymmetric and Symmetric multiprocessing.
 13

19.What is the difference between preemptive and non-preemptive

scheduling?
Ans:
o Preemptive: Process can be interrupted.
o Non-preemptive: Process runs until completion.
20.What is the role of a dispatcher in process scheduling?
Ans: It switches CPU control to the selected process.

Unit 3: Process Coordination & Deadlocks (10 Questions)

21.What is process synchronization?
Ans: Coordination of processes to prevent race conditions.
22.What is the Critical Section problem?
Ans: A problem where multiple processes access shared resources
without proper synchronization.
23.What are semaphores?
Ans: A synchronization tool that controls process access to resources.
24.What are the two types of semaphores?
Ans: Binary (0/1) and Counting (integer value).
25.What is a monitor in process synchronization?
Ans: A higher-level synchronization construct that controls access to
shared resources.
26.What are classic synchronization problems?
Ans: Producer-Consumer, Dining Philosophers, and Readers-Writers
problems.
27.What is a deadlock?
Ans: A situation where processes wait indefinitely for resources held by
other processes.
28.What are the necessary conditions for deadlock?
Ans: Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait.
 14

29.What are the methods for handling deadlocks?

Ans: Prevention, Avoidance, Detection, and Recovery.
30.What is the difference between deadlock prevention and deadlock
avoidance?
Ans:
o Prevention: Ensures at least one deadlock condition is not met.
o Avoidance: Uses algorithms like Banker's algorithm to prevent
deadlocks dynamically.

Unit 4: Memory Management (10 Questions)

31.What is memory management?
Ans: Managing memory allocation and deallocation for processes.
32.What are memory management strategies?
Ans: Contiguous Allocation, Paging, Segmentation.
33.What is swapping?
Ans: Moving processes between RAM and disk to optimize memory
usage.
34.What is paging?
Ans: Dividing memory into fixed-size pages for efficient allocation.
35.What is segmentation?
Ans: Dividing memory into variable-sized segments based on logical
divisions.
36.What is virtual memory?
Ans: A memory management technique that extends RAM using disk
space.
37.What is demand paging?
Ans: Loading only required pages into memory on demand.
38.What are page replacement algorithms?
Ans: FIFO, LRU, Optimal, Least Frequently Used.
 15

39.What is thrashing?
Ans: Excessive paging causing performance degradation.
40.How is segmentation different from paging?
Ans:
o Paging: Fixed-size memory blocks.
o Segmentation: Logical divisions of memory.

Unit 5: Storage Management (10 Questions)

41.What is a file system?
Ans: A method of organizing and storing data on storage devices.
42.What are the different types of file access methods?
Ans: Sequential, Direct, Indexed.
43.What is a directory structure?
Ans: A hierarchical way to organize files in an OS.
44.What are the different file allocation methods?
Ans: Contiguous, Linked, Indexed.
45.What is free space management?
Ans: A technique to track unused disk space (e.g., Bitmaps, Free lists).
46.What is disk scheduling?
Ans: Managing disk read/write operations efficiently.
47.What are different disk scheduling algorithms?
Ans: FCFS, SSTF, SCAN, C-SCAN, LOOK.
48.What is fragmentation in storage management?
Ans: Unused memory space leading to inefficient storage use.
49.What is the difference between internal and external fragmentation?
Ans:
o Internal: Wasted space inside allocated blocks.
o External: Wasted space due to non-contiguous free blocks.
 16

50.What is the role of an inode in a file system?

Ans: It stores metadata about files (e.g., permissions, size, location).

Data Structures using C++

Here is a set of 50 viva questions with answers covering all 5 units of Data
Structures:

Unit 1: Arrays, Searching & Sorting (10 Questions)

1. What is a Data Structure?
Ans: A way to organize and store data for efficient access and
modification.
2. What are the types of Data Structures?
Ans: Linear (Array, Stack, Queue, Linked List), Non-Linear (Tree, Graph).
3. How are arrays stored in memory?
Ans: Arrays are stored in contiguous memory locations.
4. What is a sparse matrix?
Ans: A matrix where most elements are zero.
5. How can we represent a sparse matrix?
Ans: Using array representation or linked lists.
6. What is linear search?
Ans: A search method that checks each element one by one.
7. What is binary search?
Ans: A search method that divides the list into two halves and searches
recursively.
8. What are the sorting algorithms covered?
Ans: Selection Sort, Insertion Sort, Quick Sort.
9. What is the time complexity of Quick Sort?
Ans: Best & Average Case: O(n log n), Worst Case: O(n²).
 17

10.Why is binary search faster than linear search?

Ans: It eliminates half of the data at each step (O(log n) complexity).

Unit 2: Stacks & Queues (10 Questions)

11.What is a stack?
Ans: A LIFO (Last In, First Out) data structure.
12.What are stack operations?
Ans: Push (Insert), Pop (Delete), Peek (Top element view).
13.What are applications of stacks?
Ans: Expression conversion, recursion, backtracking, undo-redo
operations.
14.What is infix, prefix, and postfix notation?
Ans:
o Infix: A + B
o Prefix: +AB
o Postfix: AB+
15.What is the algorithm for infix to postfix conversion?
Ans: Using stack, scan from left to right, push operators, and pop them
in precedence order.
16.What is a queue?
Ans: A FIFO (First In, First Out) data structure.
17.What is a circular queue?
Ans: A queue where the last position is connected back to the first
position to overcome wastage of space.
18.What is a priority queue?
Ans: A queue where elements are removed based on priority, not just
order of insertion.
19.What is a deque (double-ended queue)?
Ans: A queue where insertion and deletion can be done from both ends.
 18

20.What is the difference between a stack and a queue?

Ans: Stack: LIFO, Queue: FIFO.

Unit 3: Linked Lists (10 Questions)

21.What is a linked list?
Ans: A collection of nodes where each node contains data and a pointer
to the next node.
22.What are the types of linked lists?
Ans: Singly Linked List, Doubly Linked List, Circular Linked List.
23.What is a circular linked list?
Ans: A linked list where the last node points back to the first node.
24.What are the advantages of linked lists over arrays?
Ans:
o Dynamic size allocation
o Efficient insertions & deletions
o No memory wastage
25.What is the disadvantage of a linked list?
Ans: More memory overhead due to extra pointers.
26.How do you insert a node in a singly linked list?
Ans: Allocate memory, set data, adjust next pointer of previous node.
27.What is a doubly linked list?
Ans: A list where each node has two pointers: previous and next.
28.What is garbage collection?
Ans: The process of automatically reclaiming memory occupied by
unreferenced objects.
29.What is the difference between linked lists and arrays?
Ans:
o Arrays: Fixed size, contiguous memory
 19

o Linked Lists: Dynamic size, non-contiguous memory

30.How do you delete a node from a linked list?
Ans: Update pointers and free the memory of the deleted node.

Unit 4: Trees (10 Questions)

31.What is a tree?
Ans: A non-linear data structure consisting of nodes connected by
edges.
32.What is a binary tree?
Ans: A tree where each node has at most two children.
33.What are different types of binary trees?
Ans: Strictly Binary, Complete Binary, Full Binary Tree.
34.What is a binary search tree (BST)?
Ans: A tree where the left subtree has smaller values, and the right
subtree has larger values.
35.What are the tree traversal techniques?
Ans:
o Preorder (Root → Left → Right)
o Inorder (Left → Root → Right)
o Postorder (Left → Right → Root)
36.What is recursion in data structures?
Ans: A function that calls itself until a base condition is met.
37.What is the use of binary trees?
Ans: Expression trees, decision trees, sorting, and searching.
38.What is an expression tree?
Ans: A binary tree where operators are internal nodes and operands are
leaves.
39.What is the height of a binary tree?
Ans: The longest path from the root to a leaf.
 20

40.How do you insert a node in a BST?

Ans: Compare values and place smaller nodes to the left and larger
nodes to the right.

Unit 5: Files & Hashing (10 Questions)

41.What is a file?
Ans: A collection of related data stored in secondary storage.
42.What are different file operations?
Ans: Open, Close, Read, Write, Append, Delete.
43.What are file organization methods?
Ans: Sequential, Indexed Sequential, Random, Linked Organization.
44.What is hashing?
Ans: A technique to map keys to values using a hash function.
45.What are different types of hashing?
Ans: Static Hashing, Dynamic Hashing.
46.What is a hash collision?
Ans: When two different keys map to the same index in a hash table.
47.What are collision resolution techniques?
Ans: Chaining, Linear Probing, Quadratic Probing, Double Hashing.
48.What is an inverted file?
Ans: A file where records are indexed based on content rather than
location.
49.What is the difference between sequential and indexed sequential file
organization?
Ans:
o Sequential: Records are stored in order.
o Indexed Sequential: Uses an index to locate records faster.
 21

50.What is the advantage of hashing over searching?

Ans: Hashing provides constant time (O(1)) access, while searching takes
O(log n) or O(n).