In this task, you need to use 2 priority queues to print out the kth largest and jth smallest number in 2 new different random vectors, vector3 and vector4. Write a function called int kthLargestPQ( vector& vec, int k), and a function called int jthSmallestPQ(vector& vec, int k). Here is an example: Original vector3: 9 8 9 2 3 79577 Input K for Kth largest: 3 The 3 largest number: 9 Original vector4: 9 6 5 6 7 76 162 Input J for Jth smallest: 3 The 3 smallest number: 5 Hint: Using priority queue. This problem can be solved in two ways. 1. For the kthLargestPQ, we can maintain a small heap (small priority queue, smallest element in the top) with only k elements in size. After traversing all the elements, the top element in the PQ is what we want. The jthSmallestPQ vice versa. 2. To get the kth largest element, you can construct a large priority queue using all the elements, pop the top element k-1 times, then the top element is what we want. To get the jth smallest element, you

In this task, you need to use 2 priority queues to print out the kth largest and jth smallest number in 2 new different random vectors, vector3 and vector4. Write a function called int kthLargestPQ( vector& vec, int k), and a function called int jthSmallestPQ(vector& vec, int k). Here is an example: Original vector3: 9 8 9 2 3 79577 Input K for Kth largest: 3 The 3 largest number: 9 Original vector4: 9 6 5 6 7 76 162 Input J for Jth smallest: 3 The 3 smallest number: 5 Hint: Using priority queue. This problem can be solved in two ways. 1. For the kthLargestPQ, we can maintain a small heap (small priority queue, smallest element in the top) with only k elements in size. After traversing all the elements, the top element in the PQ is what we want. The jthSmallestPQ vice versa. 2. To get the kth largest element, you can construct a large priority queue using all the elements, pop the top element k-1 times, then the top element is what we want. To get the jth smallest element, you

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Implement binary search algorithm as a template function.Part B: Given a vector of size S and a number N. Write a function that calculates if there is any pair of numbers in the vector whose sum is equal to N?Hint: you can use the binary search function you implemented in part A.Notes:You must use iterators in your implementation.Input Format: The input consists of 2 lines. The first line contains 2 numbers, S and N. The second line contains S numbers which represent the contents of the vector.
In this programming exercise you will implement two functions. The first function will prompt the user for a file containing the number of vertices and entries of the adjacency matrix of a graph. It will return a two-dimensional list (a list of lists) containing the adjacency matrix. The textfile is named inputfilename.txt am trying to read for the matrix 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0 def readMatrix(inputfilename): ''' Returns a two-dimentional array created from the data in the given file. Pre: 'inputfilename' is the name of a text file whose first row contains the number of vertices in a graph and whose subsequent rows contain the rows of the adjacency matrix of the graph. ''' # Open the file f = open(inputfilename, 'r') # Read the number of vertices from the first line of the file n =…
Given two arrays A and B of equal size N, the task is to find a vector containing only those elements which belong to exactly one array - either A or B - but not both. That is, if some element x appears in both A and B it should not be included in the output vector. Complete the implementation of "getVector(vector<ll>A, vector<ll>B, int N)" function. Example: Input: 1 3 5 7 1 3 2 4 6 7 8 Output: 3 5 1 3 2 4 6 8 The driver codes are attached in the images below. DO NOT CHANGE THE PROVIDED DRIVER CODES AT ALL, LEAVE THEM EXACTLY THE SAME. ONLY ADD CODE TO THE "getVector(vector<ll>A, vector<ll>B, int N)" FUNCTION
Element 1 Element 2 Element 3 Element 4 end function 2 1 † Top 2 2 Task 4: Complete the following function: function SEARCHSTACK(stack, item) 2 4 4 2 1 1 Top 4 The coordinates of the element in yellow are (3,2), for example. So to select the value stored there we use the syntax puzzle[3][2], since we are looking at the second element in puzzle [3]. Using this coordinate system to re- fer to the 2-by-2 sub-grids, for example, the top-left sub-grid will consist of the elements (1,1), (1,2), (2,1) and (2,2). You will check the Pseudoku conditions using a stack. In particular, you will start with a stack containing all numbers from 1 to 4, and then inspect each element in each column (or sub-grid) to see if the number in that element is stored in the stack: if it is stored in the stack, pop that value from the stack and return the stack; otherwise, return false. This process will be repeated for every element in a column or sub-grid. If, at the end of checking every element, the stack is…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
In c++ please Write the RemoveEvens() function, which receives a vector of integers as a parameter and returns a new vector of integers containing only the odd numbers from the original vector. The main program outputs values of the returned vector. Hint: If the original vector has even numbers, then the new vector will be smaller in length than the original vector and should have no blank element. Ex: If the vector passed to the RemoveEvens() function is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the function returns and the program output is: [1, 3, 5, 7, 9] Ex: If the vector passed to the RemoveEvens() function is [1, 9, 3], hen the function returns and the program output is: [1, 9, 3] #include <iostream>#include <vector>using namespace std; vector<int> RemoveEvens(vector<int> nums) { /* Type your code here */} int main() { vector<int> input(9); input.at(0) = 1; input.at(1) = 2; input.at(2) = 3; input.at(3) = 4; input.at(4) = 5;…
This chapter describes the array implementation of queues that use a special array slot, called the reserved slot, to distinguish between an empty and a full queue. Write the definition of the class and the definitions of the function members of this queue design. Also, write a program (in main.cpp) to test various operations on a queue. //Header file QueueAsArray #ifndef H_QueueAsArray #define H_QueueAsArray #include <iostream> #include <cassert> using namespace std; template<class Type> class queueType { public: const queueType<Type>& operator=(const queueType<Type>&); // overload the assignment operator void initializeQueue(); int isEmptyQueue() const; int isFullQueue() const; Type front() const; Type back() const; void addQueue(Type queueElement); void deleteQueue(); queueType(int queueSize = 100); queueType(const queueType<Type>& otherQueue); // copy constructor…
What would be a way in implementing the Josephus problem in C++ using a vector or a list? That takes in three parameters, one the number of knights for the knight parameter. The second parameter, "skip", is the number of knights to skip and to execute the next night. Then the third parameter "start", is the index of the knight to execute first.
Write a function multiply_ends (nums) that takes a non-empty list of integers and returns the first integer multiplied by the last integer. For example, if nums is the list [5, 4, 6, 2], the function would return 5 * 2 = 10. If the list has only 1 element, the first and last elements are the same so the function should return the square of the element. For example: Test Result print(multiply_ends( [5, 4, 6, 2])) 10 Answer: (penalty regime: 0, 10, 20, ... %) 1 | Precheck Check
t. Given a string as a parameter to the function, return a square grid filled with all the characters of the string from left to right. Fill empty spaces in the grid with '_'. Sample Input: stringtogrid Output: {{s, t, r, i}, {n, g, t, o}, {g, r, i, d}, {_, _, _, _}} Complete the function: vector<vector<int> formGrid(string s){}
Part A:Implement binary search algorithm as a template function. Part B:Given a vector of size S and a number N. Write a function that calculates if there isany pair of numbers in the vector whose sum is equal to N? Hint: you can use the binary search function you implemented in part A. Notes:You must use iterators in your implementation. Input Format:The input consists of 2 lines. The first line contains 2 numbers, S and N. The secondline contains S numbers which represent the contents of the vector. Input:3 53 1 2 Output:YES