Information Technology (IT) MCQs - Computer Practice | PakExamPoint
Practise Information Technology (IT) MCQs in Computer. Attempt multiple-choice questions, check answers and revise related subtopics.
Information Technology (IT) MCQs and revision practice
Study Information Technology (IT) through multiple-choice questions in Computer. This subtopic contains 2241 practice questions. Read the wording carefully, compare the options and attempt an answer before checking the solution in learning mode.
Use these Information Technology (IT) MCQs to identify the facts, rules or methods you need to revise. Where an explanation is available, work through it and write down why your chosen option was correct or incorrect. Revisit difficult questions after reviewing your notes, then use exam mode for timed practice.
عارضی طور پر ڈیٹا اسٹور کرنے کے لئے سی پی یو میں کون سا چھوٹا میموری ڈیوائس دستیاب ہے؟
A. Register
B. ALU
C. CU
D. None of these
Check answer and explanation
Answer: Register
Explanation Registers are small, high-speed memory locations within the CPU used to store data temporarily during processing. They are faster than RAM and crucial for CPU operations .
مندرجہ ذیل میں سے کون سا طریقہ کار پروگرامنگ زبان کی مثال ہے؟
A. Pascal
B. FORTRAN
C. C
D. All of these
Check answer and explanation
Answer: All of these
Explanation Procedural languages are also known as third-generation languages (3GLs). Examples of third-generation languages include C, C++, Java, FORTRAN, and PASCAL.
کون سا کمپیوٹر نیٹ ورک قسم بڑی جگہوں، جیسے اضلاع یا شہروں کو جوڑتا ہے؟
A. LAN
B. WAN
C. MAN
D. PAN
Check answer and explanation
Answer: WAN
Explanation MAN (Metropolitan Area Network): City or district coverage LAN (Local Area Network): Small area, e.g., home, office WAN (Wide Area Network): Covers countries or continents, e.g., Internet PAN (Personal Area Network): Very small area, e.g., devices connected via Bluetooth Last verified on 08-03-2026
Explanation Merge Sort requires extra memory to merge sorted subarrays. It is not an in-place algorithm. Therefore, its space complexity is O(n) for an array of size n. Additional information : Time complexity (Best) → O(n log n) Time complexity (Average) → O(n log n) Time complexity (Worst) → O(n log n) Recursion stack → O(log n) Last verified on 24-03-2026
Explanation Files created with Lotus 1-2-3 typically have file extensions such as .WK1, .WKS, .WK2, .WK3, .WK4, or .123. WK1 is a correct extension for files created with Lotus 1-2-3.