GlobalEdge Previous Years Solved Sample Placement Papers
-
The disadvantage of an array is:
A: Static structure
B: Dynamic structure
C: Variable
D: Both A and B
Ans: A -
In which operation are array elements shifted into higher-order positions?
A: Deletion
B: Insertion
C: Searching
D: Sorting
Ans: B -
In which operation are array elements shifted into lower-order positions?
A: Deletion
B: Insertion
C: Searching
D: Sorting
Ans: A -
In a linked list, the position "start" gives the location of the:
A: First node
B: Last node
C: Middle node
D: Second node
Ans: A -
In a linked list, the pointer "start" position is also called:
A: NULL
B: Head
C: Tail
D: None
Ans: B -
The link field of the last node contains:
A: NULL
B: Head
C: Tail
D: None
Ans: A -
In a linked list, the link field of every node contains:
A: Data of the node
B: Data of the next node
C: Address of the last node
D: Address of the next node
Ans: D -
In a doubly linked list, which node points to the address of the previous node?
A: Info
B: Frow
C: Back
D: Head
Ans: C -
Which operation is not possible in a linked list?
A: Sorting
B: Searching
C: Merging
D: Inserting
Ans: C -
Pointer = new type[number_of_elements]is syntax for:A: Pointer declaration
B: Allocate memory for a single element
C: Allocate memory for a block of elements
D: Structure
Ans: C -
In which data structure is each node connected to several other nodes?
A: Non-linear
B: Linear
C: Stack
D: Queue
Ans: A -
Which data structure represents a hierarchical relationship?
A: Non-linear
B: Linear
C: Stack
D: Queue
Ans: A -
Each node in a tree has a child node:
A: Zero
B: More
C: Both A and B
D: No
Ans: C -
The root node in a tree is at position:
A: Top
B: Bottom
C: Middle
D: Right
Ans: A -
From which node do all operations commence in a tree?
A: Leaf
B: Child
C: Root
D: Internal
Ans: C -
The edges in a graph having directions are called:
A: Undirected graph
B: Arcs
C: Digraph
D: All of the above
Ans: C -
Prefix expression of
(A + B) * (C + D)is:A: *+AB+CD
B: +AB*+CD
C: AB+CD+*
D: +*AB+CD
Ans: A