DSA_3

Question 1 / 10

0 %

0/100

Score 0/100

1. Define a recursive function F( n ) as following: If n > 0 then F( n ) = n x F(n-1) If n = 0 then F( n ) = 1. As such, what is the value of F(5)?

120

About This Quiz

2. What's your name?

We’ll put your name on your report, certificate, and leaderboard.

2. Which of the following stack operations could result in stack underflow?

Is_empty

Top

Pop

Push

3. Which of the following is the appropriate statement concerning data sorting methods?

4. Which formula is the best approximation for the depth of a heap with n nodes?

The square of n

The number of digits in n (base 10)

Log (base 2) of n

5. Given a tree T in the box. What is the order of nodes visited using a pre-order traversal?

X S Z Y R W P U T V

X Z Y S P W U V T R

R S X Y Z T U W P V

R S T X Y U V Z W P

6. Suppose cursor points to a node in a linked list (using the node definition with member functions called data and link). What Boolean expression will be true when cursor points to the tail node of the list?

(cursor->link( ) == NULL)

(cursor->data( ) == NULL)

(cursor == NULL)

(cursor->data( ) == 0.0)

7. Among Breadth-first search and Depth-first search, which graph traversal algorithm uses a queue to keep track of vertices that need to be processed?

Only Depth-First Search

Only Breadth-first search

Both Breadth-first search and Depth-first search

None of them

8. Figure 2 is the array representation of a binary tree shown in Figure 1. What should be put into the space "a"?

9. Consider the following pseudo code: declare a stack of characters while ( there are more characters in the word to read ) { read a character push the character on the stack } while ( the stack is not empty ) { write the stack's top character to the screen pop a character off the stack } What is written to the screen for the input "cartets"?

Ccaarrtteettss

Stetrac

Cartets

Serc

10. Which of the following is an appropriate description concerning the list and/or array structures?

Dsa_3