Q1- Write a program that create two objects (C, D) from the queue class and do the following: Add 100 elements to queue C by results of muiplication table from (1 to 10) Add 10 elements to queue D by summation the results of cach table alone.

Q1- Write a program that create two objects (C, D) from the queue class and do the following: Add 100 elements to queue C by results of muiplication table from (1 to 10) Add 10 elements to queue D by summation the results of cach table alone.

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

b. Write out the order of elements that are contained in a queue after the following operations are performed. myQueue.enqueue(new Integer(16)); myQueue.enqueue(new Integer(12)); Integer num1 = myQueue.dequeue(); myQueue.enqueue(new Integer(6)); myQueue.enqueue(new Integer(8)); myQueue.enqueue(new Integer(30)); myQueue.enqueue(new Integer(24)); myQueue.enqueue(new Integer(18)); myQueue.dequeue(); myQueue.dequeue(); myQueue.dequeue(); myQueue.enqueue(new Integer(38); Show how step by step process of arriving at your answer.
Question 1a: Write an algorithm / program that accept ten values and store them in an array in sorted order. 1B: Write a program that implements stack and queue by using array and link list.
Computer Science CODE IN C++: You have to design and implement a game in which the avatar has to find the hidden treasure in circus. Theonly way to guide the avatar and to find the treasure is to find the shortest path that leads to the hiddentreasure. You, being a developer are bound to use the Queue data structure. Among, depth first search andbreath first search, determine the most suitable algorithm and provide a complete code. Decide the suitablename of the avatar and the game since you are the designer. Data should be taken from the user. Makerelevant assumptions if required
*The Question In the Picture Criteria a. Create a class called Queue with member variable queueArr, integer queue array, integer rear, integer front b. i. Initialize rear and front to -1ii. Receive an integer and check if queue is full, if not then insert the integer to the queue arrayiii. Delete front element from queue if front is not equal to rear (empty)iv. Print out the queue array if rear is not equal to front. c. i. Provides a choice to the user if they want to insert, delete or display the queue. ii. According to the user response, the appropriate function is called.
Q17. * What are the values of Front and Rear after performing the operations: dequeue(), enqueue(%'), dequeue), dequeue(), 4 24 Y #3 Front Rear O 2,2 Оз,3 2,3 3,2 The queue is empty
JAVA 1-Write an application using a hash table that finds all the pairs of two integers within the below array that add up to 12.Array = {4,9,6,13,5,3,2,8} 2-Develop an application that stores characters A, B and C in a queue array and then displays both the size and the first-in element of the stack. The application should then remove the first element of the queue and then display both the size and the first-in element of the queue again. Appropriate queue methods should be used to add, delete and display characters. 3-Develop an application that store characters A, B and C in a stack array and then displays both the size and the last-in element of the stack. The application should then remove the last element of the stack and then display again both the size and the last-in element of the stack. Appropriate stack methods should be used to add, delete and display characters. 4-Write a program that merges two ordered-list objects of integers into a single ordered list object of…
The essential condition which is checked before deletion in a linked queue is? a) Underflow b) Overflow c) Front value d) Rear value
Problem 7: Assume that a queue class called XQueue has a no argument constructor, an enqueue() method, a dequeue() method and an isEmpty() method. Write a method that merges two given queues by copying the elements in an alternating sequence and returning the resulting combined queue. Note: make sure that you don't include unnecessary spaces in your answer! public XQueue merge(XQueue q1, XQueue q2) { XQueue neWQueue = new XQueue(); while (!q1.isEmpty() && !q2.isEmpty()) { newQueue.enqueue( #01 ); newQueue.enqueue( #02); } while (!q1.isEmpty()) { #03 ; } while (!q2.is Empty()) { #04 ; } return newQueue (); }
Assume q1 is a queue created in the main and q2 is created in a block scope and we write q2=q1 and in the main function we print the items of the q1, if no operator= overload method then then Select one: a. The q1 has the same items of q2 b. The q1 items becomes rubbish c. The q1 becomes empty d. The q1 was not changed