What is the output of the following code (remember, the "largest" string lexicographically, i.e., lexicographically last, has the highest priority)-SortedABPriQ is an implementation of the PriQInterface ("Priority Queue Implementations."). Explain each code lines and determine output. PriQInterface pq = new SortedABPriQ(); System.out.println(pq.isEmpty()); System.out.println(pq.size()); pq.enqueue("Peter"); pq.enqueue("Melissa"); pq.enqueue("Kelly"); pq.enqueue("Sam"); System.out.println(pq.isEmpty()); System.out.println(pq.size()); System.out.println(pq.dequeue()); System.out.println(pq.dequeue()); System.out.println(pq.size());

What is the output of the following code (remember, the "largest" string lexicographically, i.e., lexicographically last, has the highest priority)-SortedABPriQ is an implementation of the PriQInterface ("Priority Queue Implementations."). Explain each code lines and determine output. PriQInterface pq = new SortedABPriQ(); System.out.println(pq.isEmpty()); System.out.println(pq.size()); pq.enqueue("Peter"); pq.enqueue("Melissa"); pq.enqueue("Kelly"); pq.enqueue("Sam"); System.out.println(pq.isEmpty()); System.out.println(pq.size()); System.out.println(pq.dequeue()); System.out.println(pq.dequeue()); System.out.println(pq.size());

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

Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and return the reverse of that string. const reverse = (str) => {const arr = []; //stores character in rev orderconst len = str.length; //finds the length of the stringlet i;for(i = len; i >= 0; i--)arr.push(str[i]); //adds the chars of str to arrreturn arr.join('');} let stringTest, reverseString; //for dummy stringstringTest = "john gabriel";reverseString = reverse(stringTest); console.log("Num3");console.log(`Reverse of the string "${stringTest}" is: "${reverseString}"`);console.log("\n");
Create a generic function print(ls, n) that prints to standard output the first n elements of list ls. The elements are printed on separate lines. If ls has less than n elements, then the entire list is printed. I attached a picture of what I have so far. I'm having a hard time figuring out how I would make it print a certain number of elements that I specify.
In AList class, we have the get function to return an item at a particular position in list indexed by i. For example, let L=[1,2,3]. A call to L.get (1) will return 2. Write in the answer an enhanced get function to accept negative indices. Specifically, the last item has index -1, the second last item has index -2, and the i-th last item has index -i. For example, let L=[1,2,31. A call to L.get (-1) will return 3. A call to L.get (-2) will return 2. A call to L.get (-3) will return 1. Below is a skeleton of the AList class: template class AList { private: /** The underlying array. */ ItemType *items; /** Stores the current size of the list. */ int count; /** Max number of items allowed. */ int maxCnt; public: // Other functions omitted... ItemType get (int i) { // Copy this function in the answer and write code below this line. } ;
I am having trouble determining time complexity when it comes to finding the runtime of a method or function. I need to know what the runtime for the following methods are. Any further explanation would also be helpful. All of these methods are dealing with a binary search tree in java. 1. public String getAllValues() - return a String that contains the elementsof the tree in ascending order. All elements are separated by a space. 2. public int numberNodes() - return the total number of nodes in the tree. 3. public void insertList(int[] list) - insert all of the values from list intothe tree. Note: My Method just goes through an array calling working insert() method on all the values in the list[] array. 4. public int removeLessThan(int value) - this method removes all integers strictly less than value from the tree. It also returns the number of nodes itremoved. Note: In this method I first call a method to count nodes less than I call another method to recursively remove by…
IMPROVE the following JAVASCRIPT FUNCTION, you need to ALIGN the output in the MIDDLE using CODEPEN. SEE ATTACHED PHOTO FOR THE INITIAL AND EXPECTED OUTPUT.function tree(num) {let ctr = numif (num % 2 == 0) {ctr++;}let cnt = 1;for (let i = 1; i <= num; i++) {let str = ""for (let k = 0; k < ctr / 2; k++) {str += " "}for(let j = 0;j<cnt;j++){if(j == parseInt(cnt/2) && i%2 == 0){str += "0"continue}str += "1"}if(i == cnt){cnt+=2}ctr--;document.write(str);document.write("<br>");}}tree(8);
create a generic array stack and push/pop a million random ints using java.util.Random class. you also want to detect the time it takes to push and pop elements from the stack and you need to run the test multple times to see how the running time grows with increasing number of operations. use a outer loop that runs the program a million times (e.g. for(int i = 1; i<1000000; i+=1000000)).
Implement the following Racket functions: You must use recursion, and not iteration. You may not use side-effects (e.g. set!). Transitive? Input: a list of pairs, L. Interpreting L as a binary relation, Transitive? returns #t if L is a transitive relation and #f otherwise. Examples: (display "Transitive? \n") (Transitive? '((a b) (b c) (a c))) ---> #t (Transitive? '((a a) (b b) (c c))) ---> #t (Transitive? '((a b) (b a))) ---> #f (Transitive? '((a b) (b a) (a a))) ---> #f (Transitive? '((a b) (b a) (a a) (b b))) ---> #t (Transitive? '())---> #t
In python, The function slice_end takes a string parameter, word, and a positive integer n; the function returns a slice of length n from the end of word. However, if word has length less than n, then the None object is returned instead. Hint: Notice that returning the empty string when n is zero might be a special case. You can use an if-elif-else decision structure and the slicing operator [ : ] to solve this problem. For example: Test Result word = "pineapple" n = 5 print(slice_end(word, n)) apple word = "too short" n = 20 print(slice_end(word, n)) None word = "llama" n = 0 print(slice_end(word, n)) word = "Saturn" n = 6 print(slice_end(word, n)) Saturn
Allow student to insert one arbitrary string. Save the letters of the string into a list. Design and perform the following tasks and display your results: • Summarizing letters in a string. Write a function that receives a string and returns a list of tuples containing the unique letters and their frequencies in the string. Test your function and display each letter with its frequency. Your function should ignore case sensitivity (that is, 'a' and 'A' are the same) and ignore spaces and punctuation. When done, write a statement that says whether the string has all the letters of the alphabet. • Present descriptive statistics and graphs about the string data. • Sorting letters in different order and removing duplicates • Write a code that produces anagrams of a given string. An anagram of a string is another string formed by rearranging the letters in the first. program must accept inputs from a user, performs an operation using a userdefined function which will accept parameters and…
The program inserts a number of values into a priority queue and then removes them. The priority queue treats a larger unsigned integer as a higher priority than a smaller value. The priority queue object keeps a count of the basic operations performed during its lifetime to date, and that count is available via an accessor. In one or two places I have put statements such as op_count++;, but these are incomplete. We only count operations involved in inserting and removing elements, not auxiliary operations such as is_empty() or size() The class implements a priority queue with an unsorted vector. Your assignment is to re-implement the priority queue implementation using a heap built on a vector, exactly as we discussed in class. Leave the framework and public method interfaces completely unchanged. My original test program must work with your new class. You will have to write new private methods bubble_up and percolate_down. You should not implement heapify or heapsort. #include…
# write your implementation heredef maxProfitBrute(changes): """ it returns the indices of (i,j) indicating the day to buy and sell respectively to have the maximum profit in a list of prices per day in <changes>. Inputs: - changes: the list holding the changes in prices; the value whose index is k represents the change between day <k> and day <k+1> <changes> has at least a single change [two days] Output: - i: the index of the change before which we buy - j: the index of the change after which we sell - maxProfit: the value of the maximum profit Example: changes = [1,2] - that means the price started with <x>; - day 1: it became <x+1> - day 2: it became <x+3> In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day """ # return the values return (0,0,0)
For this problem, you will implement divide and conquer algorithms: the maximum subarray. I have provided the pseudo code for algorithms below. You will need to handle cases of all sizes, not just powers of2. Maximum Subarray using Divide and Conquer Create a class called MaxSubFinder in the divideandconquer package. This class willimplement the maximum subarray problem on a linked list using thepseudocode described above. Implement the following methods with the exact signaturesbelow. You will need to create private helper methods to do most of the work. You canassume that the list are not empty. public static Triple<Node,Node,Integer> getMaxSubList(LinkedList list)This method returns a triple that represents the maximum sub list. The first element of thetriple is the list node where the maximum sublist starts, the middle element of the triple isthe list node where the maximum sublist ends, and the last element of the triple is themaximum sublist sum . Triple class: package…