WorksheetsINTERVIEW FOR PROGRAMMERS
Total questions: 10
Worksheet time: 6mins
A. A data structure where each element points to the next, not necessarily in consecutive memory locations.
Linked List
Palindrome
FIFO
B. A method where the first item stored is the first to be retrieved.
Queue
FIFO
Stack
C. A sequence of elements in a specific order, typically in contiguous memory locations.
D. A tree structure where each node has at most two children.
palindrome
binary search Tree
E. A data structure that allows adding and removing elements in a last-in, first-out manner.
F. A word or phrase that reads the same backward as forward.
recursion
polymorphism
G. A programming concept where a function calls itself.
FIFO
Queue
H. A tree used for efficient data retrieval, organizing nodes based on less than or greater than properties.
array
polymorphism
I. A programming concept where the same operation can be performed in different ways.
Polymorphism
Recursion
Linked List:
(a)
J. A linear data structure that operates on a first-in, first-out basis.
Array
Queue
FIFO
(a)
