GlobalEdge Previous Years Solved Sample Placement Papers
- While ((j>=1) and (A[j]
a) inserting element
b) sorting element
c) deleting element
d) searching element
Answer: b) sorting element - for i=0 to N-1 If(A[i]==ele) is logic for
a) inserting element
b) sorting element
c) deleting element
d) searching element
Answer: d) searching element - The method of collecting deleted nodes into free storage is called
a) heap memory
b) free memory
c) garbage collection
d) dynamic collection
Answer: c) garbage collection - In queue insertion and deletion performed according to
a) FIFO
b) FILO
c) LIFO
d) all of these
Answer: a) FIFO - Which of the following data structure does not have different types
a) array
b) linked list
c) stack
d) queue
Answer: a) array - If we try to delete node from the linked list which is empty is called
a) overflow
b) underflow
c) inserting
d) deleting
Answer: b) underflow - linked list is called as two way list
a) singly
b) doubly
c) circular
d) none
Answer: b) doubly - As user navigate from web page to web page then the pages are placed on
a) array
b) linked list
c) stack
d) queue
Answer: c) stack - The operators in between two operands are called as expression
a) infix
b) postfix
c) prefix
d) arithmetic
Answer: a) infix - If an operator precedes two operands it is called as expression
a) infix
b) postfix
c) prefix
d) arithmetic
Answer: c) prefix - If an operator follows the two operands it is called as expression
a) infix
b) postfix
c) prefix
d) arithmetic
Answer: b) postfix - for i=lb to ub Process (A[i]) is logic for
a) inserting element
b) sorting element
c) deleting element
d) traversing
Answer: d) traversing - Which data structure directly operates on machine level instructions
a) int
b) array
c) string
d) trees
Answer: b) array - Which is not the operation on linear data structure
a) inserting
b) sorting
c) updating
d) traversing
Answer: b) sorting - What is the statement to copy the top element into variable
a) s[top]=ele
b) ele=s[top]
c) s[++top]=ele
d) both a and b
Answer: b) ele=s[top] - What is the statement to copy the variable element into rear position in queue
a) q[rear]=ele
b) q[front]=ele
c) ele=q[rear]
d) ele=q[front]
Answer: a) q[rear]=ele - tree is a tree which at most two descendants
a) binary tree
b) sub tree
c) b+ tree
d) full
Answer: a) binary tree