GlobalEdge Previous Years Solved Sample Placement Papers
- Prefix expression of 2*3/(2-1)+5*3 is
a) *23-21/-53*1
b) 23*21+/53*+
c) 21*23-/35*+
d) -/53*+23*21
Answer: c) 21*23-/35*+ - ele=stack[top] is for
a) push
b) pop
c) enqueue
d) dequeue
Answer: b) pop - Prefix expression of A+(B*C-(D/E^F)) is
a) ABC^/DEF*
b) ABC*DEF^/
c) ^/ABC*DEF
d) *ABC/DEF^
Answer: b) ABC*DEF^/ - During conversion of infix to postfix pop is done when appears
a) (
b) )
c) ~
d) ::
Answer: b) ) - Each operator in postfix string refers to its operand in a string
a) previous 3
b) next 3
c) next 2
d) previous 2
Answer: d) previous 2 - 10, 20, 25, 35, 30, 40 for the list which searching technique can be applied
a) binary search
b) linear search
c) both a and b
d) none
Answer: b) linear search - Which operation access each data element exactly once
a) traversal
b) insertion
c) searching
d) sorting
Answer: a) traversal - Stack can be represented using
a) array
b) linked list
c) both a and b
d) none
Answer: c) both a and b - In binary search when the element is searched either right half or the left half of an array
a) element is found
b) search element comparison matches
c) comparison does not match
d) low position is less than high position
Answer: c) comparison does not match - In searching if (loc>=0) is
a) unsuccessful search
b) binary search
c) linear search
d) successful search
Answer: d) successful search - Array with one row or one column is a
a) 1D array
b) 2D array
c) multi dimensional array
d) both a and b
Answer: a) 1D array - Which operation is used to change data in data structure
a) create
b) destroy
c) select
d) update
Answer: d) update - The study of data structure mainly deals with
a) implementation of structure on computers
b) mathematical description of structure
c) to determine amount of space in memory
d) all of these
Answer: d) all of these - is a set of vertices and edges
a) tree
b) graph
c) queue
d) stack
Answer: b) graph - Which node is farthest node from root node
a) child node
b) top node
c) leaf node
d) middle node
Answer: c) leaf node - list in linked list contains unused nodes
a) Avail
b) head
c) null
d) start
Answer: a) Avail - Dynamic memory is allocated using operator
a) create
b) null
c) new
d) pointer
Answer: c) new - In which linked list it is not possible to access preceding nodes
a) singly
b) doubly
c) circular
d) all of these
Answer: a) singly - A text can be reversed using
a) tree
b) graph
c) queue
d) stack
Answer: d) stack