What is the complexity of searching for a particular element in a Singly Linked List?
a) O(n) b) O(1) c) logn d) nlogn
a) O(n) b) O(1) c) logn d) nlogn
a) Queue b) Stack c) Vector d) Array List
a) Linked list b) Stack c) Segment Tree d) Queue
a) 1 b) (n*(n-1))/2 c) (n*(n-1)) d) n-1
a) O (1) b) O (n) c) O (logn) d) O (nlogn)
a) Accessing item from an undefined stack b) Adding items to a full stack c) Removing items from an empty stack d) Index out of bounds exception
a) Heap b) Binary Tree c) Array d) Stack
a) Stack b) Queue c) Array d) Tree
a) S ingly linked list b) Doubly linked list c) Circular doubly linked list d) Array implementation of list
a) Pointer to character b) Pointer to integer c) Pointer to node d) Node
a) Binary trees b) Scheduling of processes c) Caching d) Spatial locality
a) 3 b) 4 c) 2 d) 1
a) Child b) First c) Root d) Parent
a) Zero b) Two c) One d) Three
a) log (n) where n is the number of nodes b) n where n is the number of nodes c) 0 or 1 d) atmost 1