Aspire Faculty ID #12708 · Topic: JECA MCA 2024 · Just now
JECA MCA 2024

Which sorting algorithm is most efficient if elements are already in sorted order ?

Solution

Solution: Insertion sort runs in O(n) when input is already sorted.
Answer: (C)
← Previous Next →

Previous 10 Questions — JECA MCA 2024

Nearest first
1
Virtual memory is normally implemented by ____.
Topic: JECA MCA 2024
 2
What is the worst case complexity of inserting a node in doubly linked list ?
Topic: JECA MCA 2024
 3
In IPv4 network ID and host ID in Class A is:
Topic: JECA MCA 2024
 4
Worst case time complexity of inserting into an empty linear linked list, if list must remain sorted?
Topic: JECA MCA 2024
 5
A Port address in TCP/IP is ____ bits long.
Topic: JECA MCA 2024
 6
A deadlock avoidance algorithm dynamically examines the ____ to ensure circular wait never exists.
Topic: JECA MCA 2024
 7
Which of the following is not a communication command ?
Topic: JECA MCA 2024
 8
In the OSI model, encryption and decryption are functions of the ____.
Topic: JECA MCA 2024
 9
Which command is used to extract specific columns from the file ?
Topic: JECA MCA 2024
 10
Which one of the following does not have a Net ID and Host ID ?
Topic: JECA MCA 2024

Next 10 Questions — JECA MCA 2024

Ascending by ID
1
____ server is used to create a secure tunnel connection.
Topic: JECA MCA 2024
 2
What is the prefix of expression A-B/(C*D^E) ?
Topic: JECA MCA 2024
 3
Hamming code is used for ____.
Topic: JECA MCA 2024
Ask Your Question or Put Your Review.

loading...