Scribd
Upload
3 views1 page

Corrected Answer Key First Term Csp2

The document contains a corrected answer key and solutions for a Computer Science exam for Class 11th Science at Shivpriya Junior College for the session 2025-26. It includes various topics such as logic gates, flowcharts, binary number systems, and algorithms, along with their respective answers and explanations. Additionally, it covers input devices, storage media, and basic operations in computer science.

Uploaded by

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

Corrected Answer Key First Term Csp2

The document contains a corrected answer key and solutions for a Computer Science exam for Class 11th Science at Shivpriya Junior College for the session 2025-26. It includes various topics such as logic gates, flowcharts, binary number systems, and algorithms, along with their respective answers and explanations. Additionally, it covers input devices, storage media, and basic operations in computer science.

Uploaded by

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

Corrected Answer Key & Solutions

Shivpriya Junior College — COMPUTER SCIENCE (PAPER-II)


Class: 11th Science — Session: 2025–26
Marks: 50

Q1 (A) a) EX-OR gate output is high when inputs are different. b) NAND gate is the universal
building block. c) Hard disk consists of multiple platters (typically 1–8). d) Decision symbol in
flowchart — Diamond.
Q1 (B) a) Flowchart to interchange A, B: Start → Input A,B → TEMP=A → A=B → B=TEMP →
Output A,B → End. b) Binary number system: base 2, digits 0 & 1; (1011)■ = 11■■. c) Types of
printers: Dot matrix, Inkjet, Laser, Thermal, Plotter.
Q2 (A) i) (1101100.1101)■ = 108.8125■■ ii) (1A.B1)■■ = 00011010.10110001■ iii)
(111110001.10011001)■ = (1F1.99)■■ b) Half-adder: Sum = A⊕B, Carry = A·B c) NAND: Y =
¬(A·B); NOR: Y = ¬(A+B)
Q2 (B) Mouse: Input device; optical/mechanical; parts—buttons, scroll, sensor. Scanner: Converts
hard copy → soft copy; types—flatbed, handheld, sheet-fed.
Q3 (A) i) (10011000001) BCD = 981■■ ii) (2BAD)■■ = 0010101110101101■ iii) Gate symbols:
AND, OR, NOT standard logic shapes.
Q3 (B) Fibonacci series: F0=0, F1=1; Fi = F(i-1)+F(i-2). Keyboard: Input device; types—membrane,
mechanical.
Q4 (A) a) HDD: Magnetic platters, spindle, read/write heads; data in tracks/sectors. b) Flowchart
symbols: Start/End (Oval), I/O (Parallelogram), Process (Rectangle), Decision (Diamond),
Connector (Circle). c) NAND truth table: A B → Y; 00→1, 01→1, 10→1, 11→0.
Q4 (B) a) Algorithm for addition: Input A,B → SUM=A+B → Output SUM → End. b) BCD
conversions: (15)■■ = 0001 0101 (256)■■ = 0010 0101 0110 (649)■■ = 0110 0100 1001
(746)■■ = 0111 0100 0110
Q5 (A) a) Floppy: Magnetic storage; tracks/sectors diagram; 3.5" 1.44MB disk = 80 tracks/side, 18
sectors/track. b) Basic gates: AND (A·B), OR (A+B), NOT (¬A). c) 1’s complement subtraction: i)
00011−10100 → −10001 (−17■■) ii) 01100−00100 → 01000 (8■■) iii) 000101−10010 → −001101
(−13■■)
Q5 (B) a) Short notes: Multimedia: Combines text, image, audio, video. Modem: Converts
digital↔analog (DSL, dial-up). CD-ROM: Optical read-only media using laser. Video: Digital moving
images, codecs. b) 2’s complement subtraction (52−65): 52=00110100■, 65=01000001■ → result
11110011■ = −13■■. c) A=11010■ (26■■), B=01100■ (12■■): A+B=100110■ (38■■, overflow
in 5-bit), A−B=01110■ (14■■).

You might also like