|
Question |
Rating |
View Answer |
|
Suppose you have a sorted array of 250 elements. What is the maximum number of elements you have to examine to determine if some value v is in your array if you use an efficient search? a) 7 b) 8 c) 125 d) 250 |
|
View Answer |
|
What is data structure? |
|
View Answer |
|
What is event, delegate & data structure?
|
|
View Answer |
|
How to concatenate two linked lists? |
|
View Answer |
|
How to concatenate the two linked lists? |
|
View Answer |
|
What exactly does this procedure BUBBLE_SORT (K, N) does? |
|
View Answer |
|
Define addressing and linear addressing functions? |
|
View Answer |
|
Given N discs of decreasing size stacked on one needle and two empty needles, it is required to stack all the discs onto a second needle in decreasing order of size. The third needle may be used as temporary storage. The movement of the discs is restricted by the following rules (1) A disc may be moved from any needle to any other (2) Only one disc may be moved at a time (3) At no time may a larger disc rest upon smaller disc explain the solution? |
|
View Answer |
|
Define Index area and its subdivisions? |
|
View Answer |
|
Define Simulation? |
|
View Answer |
|
What is the distant relationship between a list structure and a digraph? |
|
View Answer |
|
Name two desirable properties of hashing functions. |
|
View Answer |
|
What is a one way chain or singly linked linear list? |
|
View Answer |
|
What is splitting? |
|
View Answer |
|
What is linear hashing? |
|
View Answer |
|
What is a priority queue? |
|
View Answer |
|
State the theorem which is used to determine whether a given expression is valid or not. |
|
View Answer |
|
Explain the three applications in which stacks are used? |
|
View Answer |
|
Define and explain “push” and “pop”? |
|
View Answer |
|
Define stack? |
|
View Answer |