8. To create a list to store integers, use a. ArrayList list = new ArrayList<>(); b. ArrayList list = new ArrayList<>() ; c. ArrayList list = new ArrayList<>(); d. ArrayList list = new ArrayList();

In c++ please

C++ programming It’s my humble request don’t use chegg Given a set of integer values of size n (each separated by a space), construct a singly linked list in order using the first value as the head of the linked list. Print this linked list. Then, sort the linked list in ascending order using selection sort algorithm. Print this new linked list. You may assume that the data will contain at least 2 values. You MUST use a linked list implementation of this exercise to receive credit. You must use the formatting below in your solution. Case1: Input: 5 4 1 6 2 3 Output: [5, 4, 1, 6, 2, 3] [1, 2, 3, 4, 5, 6] Case1: Input: 0 -1 4 -22 Output: [0, -1, 4, -22] [-22, -1, 0, 4]

6. Consider the following code segment: ArrayList list = new ArrayList(10) ; list.add( "Ali" ); list.add( "Ahmed" ); list.add( "Hassan" ); list.add( 0, "Qasim" ); Which of the following elements will be at index 1 of the list? K Ali Ahmed Hassan Qasim

ASSUMING C LANGUAGE True or False: You can have the data portion of a Linked List be a Struct containing a Linked List itself

Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; curNode=curNode->getNext(); curNode=curNode->getNext(); int a=curNode->getItem()<<endl; Group of answer choices A.4 B.2 C.5 D.6

C++

What is the biggest advantage of linked list over array? Group of answer choices Unlike array, linked list can dynamically grow and shrink With linked list, it is faster to access a specific element than with array Linked list is easier to implement than array Unlike array, linked list can only hold a fixed number of elements

please go in to the detail and explain the purpose and function to each line & function of code listed below. #include <stdio.h> //Represent a node of the singly linked list struct node{ int data; struct node *next; }; //Represent the head and tail of the singly linked list struct node *head, *tail = NULL; //addNode() will add a new node to the list void addNode(int data) { //Create a new node struct node *newNode = (struct node*)malloc(sizeof(struct node)); newNode->data = data; newNode->next = NULL; //Checks if the list is empty if(head == NULL) { //If list is empty, both head and tail will point to new node head = newNode; tail = newNode; } else { //newNode will be added after tail such that tail's next will point to newNode tail->next = newNode; //newNode will become new tail of the list tail = newNode; } }...

Assume a linked list contains following integers: 7, 2, x, 5, 8, x, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; curNode=curNode->getNext(); curNode=curNode->getNext(); int a; a=curNode->getItem(); 1. x 2. 2 3. 7 4. x+9

C++The List class represents a linked list of dynamically allocated elements. The list has only one member variable head which is a pointer that leads to the first element. See the following code for the copy constructor to List. List (const List & list) { for (int i = 0; i <list.size (); i ++) { push_back (list [i]); } } What problems does the copy constructor have? Select one or more options: 1. List (const List & list) {} does not define a copy constructor. 2. The list parameter should not be constant. 3. The new elements will be added to the wrong list. 4. Copy becomes shallow rather than deep. 5. The copy will create dangling pointers. 6. Copying will create memory leaks. 7. The condition must be: i <size () 8. head is never initialized.

void listEmployees (void) { for (int i=0; i 10000. Make a guess about why the comparison function takes 2 struct Employee parameters (as opposed to struct Employee *) **

Data Structure and algorithms ( in Java ) Please solve it urgent basis: Make a programe in Java with complete comments detail and attach outputs image: Question is inside the image also: a). Write a function to insert elements in the sorted manner in the linked list. This means that the elements of the list will always be in ascending order, whenever you insert the data. For example, After calling insert method with the given data your list should be as follows: Insert 50 List:- 50 Insert 40 List:- 40 50 Insert 25 List:- 25 40 50 Insert 35 List:- 25 35 40 50 Insert 40 List:- 25 35 40 40 50 Insert 70 List:- 25 35 40 50 70 b). Write a program...