Q151. Which sorting algorithm has an average time complexity of O(n log n)?
- Bubble sort
- Insertion sort
- Merge sort
- Selection sort
Show answer and explanation
Correct answer: C. Merge sort
Merge sort is O(n log n).
Computer knowledge is tested in jobs ranging from clerical posts to IT positions. Practice MCQs on computer fundamentals, hardware, software, MS Office, networking, internet, databases and programming concepts, and see your score as soon as you finish.
Correct answer: C. Merge sort
Merge sort is O(n log n).
Correct answer: A. .ppsx
.ppsx opens directly in slideshow mode.
Correct answer: A. Using disk space to extend RAM
Virtual memory uses disk as extended memory.
Correct answer: B. Compilation
Compilation is a process, not a paradigm.
Correct answer: D. Random Access Memory
RAM is volatile main memory.
Correct answer: A. Python
Python is commonly interpreted.
Correct answer: C. Ctrl + I
Ctrl+I makes italic.
Correct answer: C. 8
Octal uses digits 0-7.
Correct answer: D. Virtual Private Network
A VPN encrypts traffic over public networks.
Correct answer: D. Star topology
Star topology uses a central device.