Universal Examination ArchiveNEP 2020 Standard โ€ข All Universities

University Exam Question Bank & 15-Mark Model Answer Blueprints

Unit-wise question archives, high-frequency 15-mark essay blueprints, mandatory scoring diagrams, and practical viva flashcards for BCA Semester 1.

Standard University Semester Exam Pattern & Marking Scheme

Section A (Very Short)

10 Questions x 2 Marks = 20 Marks. Compulsory 2-line definitions & syntax across all 5 units.

Section B (Short Answer)

5 Questions x 6 Marks = 30 Marks. Conceptual explanations with comparative tables & code snippets.

Section C (Long Essay)

2 Questions x 10/15 Marks = 20-30 Marks. Full architecture derivations, memory models, and diagrams.

Top University Exam Papers

Unit-Wise 15-Mark Long Essay Model Answer Blueprints

NEP 2020 Blueprints
UNIT 1 โ€ข Q1. 15-Mark Long University QuestionExam Frequency: 98% (AKTU, IPU, DU, CCSU)

"Draw and explain the complete Functional Block Diagram of a modern digital computer. Describe the roles of Control Unit (CU), Arithmetic Logic Unit (ALU), and the 5 primary CPU Registers. Explain why the Data Bus is bidirectional while the Address Bus is unidirectional."

๐ŸŽฏ Examiner's Step-Wise Marking Breakdown (15 Marks Total):
  • โ€ข Step 1 (4 Marks): Draw clean Functional Block Diagram (Input, CPU with ALU/CU/Registers, Primary RAM/ROM, Secondary Storage, Output).
  • โ€ข Step 2 (4 Marks): Detail Control Unit (Instruction Fetch/Decode/Execute cycle) and ALU (Arithmetic & Boolean logic operations).
  • โ€ข Step 3 (4 Marks): Explain 5 CPU Registers: Program Counter (PC), Accumulator (AC), Instruction Register (IR), MAR, and MDR.
  • โ€ข Step 4 (3 Marks): Explain System Bus architecture: Unidirectional Address Bus (CPU โ†’ Memory) vs Bidirectional Data Bus (CPU โ†” Memory/IO).
UNIT 1 โ€ข Q2. 15-Mark Long University QuestionExam Frequency: 95% (Theory Master)

"Discuss the evolution and the 5 Generations of Computers from 1940 to present. Tabulate a comparative analysis across Switching Devices, Memory Technology, Programming Languages, and Processing Speeds. Explain why John von Neumann's Stored-Program Concept is the foundation of modern computing."

๐ŸŽฏ Examiner's Step-Wise Marking Breakdown (15 Marks Total):
  • โ€ข Step 1 (4 Marks): Detail Von Neumann Stored Program Concept (storing program instructions and data in the same internal memory space).
  • โ€ข Step 2 (7 Marks): Master 6-Column Comparative Table covering 1st to 5th Generation (Vacuum Tubes โ†’ Transistors โ†’ ICs โ†’ VLSI โ†’ ULSI/NPUs, memory, languages, operating speeds ms to ps).
  • โ€ข Step 3 (4 Marks): Cite historic milestones: Charles Babbage (Store/Mill), Lady Ada Lovelace, ENIAC, EDVAC, UNIVAC, and modern AI microprocessors.
UNIT 1 โ€ข Q3. 15-Mark Compulsory Numerical ProblemExam Frequency: 100% (Guaranteed Scoring Numerical)

"Solve the following number system operations with complete step-by-step intermediate calculations: (a) Convert (105.625)โ‚โ‚€ to Binary, Octal, and Hexadecimal [5 Marks]; (b) Perform (35)โ‚โ‚€ - (18)โ‚โ‚€ using 8-bit 2's Complement subtraction with carry verification [5 Marks]; (c) Convert (11011011101)โ‚‚ directly to Octal and Hexadecimal [5 Marks]."

๐ŸŽฏ Examiner's Step-Wise Marking Breakdown (15 Marks Total):
  • โ€ข Part A (5 Marks): Integer successive division: 105 รท 2 = (1101001)โ‚‚; Fractional multiplication: 0.625 ร— 2 = (.101)โ‚‚ โ†’ Result: (1101001.101)โ‚‚ = (151.5)โ‚ˆ = (69.A)โ‚โ‚†.
  • โ€ข Part B (5 Marks): Minuend M = 00100011, Subtrahend N = 00010010; 1's comp = 11101101, 2's comp = 11101110; Sum = 1 00010001; Discard carry $\rightarrow$ +17.
  • โ€ข Part C (5 Marks): 3-bit grouping for Octal: (011 011 011 101)โ‚‚ = (3335)โ‚ˆ; 4-bit nibbles for Hex: (0110 1101 1101)โ‚‚ = (6DD)โ‚โ‚†.
