Mixed C949 Questions

Data Structures and Algorithms I C949

What does an algorithm describe?

A sequence of steps to solve a computational problem or perform a calculation

What does Dijkstra’s algorithm calculate?

The shortest path from a given starting vertex to all other vertices

What type of object can be stored in a Python list?

Any type of object

What are the numbers generated by Python’s random module known as?

Pseudo-random

What is a defining feature of a linked list data structure?

Items are ordered and stored in nodes, each with a pointer to the next

What does a multiplicative string hash function do?

Repetitively multiplies the hash value and adds the ASCII (or Unicode) value of each character in the string

Which ADT allows for a collection of distinct items?

Set

What is list nesting in the Python language?

Putting a list inside another list

What is the maximum floating-point value approximately in a standard 32-bit installation of Python?

1.8×10308

What is the default recursion depth limit in Python?

1000

What is often referred to as the start node in a circular linked list?

The head node

In a programming context, what is a range?

A sequence of values that a variable can take

What is the key distinguishing feature of the selection sort algorithm?

It selects the smallest unsorted element and swaps it with the element at the current position

What is a function that calls itself known as?

Recursive Function

Where is a new node inserted if its key is less than the current node’s key and the current node has no left child?

As the current node’s left child

What does the all pairs shortest path algorithm determine?

The shortest paths between all pairs of vertices in a graph.

What happens when duplicates are passed to the set() function?

The set keeps only one instance of each element

Why is the mid-square hash function typically implemented using binary?

Because a binary implementation is faster