Section B:1. What is the output of the following program? Draw the content of Char queue.public class Vchar {public static void main(String[] args) {// TODO Auto-generated method stubQueue vChar = new Queue();String text = " I love to learn TK1143 Program Design !";for(int i=0; i< text.length(); i++) {char c = text.charAt(i);if (c== 'a' || c=='e' || c=='i' || c=='o' || c== 'u')vChar.enqueue (c);}System.out.println(vChar.size());while (!vChar.isEmpty())System.out.print(vChar.dequeue () +} 2.12345Trace the given program and give the output.class Product {int id;String name, category, manufacturer;int quantity;60public Product (int id, String name, String category, String manufacturer, int quantity) {this.id = id;this.name = name;this.category = category;this.manufacturer = manufacturer;this.quantity = quantity;public static void main(String[] args) {Queue listP = new Queue<>();//Creating BooksProduct bl=new Product (121, "Canadian Purple Wheat", "Bread", "Gardenia",8);Product b2=new Product (233,"Ikan Sardin", "sardine", "Ayam Brands",6);Product b3=new Product (101, "Dark Chocolate", "Chocolate", "Cadbury",4);//Adding Product to the listplistP.enqueue (b1);listP.enqueue (b2);listP.enqueue (b3);System.out.println("Traversing the product elements:");//Traversing list elementsfor (Product b:listP) {System.out.println(b.id+""+b.name+", "+b.category+", "+b.manufacturer+", "+b.quantity);}//Remove first listP elementlistp.dequeue ();System.out.println("After removing one product record: ");for (Product b:listP) {System.out.println(b.id+""+b.name+", "+b.category+", "+b.manufacturer+", "+b.quantity);}78901210111213 }1415 public class ProductList {1601718192021222312425262728m m m m m m. m 466789293031323456733343536373839 }4000 99}

As per the guidelines we allow to solve only one question if first question is different from second…

Section B: 1. What is the output of the following program? Draw the content of Char queue. public class Vchar { public static void main(String[] args) { // TODO Auto-generated method stub Queue vChar = new Queue(); String text = " I love to learn TK1143 Program Design !"; for(int i=0; i< text.length(); i++) { char c = text.charAt(i); if (c== 'a' || c=='e' || c=='i' || c=='0' || <== 'u') vChar.enqueue (c); } System.out.println(vChar.size()); while (!vChar.isEmpty()) System.out.print(vChar.dequeue () + }

Section B: 1. What is the output of the following program? Draw the content of Char queue. public class Vchar { public static void main(String[] args) { // TODO Auto-generated method stub Queue vChar = new Queue(); String text = " I love to learn TK1143 Program Design !"; for(int i=0; i< text.length(); i++) { char c = text.charAt(i); if (c== 'a' || c=='e' || c=='i' || c=='0' || <== 'u') vChar.enqueue (c); } System.out.println(vChar.size()); while (!vChar.isEmpty()) System.out.print(vChar.dequeue () + }

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

class Queue { private static int front, rear, capacity; private static int queue[]; Queue(int size) { front = rear = 0; capacity = size; queue = new int[capacity]; } // insert an element into the queue static void queueEnqueue(int item) { // check if the queue is full if (capacity == rear) { System.out.printf("\nQueue is full\n"); return; } // insert element at the rear else { queue[rear] = item; rear++; } return; } //remove an element from the queue static void queueDequeue() { // check if queue is empty if (front == rear) { System.out.printf("\nQueue is empty\n"); return; } // shift elements to the right by one place uptil rear else {…
class Queue { private static int front, rear, capacity; private static int queue[]; Queue(int c) { front = rear = 0; capacity = c; queue = new int[capacity]; } static void queueEnqueue(int data) { if (capacity == rear) { System.out.printf("\nQueue is full\n"); return; } else { queue[rear] = data; rear++; } return; } static void queueDequeue() { if (front == rear) { System.out.printf("\nQueue is empty\n"); return; } else { for (int i = 0; i < rear - 1; i++) { queue[i] = queue[i + 1]; } if (rear < capacity) queue[rear] = 0; rear--; } return; } static void queueDisplay() { int i; if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; } for (i = front; i < rear; i++) { System.out.printf(" %d <-- ", queue[i]); } return; } static void queueFront() { if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; } System.out.printf("\nFront Element is: %d", queue[front]);…
Problem Description: 1. Suppose that we want to add a method to a class of queues that will splice two queues together. This method adds to the end of a queue all items that are in a second queue. The header of the method could be as follows: public void splice (QueueInterface anotherQueue) Write this method in such a way that it will work in any class that implements QueueInterface.
public class CustomLinkedList {    public static int findMax(IntNode headObj) { /* Type your code here */         }    public static void main(String[] args) { IntNode headObj;   IntNode currObj; IntNode lastObj; int i;   int max;     // Create head node headObj = new IntNode(-1);   lastObj = headObj;     // Add nodes to the list for (i = 0; i < 20; ++i) {   currObj = new IntNode(i);     lastObj.insertAfter(currObj);   lastObj = currObj; }        max = findMax(headObj); System.out.println(max); }}
Create Pseudocode for this class Queue { private static int front, rear, capacity; private static int queue[]; Queue(int c) { front = rear = 0; capacity = c; queue = new int[capacity]; } static void queueEnqueue(int data) { if (capacity == rear) { System.out.printf("\nQueue is full\n"); return; }     else { queue[rear] = data; rear++; } return; } static void queueDequeue() {    if (front == rear) { System.out.printf("\nQueue is empty\n"); return; } else { for (int i = 0; i < rear - 1; i++) { queue[i] = queue[i + 1]; }    if (rear < capacity) queue[rear] = 0;    rear--; } return; }   static void queueDisplay() { int i; if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; }     for (i = front; i < rear; i++) { System.out.printf(" %d <-- ", queue[i]); } return; }   static void queueFront() { if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; } System.out.printf("\nFront…
package queuedemo; class Queue { int front, rear, size;   int capacity;   int array[];   public Queue(int cap)   {   capacity = cap;   front=size=0;   rear=capacity-1;   array = new int[capacity];   }      // Method to add an item to the queue.   void enqueue(int item)   {   if(isFull()) {   System.out.println("Queue overflow");   return;   }   rear=(rear+1)%capacity;   array[rear]=item;   size=size+1;   }   // Queue is empty when size is 0   boolean isEmpty()   {   return (size == 0);   }   // Queue is full when size becomes equal to the capacity   boolean isFull()   {   return (size == capacity);   }   // Method to remove an item from queue.   int dequeue()   {   if (isEmpty())   System.out.println("Queue Underflow");   return;   }   int item = array[front];   front = (front + 1)% this.capacity;…
Analyze the following code: import java.util.*; public class Test { public static void main(String[] args) { PriorityQueue queue = } } new PriorityQueue( Arrays.asList(60, 10, 50, 30, 40, 20)); for (int i: queue) System.out.print(i + "); The program displays 60 10 50 30 40 20 The program displays 10 20 30 40 50 60 The program displays 60 50 40 30 20 10 There is no guarantee that the program displays 10 20 30 40 50 60
void getInput(){for(int i =0; i < studentName.length; i++){System.out.print("Student name: ");studentName[i] = keyboard.nextLine();System.out.print("Studnet ID: ");midTerm1[i] = keyboard.nextInt();}keyboard.close();} Can't put full student name becuase nextLine();
In JavaScript use recursion to find the sum of all pages in the following: function getPageTotal(list) {// your code here// returns an integer}Example test case:Input: {"book":"A","pages":50,"next":{"book":"B","pages":25,"next": null}}Output: 75Reasoning: 50 + 25 pages
please convert this into c++ import java.util.Iterator;import java.util.NoSuchElementException; public class Queue<Item> implements Iterable<Item> { private int n; // number of elements on queue private Node first; // beginning of queue private Node last; // end of queue // helper linked list class private class Node { private Item item; private Node next; } /** * Initializes an empty queue. */ public Queue() { first = null; last = null; n = 0; } /** * Returns true if this queue is empty. * * @return {@code true} if this queue is empty; {@code false} otherwise */ public boolean isEmpty() { return first == null; } /** * Returns the number of items in this queue. * * @return the number of items in this queue */ public int size() { return n; } /** * Returns the number of items in this queue. * * @return the…
Computer Science Write a program in the Java language that includes: 1. A class for books, taking into account the encapsulation and getter, setter. 2. Entering books by the user using Scanner 3. LinkedList class for: (Adding a new book - Inserting a book- Searching for a book using the ISBN Number - Viewing all books,delete book). 4. Serial number increases automatically with each book that is entered. 5. Printing the names of books is as follows: Serial - ISBN - Name - PubYear - Price - Notes. 6-Design a main menu that includes: • Add Book • Insert Book • Delete Book • Search . Display . Exit
public class ShoppingListDriver{ public static void main(String[] args){ ShoppingList sl=new ShoppingList(3);sl.insert(null);sl.insert(new Item("Bread", "Carb Food", 2, 2.99));sl.insert(new Item("Seafood","Sea Food", -1, 10.99));sl.insert(new Item("Rice", "Carb Food",2, 19.99));sl.insert(new Item("Salad Dressings","Dessing", 2, 19.99));sl.insert(new Item("Eggs", "Protein",2, 3.99));sl.insert(new Item("Cheese","Protein", 2, 1.59));sl.insert(new Item("Eggs", "Protein",3, 3.99));sl.printNames();sl.print(); System.out.println("After removing Eggs:");sl.remove(new Item("Eggs","Protein",0,0));sl.printNames();sl.print(); }}