Join WhatsApp ChannelDaily MCQs & Exam Updates

Computer Science MCQs

MCQs on Programming, Networking, Database and OS

25 Questions
Subject Preparation Guide

Prepare Computer Science with confidence

Strengthen your knowledge of computer fundamentals, hardware, software, programming, networks, databases and information technology.

Computer BasicsProgrammingNetworksDatabases
Recommended for academic classes, IT tests and computer portions of competitive examinations.
Computer Science preparation illustration
Filter: All Exams css pms fpsc ppsc nts | All Easy Medium Hard
21
Medium fpsc nts

What is the purpose of a checksum?

  • A Compress data
  • B Verify data integrity
  • C Increase speed
  • D Encrypt files
Permalink
Correct Answer: Option B — Verify data integrity
Explanation: A checksum helps detect accidental changes in data during storage or transmission by comparing calculated values before and after transfer.
Submitted by: PaperMCQs
22
Medium ppsc nts

What is Freeze Panes used for?

  • A Lock worksheet
  • B Keep rows or columns visible
  • C Protect workbook
  • D Hide formulas
Permalink
Correct Answer: Option B — Keep rows or columns visible
Explanation: Freeze Panes keeps selected rows or columns visible while scrolling through large worksheets.
Submitted by: PaperMCQs
23
Medium fpsc nts

Which Access key uniquely identifies each record?

  • A Foreign Key
  • B Primary Key
  • C Composite Key
  • D Candidate Key
Permalink
Correct Answer: Option B — Primary Key
Explanation: A primary key uniquely identifies each record and prevents duplicate entries in a table.
Submitted by: PaperMCQs
24
Medium fpsc nts

Which SQL clause is used to filter rows before grouping?

  • A HAVING
  • B GROUP BY
  • C WHERE
  • D ORDER BY
Permalink
Correct Answer: Option C — WHERE
Explanation: The WHERE clause filters rows before grouping and aggregation are applied.
Submitted by: PaperMCQs
25
Medium fpsc nts

Which sorting algorithm repeatedly selects the smallest element and places it in the correct position?

  • A Merge Sort
  • B Quick Sort
  • C Selection Sort
  • D Heap Sort
Permalink
Correct Answer: Option C — Selection Sort
Explanation: Selection Sort repeatedly finds the minimum element from the unsorted portion and places it at the beginning. It is simple but inefficient for large datasets.
Submitted by: PaperMCQs
All Subjects
Biology 100 Chemistry 99 Computer Science 120 Current Affairs 386
1–4 of 11Auto-changing every 5s
Academic Subjects
Physics9th Class 248
View All Academic Classes
Mock Tests
Quick Test (20 Q) Full Mock Test