2005ds-exam - 20052006 2005 11 9 120 1 Please fill in the...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
浙浙浙浙 2005–2006 浙浙浙浙浙浙 浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙 开开开开开 开开开开开开开开开开 开开开开开开开 开开开开开2005 11 9 开开开开开120 开开 开开开开________ 开开开开开 _____ 开开开 开开开 ___ 开开 开 开 开开 开开开 (浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙浙) 1开 Please fill in the table with your best choices: ( 20 points , 2 points × 10) 1 2 3 4 5 6 7 8 9 10 (1) An undirected graph with n vertices has at most edges. n n ( n – 1) n ( n – 1)/2 2 n (2) Given a queue that is implemented by a single linked list, which status is 1->2->3, after operations “delete” and “insert(4)”, the status of this list is开 4->1->2 2->3->4 is OR neither nor (3) To find the shortest path between a pair of given vertices, method can be used. Kruskal Dijkstra Hashing Critical Path (4) In the disjoint set problem, if Union s are performed by height, then the depth of any tree with n nodes is . O( n ) O(1) O(log n ) n /2 (5) Given a single linked list, we would delete the node follow the node implied by P pointer. which operation is correct?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 3

2005ds-exam - 20052006 2005 11 9 120 1 Please fill in the...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online