UNIT 2 โ€ข Q4. 15-Mark Long University QuestionExam Frequency: 95% (AKTU, IPU, DU, CCSU)

"Discuss the complete Memory Hierarchy of a modern computer in detail. Explain the working principle of Cache Memory, Temporal vs Spatial Locality of Reference, and differentiate between SRAM and DRAM in tabular form."

๐ŸŽฏ Examiner's Step-Wise Marking Breakdown (15 Marks Total):
  • โ€ข Step 1 (3 Marks): Draw the 5-Tier Triangular Memory Pyramid with Upward (Speed/Cost) and Downward (Capacity) arrows.
  • โ€ข Step 2 (4 Marks): Define Cache Memory, Hit Ratio formula H = Hits / (Hits + Misses), and Average Access Time T_avg = H ยท T_c + (1 - H) ยท T_m.
  • โ€ข Step 3 (3 Marks): Explain Principle of Locality of Reference with code examples (Temporal in loops, Spatial in contiguous arrays).
  • โ€ข Step 4 (5 Marks): Structured 6-parameter comparative table contrasting SRAM (Flip-flops, no refresh, Cache) vs DRAM (1T-1C Capacitor, 64ms refresh, Main RAM).
UNIT 2 โ€ข Q5. 15-Mark Long University QuestionExam Frequency: 90% (Numerical + Theory)

"Explain the physical construction and operational mechanics of a Hard Disk Drive (HDD). Define Seek Time, Rotational Latency, and derive the formula for Total Average Disk Access Time. Calculate the access time for a 7200 RPM drive with 8.5ms seek time and 150 MB/s transfer rate for a 64 KB block."

๐ŸŽฏ Examiner's Step-Wise Marking Breakdown (15 Marks Total):
  • โ€ข Step 1 (4 Marks): Draw physical HDD diagram (Spindle motor, platters, R/W head, tracks, sectors, cylinders).
  • โ€ข Step 2 (4 Marks): Define Seek Time (T_seek), Rotational Latency (T_latency = 0.5 ยท (60 / RPM)), and Data Transfer Rate (T_transfer).
  • โ€ข Step 3 (4 Marks): Solved Numerical calculation: T_latency = 0.5 ร— (60,000 / 7200) = 4.17 ms; T_transfer = (0.0625 MB / 150) ร— 1000 = 0.417 ms.
  • โ€ข Step 4 (3 Marks): Final Total Access Time: 8.5 ms + 4.17 ms + 0.417 ms = 13.087 ms. Contrast with modern NAND Flash SSD.
UNIT 3 โ€ข Q6. 15-Mark Long University QuestionExam Frequency: 95% (AKTU, IPU, DU, CCSU)

"Explain the complete Language Translation and Compilation Pipeline in detail. Describe the 6 phases of a Compiler, the distinct roles of a Linker and a Loader, and compare Compilers and Interpreters across 6 parameters."

๐ŸŽฏ Examiner's Step-Wise Marking Breakdown (15 Marks Total):
  • โ€ข Step 1 (4 Marks): Draw 6-Stage Compilation Pipeline (Source โ†’ Preprocessor โ†’ Compiler โ†’ Assembler โ†’ Linker โ†’ Loader โ†’ RAM).
  • โ€ข Step 2 (5 Marks): Explain 6 Compiler Phases: Lexical (Tokens), Syntax (Parse Tree), Semantic (Type Check), ICG, Optimizer, Target Codegen.
  • โ€ข Step 3 (3 Marks): Contrast Linker (combines object files into .exe on disk) vs Loader (loads .exe into primary RAM and sets PC register).
  • โ€ข Step 4 (3 Marks): 6-parameter comparative table contrasting Compiler (single pass, .exe, fast) vs Interpreter (line-by-line, in RAM).
UNIT 3 โ€ข Q7. 15-Mark Long University QuestionExam Frequency: 95% (OS Core Master)

"Discuss the 5 primary functions of an Operating System. Explain the 5-state Process Lifecycle with a neat state transition diagram, define the contents of a Process Control Block (PCB), and differentiate between Time-Sharing and Real-Time Operating Systems (RTOS)."

