The Order Of An Algorithm

Question 1

The efficiency of an algorithm

Answer 1

Is a measure of the run-time for the algorithm, often proportional to the number of operations to be executed.

Question 2

The size of an algorithm

Answer 2

Is a measure of its complexity

Question 3

The order of an algorithm

Answer 3

Is a measure of its efficiency as a function of the size of the problem

Question 4

What’s the efficiency of bubble sorting algorithm as a function

Answer 4

1/2(n-1)n

Question 5

What’s the measure of size for any sorting algorithm

Answer 5

n

Question 6

Of what order is the bubble sorting algorithm is ?

Answer 6

Of quadratic order

Question 7

What is an algorithm

Answer 7

It is a set of instructions
It must have a finite number of steps
It must work for any valid input
It must have an end

Question 8

Full bin combinations algorithm explained

Answer 8

FInd combination of items that will completely fill a bin

Places remaining items using a first fit algorithm

Question 9

First fit algorithm

Answer 9

Places items in the given order to the first available bin

It is a heuristic algorithm meaning it attemps to find the best optimal solution

Question 10

First fit decreasing algorithm

Answer 10

Sort items in decreasing order by using another algorithm such as bubble sort or insertion sort and then performs first fit algorithm

Question 11

Which algorithm between a full bin combinations and first fit algorithm produces the best optimal solution?

Answer 11

the full bin combinations algorithm

Question 12

What is a graph

Answer 12

A graph is a series of nodes (or vertices) connected by edges (or arcs)

Question 13

How to find the degree of a graph

Answer 13

To find the degree (or order or valency ) of a vertex count how many ends of edges (or arcs) there are at the vertex

Question 14

Why can’t the order of a connected graph be an odd number?

Answer 14

Because in a connected graph it is possible to go from any vertex to the other

Question 15

What is a loop ?

Answer 15

A loop is an edge (or arc) that starts and finshes at the same node

Question 16

What is a tree ?

Answer 16

A tree is a connected graph with no cycles/loops

Question 17

What is a spanning tree?

Answer 17

A spanning tree is a connected subgraph with no cycles/loops containing all vertices (or nodes)

Question 18

How many edges in a tree of 10 nodes

Answer 18

9 edges (or arcs) because every node is visited only once

Question 19

Isomorphic graph have

Answer 19

the same incidence matrix despite looking visually different

Question 20

What is a network grpah

Answer 20

Adding a weight or value to nodes in a graph will produce a weighted grpah( or a network)

Question 21

Planar graph defined

Answer 21

A graph where none of the edges are crossed by each other

Question 22

Prim’s algorithm

Answer 22

will find the minumum spanning tree
It works by:
select any node to begin with
select the shortest edge connected to that node
select the shortest edge connecting any node that has been already
connected
repeat previous step until all nodes have been connected

Question 23

Kruskal’s algorithm

Answer 23

selects the shortest edge in a network
select the next shortest edge which does not create a cycle
repeat previous steps until all nodes are connected

Question 24

Dijkstra’s algorithm