stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Algorithmics (HESS) Flashcards | StudBud
Explore
/
Algorithmics (HESS)
Algorithmics (HESS)
40 terms
·
StudBud Administration
·
49 plays
Algorithmics Revision
Flashcards
40 cards
F
Practice quiz
P
Host live
L
Questions
40
Answers
1
Undecidable problems
admit no reasonable algorithms
admit no algorithms at all
admit reasonable (polynomial time) algorithms
2
Checkmate in 1 (white to move)
None of the above
Knight to C6
Bishop to C5
Rook to C8
3
An example of a tour improvement for the TSP is
2 x Minimum Spanning Tree
Nearest Neighbour
2 opt swap
4
Building a mathematical system requires
Sets
Numbers
Axioms
Operations
5
Stack -> Boolean
is most likely from the operation
Pop
Top
Is_Empty
Push
6
Which of these is true?
∞ × ∞ = 0
∞ × ∞ = 1
∞ × ∞ = ∞2
∞ × ∞ = ∞
7
Which is bigger?
O(n log n)
O(2n)
O(n!)
8
The Chinese Room experiment was first discussed by
John Searle
David Hilbert
Kurt Godel
Alan Turing
9
Lambda Calculus was developed by
Church
Hilbert
Church and Turing
Turing
10
Which of the following is a graph traversal algorithm?
Prims
Bellman Ford
Dijkstras
Depth First Search
11
A heuristic is a technique that will attempt to find
all of the possible solutions to a problem
an optimal solution to a problem
a solution to a problem in a reasonable timeframe
12
Which algorithm is commonly used to determine the minimum spanning tree of a graph?
Bellman-Ford
PageRank
Prims
13
while
and
for
are commonly used as part of
Iteration
Recursion
14
Using the Master Theorem, solve T(n) = T(n/2)+1
O(n2)
O(n!)
O(log n)
O(n)
15
The number of possible spanning trees in the following graph are:
2
3
4
1
16
DNA algorithms most likely follow which approach?
Greedy
Brute Force
Divide and Conquer
Dynamic Programming
17
A adjacency matrix for a undirected graph is always
asymmetric
symmetric
too hard to determine
18
A planar graph must not have
weighted edges
multiple edges
intersecting edges
loops
19
The Systems Reply to the Chinese room argues...
the person in the room doesn’t understand but is like a CPU
the room is behaving the same way, it understands Chinese
the room evokes a separate agent which is the understanding
20
For mathematics to be consistent
there exists an method for the correctness of any statement
None of these
every statement must be either proved or disproved
no contradictions or paradoxes exist
21
John Searle argues
The Chinese room proves the notion of Strong AI
Neither proves or disproves strong AI
The Chinese room disproves the notion of Strong AI
22
I proved mathematics to be incomplete
David Hilbert
Kurt Gödel
John Searle
Alan Turing
23
When looking at a car that is road tested, high mileage and old..
BUY
DON'T BUY
Cannot determine
24
PriorityQueue x Item x Priority -> PriorityQueue belongs to which operation?
Dequeue
IsEmpty
Empty
Enqueue
25
Which one of the following operations is typically associated with the graph ADT
Empty
Pop
Index
AddNode
26
What is a chatbot?
A robot that corrects conversation
A program which conducts a conversation via textual methods
An algorithm to determine if a language is readable
An algorithm used in translating text
27
The Turing test is to determine
a machine's ability to exhibit human behaviour
when an algorithm will halt
if an algorithm will halt
a human's ability to exhibit machine like behaviour
28
The runtime for the Dynamic Programming solution for the TSP is
O(n!)
O(2nn2)
O(n3)
O(2nn)
29
Which of the following is
not
associated with Neural Networks
Weights
Training
Input / Output Layer
DNA strands
30
The graph G=(V, E) with V={1, 2, 3, 4} and E={(1,2), (1,3), (1,4), (2, 3), (2, 4), (3,4)} is:
A Tree
Disconnected
Complete
31
What algorithm could this flow chart represent?
Bellman Ford
Dijkstras
Prims
Floyd Warshall
32
Hard limits of computation are linked to..
The technology
The problem
33
Which of the following is
not
a property of a tree?
Contains no circuits
Simple
Connected
Disconnected
34
Q = new_queue(), enqueue(Q, “John”), enqueue(Q, “Mary”), dequeue(Q) results in:
Mary
Null
John, Mary
John
35
Stack x Item -> Stack
is most likely from the operation
Top
Pop
Is_Empty
Push
36
The Busy Beaver problem
Counts all symbols written by a turing machine
Counts the 1s printed by a turing machine given it halts
Counts the 1s printed by a turing machine
Always halts no matter how many states the machine has
37
The simulated annealing algorithm...
increases the temp, accepting better solns as time goes on
decreases the temp, accepting worse solns as time goes on
decreases the temp, accepting better solns as time goes on
38
When looking at a car that is road tested and high mileage..
Cannot determine
DON'T BUY
BUY
39
The design pattern of Prim's Algorithm is
Divide and Conquer
Brute Force
Decrease and Conquer
Greedy
40
Which of the following is likely to use a stack?
BFS
DFS
Prims
Dijkstras
