A PHP Error was encountered

Severity: Warning

Message: fopen(/var/cpanel/php/sessions/ea-php56/PHPSESSID0tfu2msno79r4fmlm02q4o325dkngqvi): failed to open stream: No space left on device

Filename: drivers/Session_files_driver.php

Line Number: 174

A PHP Error was encountered

Severity: Warning

Message: session_start(): Cannot send session cookie - headers already sent by (output started at /home/nerd/public_html/system/core/Exceptions.php:271)

Filename: Session/Session.php

Line Number: 144

A PHP Error was encountered

Severity: Warning

Message: session_start(): Cannot send session cache limiter - headers already sent (output started at /home/nerd/public_html/system/core/Exceptions.php:271)

Filename: Session/Session.php

Line Number: 144

Algorithms MCQ Questions

Algorithms MCQ Questions

Post A Question

Classifications:

MCQ Questions Categories:

No collections found!

Dijkstra’s algorithm is based on
icon 1 answers
icon579 Views
icon0 Likes
Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?
icon 1 answers
icon257 Views
icon0 Likes
A problem in NP is NP-complete
icon 1 answers
icon255 Views
icon0 Likes
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
icon 1 answers
icon296 Views
icon0 Likes
Which of the following statements is TRUE?
icon 1 answers
icon250 Views
icon0 Likes
An unordered list contains n distinct elements
icon 1 answers
icon256 Views
icon0 Likes
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?
icon 1 answers
icon219 Views
icon0 Likes
The time complexity of an algorithm to compute M1 × M2 will be
icon 1 answers
icon586 Views
icon0 Likes
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is
icon 1 answers
icon241 Views
icon0 Likes
Which of the following sorting algorithms has the lowest worst-case complexity?
icon 1 answers
icon267 Views
icon0 Likes
The worst case running time of this computation is
icon 1 answers
icon227 Views
icon0 Likes
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of
icon 1 answers
icon275 Views
icon0 Likes
What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?
icon 1 answers
icon587 Views
icon0 Likes

A PHP Error was encountered

Severity: Warning

Message: Unknown: Failed to write session data (user). Please verify that the current setting of session.save_path is correct (/var/cpanel/php/sessions/ea-php56)

Filename: Unknown

Line Number: 0