what does the following code do?public int function(T e)Node temp = head;int var =0;while (temp != null)if(temp.Datae)return var;var =var+1;temp =temp. Nextreturn -1;}O a. Find and delete a given element in the listO b. Find and return the given element in the listO c. Find and insert a new element in the listO d. Find and return the position of the given element in the list

what does the following code do? public int function(T e) Node temp = head; int var = 0; while (temp != null) { if(temp.Data e) { return var; } var = var+13; temp temp.Next } return -1; a. Find and delete a given element in the list O b. Find and return the given element in the list O c. Find and insert a new element in the list n d. Find and return the position of the given element in the list

what does the following code do? public int function(T e) Node temp = head; int var = 0; while (temp != null) { if(temp.Data e) { return var; } var = var+13; temp temp.Next } return -1; a. Find and delete a given element in the list O b. Find and return the given element in the list O c. Find and insert a new element in the list n d. Find and return the position of the given element in the list

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

What is the functionality of the following piece of code? public int function(){Node temp = tail.getPrev();tail.setPrev(temp.getPrev());temp.getPrev().setNext(tail);size--;return temp.getItem();}a) Return the element at the tail of the list but do not remove itb) Return the element at the tail of the list and remove it from the listc) Return the last but one element from the list but do not remove itd) Return the last but one element at the tail of the list and remove it from the list
A) Given a list, iterate it, and display numbers divisible by five, and if you find a number greater than 150, stop the loop iterations list = [12,15,32,42,55,75,122,132,150,180,200]
Implement a list of employees using a dynamic array of strings.Your solution should include functions for printing list, inserting and removingemployees, and sorting lists (use Bubble sort in C++ language).Keep list of employees sorted within the list after insertion.See the following example:How many employees do you expect to have?5 (Carriage Return)Menu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit2 (Carriage Return)Input name of new employee : MikeMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit1(Carriage Return)1 . MaryMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit
Q3. Write for-loops and while-loops to:(a) Compute the mean of every column in mtcars.(b) Create an object to store unique values in each column of iris. (Hint: Use function unique()) Theobject could be whatever object you like, list, matrix, dataframe, etc.
Considering all the elements and its indexes at the right side:Write a sequence of List operations that would result to a LIST that contains ONLY the elements with its respective indexes: {index[00]=104, index[01]=165, index[02]=115, index[03]=384, index[04]=248, index[05]=117}.
// pre: list != null, list.length > 0 // post: return index of minimum element of array public static int findMin(int[] list) { assert list != null && list.length > 0 : "failed precondition"; int indexOfMin = 0; for(int i = 1; i < list.length; i++) { if(list[i] < list[indexOfMin]) { indexOfMin = i; } } return indexOfMin; } Question: draw DFG from the code above find the all-def/c/p use paths. Generate test cases to test this function using JUnit! (to test all-def/c/p use path)
program Linked List: modify the following program to make a node containing data values of int, char, and string. #include <iostream> using namespace std; struct node { int data; struct Node *next; }; struct Node* head = nullptr;//or Null or 0; void insert(int new_data) { struct Node* new_node=(struct Node*) new(struct Node); new_mode->data=new_data; new_mode->next=head; head=new_node; } void display() { struct Node* ptr; ptr=head; while(ptr ! = NULL) { cout<<ptr->data<<""; ptr=ptr->next; } } int main() { insert{2}; display{}; return0; }
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:…
C++ What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 void fun(Node<ItemType>* start) { if(start == nullptr) return; cout << start->getItem() << " "; if(start->getNext() != nullptr ) fun(start->getNext()->getNext()); cout << start->getItem() << " ";} eof.
The function count_contains_og in python takes a list of strings and returns how many strings in the list contain 'og' / 'OG' / 'oG' / 'Og' (check for 'og', ignoring case). Hint: Use the sequence membership operator in to help you check for 'og' in the individual strings. Create a lower-cased version of the string (lower), then use the in operator. For example: Test Result str_list = ['cat', 'dog', 'FROG', 'monkey'] print(count_contains_og(str_list)) 2 strlist = ["X", "x"] print(count_contains_og(strlist)) 0 list_of_one_og = ["Doggie"] print(count_contains_og(list_of_one_og)) 1
scheme: Q7: No Repeats Implement no-repeats, which takes a list of numbers s as input and returns a list that has all of the unique elements of s in the order that they first appear, but no repeats. For example, (no-repeats (list 5 4 5 4 2 2)) evaluates to (5 4 2). Hints: To test if two numbers are equal, use the = procedure. To test if two numbers are not equal, use the not procedure in combination with =. You may find it helpful to use the filter procedure. (define (no-repeats s) 'YOUR-CODE-HERE ) ;;; Tests (no-repeats (list 5 4 5 4 2 2)) ; expect (5 4 2)
True/False Select true or false for the statements below. Explain your answers if you like to receive partial credit. 3) Which of the following is true about the insertBeforeCurrent function for a CircularLinked List (CLL) like you did in programming exercise 1?a. If the CLL is empty, you need to create the new node, set it to current, andhave its next pointer refer to itselfb. The worst case performance of the function is O(n)c. If you insert a new element with the same data value as the current node, theperformance improves to O(log n)