CS502 – Design and Analysis of Algorithms Quiz #2
Q1: Memorization is?
(A) To store previous results for future use
(B) To avoid unnecessary repetitions by writing down the results of recursive calls and looking them up again if needed later
(C) To make the process accurate
(D) None of the above
Answer: (B) To avoid unnecessary repetitions by writing down the results of recursive calls and looking them up again if needed later
Q2: Which sorting algorithm is faster?
(A) O(n log n)
(B) O(n²)
(C) O(n + k)
(D) O(n³)
Answer: (A) O(n log n)
Q3: Quick sort is:
(A) Stable & in place
(B) Not stable but in place
(C) Stable but not in place
(D) Sometimes stable & sometimes in place
Answer: (B) Not stable but in place
Q4: One example of in place but not stable algorithm is:
(A) Merge Sort
(B) Quick Sort
(C) Continuation Sort
(D) Bubble Sort
Answer: (B) Quick Sort
Q6: Continuation sort is suitable to sort the elements in range 1 to k:
(A) K is Large
(B) K is not known
(C) K may be small or large
(D) K is small
Answer: (D) K is small
Q7: In stable sorting algorithm:
(A) If duplicate elements remain in the same relative position after sorting
(B) One array is used
(C) More than one array is required
(D) Duplicating elements not handled
Answer: (A) If duplicate elements remain in the same relative position after sorting
Q8: Which may be a stable sort?
(A) Merge
(B) Insertion
(C) Both above
(D) None of the above
Answer: (C) Both above
Q9: An in place sorting algorithm is one that uses ___ arrays for storage:
(A) Two dimensional arrays
(B) More than one array
(C) No Additional Array
(D) None of the above
Answer: (C) No Additional Array
Q10: Continuation sort has time complexity of:
(A) O(n)
(B) O(n + k)
(C) O(n log n)
(D) O(k)
Answer: (B) O(n + k)
CS614 – Data Warehousing Quiz #1
Q1: Node of a B-Tree is stored in memory block and traversing a B-tree involves ___ page faults?
(A) O(n²)
(B) O(n)
(C) O(n log n)
(D) O(log n)
Answer: (D) O(log n)
Q2: The growth of master files and magnetic tapes exploded around the mid:
(A) 1960
(B) 1970
(C) 1980
(D) 1990
Answer: (B) 1970
Q3: ___ is an application of information & data intelligence:
(A) Education
(B) Knowledge
(C) Power
Answer: (B) Knowledge
Q4: Need to synchronize data upon updation is called?
(A) Data Limitation
(B) Data Manipulation
(C) Data Coherence
(D) Data Replication
Answer: (C) Data Coherence
Q5: Suppose the amount of data recorded in an organization is doubled every year, this is called?
(A) Linear
(B) Quadratic
(C) Exponential
(D) Logarithmic
Answer: (C) Exponential
Q6: Relational databases allow you to navigate the data in ___ direction that is appropriate using the primary, foreign key structure?
(A) Forward
(B) One
(C) Backward
(D) Any
Answer: (D) Any
Q7: The input to the data warehouse can come from OLTP or transactional systems or other third-party databases.
(A) True
(B) False
Answer: (A) True
Q8: Naturally Evolving Architecture occurred when an organization had a ___ approach to handling the whole process of hardware and software architecture?
(A) Good
(B) Relaxed
(C) Not Relaxed
(D) None
Answer: (C) Not Relaxed
Q9: ___ modeling technique is more appropriate for data warehousing:
(A) Dimensional
(B) Physical
(C) Entity Relationship
(D) None
Answer: (A) Dimensional
Q10: ___ gives total view of an organization?
(A) OLTP
(B) OLAP
(C) Data warehousing
(D) Database
Answer: (C) Data warehousing