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
NEP 2020 BlueprintsUnit-Wise 15-Mark Long Essay Model Answer 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).
NBC 103 • Problem Solving Using CNEP 2020 High-Yield Exam Questions
C Programming Core 15-Mark University Examination Blueprints
NBC 103 • UNIT 1 & 2 • 15-Mark Compulsory QuestionExam Frequency: 99% (AKTU, IPU, DU, CCSU)
"Explain the complete 4-stage Compilation Pipeline of a C program (.c to .exe). Describe the roles of the Preprocessor, Compiler, Assembler, and Linker. Write an algorithm and complete C program to find the roots of a quadratic equation ax² + bx + c = 0, handling all three discriminant conditions."
🎯 Examiner's Step-Wise Marking Breakdown (15 Marks Total):
- • Step 1 (4 Marks): Draw 4-stage pipeline (.c → cpp → .i → ccl → .s → as → .obj → ld → .exe) detailing header inclusion, macro expansion, and runtime library binding.
- • Step 2 (3 Marks): Algorithm/Flowchart for roots of quadratic equation with Discriminant D = b² - 4ac.
- • Step 3 (5 Marks): Complete ANSI C program using math.h sqrt() function, checking a != 0, and handling D > 0 (Real/Distinct), D == 0 (Real/Equal), and D < 0 (Complex conjugates).
- • Step 4 (3 Marks): Sample test case inputs and outputs with zero-check defense.
NBC 103 • UNIT 2 • 15-Mark Long University QuestionExam Frequency: 95% (Theory + Code)
"Differentiate between while and do-while loops with syntax, minimum execution counts, and flowcharts. Explain the concepts of Call by Value vs Call by Reference using pointers. Write a C program to swap two integers using pointers and illustrate the stack frame activation record."
🎯 Examiner's Step-Wise Marking Breakdown (15 Marks Total):
- • Step 1 (4 Marks): Comparative matrix of while vs do-while: Entry-Controlled (min 0) vs Exit-Controlled (min 1, mandatory semicolon while();).
- • Step 2 (4 Marks): Explain Call by Value (bitwise copy, no modification to caller) vs Call by Reference simulation in C (passing addresses &a, &b to pointers).
- • Step 3 (4 Marks): Complete swap(int *x, int *y) code snippet with main() calling swap(&a, &b).
- • Step 4 (3 Marks): Memory diagram showing caller's stack frame vs swap() stack frame with memory addresses (0x1000, 0x1004).
NBC 103 • UNIT 3 • 15-Mark Core Programming QuestionExam Frequency: 98% (High-Yield Coding)
"What is a Pointer in C? Explain pointer arithmetic and the Equivalence Principle *(arr + i) == arr[i]. Derive the Row-Major memory address formula for a 2D array A[i][j]. Write a complete C program to multiply two matrices of orders R1 x C1 and R2 x C2 with compatibility validation."
🎯 Examiner's Step-Wise Marking Breakdown (15 Marks Total):
- • Step 1 (3 Marks): Pointer definition, address-of (&), dereference (*), and arithmetic scaling (ptr++ jumps sizeof(*ptr) bytes).
- • Step 2 (4 Marks): Row-Major formula derivation: Address(A[i][j]) = Base + (i · COLS + j) · sizeof(type). Explain why column size is mandatory in function declarations.
- • Step 3 (6 Marks): Matrix multiplication C program verifying C1 == R2, computing C[i][j] via triple nested loops in O(N³), and printing formatted matrix.
- • Step 4 (2 Marks): Explain Dangling Pointer vs NULL Pointer.
NBC 103 • UNIT 4 • 15-Mark Long University QuestionExam Frequency: 95% (AKTU, IPU, CCSU)
"Compare Structures (struct) and Unions (union) across 6 parameters with neat memory layout diagrams. Explain Structure Padding (slack bytes) and how #pragma pack(1) alters data alignment. Write a C program to store and display student records using an array of structures."
🎯 Examiner's Step-Wise Marking Breakdown (15 Marks Total):
- • Step 1 (5 Marks): Master 6-parameter comparative table: Memory allocation (separate vs shared), Size (sum vs largest member), member coexistence vs overwrite side-effects.
- • Step 2 (4 Marks): Structure padding diagram showing word boundary alignment (why struct { char c; int i; } consumes 8 bytes instead of 5 bytes) and #pragma pack(1).
- • Step 3 (4 Marks): Array of structures C program (struct Student bca[3]) accessing members with dot (.) and pointer arrow (->) operators.
- • Step 4 (2 Marks): Explain the 4 storage classes (auto, register, static, extern) in brief.
NBC 103 • UNIT 5 • 15-Mark Long University QuestionExam Frequency: 95% (AKTU, IPU, DU, CCSU)
"Discuss Dynamic Memory Allocation (DMA) in C. Tabulate a comparison between malloc(), calloc(), realloc(), and free(). Explain what causes Memory Leaks and Dangling Pointers with remediation code. Write an optimized Binary Search algorithm and derive its worst-case time complexity O(log2 N)."
🎯 Examiner's Step-Wise Marking Breakdown (15 Marks Total):
- • Step 1 (4 Marks): The 4 memory segments (Code, Data, Stack, Heap). DMA table comparing malloc(size), calloc(n, size), realloc(ptr, size), and free(ptr).
- • Step 2 (3 Marks): Memory Leak definition, consequences on long-running servers, and setting ptr = NULL after free() to fix dangling pointers.
- • Step 3 (5 Marks): Iterative Binary Search C program using safe midpoint mid = low + (high - low) / 2 to prevent integer overflow.
- • Step 4 (3 Marks): Recurrence relation derivation: T(N) = T(N/2) + O(1) → O(log2 N) time complexity. State why array MUST be sorted.
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
- In Unit 1, always draw the complete 4-Stage Compilation Pipeline (.c -> Preprocessor -> .i -> Compiler -> .s -> Assembler -> .o -> Linker -> .exe) and standard flowchart symbols with directional flowlines.
- In Unit 2 loop questions, always write down the 4 mandatory loop components (Initialization, Test Condition, Body, Update) and compare while vs do-while with execution flowcharts.
- In Unit 3, draw RAM memory block diagrams showing pointer addresses (e.g. 0x1000, 0x1004) and demonstrate the Equivalence Principle: *(arr + i) == arr[i].
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)
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 the primary role of a Device Driver in system software?
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 the difference between Syntax Error and Logical Error?
16
Why must an algorithm have the property of 'Finiteness'?
17
What is Spooling in an Operating System and what is its full form?
18
Why do high-end Linux servers and supercomputers still prefer CLI over GUI?
19
What is the difference between an Internal Command and an External Command in DOS/Windows?
20
How do the commands DEL and RD differ in Windows CLI?
21
What is the primary difference between Half-Duplex and Full-Duplex transmission?
22
Why are the copper wires in a Twisted Pair cable twisted around each other?
23
Why must a Bus topology have Terminators at both ends of the backbone cable?
24
Why was IPv6 introduced when IPv4 was already working globally?
25
Why does FTP use two separate port connections (Port 20 and Port 21)?
26
What is the key functional difference between POP3 and IMAP for email retrieval?
27
What is the key difference between Bitmap (Raster) graphics and Vector graphics?
28
What is the Nyquist Sampling Theorem in digital audio recording?
29
What is meant by 'Generational Loss' in conventional analog media?
30
How did lossy data compression enable the modern streaming video revolution?
31
What is the key difference between an Algorithm and Pseudocode?
32
Why can a flowchart have multiple STOP symbols but strictly only ONE START symbol?
33
What is the difference between Linker and Loader?
34
Why is 'void main()' considered obsolete or bad practice in modern ANSI C?
35
What happens when an unsigned char exceeds its maximum value of 255?
36
Can an identifier in C begin with an underscore (_)?
37
What is the output of printf("%d", 5 / 2) vs printf("%f", 5.0 / 2)?
38
What is the difference between #define PI 3.14 and const float PI = 3.14?
39
Why should we never use gets() in production C code?
40
What does the return value of scanf() represent?
41
Can we use relational conditions like 'case > 5:' in a C switch statement?
42
What is the Dangling Else problem and how does the C compiler resolve it?
43
What is the output of: int i = 10; do { printf("%d ", i); i++; } while(i < 5);?
44
Can any expression in a for loop header: for(e1; e2; e3) be omitted?
45
Can continue be used inside a switch statement?
46
What is the difference between return 0 and exit(0)?
47
What happens if you call a function before its declaration in C?
48
Can a C function return multiple values directly?
49
Why does C not have true Call by Reference like C++?
50
What is Tail Recursion and why is it desirable?
51
Why does C not check array bounds during runtime?
52
What is the difference between int arr[5] and arr[5]?
53
Why must the column size be specified when declaring 2D arrays as function parameters: void func(int arr[][3])?
54
What is the Transpose of a matrix?
55
What is the size of a pointer variable in C?
56
What is a Dangling Pointer and how do you remediate it?
57
Why does sizeof(arr) behave differently inside main() versus inside a function receiving arr?
58
What is a Function Pointer?
59
What is the ASCII value of the null character '\0' versus character '0'?
60
What happens if a character array has no '\0' terminator?
61
Can two different structure types contain members with identical names?
62
What is the purpose of #pragma pack(1)?
63
What is the syntactic difference between (*ptr).member and *ptr.member?
64
Can a structure contain an instance of itself as a member?
65
Can we use the address-of operator (&) on a bit-field member?
66
What is the memory address of the first member of a union compared to the union variable itself?
67
Does typedef allocate any physical memory in RAM?
68
Can an enum value in C be negative?
69
Why does the compiler ignore the 'register' keyword sometimes?
70
What is the difference between declaring a variable with extern versus defining it?
71
Why is Binary Search inefficient on standard Singly Linked Lists?
72
How many comparisons does Binary Search take in an array of 1024 elements in the worst case?
73
What is an In-Place Sorting Algorithm?
74
Why is Selection Sort not considered stable?
75
What does malloc(0) return in C?
76
Can memory allocated with malloc() be freed partially?
77
Why is the return type of fgetc() int rather than char?
78
What is EOF and what numerical value does it hold?
79
What is the return value of fread() and fwrite()?
80
What is the difference between fseek(fp, 0, SEEK_SET) and rewind(fp)?
81
Why is Feedback considered the most critical component of the communication cycle?
82
What is the recommended interpersonal distance for professional interviews according to Proxemics?
83
What is Empathy and how does it differ from Sympathy?
84
What is the best way to initiate a Group Discussion?
85
What makes a Resume ATS-friendly?
86
Why is the Pyramid of Energy always upright?
87
Which bacteria is responsible for symbiotic nitrogen fixation in legumes?
88
What is the difference between BOD and COD?
89
Which international treaty successfully phased out Ozone Depleting Substances (CFCs)?
90