finalDSA 19-10-2013

# finalDSA 19-10-2013 - FU-HCM Data Structure and Algorithm...

This preview shows pages 1–4. Sign up to view the full content.

FU-HCM » Data Structure and Algorithm You are here FU-HCM / » DSA / » Quizzes / » Kỳ thi: Final Exam - Ngày thi: 19.10.2013 / » Attempt 1 Kỳ thi: Final Exam - Ngày thi: 19.10.2013 Page: 1 2 (Next) Question 1 Marks: 1 Imagine we have the singly linked list, the head reference allows to manage this list. Show what would happen if we applied the following statements to this list? for (temp = head; temp.next != null; temp = temp.next) { } temp.next = head; Choose one answer. a. This will create a circularly linked list. b. Nothing happens, the temp reference points at the end of the list. c. Insert the temp node successfully. d. We have lost control this list, the head is overwritten by the other reference. Question 2 Marks: 1 Choose one answer.

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

View Full Document
Question 3 Marks: 1 With respect to hash tables, select the correct statement about open addressing method for handling collision (select the best answer). Choose one answer. Question 4 Marks: 1 In a single method implementation, how many recursive calls can be used? Choose one answer. Question 5 Marks: 1 Given a weighted graph below. What is the total edge-weight of the minimum spanning tree of G? Choose one answer. a. 31 b. 48 c. 25 d. 40 Question 6 Marks: 1 Which of the following Sorting algorithms have complexity of O( n ) in best case ? Choose one answer.
Question 7 Marks: 1 In Quicksort, the bound value (pivot) may be selected as Choose one answer. Question 8 Marks: 1 Consider the following algorithm: What is maximum number of activation records ( including its caller ) in runtime stack when calling TriangularNumber(10) Choose one answer.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern