Questions
Which of the following data structures is used to implement predictive text or auto complete dictionary, such as found on a mobile telephone?
- Bloom filter
- Trie
- Hash Map
- Stack
- None of the above
Which of the following is a characteristic of bloom filter?
- False positive matches are possible, but false negatives are not possible.
- False negative matches are possible, but false positives are not possible.
- Bloom filter takes large amount of space than hash table.
- Look ups in bloom filters are much slower than look ups in hash table.
- None of the above
Which of the following statements are true?
- Linked list has more storage over head than array, considering both are of same size.
- Linked list's size is fixed whereas array's size can be varied dynamically.
- The list elements cannot be inserted or removed from the linked list.
- Only 1 and 2
- Only 1
- Only 2 and 3
- Only 2
- 1, 2 and 3
Which of the following statements is/are true?
- The time complexity for searching an element in binary search tree is O(log n).
- The time complexity for searching an element in binary tree is O(n).
- The time complexity for searching an element in binary tree and binary search tree cannot be determined.
- Both 1 and 2
- Only 1
- Only 2
- Only 2 and 3
- 1, 2 and 3
Given four algorithms A, B, C, D with time complexities as follows:
A-O(n)
B-O(log log n)
C-O(log n)
D-O(1)
where n > 1
Select the option, which gives the algorithms in increasing order of their time complexities.
- C B A D
- B C D A
- A D B C
- A D C B
- None of these
Which of the following searching methods takes a time complexity of O(1) to search an element?
- Linear search
- Binary search
- Hash based search (Hashing)
- Tree based search
- None of the above
Inorder traversal of Binary Search Tree gives which of the following?
- Descending order of inserted elements
- Random order of inserted elements
- Ascending order of inserted elements
- The order in which the elements are inserted
- None of the above
A tree data structure has 100 nodes. What is the number of nodes in this tree having no ancestor?
- 50
- 1
- 0
- 55
- None of these
Last in first out property is associated with which of the following data structures?
- Linked list
- Queue
- Stack
- Tree
- None of these
Which of the following statements is/are true?
- Quick sort algorithm and bubble sort algorithm takes O(n2) in worst case.
- Quick sort and merge sort takes O(n2) in worst case.
- Only 1
- Only 2
- Both 1 and 2
- Neither 1 or 2
- None of the above
In which of the following applications is a tree data structure best used?
- Symbol table construction
- Spell checker
- Auto complete feature
- Implementing recursion
- None of these
Which of the following statements is/are true?
Statement 1: Data structures are solely used for visualizing the data
Statement 2: Data strcuture is programming language dependent
- Both statement 1 and statement 2 are true.
- Only statement 1 is true.
- Only statement 2 is true.
- Neither statement 1 nor statement 2 are true.
- None of the above
Which of the following data structures can be described as a connected graph with no cycles?
- Linked list
- Tree
- Queue
- Stack
- None of the above
Which of the following data structures supports insertion or deletion of elements either from the front (head) or back (tail)?
- Queue
- Stack
- Dequeue
- Hash map
- None of these
Which of the following is a lossless data compression algorithm?
- Run length encoding
- JPEG encoding
- Block truncation coding
- Fractal compression
- None of the above