Select true or false for the statements below. Explain your answers if you like to receive partial credit

Select true or false for the statements below. Explain your answers if you like to receive partial credit

Which of the following is true about searching elements in an unordered array?

With the data is unsorted, search is O(n) because if the element you are looking for is not there, you have to check every element in the array

If you start at the end of the array and traverse to index 0, search improves to O(log n) because you only have to look at half of the array

If you get lucky with checking the first element and find it immediately, then the worst case performance of search improves to O(n^2)

Which of the following is true about searching elements in an ordered array?

You cannot use binary search on an ordered array so the performance is O(n)

If there are no holes in the array and the elements are all next to each other, then the performance for search improves to O(1)

If you do a linear search on a sorted array, the performance improves to O(log n)

Which of the following is true about the insertBeforeCurrent function for a Circular Linked List (CLL) like you did in programming exercise 1?

If the CLL is empty, you need to create the new node, set it to current, and have its next pointer refer to itself

The worst case performance of the function is O(n)

If you insert a new element with the same data value as the current node, the performance improves to O(log n)

Given a stack implemented as a standard linked list (only a head pointer) with O(1) push and O(1) pop, and the following functions are performed in sequence:

Push(“Charmander”), Push(“Squirtle”), Push(“Bulbasaur”), Pop(), Push(“Larvitar”), Push(“Eevee”), Pop(), Pop()

Which of the following is true after all the functions are executed?

Charmander and Squirtle will be the only elements left on the stack

The head node will be pointing to Charmander

If you Push(“Pikachu”), it will be the last node of the linked list

Which of the following is true about using the binary search algorithm in a sorted array with no holes and always keeping the order of the array intact?

Binary search improves the performance of delete to O(log n)

Binary search improves the performance of update to O(log n)

Binary search improves the performance of search to O(log n)

Given an array [10 9 8 7 6 5 4 3 2 1], which of the following is true of the following sorting algorithms if we wanted to sort this array into ascending order?

If we used optimized bubble sort on this array, the performance is O(n)

If we used MergeSort on this array, the performance is O(n log n)

If we used InsertionSort on this array, the performance is near O(n)

Which of the following is true about Big-O notation?

If we say an algorithm performs at O(n), you will get the same number of operations executed no matter how large the data set grows in size

If algorithm 1 is O(n) and algorithm 2 is O(1), algorithm 1 is considered to be significantly better than algorithm 2

O(n log n) is significantly better than O(n)

Which of the following is true about the delete function in a standard linked list (only a head pointer and nodes only having a next pointer)?

There is only 1 scenario to consider when looking for a node to delete in a linked list

When you traverse the list to find the element to delete, it improves the performance to O(1)

You should always check first to see if the list is empty before attempting to find and delete a node

Which of the following is true about the Mergesort algorithm applied to an array of numbers that are all different?

Memory usage is efficient because all swaps take place within the same array

Performance is consistently at O(n log n) for all array scenarios

When the partition function completes on the array, the pivot element will always be in the exact center of the array

Which of the following is true about the linked list functions where the linked list only contains a head pointer?

If the linked list is ordered, you can use binary search and improve the performance to O(log n)

The worst case performance of the delete function is in the same Big-O category as the worst case performance of the delete function with an unordered array

If the node you are deleting is at the end of the list, the performance is O(1)

Question

Select true or false for the statements below. Explain your answers if you like to receive partial credit

Which of the following is true about searching elements in an unordered array?
1. With the data is unsorted, search is O(n) because if the element you are looking for is not there, you have to check every element in the array
2. If you start at the end of the array and traverse to index 0, search improves to O(log n) because you only have to look at half of the array
3. If you get lucky with checking the first element and find it immediately, then the worst case performance of search improves to O(n^2)

Which of the following is true about searching elements in an ordered array?
1. You cannot use binary search on an ordered array so the performance is O(n)
2. If there are no holes in the array and the elements are all next to each other, then the performance for search improves to O(1)
3. If you do a linear search on a sorted array, the performance improves to O(log n)

Which of the following is true about the insertBeforeCurrent function for a Circular Linked List (CLL) like you did in programming exercise 1?
1. If the CLL is empty, you need to create the new node, set it to current, and have its next pointer refer to itself
2. The worst case performance of the function is O(n)
3. If you insert a new element with the same data value as the current node, the performance improves to O(log n)

Given a stack implemented as a standard linked list (only a head pointer) with O(1) push and O(1) pop, and the following functions are performed in sequence:

Push(“Charmander”), Push(“Squirtle”), Push(“Bulbasaur”), Pop(), Push(“Larvitar”), Push(“Eevee”), Pop(), Pop()

Which of the following is true after all the functions are executed?

Charmander and Squirtle will be the only elements left on the stack
The head node will be pointing to Charmander
If you Push(“Pikachu”), it will be the last node of the linked list

Which of the following is true about using the binary search algorithm in a sorted array with no holes and always keeping the order of the array intact?

Binary search improves the performance of delete to O(log n)
Binary search improves the performance of update to O(log n)
Binary search improves the performance of search to O(log n)

Given an array [10 9 8 7 6 5 4 3 2 1], which of the following is true of the following sorting algorithms if we wanted to sort this array into ascending order?
1. If we used optimized bubble sort on this array, the performance is O(n)
2. If we used MergeSort on this array, the performance is O(n log n)
3. If we used InsertionSort on this array, the performance is near O(n)

Which of the following is true about Big-O notation?

If we say an algorithm performs at O(n), you will get the same number of operations executed no matter how large the data set grows in size
If algorithm 1 is O(n) and algorithm 2 is O(1), algorithm 1 is considered to be significantly better than algorithm 2
O(n log n) is significantly better than O(n)

Which of the following is true about the delete function in a standard linked list (only a head pointer and nodes only having a next pointer)?

There is only 1 scenario to consider when looking for a node to delete in a linked list
When you traverse the list to find the element to delete, it improves the performance to O(1)
You should always check first to see if the list is empty before attempting to find and delete a node

Which of the following is true about the Mergesort algorithm applied to an array of numbers that are all different?

Memory usage is efficient because all swaps take place within the same array
Performance is consistently at O(n log n) for all array scenarios
When the partition function completes on the array, the pivot element will always be in the exact center of the array

Which of the following is true about the linked list functions where the linked list only contains a head pointer?

If the linked list is ordered, you can use binary search and improve the performance to O(log n)
The worst case performance of the delete function is in the same Big-O category as the worst case performance of the delete function with an unordered array
If the node you are deleting is at the end of the list, the performance is O(1)

Accepted Answer

Note: This is a multiple-question-based problem. As per company guidelines, only the first question…