12 votes
1
In a doubly linked list the number of pointers affected for an insertion operation will be401Depends on the nodes of doubly linked list
1 votes
6
0 votes
10
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer g...
29 votes
11
In a circular linked list organization, insertion of a record involves modification ofOne pointer.Two pointers.Multiple pointers.No pointer.
1 votes
12
I think the median can be found in O(n), because in O(n) we can merge the arrays into a single sorted array and in O(1) we can find the middle element of the array. Am I...
1 votes
15
1 votes
17
representation of data structure in memory is known as 1)recursive 2)ADT 3)File structure 4)storage structure
1 votes
18
5. In a set of 8 positive integers, there always exists a pair of numbers having the same remainder when divided by:.(A) 7 (B) 11 (C) 13 ...
3 votes
19
0 votes
21
1 votes
23
1 votes
24
Decomposition help in eliminating some of the problems of bad designRedundancyInconsistenciesAnomaliesAll of the above
1 votes
25
Which of the following is the process by which a user’s privileges ascertained ?AuthorizationAuthenticationAccess ControlNone of these
3 votes
26
0 votes
28
PLZ someone give one one example...Thanks in advance.
3 votes
30
Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have isa) (n-1)(n-2)/2b) n(n-1)/2c) n-1d) n