For the terminology stored in each cell of the table below, choose a corresponding key point from the Hints section below and put the number (not the text). Some choices may be used multiple times or not at all. Dictionary(map) ADT: Quicksort: Mergesort: Radix sort over big integer numbers: Insertion sort: Selection sort: Heapsort: Counting sort over a small range of integers: Bucket sort: Bubble sort: Depth-First-Search: Bellman-Ford’s algorithm: Prim’s algorithm: Dijkstra’s algorithm: 0-1 knapsack problem: Hints : sorting: continuously swapping elements while finding the next number to add in the sorted sublist sorting: an improved selection sort - extracting the root of a binary tree to get the maximal/minimal key sorting: removing one element from the input data, then finding the location it belongs within the sorted sublist, and inserts it there sorting: in general, sorting the least significant position first sorting: finding the smallest element in the unsorted sublist sorting: partition into two sub-arrays around a pivot value then making recursive calls sorting: recursively dividing into two sub-arrays first then merge them to produce new sorted sublists sorting: parallel processing for all the input data sorting: its efficiency is heavily depending on the uniform distribution of input data sorting: non-comparison algorithm utilizing integer characteristics by counting the number of objects that have each distinct key value sorting: branch and bound among input data elements completely connected graph handling negative edge cost in finding the single-source shortest path finding values by key, not by positional information such as index a non-deterministic polynomial (NP) problem finding shortest paths from a source to all other nodes on the graph producing a shortest-path tree a dynamic programming solution a greedy choice solution tree of n-1 edges (n: number of vertices) use a queue to traverse an entire graph use a stack to traverse an entire graph

For the terminology stored in each cell of the table below, choose a corresponding key point from the Hints section below and put the number (not the text). Some choices may be used multiple times or not at all. Dictionary(map) ADT: Quicksort: Mergesort: Radix sort over big integer numbers: Insertion sort: Selection sort: Heapsort: Counting sort over a small range of integers: Bucket sort: Bubble sort: Depth-First-Search: Bellman-Ford’s algorithm: Prim’s algorithm: Dijkstra’s algorithm: 0-1 knapsack problem: Hints : sorting: continuously swapping elements while finding the next number to add in the sorted sublist sorting: an improved selection sort - extracting the root of a binary tree to get the maximal/minimal key sorting: removing one element from the input data, then finding the location it belongs within the sorted sublist, and inserts it there sorting: in general, sorting the least significant position first sorting: finding the smallest element in the unsorted sublist sorting: partition into two sub-arrays around a pivot value then making recursive calls sorting: recursively dividing into two sub-arrays first then merge them to produce new sorted sublists sorting: parallel processing for all the input data sorting: its efficiency is heavily depending on the uniform distribution of input data sorting: non-comparison algorithm utilizing integer characteristics by counting the number of objects that have each distinct key value sorting: branch and bound among input data elements completely connected graph handling negative edge cost in finding the single-source shortest path finding values by key, not by positional information such as index a non-deterministic polynomial (NP) problem finding shortest paths from a source to all other nodes on the graph producing a shortest-path tree a dynamic programming solution a greedy choice solution tree of n-1 edges (n: number of vertices) use a queue to traverse an entire graph use a stack to traverse an entire graph

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

Related questions

Question

For the terminology stored in each cell of the table below, choose a corresponding key point from the Hints section below and put the number (not the text). Some choices may be used multiple times or not at all.

Dictionary(map) ADT:	Quicksort:	Mergesort:	Radix sort over big integer numbers:	Insertion sort:
Selection sort:	Heapsort:	Counting sort over a small range of integers:	Bucket sort:	Bubble sort:
Depth-First-Search:	Bellman-Ford’s algorithm:	Prim’s algorithm:	Dijkstra’s algorithm:	0-1 knapsack problem:

Hints :

sorting: continuously swapping elements while finding the next number to add in the sorted sublist
sorting: an improved selection sort - extracting the root of a binary tree to get the maximal/minimal key
sorting: removing one element from the input data, then finding the location it belongs within the sorted sublist, and inserts it there
sorting: in general, sorting the least significant position first
sorting: finding the smallest element in the unsorted sublist
sorting: partition into two sub-arrays around a pivot value then making recursive calls
sorting: recursively dividing into two sub-arrays first then merge them to produce new sorted sublists
sorting: parallel processing for all the input data
sorting: its efficiency is heavily depending on the uniform distribution of input data
sorting: non-comparison algorithm utilizing integer characteristics by counting the number of objects that have each distinct key value
sorting: branch and bound among input data elements
completely connected graph
handling negative edge cost in finding the single-source shortest path
finding values by key, not by positional information such as index
a non-deterministic polynomial (NP) problem
finding shortest paths from a source to all other nodes on the graph producing a shortest-path tree
a dynamic programming solution
a greedy choice solution
tree of n-1 edges (n: number of vertices)
use a queue to traverse an entire graph
use a stack to traverse an entire graph

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.