Question 27 Incorrect Mark 0.00 out of 1.00 The process of storing records in the order that they were added to a file is called: Select one: a. Entry-sequenced file b. Binary Sequenced file c. LIFO file format d. Tombstone approach × The correct answer is: Entry-sequenced file Question 28 Incorrect Mark 0.00 out of 1.00 A traversal that visits each node after visiting its children is called: Select one: a. Preorder Traversal × b. Postorder Traversal c. Inorder Traversal d. Outoforder Traversal The correct answer is: Postorder Traversal
Question 29 Incorrect Mark 0.00 out of 1.00 True/False: The stack data structure is implemented as a LIFO structure (last in first out) Select one: True False X The correct answer is 'True'. Question 30 Correct Mark 1.00 out of 1.00 A coding scheme that replaces repeated occurrences of strings with a pointer to the location in the file of the first occurrence of the string is called Ziv-Lempel coding. Select one: True v False The correct answer is 'True'.
Question 31 Incorrect Mark 0.00 out of 1.00 Setting the dirty bit causes what action to be performed on a block: (select the best answer) Select one: a. It is deleted because it is no longer consistent b. It flushes or writes the block out to the disk c. Refreshes the data by re-reading the block d. It cleans the cache by flushing all data from the cache × The correct answer is: It flushes or writes the block out to the disk Question 32 Incorrect Mark 0.00 out of 1.00 A sort that features a limit of n-1 of record swaps is called: Select one: a. Insertion sort x b. Bubble sort c. Inversion sort d. Selection sort The correct answer is: Selection sort