COMPUTER PROGRAMMING 2- SEATWORK 1- INTRO TO DATA STRUCTURES

What do you call a collection of items stored at contiguous memory locations?

• Linked List

• Array

• Linear List

• Data Structure

Which of the following are examples of Data Structures?

• Linear List

• Linked List

• Stacks

• Trees

• Pseudocodes

A ____________ is a linear data structure, in which the elements are not stored at contiguous memory locations

What does LIFO stand for?

• Last In First Out

• Last In Flow Out

• Least In Flow Out

• Last In First Output

Which of the following is NOT an example of sorting algorithms?

• Bubble

• Selection

• Hashing

• Heap

The ___________ sorting works by comparing each item in the list with the item next to it, and swapping them if required.

What do you call this algorithm that sorts an array by repeatedly finding the minimum element from unsorted part and putting it at the beginning?

• Insertion

• Quick sort

• Selection

• Heap

Like Quick Sort, Merge Sort is a ____________ algorithm which divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.

What are the two types of sorting?

• Internal

• Quick Sort

• External

• Merge Sort

How do you call this special function that is used to map a given value with a particular key for faster access of elements?

• merge function

• hash function

• sorted array function

• bubble function