Search Header Logo

The Got It Quiz - Programming

Authored by Yen Dang

Instructional Technology

University

Used 3+ times

The Got It Quiz - Programming
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

What does RAM stand for?

Relative Atomic Memory

Random Altered Memory

Random Access Memory

Relative Altered Memory

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If you wanted to make sure that the close-parenthesis (the ')' character) matches the open-parenthesis (the '(' character) in a mathematical expression, which data structure could help you?

Stack

Queue

Tree

Hash Table

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

The elements of an array are stored successively in memory cells because

The addr. of nth element can be calculated based on that of the 1st element

Computer memory archt. doesn't allow arrays to store other than serially

Both of above

None of the above

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statement(s) are true about binary search & binary search tree?

Worst case for searching an element using binary search is O(logn)

Worst case for searching an element using binary search tree is O(logn)

Binary search tree is a form of binary search

Binary search tree is a balanced tree

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are the correct intermediate steps of the following data set when it is being sorted with the Insertion sort? 15,20,10,18

15,20,10,18 -- 10,15,20,18 -- 10,15,18,20 -- 10,15,18,20

15,18,10,20 -- 10,18,15,20 -- 10,15,18,20 -- 10,15,18,20

15,10,20,18 -- 15,10,18,20 -- 10,15,18,20

10, 20,15,18 -- 10,15,20,18 -- 10,15,18,20

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If all the elements in an input array is equal for example [1,1,1,1,1,1], What would be the running time of the Insertion Algorithm?

O(2N)

O(n^2)

O(n)

None of the above

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Find the slowest time.

O(n)

O(n^2)

O(n!)

O(2^n)

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Instructional Technology