Select the statement that is most correct.

A. A recursive method is a method that invokes itself directly or indirectly. For a recursive method to terminate there must be one or more base cases,

B. For a recursive method to terminate there must be one or more steps

C. For a recursive method to terminate there must be one or more limit conditions,

D. There is no difference between a recursive method and a non-recursive method.

The following is the main part of selection sort pseudocode: for i=0t o n-2 // large loop find a[k], where a[k] = min {a[i], a[i+1]....a[n-1]} if k # i then swap ali] with a[k] end for Consider the list of ten integers below. 8, 5, 11, 12, 4, 10, 2, 5, 9, 6 Whats the list ater the FIRST TWO iterations of the large loop in a selection sort? (sorting from smallestto largest)

C. 2, 4, 11, 12, 5, 10, 8, 5, 9, 6

A. 2, 4, 11, 12, 10, 5, 8, 5, 9, 6

B. 2, 4, 11, 12, 5, 10, 8, 5, 6, 9

D. 2, 4, 8, 5, 11, 12, 10, 5, 9, 6

Select the statementthatis most correct.

[A] Tail recursion is a special case of recursion in which the last operation of the function, the tail call, is a recursive call.

[B] Tail recursion is a special case of recursion in which the first operation of the function, is a recursive call.

Which statements are true (select two):

B. In a singly-linked list we can insert a node after a given node with time complexity O(n)

D. In a singly-linked listwe can insert a node after a given node with time complexity O(1)

A. In a singly-linked list there is no efficient way to iffsert a node before a given node in the middle of the list (the action is considered efficient fis complexity is O(1)).

C. In a singly-linked list we can insert a node before a given node in the middle ofthe listwith time complexity O(1)

Select the statement that is most correct. Suppose we are considering a singly linked list which has at least 2 nodes. What does the java code snippet below do? Node f = head; while( f.next != tail) f = f.next ; f.next = null; tail = f;

it deletes some middle node in the list.

It deletes node before the last node.

It does not make any change on the list.

Suppose we are consi ing a singly linked list and p is some node in the list which has successor node. Select the most correct java code snippet that deletes the successor node of p (the node after p).

[A] Node q = p.next ; p.next = q.next ;

[B] p = p.next ; p.next = null;

[C] Node q = p.next ; q.next = p.next.next ;

Consider the fun() method in a singly linked list of integers below: Integer fun() {if (isEmpty()) return null; Integer x = head.info ; if (head == tail) head = tail = null; else head = head.next ; return(x); } Specify the correct statement about the fun() method in the code above (choose the most suitable one).

[B] lt removes and returns the first element of the list

[A] It removes and returns the second element of the list

[C] lt removes and returns the last element of the list

Select the statement that is most correct. Suppose we are considering a doubly linked list which is not empty. What does the java code snippet below do? Node q = new Node(x); q.prev=null; q.next = head; head.prev = q; head = q;

[A] It inserts new node with value x at the head of the list.

[B] It inserts new node with value x after the head of the list.

Select the statement that is most correct. Suppose we are considering a singly linked list and p is some node in the list which has both predecessor and successor nodes. What does the java code snippet below do? Node f = head; while( f.next != p) f = f.next ; f.next = p.next ;

[A] It does not make any change on the list.

[B] It deletes the node after p.

[D] It deletes the node before p.

Select the statement that is most correct. Which of the following applications may use a queue?

[C] Keeping track of local variables at run time.

[A] Store all variables in a program.

[B] Store a waiting list of printing jobs.

[D] Undo sequence in a text editor.

Select the statement that is most correct. Suppose we are considering a doubly linked list and p is some node in the list which has successor node. What does the java code snippet below do? Node p1, p2; p1 = new Node(x); p2 = p.next ; p.next = p1; p1.prev = p; p1.next = p2; p2.prev = p1;

[B] It inserts new node with value x after the node p.

[A] It creates new node with value x at the end of the list.

[C] It inserts new node with value x before the node p.

[D] It replaces the node p with new node with value x.

Whatis the correct definition of a hash function? (Select the best answer)

[B] Hash function h(x) is a function which transforms a particular key x, be it a string, number, record, or the like. into an index i= h(x) in the table T. where T[i] is used for storing an item having key x or its address.

[A] Hash function h(x) is a function which transforms a particular key (string, or number) into an index i= h(x) in the table T. where T[i] is used for storing an item having key x or its address.

[C] Hash function h(x) is a function which transforms a particular key x, be it a string, number, record, or the like. into a positive integer.

[D] Hash function h(x) is a function which transforms a particular key x, be it a string, number, record, or the like. into non-negative integer.

Consider the binary tree below. Which statement is correct? (full binary tree = proper binary tree = 2-tree)

[D] The tree is full but not complete.

[A] The tree is neither complete nor full.

[B] The tree is both full and complete.

[C] The tree is complete but not full.

CSD201_PART3

Authored by Phạm Ngân

Other

University

