How do I write the following C++ code in Java? The question is found here: https://open.kattis.com/problems/teque code:# in clude c bits/stdcyt hyUSing name Space Stddeque ctats gi;Void Aush blint i) LgL-push - back (i);it (G2 sitey) - gi-sizel)7=1) Eint h g2-fentl);g2. Pop Arona(l;backn);glo Push-Void Pushy (int i Sgi. pusha back (;);eise if (gi-sizel)> g.size1) {g2 - Push - frontli):int get (int i{it (iegusizel) {Yetuan gl.at(:; Ye hurn gL-at(i-gl-5itc;int mainl) Lint n;s cant ("l.d", bon);while [n--) {char sLis]:int o;Scant Ad", ko)pushblo);else if (slo)==\p! Kn s6]==\my 2pushmlo);else s

The code implementation in Java is given below.

Answered: How do I write the following C++ code…

Engineering

Computer Science

How do I write the following C++ code in Java? The question is found here: https://open.kattis.com/problems/teque

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

#ifndef INT_SET_H#define INT_SET_H #include <iostream> class IntSet{public: static const int DEFAULT_CAPACITY = 1; IntSet(int initial_capacity = DEFAULT_CAPACITY); IntSet(const IntSet& src); ~IntSet(); IntSet& operator=(const IntSet& rhs); int size() const; bool isEmpty() const; bool contains(int anInt) const; bool isSubsetOf(const IntSet& otherIntSet) const; void DumpData(std::ostream& out) const; IntSet unionWith(const IntSet& otherIntSet) const; IntSet intersect(const IntSet& otherIntSet) const; IntSet subtract(const IntSet& otherIntSet) const; void reset(); bool add(int anInt); bool remove(int anInt); private: int* data; int capacity; int used; void resize(int new_capacity);}; bool operator==(const IntSet& is1, const IntSet& is2); #endif
A "generic" data structure cannot use a primitive type as its generic type. O True False
Huffman code // C program for Huffman Coding #include<stdio.h> #include<stdlib.h> #define MAX_TREE_HT 100 struct MinHeapNode { char data; unsigned freq; struct MinHeapNode *left, *right; }; struct MinHeap { unsigned size; unsigned capacity; struct MinHeapNode** array; }; struct MinHeapNode* newNode(char data, unsigned freq) { struct MinHeapNode* temp = (struct MinHeapNode*)malloc (sizeof(struct MinHeapNode)); temp->left = temp->right = NULL; temp->data = data; temp->freq = freq; return temp; } struct MinHeap* createMinHeap(unsigned capacity) { struct MinHeap* minHeap = (struct MinHeap*)malloc(sizeof(struct MinHeap)); minHeap->size = 0; minHeap->capacity = capacity; minHeap->array = (struct MinHeapNode**)malloc(minHeap-> capacity * sizeof(struct MinHeapNode*)); return minHeap; } void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) { struct MinHeapNode* t = *a; *a = *b;…
Match the C-function on the left to the Intel assemble function on the right. W: cmpl $4 movl %edi , %edi jmp .L4(,%rdi,8) %edi .L3: movl $17, %eax ret .15: movl $3, %eax int A ( int x , int y) { int a ; if ( x == 0 ) else i f ( x == 1 ) a = 3 ; else i f ( x == 2 ) a = 2 0 ; else i f ( x == 3 ) a = 2 ; else i f ( x == 4 ) a = 1 ; ret .L6: a = 17; movl $20, %eax ret .L7: movl $2, %eax ret else a = 0; .L8: return a ; movl $1, %eax .L2: ret . section .rodata . L4: .quad .L3 .quad .L5 .quad .L6 .quad .L7 .quad .L8 X: testl %edi, %edi je cmpl je cmpl je стр1 je cmpl .L16 $1, %edi .L17 $2, %edi .L18 $3, %edi int B (int x, int y) { int a; switch (x) { .L19 $4, %edi %al movzbl %al, %eax case 0: a = 17; break; sete break; case 1: a = 3; case 2: a = 20; break; case 3: a = 2; break; case 4: a = 1; a = 0; } return a; ret .L16: break; movl $17, %eax ret .L17: movl $3, %eax } ret .L18: movl $20, %eax ret .L19: movl ret $2, %eax
Question4 (Linked List): 1. Given the attached program code, answer the following: (a) Match each function name with its task. Function Name Task F1 Insert a node at the front of the list. F2 Insert a node after a given node. F3 Delete a node in a specific position. F4 Insert a node at the end of the list. F5 Create the first node in the list. F6 Display all the nodes of the list. (b) What is the result of program execution with the data given in main(). (c) Write a function to count the number of nodes in the list.
-0 FAMAS oro ag -0 1 void printVerticalGraph(int nUnits) { 2 4 9 10 11 12 13 14 15 16 17 456 BARHEIDEN 18 19 20 21 22 23 24 25 26 27 int nRev; printf("%d\n", nUnits); while (nUnits>0){ nRev = getReverse (nUnits); // 1) Adjust nUnits ?? [Q1] ?? while (nRev>0){ nUnits *= 10; // 2) Condition to print * if(?? [Q2]??) { printf("*"); } // 3) Update for nUnits for * case ?? [Q3] ?? }else{ printf(" "); // 4) Update for nUnits for ?? [Q4]?? } // 5) Update to nRev ?? [Q5]?? printf("\n"); case
Help me fix my c programming error. #include <stdio.h>#include <stdlib.h>#define _CRT_SECURE_NO_WARNINGS void addContact();void viewContact();char firstName();char lastName();char phoneNumber[10]; int main(){int selection;printf("\n\t---Contact Mangement System--");printf("\n\t[1] Add New Contact");printf("\n\t[2] View Contact");printf("\n\t[3] Help");printf("\n\t[4] Exit");printf("\n\tEnter Your Selection");scanf("%d", selection);switch (selection){case 1:addContact();break;case 2:viewContact();break;case 3:exit(1);break;default:printf("Enter Your Selection");main();}}void addContact();{printf("Enter First Name: ");scanf("%s", firstName);printf("Enter Last Name: ");scanf("%s", lastName);printf("Enter Your Phone Number: ");scanf("%s", phoneNumber);if (strlen(phoneNumber) == 10){FILE* fp;fp = fopne("contacts.txt", "w");fputs(firstName, fp);fputs(lastName, fp);fputs(phoneNumber, fp);printf("\n\tContact Added");fclose(fp); } main();} void viewContact(){system("cls");char…
Modify the given code to accept float instead of int as a coefficient in C LANGUAGE: // Node structure containing power and coefficient of// variablestruct Node {int coeff;int pow;struct Node* next;}; // Function to create new nodevoid create_node(int x, int y, struct Node** temp){struct Node *r, *z;z = *temp;if (z == NULL) {r = (struct Node*)malloc(sizeof(struct Node));r->coeff = x;r->pow = y;*temp = r;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}else {r->coeff = x;r->pow = y;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}} // Function Adding two polynomial numbersvoid polyadd(struct Node* poly1, struct Node* poly2,struct Node* poly){while (poly1->next && poly2->next) {// If power of 1st polynomial is greater then 2nd,// then store 1st as it is and move its pointerif (poly1->pow > poly2->pow) {poly->pow = poly1->pow;poly->coeff = poly1->coeff;poly1 =…
int cal_media() {cout<<"Enter Your Name"<<endl;cin>>name;cout<<"Enter the Both subject marks"<<endl;cin>>marks1>>marks2;totalmarks = marks1 + marks2;} Question 4: On above code overload unary operator prefix decrement and post fix increment forthe calc-media() function.
#include <iostream>//#include <vector> using namespace std; class Vec {public:Vec() {sz = 0;cap = 1;p_arr = new int[cap];} int size(){return this->sz;}int capacity(){return this->cap;}void reserve( int n ){// TODO:// (0) check the n should be > size, otherwise// ignore this action.if ( n > sz ){// (1) create a new int array which size is n// and get its address//cout << "Adress:"<< &n << endl;int *newarr = new int [n];//cout << "Address: " << newarr << endl; // location // (2) use for loop to copy the old array to the// new arrayfor(int i = 0; i < sz; i++){newarr[i] = p_arr[i];}// (3) update the variable to the new addressthis->cap=n; // (4) delete old arraydelete[] newarr;}}void push_back( int v ){// TODO:if ( sz == cap ){ cap *= 2; reserve(cap);}p_arr[sz++] = v;// complete others}int at(int idx){return this->p_arr[idx];}private://vector<int> arr;int *p_arr;int sz = 0;int cap = 0; }; int main(){Vec v;…
in C++ starting code: #include <iostream>// FIXME include vector libraryusing namespace std; int main() { /* Type your code here. */ return 0;} Please copy and paste working code.
in c language typedef _people { int age; char name[ 32 ] ; } People_T ; People_T data [ 3 ]; Using string lib function, Assign 30 and Cathy to the first cell, Assign 40 and John to the second cell and Assign 50 and Tom to the third cell