What is the time complexity for adding an element to the end of Linked List?

• O(1)
• O(Nˆ2)
• O(logN)
• O(N)

Which of the following is not the type of queue?

• Ordinary queue
• Circular queue
• Priority queue
• Single ended queue

What is double-linked list?

• each node points to the next node
• last node points to the first
• each node points to all previous nodes
• each node points to the next and previous nodes

Which among the following is the worst-case time complexity for appending an element in a variable-length array?

• O(n)
• O(n2)
• O(log n)
• O(1)

Specify ArrayList advantages over LinkedList

• arrayList is better for manipulating the data
• adding and removing an element
• less memory usage
• increasing the size

What will be the result of nested statements/loops or recursion?

• O(1)
• O(n^2 + n)
• O(n^2)
• O(n)

We can use the following recursive function to search an array of sorted numerical values to find a specific number in that array (or return -1 if the value isn't in the array): function searchSortedArray(number, array, beginIndex = 0, endIndex = array.length - 1) { let middleIndex = Math.floor((beginIndex + endIndex)/2); if (array[middleIndex] === number)  {    return middleIndex;  } else if (beginIndex >= endIndex)  {    return -1;  } else if (array[middleIndex] < number)  {    beginIndex = middleIndex + 1;    return searchSortedArray(number, array, beginIndex, endIndex);  } else if (array[middleIndex] > number)  {    endIndex = middleIndex - 1;    return searchSortedArray(number, array, beginIndex, endIndex);  } }

• O(n*n)
• O(nlogn)
• O(logn)
• O(n)

hich of the statements below is not related to recursion

• Termination when loop-continuation condition fails
• Problem division
• Implementation of the selection statements
• Repetitve method calls

This method will return true onlu in case if: public static boolean check (String s) {  return s.length( ) >= 2 && (s.charAt(0) == s.charAt(1) || check(s.substring(1)));}

• The string s contains two or more of the same character that are next to each other.
• The string s contains two or more of the same characters.
• The string s ends with two or more of the same characters
• The string s starts with two or more of the same characters.

Find the complexity of the below program: static void function(int n) { if (n==1) return; { for (int i=1; i<=n; i++)     { for (int j=1; j<=n; j++)            System.out.print("*");            break;      }   System.out.println(); } }

• O(logn)
• O(n*n)
• O(n)
• O(nlogn)