63. Which of the algorithms below will produce the same result? Select two answers. (A) Processing a list from the beginning to the end and counting the number of elements that begin with the letter "a" (B) Processing a list from the end to the begin- ning and counting the number of elements that begin with the letter "a" (C) Processing the list with a merge search to group the elements that begin with "a" and then counting them (D) Processing the list with a procedure to see if the element begins with the letter "a" and keeping count with a local variable 64. An alarm company records the number of times each door is opened and closed. The alarm cannot be set if a door is still open. How can the alarm company code this option in its software? Select two answers. (A) If the door count multiplied by 2 gives an odd number, then the door is open. (B) If door count MOD 2 = 1, then the door is open. (C) If the number of times a door is opened does not equal the number of times it is closed, then the door is open. (D) If the quotient of dividing the door count by two is an even number, then the door is open.

63. Which of the algorithms below will produce the same result? Select two answers. (A) Processing a list from the beginning to the end and counting the number of elements that begin with the letter "a" (B) Processing a list from the end to the begin- ning and counting the number of elements that begin with the letter "a" (C) Processing the list with a merge search to group the elements that begin with "a" and then counting them (D) Processing the list with a procedure to see if the element begins with the letter "a" and keeping count with a local variable 64. An alarm company records the number of times each door is opened and closed. The alarm cannot be set if a door is still open. How can the alarm company code this option in its software? Select two answers. (A) If the door count multiplied by 2 gives an odd number, then the door is open. (B) If door count MOD 2 = 1, then the door is open. (C) If the number of times a door is opened does not equal the number of times it is closed, then the door is open. (D) If the quotient of dividing the door count by two is an even number, then the door is open.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

