Question 1
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
Question 2
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS 2002)
Question 3
Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best known algorithm to delete the node Q from the list?
Question 4
What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order ?
Question 5
Consider the following conditions:
(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.
(c)All the positive allocations must be in independent positions.
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies: Codes:
Question 8
Question 9
Question 10
There are 50 questions to complete.