2.Write a Java program to remove all odd items from the stack, by putting t tmp1 and all the odd items into tmp2. Then it move the items in tmp1 back Example (with the top of the stack on the left) 23 45 6 32 21 43 53 82 71 68

2.Write a Java program to remove all odd items from the stack, by putting t tmp1 and all the odd items into tmp2. Then it move the items in tmp1 back Example (with the top of the stack on the left) 23 45 6 32 21 43 53 82 71 68

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

Write a java program to insert one element in a singly linked list before a given element. Your program will print the original list, request the user to put in an element to be inserted, and an element to indicate the location of the insertion, then print the final list after the insertion is done. If the element doesn't exist in the list, add the new element to the end of the list. No duplicate values are allowed to store in list. Once you done insertion operation (at least 10 element inserted) in your list, Draw a binary search tree and AVL tree ( show all rotations ) as per your inserted values . Use the following as your test cases to evaluate whether your program works correctly: If you have a linked list: 6à2à7. With user input 8 and 2. Your list should become 6à8à2à7: With user input 8 and -1. Your list should become 6à2à7à8: Let suppose your final linked list . 6à2à7à8à5à10à1à9à3
PYTHON Write a Python program that counts the amount of identical values in a list below, and prints them. [21, 18, 57, 82, 83, 18, 60, 18, 56, 51, 62, 44, 19, 30, 81, 35, 34, 61, 51, 35, 44, 72, 65, 84, 47, 26, 30, 98, 84, 83, 42, 98, 15, 7, 24, 89, 29, 22, 36, 49, 79, 31, 23, 70, 60, 20, 42, 95, 7, 84, 89, 93, 98, 43, 83, 31, 29, 93, 74, 41, 91, 52, 74, 82, 8, 37, 80, 46, 63, 65, 83, 20, 13, 100, 12, 61, 92, 58, 22, 3, 36, 33, 35, 81, 20, 96, 55, 24, 21, 14, 92, 68, 10, 19, 96, 28, 4, 35, 27, 5]
• Exercise # 1: Write a program that prints a multiplication table using two FOR loops, like this: 4. 10 2. 4. 10 12 14 16 18 20 6. 6. 12 15 18 21 24 27 30 4 8. 12 16 20 24 28 32 36 40 5. 10 15 20 25 30 30 35 40 45 50 12 18 24 36 42 48 54 60 70 7. 14 21 28 35 42 49 56 63 8. 16 24 32 40 48 56 64 72 80 6. 18 27 36 45 54 63 70 72 81 90 10 20 30 40 50 60 80 90 100
Write a program that uses a recursive call to find the integer logb of a number. Where logb returns the integer log of a number in a designated base. For example, the integer base 10 log of 1234 is 3, and the integer base 2 log of 1234 is 10. This is a relatively easy calculation. You simply repeatedly divide the number by the base using integer division until the quotient is less than the base and count the number of completed divisions. 1234/10=123 (1) 123/10 12 (2) 12/10 = 1 (3) 1234/2= 617 (1) 617/2 = 308 (2) 308/2 = 154 (3) 154/2 = 77 (4) 77/2 = 38 (5) 38/2 = 19 (6) 19/2 = 9 (7) 9/2=4 (8) 4/2=2(9) 2/2 = 1 (10)
Write a program that reads a list of integers and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2, To achieve the above, first read the integers into an array. Then output the array in reverse. 453086 3222312 ax37zav7
Write a Java program and screenshot of the output using Stack class to show the following points: a. Create three empty stacks named stackOne, stackTwo and stackThree respectively. b. Push the numbers [a, b, c, d] "for example [7, 5, 8, 22]" into stackOne and [w, x, y, z] "for example [5, 4, 2, 11]” into stackTwo. (Note: value of the numbers [a,b,c,d, etc] for each of the student should be different) c. Pop the top number of stackOne and top number of stackTwo and add them. Then, push the addition result into stack Three. d. Pop the top number of stackOne and top number of stackTwo and subtract them. Push the result of subtraction into stackThree. e. Print StackOne, stackTwo and stackThree. f. Print the largest number in stack Three
Write a program that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: no
Write a C program for this problem: The partially initialized array "table" can be viewed as a primitive spreadsheet, in which the last column and bottom row have been left blank. Write the code to fill in this row and column with the totals of each column, each row, and the GRAND TOTAL. PS. Don't forget to add comments for every step you make.
JAVA: Write a recursive method named threeSum that accepts a list of integers and prints all combinations of three integers in the list that sum to 0. For example, if given the list [-1, 0, 1, 2, -1, -4], print the following lines of output: [-1, 0, 1] [-1, 2, -1] [0, 1, -1] You may print the lines of output in any order. The elements in each three-element sublist should appear in the same relative order that they appeared in the original list. Do not print duplicate lists; if the same exact sublist can be made in multiple ways, print it only once. If there are no combinations of three elements that sum to 0, print no output. The list passed to your method must be back to its original state at the end of the call. Either do not modify it, or if you modify it, fully undo your modifications before the method returns. Constraints: Do not declare any global variables. You can use any data structures you like, and your code can contain loops, but the overall algorithm must be recursive and…
Write a program in python which will read two integers, j and k, from standard input. Use the list function and the range function to print a list of integers from k down to j (inclusive). Notice the form of the output is a list. You may assume that j is less than or equal to k. For example: Input Result 2 5 [5, 4, 3, 2] 0 0 [0] -3 3 [3, 2, 1, 0, -1, -2, -3]
Write a JavaScript program to sort the strings of a given array of strings in the order of increasing lengths.Note: Do not change the order if the lengths of two string are same.