What would be the output of the following code?KWLinkedList list = new KWLinked List ();for(int i = 1; i<= 4; i++)list.add( i );Listlterator iter = list.listlterator();while(iter.hasNext()){int x = iter.next();int y = iter.next();:iter.set(x + y);}while(iter.hasPrevious())System.out.print(iter.previous() + " ");A) 1337B) 47 2 3c) 123 4D) 73 3 1

I have given an answer in step 2.

What would be the output of the following code? KWLinkedList list = new KWLinkedList (); for(int i = 1; i<= 4; i++) list.add( i): Listiterator iter = list.listiterator(); while(iter.hasNext()) { int x = iter.next(): int y = iter.next(): iter.set(x + y); } whilețiter.hasPrevious()) System.out.print(iter.previous() + " ");

What would be the output of the following code? KWLinkedList list = new KWLinkedList (); for(int i = 1; i<= 4; i++) list.add( i): Listiterator iter = list.listiterator(); while(iter.hasNext()) { int x = iter.next(): int y = iter.next(): iter.set(x + y); } whilețiter.hasPrevious()) System.out.print(iter.previous() + " ");

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

4. What is the running time of the following code? Points] public static List makeList ( int N) ArrayList 1st = new ArrayList (); for ( inti =0; i < N; i++) { 1st.add (i); lst.trimToSize (); } }
Given the interface of the Linked-List struct Node{ int data; Node* next = nullptr; }; class LinkedList{ private: Node* head; Node* tail; public: display_at(int pos) const; ... }; Write a definition for a method display_at. The method takes as a parameter integer that indicates the node's position which data you need to display. Example: list: 5 -> 8 -> 3 -> 10 display_at(1); // will display 5 display_at(4); // will display 10 void LinkedList::display_at(int pos) const{ // your code will go here }
Make a doubly linked list and apply all the insertion, deletion and search cases. The node willhave an int variable in the data part. Your LinkedList will have a head and a tail pointer.Your LinkedList class must have the following functions: 1) insert a node1. void insertNodeAtBeginning(int data);2. void insertNodeInMiddle(int key, int data); //will search for keyand insert node after the node where a node’s data==key3. void insertNodeAtEnd(int data);2) delete a node1. bool deleteFirstNode(); //will delete the first node of the LL2. bool deleteNode(int key); //search for the node where its data==keyand delete that particular node3. bool deleteLastNode(); //will delete the last node of the LL3) Search a node1. Node* searchNodeRef(int key); //will search for the key in the datapart of the node2. bool searchNode(int key); The program must be completely generic, especially for deleting/inserting the middle nodes. Implement all the functions from the ABOVE STATEMENTS and make a login and…
Write a function in C++ that takes a pointer to an array as one parameter, and the length of the array as the second parameter. The function shall calculate the longest contiguous streak of odd numbers present in the array. You do not need to handle negative length arrays. Use Example: int. main(){ int array[] = {1,2,3,4,5,7,9}; std::cout << "Number Odd: << numOdd(array, 7); std::cout << std::endl; } Output: 3
Given the following class declaration: class List { public: List(); List(const List&); List& operator=(const List&); -List(); // Inserts element in the specified position, returns true if // it was able to insert. // Example, if the list is [4, 2, 1], and the user // calls list.Insert(6, 1) the list would become [4, 6, 2, 1] bool Insert(double element, size_t position) ; // Returns the position of element if found, if not found returns -1 int Index0f(double element)const ; // Removes the element in the given position double Remove(size_t position) ; // Gets the number in the given position double Get(size_t position)const ; // Returns a string representation of the list, elements // separated by commas and the list between brackets string ToString()const ; // Returns the number of elements in the list size_t Size)const; // Returns true if the list is empty, false otherwise bool IsEmpty)const; // Clears the whole list void Clear(); private: struct Node{ double number; Node* next; };…
To declare an array of String called myStrings, we would code: ArrayList<Blank 1> myStrings = Blank 2 ArrayList<String>();
Examine the following code: ArrayList<String> list = new ArrayList<String>(10) ; list.add("A"); list.add("B"); list.add("C"); list.add(0, "E" ); What element will be at index 2 of the list? What list will be printed after executing the method list.remove(2);
The following procedure removes the first half of the list passed as a parameter: public static void foo( List myList) { int theSize = myList.size( ) / 2; for( int i = 0; i < theSize; i++ ) myList.remove( 0 ); } What is the running time of foo if myList is a LinkedList? e(1) O e(n Ig n) O(n) O e(n³) e(n?)
Given below is a function to delete the last element of a single linked list. Fill in the blanks. void removelast(){ if(head==null) return null; else if(head.nextNode==null){ } else{ Node temp=head; while(temp.nextNode.nextNode!=null){ temp=temp.nextNode; } } }
Which best describes this axiom: aList.getLength ( ) = ( aList.remove ( i ) ) . getLength ( ) + 1 You cannot remove an item from from existing list that is empty Removing an item from an existing list decreases its length by one Removing an item from an existing list increases the list size by one None of these
This code is not in order! Put the code in order! ArrayList<String> list = new ArrayList<>(); position 11 Position 1. Reorder Choice: list.remove(2); list.remove(2); position 22 Position 2. Reorder Choice: list.add("Minfilia"); list.add("Minfilia"); position 33 Position 3. Reorder Choice: list.add("Yda"); list.add("Yda"); position 44 Position 4. Reorder Choice: System.out.println("Print 3: " + list); list.add("Thancred"); // on a single line to remove variability, yes this is allowed. System.out.println("Print 3: " + list); list.add("Thancred"); // on a single line to remove variability, yes this is allowed. position 55 Position 5. Reorder Choice: System.out.println("Print 2: " + list); // line 5 System.out.println("Print 2: " + list); // line 5 position 66 Position 6. Reorder Choice: list.add(list.size()-2,"Y'shtola"); list.add(list.size()-2,"Y'shtola"); position 77 Position 7. Reorder Choice:…