Complexity: What is the most efficient sort algorithm you know of and describe the type of process it uses. Is this used on specific data types or any type?, Common complexity problems: What does it mean that an algorithm is in NP? What does it mean it is in NP-complete?, Recursion: Why do we use recursion and how does it effect space/time complexity?, Pseudo Code: What is the relationship of pseudo code to code? Describe the difference., Linked List: What is the difference between a linked list and an array?, Double linked and circular lists: What is the advantage of having a double linked list?, Double linked and circular lists: What is the advantage of having a circular list?, Stacks: Stacks are referred to as LIFO or FILO. What does this mean?, Queues: Queues are referred to as bounded or unbounded capacity. What does this mean?, Trees: What is DFS? Describe the algorithm steps? (not pseudo code steps), Balancing trees: In a balanced tree what is the efficiency of any search?, Hash tables and mappings: What are the two ways to manage collisions in Hash tables?, Sorting algorithms: What are the basic comparative sorts and how do they differ?, Non comparative Sorting Algorithms: Why are these sorts (Bucket, Radix etc) more efficient? , Graphs: What is an Euler path? , Graphs: What is an Euler cycle?, Search and sorting graphs: Describe Dijkstra’s algorithm, Search and sorting graphs: How do Kruskal’s and Baruvka’s algorithm differ to each other?, Finite state machines: If we say a FSM accepts only a string x, what does this mean?, Linear Algebra: What are the eigenvalues of a matrix? Give example where we use them., Linear Algebra: How does using a matrix form of linear equations help you solve them?, Distributed systems: How do distributed system load share?, Distributed systems: What is the difference between parallel computing and threads?, Distributed systems: What sort of programs can use distributed systems ? How do they synchronize their messaging, Distributed systems: What sort of tasks are needed to maintain a distributed system?, To prove that F: A --→ B is one-to-one, we must show that for all x1 and x2 in A, F(x1) =F(x2) and x1 = x2. Is this true?, Consider the following two statements: “100 percent of convicted felons consumed bread during their childhood." and "People who do not consume bread as a child do not become felons." Does the first statement logically imply the second? What do we call the formation of the second in relation to the first?, What is the difference between a minimum spanning tree and the shortest path between two points in a spanning tree. Can we find the shortest path between all points in the graph as a minimum path for the graph, Describe how to use a stack S and a queue Q to generate all possible subsets of an n -element set T non recursively.

HIT220/PRT580 Interview practice

af
Integrere

Rangliste

Tilfældige kort er en åben skabelon. Det genererer ikke resultater for en rangliste.

Visuel stil

Indstillinger

Skift skabelon

Gendan automatisk gemt: ?