Geometrics Previous Years Solved Sample Placement Papers
-
For I=N-1 down to Pos is the loop for:
A: Deleting element in an array
B: Inserting element in an array
C: Traversing
D: Both A and B
Ans: D -
In operation, all the elements are shifted into a lower-order position from the given position:
A: Deleting element in an array
B: Inserting element in an array
C: Traversing
D: Binary searching
Ans: A -
Which is not a sorting method?
A: Heap sort
B: Quick sort
C: Shell sort
D: Linear sort
Ans: D -
The memory address of element A[i][j] in row-major order is:
A: loc(A[i][j]) = base(A) + W((i-LB) + n(j-LB))
B: loc(A[i][j]) = base(A) + W(n(j-LB) + (i-LB))
C: loc(A[j][i]) = base(A) + W(n(I-LB) + n(j-LB))
D: loc(A[i][j]) = base(A) + W((I-LB) + n(j-LB))
Ans: B -
The memory address of elements A[i][j] in column-major order is:
A: loc(A[i][j]) = base(A) + W((I-LB) + m(j-LB))
B: loc(A[i][j]) = base(A) + W(m(j-LB) + (i-LB))
C: loc(A[j][i]) = base(A) + W(n(I-LB) + m(j-LB))
D: loc(A[i][j]) = base(A) + W((I-LB) + m(j-LB))
Ans: B -
The base address of an array is the address of:
A: A[1]
B: A[n1]
C: A[0]
D: Both A and B
Ans: C -
Which data structure is used to implement queues, trees, graphs?
A: Stack
B: List
C: Array
D: None
Ans: C -
In which data structure do addition and deletion of elements take place from the same position?
A: Stack
B: List
C: Array
D: Queue
Ans: A -
In stack, the end is commonly referred to as:
A: Top
B: Bottom
C: Rear
D: Front
Ans: A -
In stack, the end opposite is known as:
A: Top
B: Base
C: Rear
D: Front
Ans: B -
In stack, which element is removed first?
A: Element inserted first
B: Most recently added element
C: Middle element
D: Second element
Ans: B -
In which position of the stack will the element remain for the longest time?
A: A[0]
B: Base
C: Top
D: Both A and B
Ans: B -
Stack performs the operation:
A: Last in, first out
B: Last in, last out
C: Last in, fast out
D: First in, first out
Ans: A -
In which operation is the stack not modified?
A: Push(item)
B: Pop()
C: Peek()
D: None
Ans: C -
What is the function of the Peek() operation?
A: Removes the top item from the stack
B: Tests if the stack is empty or not
C: Returns the number of items in the stack
D: Returns the top item from the stack but does not remove it
Ans: D -
Push operation in stack is:
A: First increases the top position and inserts the element
B: First inserts the element and then increases the top position
C: First decreases the top position and inserts the element
D: First inserts the element and decreases the top position
Ans: A -
Which of the following is not an application of stack?
A: Rearranging railroad cars
B: Runtime memory management
C: Multiprogramming platform
D: Conversion of infix expression into postfix and prefix expression
Ans: C