๐ŸŽฏ Examiner's Step-Wise Marking Breakdown (15 Marks Total):
  • โ€ข Step 1 (4 Marks): Detail 5 Core OS Functions: Processor Scheduling, Memory Paging/Virtual Memory, File Systems, I/O Spooling, Security.
  • โ€ข Step 2 (5 Marks): Draw 5-State Process Lifecycle Diagram (New โ†’ Ready โ†’ Running โ†’ Waiting โ†’ Terminated) with event triggers (Dispatch, Timeout, I/O Wait, I/O Complete).
  • โ€ข Step 3 (3 Marks): List 6 PCB fields (PID, State, Program Counter, CPU Registers, Memory Limits, Open Files).
  • โ€ข Step 4 (3 Marks): Contrast Time-Sharing OS (Time Quantum round-robin) vs RTOS (Deterministic deadline execution: Hard vs Soft RTOS).

Subject-wise High-Frequency Exam Topics

NBC 101Fundamentals of Computer
  • Always draw the complete Functional Block Diagram of a Computer (Input, CPU with ALU/CU/Registers, Memory Unit, Output Unit) with clean directional bus arrows in Unit 1.
  • In Unit 2 Memory Hierarchy questions, always draw the Triangular 5-Tier Pyramid with upward 'Speed & Cost' and downward 'Capacity' arrows.
  • In Unit 3 Translator questions, draw the complete 6-Stage Compilation Pipeline (Source -> Preprocessor -> Compiler -> Assembler -> Linker -> Loader -> RAM).
NBC 103Problem Solving Using C
  • Every syntax question must include a complete 4-8 line working code snippet + output.
  • Draw RAM memory block diagrams showing pointer addresses (e.g. 0x1000, 0x1004) for all pointer and array answers.
  • Unit 3 (Pointers & Strings) and Unit 5 (DMA malloc/calloc + Binary Search) carry maximum marks in university exams.
NBC 104Communication Skills
  • Always draw the Communication Cycle Diagram (Sender -> Encoding -> Channel -> Decoding -> Receiver -> Feedback with Noise) in Unit 1 questions.
  • Tabulate the 7 C's of Effective Communication with clean examples.
  • Memorize the standard professional format for Resumes, Business Emails, and Minutes of Meeting (MoM).
NBC 105Environment and Ecology
  • Draw Food Web diagrams and Ecological Pyramids (Number, Biomass, Energy) in Unit 1.
  • Diagram the Carbon & Nitrogen Cycles showing fixation, nitrification, and assimilation.
  • Explain the chemical reactions of Acid Rain (SO2 -> H2SO3 and NO2 -> HNO3) and Ozone depletion via CFCs.

Master Practical Viva Voce Repository (Semester 1)

33 Questions
1

What is the difference between Data and Information?

2

Why is the Data Bus bidirectional while the Address Bus is unidirectional?

3

Who is recognized as the world's first computer programmer and why?

4

What was the single biggest technological advantage of Transistors over Vacuum Tubes in 2nd Gen computers?

5

What is the primary difference between a Mainframe Computer and a Supercomputer?

6

Why do modern computers use 2's Complement representation for negative numbers rather than sign-magnitude?

7

What is the difference between Temporal Locality and Spatial Locality?

8

Why does a computer use dynamic refreshing in DRAM?

9

What is meant by a Cylinder in a multi-platter Hard Disk Drive?

10

Why is MICR preferred over optical barcode/OCR for banking cheque processing?

11

Why are Dot Matrix Printers still used at Railway Ticket counters and Banks despite being noisy and slow?

12

What is Firmware and where is it located in a computer?

13

What is the difference between an Object File (.obj) and an Executable File (.exe)?

14

What is the key difference between 3GL (Procedural) and 4GL (Non-Procedural) languages?

15

What is Spooling in an Operating System and what is its full form?

16

What is the primary difference between a Hard Real-Time OS and a Soft Real-Time OS?

17

What is a Real-Time Operating System (RTOS) and where is it used?

18

What is the key difference between a Hub and a Switch in a Star Network?

19

What is the difference between = and == in C?

20

What happens if a recursive function does not have a base condition?

21

What is a NULL pointer vs a Dangling pointer?

22

Why is the arrow operator (->) used with structure pointers?

23

What is the key difference between malloc() and calloc()?

24

Why is Feedback considered the most critical component of the communication cycle?

25

What is the recommended interpersonal distance for professional interviews according to Proxemics?

26

What is Empathy and how does it differ from Sympathy?

27

What is the best way to initiate a Group Discussion?

28

What makes a Resume ATS-friendly?

29

Why is the Pyramid of Energy always upright?

30

Which bacteria is responsible for symbiotic nitrogen fixation in legumes?

31

What is the difference between BOD and COD?

32

Which international treaty successfully phased out Ozone Depleting Substances (CFCs)?

33

What historic tragedy prompted the enactment of the Environment Protection Act 1986 in India?