write a vb.net program to read from keyboard 10 values into: (using subs) 1- dynamic array 2- arraylist 3- queue 4- stack print of the screen values from each method in different subs. use the following as you see suitable(in different subs or functions): *setvalue *all arraylist functions *all queues and stacks operations

write a vb.net program to read from keyboard 10 values into: (using subs) 1- dynamic array 2- arraylist 3- queue 4- stack print of the screen values from each method in different subs. use the following as you see suitable(in different subs or functions): setvalue all arraylist functions *all queues and stacks operations

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Assume you have the max-heap 100, 80, 70, 60, 50, 40, 30, 50, 10, 20. What is the final state of the array after one full iteration of heapsort (stop before the recursive call ono sub arrays, Sorts from min to max values, pivot placed at the end) is called? 80, 60, 70, 50, 50, 40, 30, 30, 20, 10, 100 80, 60, 70, 50, 50, 40, 30, 30, 20, 10 100, 80, 70, 60, 50, 50, 40, 30, 30, 20, 10 100, 80, 60, 70, 50, 50, 40, 30, 30, 20, 10 60, 70, 50, 50, 40, 30, 30, 20, 10, 100, 80 Assume you have the following array: 8, 5, 30, 15, 100, 10, 20. What will the array look like after a single pass of the Partition part of the quicksort algorithm (Min to max value, pivot placed at the end)? 5, 8, 15, 20, 30, 10 8, 5, 15, 10, 20, 30, 100 8, 5, 15, 10, 20, 100, 30 8, 5, 15, 10, 100, 30, 20 15, 8, 5, 20, 100, 30 Assume you have the array 7,9,6,10,3,5,8, what are the swaps that occur when we call build-min-heap? 6-5, 9-3 9-3, 7-3 6-5, 7-3, 9-3 9-3, 7-3, 6-5 6-5, 9-3, 7-3 Assume we have the array…
7. For a given input array, write a code in c or c++ to construct a Max-Heap using the following algorithms.The code should use inherently the same algorithms which were discussed in the class. (a) Build-Max-Heap(b) Max-Heap-Insert
What are the properties of a heap? What is the running time of heap sort on an array A of length n that is already sorted in increasing order? What about the same in decreasing order? Lastly, trace out the heap sort algorithm for the following list: {25, 44, 55, 99, 30, 37, 15, 10, 2, 4} in Python. Your activity should include the following in Python: 1. A description of the algorithm(s) and, if helpful, pseudocode. 2. At least one worked example or diagram to show more precisely how the algorithm(s) works. Paper should be 2-3 pages in length (not including title and references pages)
For each of the following scenarios choose the “best” data structure from the following list or acombination of data structures: an UNSORTED ARRAY, LINK LIST, DLL, circular LINKLIST, STACK, QUEUE, DOUBLE ENDED QUEUE, HEAP, BST. In each case, justify youranswer briefly.i. When the data dynamically growsii. A list must be maintained so that any element can be accessed randomlyiii. A program needs to remember operations it performed in opposite orderiv. If the developer wants to add or remove both endsv. Whenever the developer wants quick access to the largest (or smallest) item.
In C++, Implement a Priority Queue(PQ) using an UNSORTED LIST. Use an array size of 20 elements. Use a circular array: Next index after last index is 0. Add the new node to next available index in the array. When you add an element, add 1 to index (hit max index, go to index 0). Test if array in full before you add. When you remove an element, from the list, move the following elements to the left to fill in the blank, etc ( Like prior program done with LISTS ) Create a class called Node: Have a Name and Priority. Data set - 1 is the highest priority, 10 is lowest priority. Enqueue and dequeue in the following order. Function Name, Priority Enqueue Joe, 3 Enqueue Fred, 1 Enqueue Tuyet, 9 Enqueue Jose, 6 Dequeue Enqueue Jing, 2 Enqueue Xi, 5 Enqueue Moe, 3 Dequeue Enqueue Miko, 7 Enqueue Vlady, 8 Enqueue Frank, 9 Enqueue Anny, 3 Dequeue Enqueue Xi, 2 Enqueue Wali, 2 Enqueue Laschec, 6 Enqueue Xerrax, 8 Dequeue Dequeue Dequeue Dequeue Dequeue Dequeue Dequeue Dequeue Dequeue Dequeue…
In the Mergesort, the idea is to merge two arrays or list of two numbers, where each of those arrays are sorted. The merged array becomes fully sorted. The following code snippet makes the process of merge happen. Assume an array A={4, 11, 2, 9, 6}, where we want to split that array and then merge it. If we call the function "merge(A, 0, 2, 4)", how would the array A look like after the merge operation?* 4, 11, 2, 9, 6 2, 4, 6, 9, 11 4, 11, 9, 2, 6 4, 11, 6, 9, 2 11, 9, 6, 4, 2 4, 9, 6, 11, 2
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order: [C; A; G; B; D; F; E]. Answer the two questions that follow. What follows is a fill in the blank question with 7 blanks. Show the array's contents after the first deletion operation has been performed on the heap resulting from the previous question. Fill in only one letter in each open space.[ Blank 1.______. ; Blank 2. ______. ; Blank 3. ________. ; Blank 4. ______. ; Blank 5. __________ ; Blank 6. ________-. ; Blank 7. _____-. ]
In the below stack allocation, what is the current value of top after execution of the following code (i.e. after the function using the second activation record)? Hint: remember that stacks grow from highest address toward lower address. StackAllocatr m = new StackAllocatr(5); m.push(1); m.push(2); m.pop
Consider a list L = {387, 690, 234, 435, 567, 123, 441}. Here, the number ofelements n = 7, the number of digits l = 3 and radix r = 10. This means that radixsort would require 10 bins and would complete the sorting in 3 passes. illustrates the passes of radix sort over the list. It is assumed that each key is thrown into the bin face down. At the end of each pass, when the keys are collected from each bin in order, the list of keys in each bin is turned upside down to be appended to the output list
2. You have a large array that you want to be sorted In ascending order. Under what circumstances would the bubblesort algorithm sort that array very quickly? A. if the array is initially in descending order B. if the array elements can be mapped to a linked list C. if the array elements are already close to their eventual sorted position D. if the array elements are string objects E. never, heapsort will always be faster
Consider the following program: char *g() { char message[13] = {'H','i',' ','!','H','i',' ','!','H','i',' ','!', '\0'}; return message; } Why is this bad programming practice? A. Returns a pointer to address on the stack B. %rax is not big enough to hold the array C. Return type and returned value have different types D. We can't return a pointer to a value on the heap
bubblesort.h is in second picture This is bublesort.c int compare(Entry a, Entry b) {// IMPLEMENT}/*TEST: ./mergesort < test.inOUTPUT:1 lsdfjl2 ghijk3 ksdljf5 abc6 def*/int main(void) {// IMPLEMENT} this is test.in 55 abc6 def2 ghijk3 ksdljf1 lsdfjl