a.
To find whether a list is a collection of elements of the same type or not.
a.
True.
Explanation of Solution
Explanation:
A list is a collection of elements that are of the same type. The elements of the list can be stored in a one-dimensional array. The size of the list can be described with the help of the number of elements that it can store.
Conclusion:
Therefore, the given statement is true.
b.
To find whether the sequential search of the elements in a list assumes that the elements are sorted or not.
b.
False.
Explanation of Solution
Explanation:
In a sequential search, the desired element is searched sequentially. The element is compared from the first element in the list to the last element in the list until the desired element is found in the list. The sequential search does not assume that the list is sorted in any order.
Conclusion:
Therefore, the given statement is false.
c.
To find whether the given statement is true or not.
For a list of 100 elements, whether the number of key comparisons is 5050 or not.
c.
False.
Explanation of Solution
Explanation:
The bubble sort is a sorting technique that sorts the list of elements by comparing them to each other. The first element is compared to the next element and sorted if required. Then, it is compared to the next element and so on until it is placed in its proper place. This process is repeated until the entire list is sorted.
The key comparisons in bubble sort are calculated using the formula:
where n is the number of elements in the list.
Here,
Number of key comparisons
Conclusion:
Therefore, as per the above calculation, the given number of comparisons are not correct. Hence, the given statement is false.
d.
To find whether the binary search of the elements in a list assumes that the elements are sorted or not.
d.
True.
Explanation of Solution
Explanation:
The binary search technique is a searching technique in which the middle element of the list is calculated. Then the middle element is compared with the element that needs to be searched from the list. If it matches then the search is successful otherwise another list is chosen and again the middle element is calculated. This process is repeated until the desired element is not found in the list.
The elements in binary search are sorted in a certain order. The order may be ascending or descending. The binary search on a list assumes that the list of elements is sorted.
Conclusion:
Therefore, the given statement is true.
e.
To find whether the binary search is faster on the ordered list and slower on the unordered list of elements is true or not.
e.
False.
Explanation of Solution
Explanation:
The elements in binary search are sorted in a certain order. The order may be ascending or descending. The only necessary condition to search an element in the given list using the binary search technique is that the list must be sorted.
The binary search applies to an ordered list of elements. The search operation is performed using the binary search technique if the list is ordered. It cannot be applied to the unordered list of elements.
Conclusion:
Therefore, the given statement is false.
f.
To find whether the given statement “a binary search is faster on larger lists and a sequential search is faster on smaller lists” is correct or not.
f.
True.
Explanation of Solution
Explanation:
The binary search is performed on a sorted list of elements. Whenever the medium of the list is calculated half of the list is rejected based on the elements that need to be searched in the list. It shortens the list in every step. So, it is faster on larger lists.
While the sequential search is performed on unsorted lists. The element is searched till the end of the list. It increases the execution time of the sequential search. So, it is more suitable for the smaller lists.
Conclusion:
Therefore, the given statement is true.
g.
To find whether a
g.
False.
Explanation of Solution
Explanation:
A list is implemented using the vector type. It is implemented in the same as the array is implemented. The only difference is that the size of the vector can increase during the time of execution. If the vector object of size 10 is declared, it can shrink or expand to store more or fewer elements than 10.
Conclusion:
Therefore, the given statement is false.
h.
To find whether the given statement “the expression vecList.capacity() returns the number of elements that can be added to the vecList” is correct or not.
h.
True.
Explanation of Solution
Explanation:
The vector class contains many operations that can be performed on the vector object. The vecList.capacity() is the operation that returns the number of elements that can be added to the vecList.
Conclusion:
Therefore, the given statement is true.
Want to see more full solutions like this?
Chapter 16 Solutions
EBK C++ PROGRAMMING: FROM PROBLEM ANALY
- Select which of the following statements about searching for items in a list is incorrect. Group of answer choices 1. In an unsorted list, if the item is not present in the list, we will need to check every single item. In a sorted list, if we start the search at the smallest item, at most we would only need to check all items smaller than the target. If we get to an item larger than the target we can end our search early. This would make searching faster in the sorted list. 2. Sorting a list only makes sense for primitive types (ints, doubles) and Strings but not objects. For this reason we cannot sort a list of objects, and will always have to check each object in a list when we search for a target object. 3. In an unsorted list you need to check each item, to see if it is the item you want. If the list is sorted you can look at the middle item and then you can direct your search to the relevant portion of the list (higher or lower). This is called binary search. This will…arrow_forwardOld MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.arrow_forwardData Structure and algorithms ( in Java ) Please solve it urgent basis: Make a programe in Java and attach the image of output screen: Question 4: Write a programe which has function name RemoveDuplicates() which takes a list sorted in increasing order and delete any duplicate nodes from the list. Ideally, the list should only be traversed once.arrow_forward
- please code in python Forbidden concepts: recursion, custom classes Create a program that finds all the prime numbers between 2 to 1000. As each is found, add it to the list, then print the list in an organized fashion.arrow_forwardWrite a function to sort a linked list of integers as follows: a) Find the largest value in the list. (the student should implement this function) b) delete it from its position and insert it at the head of the list. c) starting from what is now the second element, repeat (a) and (b). d) starting from what is now the third element, repeat (a) and (b). Continue until the list is sorted. please answer it in C++arrow_forwardQuestion 2 A doubly linked list may be referred to as a complex type of linked list in which a node contains a pointer to the previous node (previous pointer) as well as the next node (next pointer) in the sequence. You have been given the following fruits: Apple, Lemon, Orange, Grape, Strawberry, Mango, Banana, Peach. Write a Python program that will insert these fruits into a sorted doubly linked list.arrow_forward
- NEED HELP WITH 2-D list. (PYTHON) For e.g., the following is another example of 2-D multidimensional list. Each row contains student name followed by their grades in 5 subjects: students = [ ['Anna', 98.5, 77.5, 89, 93.5, 85.5], ['Bob', 77, 66.5, 54, 90, 85.5], ['Sam', 98, 97, 89.5, 92.5, 96.5] ] To access, a specific row, you would use students[row_number][column_number]. students[0][0] would print 'Anna' students[0][1] would print 98.5 Create your own 2-D list with at-least 5 students and their grades in 5 subjects like the example above. Write a nested for/while loop that would use find the total of 5 subjects for each student and stores that into a sepearate list. Display the Total for each student.arrow_forward1a. Distinguish between singly-linked lists and doubly-linked lists. Give examples to illustrate your answer. 1b. You are preparing for your mid-semester examinations in an empty lecture hall at school. You left your laptop unattended for 15 minutes and returned to find that it was missing/stolen. Describe an algorithm to search for, and find, your missing/stolen laptop.arrow_forwardComplete using Standard C programming. Implement a singly linked list that performs the following: Displays the maximum value in the linked list using recursion. Displays the linked list in reverse order using recursion. Merge two single linked lists and display.arrow_forward
- Write proceedures for the following: 1) Given a 9x9 grid of numbers (lists of lists, so [[1,2,3,4,5,6,7,8,9],[3,4,5,1,2,6,7,8,9],....]), a column number, and a fixed number between 1 and 9, determine if the fixed number appears in the column. (Unimportant here, but missing numbers for an incomplete grid will be zeros). The program should return a true or false.arrow_forwardExercise 6 Write a quicksort function of type int list -> int list. Here's a review of the quicksort algorithm. First pick an element and call it the pivot. (The head of the list is an easy choice for the pivot.) Partition the rest of the list into two sublists, one with all the elements less than the pivot and another with all the elements not less than the pivot. Recursively sort the sublists. Combine the two sublists (and the pivot) into a final sorted list.arrow_forwardPython only* Use recursive function*. Define colorListCircles with 2 parameters Use def to define colorListCircles with 2 parameters The colorListCircles function must draw concentric circles using colors from a list. It has two parameters: the first specifies the radius of the largest circle, and the second is a list of colors. The number of concentric circles drawn is the length of the list, and these circles are colored, from largest to smallest, by the colors in the list from first to last. When viewed as nested rings, all rings should have the same thickness. If the list is empty, nothing should be drawn. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order, you may not use any loops and you must use recursion. Also, you will still need to use drawDot. For full credit, your function should call drawDot in only one place, and should only contain one recursive call. Do not use any kind of loop Within the definition…arrow_forward
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning