The Got It Quiz - Programming

The Got It Quiz - Programming

University

10 Qs

quiz-placeholder

Similar activities

Тест Админ

Тест Админ

University

13 Qs

CSE Numerical Ability Quiz 1

CSE Numerical Ability Quiz 1

University

10 Qs

Information Technology Quiz

Information Technology Quiz

KG - Professional Development

8 Qs

Search Engines and Browsers

Search Engines and Browsers

3rd Grade - University

10 Qs

Pengetahuan Tentang Internet

Pengetahuan Tentang Internet

University

10 Qs

EMERGINGX

EMERGINGX

University

15 Qs

Hari ke 3 kuis coding dan perkenalan AI

Hari ke 3 kuis coding dan perkenalan AI

University

10 Qs

Log n

Log n

University

6 Qs

The Got It Quiz - Programming

The Got It Quiz - Programming

Assessment

Quiz

Instructional Technology

University

Medium

Created by

Yen Dang

Used 3+ times

FREE Resource

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)

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?