A binary search only works if the values in the list are sorted. A bubble sort is a simple way to sort entries. The basic idea is to compare two adjacent entries in a list-call them entry[j] and entry[j+1]. If entry[j] is larger, then swap the entries. If this is repeated until the last two entries are compared, the largest element in the list will now be last. The smallest entry will ultimately get swapped, or "bubbled" up to the top. The algorithm could be described in C as: last = num; while (last > 0) { pairs = last - 1: for (j = 0; j <= pairs; įtt) { if (entryli) > entry (j+1] { temp = entrylil: entryli] = entrylj+1]l: entrylj+1] = temp: last = 1: } Here, num is the number of entries in the list. Write an assembly language program to implement a bubble sort algorithm, and test it using a list of 8 elements. Each element should be a halfword in length. Please show your code works with the Keil tools or VISUAL, by grabbing a screen shot with your name somewhere on the screen.

A binary search only works if the values in the list are sorted. A bubble sort is a simple way to sort entries. The basic idea is to compare two adjacent entries in a list-call them entry[j] and entry[j+1]. If entry[j] is larger, then swap the entries. If this is repeated until the last two entries are compared, the largest element in the list will now be last. The smallest entry will ultimately get swapped, or "bubbled" up to the top. The algorithm could be described in C as: last = num; while (last > 0) { pairs = last - 1: for (j = 0; j <= pairs; įtt) { if (entryli) > entry (j+1] { temp = entrylil: entryli] = entrylj+1]l: entrylj+1] = temp: last = 1: } Here, num is the number of entries in the list. Write an assembly language program to implement a bubble sort algorithm, and test it using a list of 8 elements. Each element should be a halfword in length. Please show your code works with the Keil tools or VISUAL, by grabbing a screen shot with your name somewhere on the screen.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a pyhton program that starts with an empty list. Your program must ask theuser for a positive integer n, generate n random integers in the range [1-10] (inclusive),store them in that list, and print it.Your program then must repeatedly ask the user to enter a number and a string to replaceall occurrences of that number in the list with that string (e.g., replace all 1’s with "hello",all 8’s with “hi”, etc.). At every iteration, print the updated list and the number of times anumber was replaced. Your program stops when the user enters ‘q’. Input validation isoptional. Hint: use a for (counter controlled) loop inside a while (event-controlled) loop. Sample output:n >> 13List: [1, 3, 3, 9, 5, 7, 8, 2, 10, 8, 4, 1, 1]Enter a number to change ['q' to quit]>> 1with string >> helloList: ['hello', 3, 3, 9, 5, 7, 8, 2, 10, 8, 4, 'hello', 'hello']The number 1 was replaced 3 timesEnter a number to change ['q' to quit]>> 8with string >> hiList: ['hello', 3, 3,…
Consider a doubly-linked list with n elements which are sorted. Which of the following statements are true? i. insert(k) (inserting the element k at the correct place) will take O(1) time. ii. search(k) will take O(1) time. Select one: a.) None of them are true b.) Only i is true c.) Both of them are true d.) Only ii is true
The Bubble Sort for a list of numbers x0, x1, . . . , xn works as follows: (i) if x0 > x1, switch their values; (ii) now do the same for x1 and x2, then for x2 and x3, all the way down the list to xn−1 and xn; (iii) if at least one switch was made go back to (i), otherwise you’re done. When you’re done you will have x0 x1 x2 · · · xn. Write a program BubbleSort.py to ask the user for the number n. Generate n + 1 random numbers x0, x1, . . . , xn on the interval [0, 1] using random.random(). Bubble sort the numbers and present them in increasing order. I’m sure you can find code to do this online but WRITE YOUR OWN CODE
There is a variation of the bubble sort algorithm called a gapsort that, rather than comparing neighboring elements eachtime through the list, compares elements that are some numberi positions apart, where i is an integer less than n. For example,the first element would be compared to the (i + 1) element, thesecond element would be compared to the (i + 2) element,the nth element would be compared to the (n - i) element,and so on. A single iteration is completed when all of theelements that can be compared, have been compared. On thenext iteration, i is reduced by some number greater than 1and the process continues until i is less than 1. Implement agap sort.
Write a program in Java to implement the Insertion sort algorithm to sort a given set of elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted, and plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator
Implement the following method in parallel to sort a list usingquick sort: public static void parallelQuickSort(int[] list) Write a test program that times the execution time for a list of size 9,000,000 usingthis parallel method and a sequential method.
Given a string formed with 0’s and 1’s. The string is marked with a special character X that represents the middle of the string (for example: 0101011X1101010). Write an algorithm to check whether the string is palindrome or not: (a) If the string is stored as an array (b) If the string is stored as a singlv linked list
In this lab the task is to write a program that maintains a personal phone book. The program allows to: ▪ Add and Delete entries from the phone book, ▪ Search the phone book for a specific entry by last name or by phone number, and ▪ Print out the entire entries in the phone book. The data in the phone book is maintained by storing in memory with the use of a singly linked list, with one list node per entry. Each node contains members for storing a person’s family name, first name, address, and the phone number. Use strings to store this information. The linked list must be kept in increasing alphabetical order, sorted by family name. There are no duplicate entries with the same family name allowed in the phone book. This program should be menu driven, with the user being offered a choice of the following commands described below: ▪ Insert a new entry into the phone book. The program should prompt the user for a new family name and first name, an address and a phone number. This…
using arrays or Arraylist in Java language Write the method filterBySize().* * Given an ArrayList of String, return a new list where only * strings of the given length are retained.* * Examples:* filterBySize(["a", "bb", "b", "ccc"], 1) returns ["a", "b"]* filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"]* filterBySize(["a", "bb", "b", "ccc"], 4) returns []* * @param list the list of Strings to process.* @param n the size of words to retain.* @return a new list of words with the indicated size retained.
Fill a linked list with five million random values. Traverse the entire list (not print) using Iterator with .next() get(4999999) Measure the elapsed time for each approach using System.nanoTime(). Report the results.
Implement a nested class DoubleNode for creating doubly-linked lists, with each node containing a reference to the item before and following it in the list (empty if no such item exists). Then, for the following jobs, implement static methods: insert at the beginning, insert at the end, remove from the beginning, remove from the end, insert before a given node, insert after a given node, and remove a given node.
Instead of reading in an entire list N1,N2,⋯N1,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. Write a java program and please share the code / an example of the code working.