COSC2006 Final Project to be assigned 23:59, Wednesday, July 26th. The Project Two students work together to complete the program to compare the performance of two algorithms implemented on the same data structure. The table at the end shows the tasks randomly assigned respectively to teams of two. On the first row of the table, Hrithik and Sahil will implement Bubble Sort and Merge Sort on a Linked List. On the last row, Avkashkumar and Upal will implement Insertion Sort and Selection Sort on an array or ArrayList. You will generate random keys for your input data. You must compare two sorting algorithms using the same input data. (If you generate a new set of random keys for the second sorting algorithm, the two sorting algorithms will run on different input data and their results may not be comparable.) Determine the time complexity of your two assigned sorting algorithms based on your code with explanation. If the performance differs according to the pattern of the input…
Write an algorithm for the following (algorithm not pseudocode, not implementation of codes) a. algorithm to insert a data X after a specific data item Y in the linked listb. algorithm to delete any node from the singly liked list where the key value of the node is knownc. algorithm to delete a node from a doubly linked listd. algorithm to delete all nodes having greater than a given value, from a given singly linked liste. algorithm to add two polynomials using linked list
Which of the following statements regarding linked lists and arrays is correct? Group of answer choices: a. A dynamically resizable array makes insertions at the beginning of an array very efficient. b. Using a doubly linked list is more efficient than an array when accessing the ith element of a structure. c. A dynamically resizable array is another name for a linked list. d. Any type of list tends to be better than an array when there are a set number of maximum items known beforehand. e. If many deletions at any place in the structure were common, a linked list implementation would likely be preferable to an array
Select true or false for the statements below. Explain your answers if you like to receive partial credit 8) Which of the following is true about the delete function in a standard linked list (only a head pointer and nodes only having a next pointer)?a. There is only 1 scenario to consider when looking for a node to delete in a linked listb. When you traverse the list to find the element to delete, it improves theperformance to O(1)c. You should always check first to see if the list is empty before attempting to find and delete a node
#Searching Exercise By Antonio Rotondodef ordered_sequential_search(a_list, item):pos = 0found = Falsestop = Falsecount = 0while pos < len(a_list) and not found and not stop:count += 1if a_list[pos] == item:found = Trueelse:if a_list[pos] > item:stop = Trueelse:pos = pos+1return found, counttest_list = [0, 1, 2, 8, 13, 17, 19, 32, 42,]print(ordered_sequential_search(test_list, 3))print(ordered_sequential_search(test_list, 13))def sequential_search(a_list, item):pos = 0found = Falsecount = 0while pos < len(a_list) and not found:count += 1if a_list[pos] == item:found = Trueelse:pos = pos+1return found, counttest_list = [1, 2, 32, 8, 17, 19, 42, 13, 0]def binary_search(a_list, item, count):if len(a_list) == 0:return False, countelse:midpoint = len(a_list) // 2count+=1if a_list[midpoint] == item:return True, countelse:if item < a_list[midpoint]:return binary_search(a_list[:midpoint], item, count)else:return binary_search(a_list[midpoint + 1:], item,count)test_list = [0, 1, 2,…
Consider the following list:45, 78, 23, 12, 63, 90, 38, 56, 88, 15Using a sequential search, how many comparisons are required to determine whether the following items are in the list or not? (Recall that comparisons mean item comparisons, not index comparisons.) a. 90 b. 14 c. 45 d. 23 e. 5
Select true or false for the statements below. Explain your answers if you like to receive partial credit 10) Which of the following is true about the linked list functions where the linked list onlycontains a head pointer?a. If the linked list is ordered, you can use binary search and improve theperformance to O(log n)b. The worst case performance of the delete function is in the same Big-Ocategory as the worst case performance of the delete function with anunordered arrayc. If the node you are deleting is at the end of the list, the performance is O(1)
Need help with this: Given the following challenges, use append(), extend(), pop(), and insert()to change the contents of the lists. Suppose that we have the following list: Strawberry, Blueberry, Blackberry, Cranberry Define the list berries with the following elements shown in Snippet 5.11: Strawberry, Blueberry, Blackberry, Cranberry Using the built-in append() method, add the value Raspberry to the list berries. Using the built-in extend() method, extend an empty fruits list from the berries list that you created previously. Insert Mangoes into the fruits list at index 2 using the built-in method insert(). Remove the element at index 1 from the fruits list using the built-in method pop() and replace it with Apples, using the insert() built-in method. Finally, sort the elements in the fruits list by using the built-in method sort() with keyword arguments. Set the key argument to None and the reverse argument to False.
The following are the operations that you can do using a single linked list. Choose only one operation then create the algorithm and simulate. The attached Rubric will be used in evaluating the activity. 1. Delete a particular node in a single linked list 2. Delete the first node of a single linked list 3. Insertion after a given node of a single linked list 4. Insertion at a given position in a single linked list 5. Insertion before a given node in a single linked list 6. Reverse a single linked list EX: Delete the last node of a single linked list Problem" Deletion of the last node in a single linked list Algorithm" Step 1: if HEAD = NULL Write UNDERFLOW Go to Step 8 Step 2: SET PTR = HEAD Step 3: Repeat Steps 4 and while PTR à NEXT = NULL Step 4: SET PREPPTR = PTR Step 5: SET PTR =PTR à NEXT [End of loop] Step 6: SET PREPTR à NEXT = NULL Step 7: FREE PTR Step 8: EXIT…
Q.6 Write algorithms to perform each of the followings:i) Split a list into two equal lists.ii) Insert a new node before any node in a link list.
Please don't copy from chegg.com those answers are wrong! Say you have a random, <strong>unordered list</strong> containing <strong>4096 four-digit</strong> numbers. Describe the most efficient way to: sort the list and then search for 100 elements within the list, and analyze the expected run time for this specific list's sorting and searching
Background: When searching for an item in a list, each item that we examine (compare) is considered to be interrogated. If we search for John, the following names are interrogated: Harry, Larry, John (in that order). If two names tie for the middle position, choose the first of the two names for the middle.If we search this same list for John using the Sequential search we would interrogate all the names from Alice through John. We would start with Alice, move to Bob, move to Carol and so forth until we reached John. Directions: Use the original list of names (Alice - Oliver) to answers questions 1-8. Using a sequential search, what names are interrogated to find Carol? Using a sequential search, what names are interrogated to determine that Sam is not in the list? Using a binary search, what names are interrogated to find Carol? Using a binary search, what names are interrogated to determine that Sam is not in the list? Will a binary search or sequential search find Alice…