Used 1+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

55 questions

Show all answers

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider the AVL tree below. What is the breadth-first traversal of the tree after inserting a node with value 24?

A. 35, 22, 39, 12, 32, 37, 24, 27

B. 35, 22, 39, 12, 32, 37, 27, 24

C. 35, 22, 39, 12, 37, 27, 24, 32

D. 35, 22, 39, 12, 27, 37, 24, 32

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the breadth-first traversal of a tree below after deleting the node 30 by merging?

A. 25, 15, 40, 5, 20, 35, 10

B. 15, 5, 25, 10, 20, 40, 35

C. 15, 5, 40, 10, 35, 25, 20

D. 25, 15, 40, 5, 35, 10, 20

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the breadth-first traversal from the vertex F of a graph below? (visit nodes in ABC order if there are some nodes having the same selection ability)

A. F, C, D, G, B, A, E

B. F, C, B, D, G, A, E, H

C. F, C, D, G, A, B, E, H

D. F, C, D, G, B, A, E, H

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Given a graph below. What is the output of depth-first traversal from vertex B? (visit nodes in ABC)

A. B, A, E, G, C, D, F, H

B. B, A, E, G, F, D, C

C. B, A, C, E, G, F, D, H

D. B, A, E, G, F, D, C, H

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider the AVL tree below. What is the breadth-first traversal of the tree after inserting a node with value 28?

A. 35, 22, 39, 12, 32, 37, 27, 28

B. 35, 22, 39, 12, 32, 37, 28, 27

C. 35, 22, 39, 12, 28, 37, 27, 32

D. 35, 22, 39, 12, 37, 28, 27, 32

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Given a binary search tree T below. What is a result of the breadth-first traverse of T after you delete by merging node 3?

A. 6, 1, 8, 2, 4, 7, 9

B. 6, 1, 8, 2, 7, 9, 4

C. 6, 2, 8, 1, 4, 7, 9

D. 6, 2, 1, 4, 8, 7, 9

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider the AVL tree below. What is the breath-first traversal of the tree after inserting a node with value 33?

A. 40, 25, 50, 15, 33, 45, 30, 35

B. 40, 25, 50, 15, 30, 45, 33, 35

C. 40, 25, 50, 15, 30, 45, 35, 33

D. 40, 25, 50, 15, 35, 45, 30, 33

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

56 questions

Политическая наука: Вопросы и Ответы

Quiz

•

University

50 questions

FINAL EXAM: LIVING IN THE IT ERA

Quiz

•

University

60 questions

Simulacro de Lenguaje - CUP 2025

Quiz

•

University

60 questions

Direito Financeiro - Orçamentação

Quiz

•

University

50 questions

NCC Quiz Challenges

Quiz

•

University

50 questions

PEMANTAPAN PERSIAPAN UJIAN PPPK

Quiz

•

University

51 questions

Met.o Rev

Quiz

•

University

51 questions

Motricité

Quiz

•

University

Popular Resources on Wayground

10 questions

5.P.1.3 Distance/Time Graphs

Quiz

•

5th Grade

10 questions

Fire Drill

Quiz

•

2nd - 5th Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

15 questions

Hargrett House Quiz: Community & Service

Quiz

•

5th Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

20 questions

Inferences

Quiz

•

4th Grade

15 questions

Equivalent Fractions

Quiz

•

4th Grade

Discover more resources for Other

18 questions

Informative or Argumentative essay

Quiz

•

5th Grade - University

20 questions

Disney Trivia

Quiz

•

University

20 questions

8.II_Review_TEACHER

Quiz

•

University

39 questions

Unit 7 Key Terms

Quiz

•

11th Grade - University

20 questions

Subject verb agreement practice

Quiz

•

University

20 questions

Quadrilaterals

Quiz

•

KG - University

5 questions

Examining Theme

Interactive video

•

4th Grade - University

25 questions

WWI, Great Depression, WWII

Quiz

•

KG - University

CSD201_PART3

Consider the AVL tree below. What is the breadth-first traversal of the tree after inserting a node with value 24?

What is the breadth-first traversal of a tree below after deleting the node 30 by merging?

What is the breadth-first traversal from the vertex F of a graph below? (visit nodes in ABC order if there are some nodes having the same selection ability)

Given a graph below. What is the output of depth-first traversal from vertex B? (visit nodes in ABC)

Consider the AVL tree below. What is the breadth-first traversal of the tree after inserting a node with value 28?

Given a binary search tree T below. What is a result of the breadth-first traverse of T after you delete by merging node 3?

Consider the AVL tree below. What is the breath-first traversal of the tree after inserting a node with value 33?

Given a binary search tree T below. What is a result of the breadth-first traverse of T after you delete by copying the root (node 5)?

What is the breadth-first traversal of a tree below after deleting the node 15 by merging?

Suppose a multigraph G is given blow (view picture). Which of the following is the Euler cycle from the vertex D, created by the above algorithm?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Other