ClassQuiz Play Explore Search Docs GitHub

Register Log in

Beginner Level

Level 1

Made by @rohoy90495

0 0

0

179

1: The function solves a particular problem by calling a copy of itself and solving smaller subproblems of the original problems.

40s

Hashing Functions

Recursive Function

Predefined Function

none

2: Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

40s

Pre-Order

Monastic Orders

In-Order

None of these

3: What is a Single Operand Operator below.?

40s

& Bitwise AND Operator

| Bitwise OR operator

^ Bitwise Exclusive OR

~ Bitwise Negate Operator

4: The last node of the singly-linked list contains ___

40s

NULL

Next pointer

Data

None of the above

5: Dynamic Programming (DP) is defined as a technique that solves some particular type of problems in ....time

40s

Quadratic

Polynomial

Linear

None

6: What is the time complexity for DFS?

40s

O(v +e )

O(v * e)

O(v)

None

7: If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

40s

Insertion sort

selection sort

Merge sort

Quick sort

8: Which of the following syntax correctly declares an Array?

40s

int adypu;

array adypu[20];

geeks{20};

int adypu[20];

9: The stack's ____ determines how many recursive calls are allowed.

40s

Size

Time

Quality

None

10: The tree that has left value smaller than the root value and right node greater than the root value, is called?

40s

Binary tree

Binary search tree

Complete tree

None

11: The left-shift and right-shift operators should not be used for ------numbers.

40s

Positive

Real

Negative

None

12: In a stack, if a user tries to remove an element from an empty stack it is called?

40s

Empty collection

Garbage collection

Overflow

Underflow

13: What type of additional memory is required for each recursive call.

40s

Queue Memory

Heap Memory

Stack Memory

None

14: Which searching technique takes O(1) time complexity for searching the data?

40s

Binary Search

Linear search

AVL search tree

Hashing

15: The list of data in which elements can be inserted and removed at the same end is called ____.

40s

Array

String

Stack

None

16: The method used in dynamic programming to save previously calculated data is known as _______.

40s

Mapping

Saving value property

Memoization

None

17: Which of the following is not a stable sorting algorithm in its typical implementation?

40s

Quick sort

Bubble Sort

Merge sort

Selection sort

18: Which of these operators can be used to concatenate two or more String objects?

40s

"+"

"+="

"&"

None of these

19: In simple chaining, what data structure is used?

40s

Singly linked list

Circular linked list

Doubly linked list

Binary trees

20: Which data structure type allows deleting data elements from front and inserting at rear?

40s

Stack

Queue

Array

None

21: Which of the following sorting algorithms has the worst time complexity for most inputs?

40s

Quick sort

Merge sort

Bubble sort

None

22: In an array int arr[3]={1,2,3}, what will happen if we try to access arr[4] in C/C++?

40s

Run TIme error

3

0

Garbage value

23: Which condition is needed to stop the recursion otherwise infinite loop will occur.

40s

Base case

Best case

Worst case

None

24: Backtracking problems take time complexity ......

40s

High time complexity

Low time complexity

Both

None

25: BFS uses which data structure?

40s

Stack

Queue

Tree

Hash

26: What creates mapping between key and value?

40s

Collision

Key

Hash Table

Hash function

27: The difference between queue and stack is ____.

40s

Queues require dynamic memory but stacks do not

Stack requires dynamic memory but queue do not

Queue uses two ends of the structure, stack uses only one

Stack uses two ends of the structure, queue uses only one

28: In Hashing techniques, A key can be ......

40s

Integer

String

Either integer or string

None

29: How many queues are needed to implement a stack? Consider the situation where no other data structure like arrays, or linked lists is available to you.

40s

1

2

3

None

30: What is the condition for applying binary search?

40s

Data is not sorted

Data must be sorted

Either A or B

None

31: What advantage does a linked list have over an array?

40s

A linked list is not of a fixed size

It's better

It is easier to use

It is easier to use

32: The function solves a particular problem by calling a copy of itself and solving smaller subproblems of the original problems.

40s

Hashing Functions

Recursive Function

Predefined Function

none

33: Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

40s

Pre-Order

Monastic Orders

In-Order

None of these

34: What is a Single Operand Operator below.?

40s

& Bitwise AND Operator

| Bitwise OR operator

^ Bitwise Exclusive OR

~ Bitwise Negate Operator

35: The last node of the singly-linked list contains ___

40s

NULL

Next pointer

Data

None of the above

36: Dynamic Programming (DP) is defined as a technique that solves some particular type of problems in ....time

40s

Quadratic

Polynomial

Linear

None

37: What is the time complexity for DFS?

40s

O(v +e )

O(v * e)

O(v)

None

38: If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

40s

Insertion sort

selection sort

Merge sort

Quick sort

39: Which of the following syntax correctly declares an Array?

40s

int adypu;

array adypu[20];

geeks{20};

int adypu[20];

40: The stack's ____ determines how many recursive calls are allowed.

40s

Size

Time

Quality

None

41: The tree that has left value smaller than the root value and right node greater than the root value, is called?

40s

Binary tree

Binary search tree

Complete tree

None

42: The left-shift and right-shift operators should not be used for ------numbers.

40s

Positive

Real

Negative

None

43: In a stack, if a user tries to remove an element from an empty stack it is called?

40s

Empty collection

Garbage collection

Overflow

Underflow

44: What type of additional memory is required for each recursive call.

40s

Queue Memory

Heap Memory

Stack Memory

None

45: Which searching technique takes O(1) time complexity for searching the data?

40s

Binary Search

Linear search

AVL search tree

Hashing

46: The list of data in which elements can be inserted and removed at the same end is called ____.

40s

Array

String

Stack

None

47: The method used in dynamic programming to save previously calculated data is known as _______.

40s

Mapping

Saving value property

Memoization

None

48: Which of the following is not a stable sorting algorithm in its typical implementation?

40s

Quick sort

Bubble Sort

Merge sort

Selection sort

49: Which of these operators can be used to concatenate two or more String objects?

40s

"+"

"+="

"&"

None of these

50: In simple chaining, what data structure is used?

40s

Singly linked list

Circular linked list

Doubly linked list

Binary trees

51: Which data structure type allows deleting data elements from front and inserting at rear?

40s

Stack

Queue

Array

None

52: Which of the following sorting algorithms has the worst time complexity for most inputs?

40s

Quick sort

Merge sort

Bubble sort

None

53: In an array int arr[3]={1,2,3}, what will happen if we try to access arr[4] in C/C++?

40s

Run TIme error

3

0

Garbage value

54: Which condition is needed to stop the recursion otherwise infinite loop will occur.

40s

Base case

Best case

Worst case

None

55: Backtracking problems take time complexity ......

40s

High time complexity

Low time complexity

Both

None

56: BFS uses which data structure?

40s

Stack

Queue

Tree

Hash

57: What creates mapping between key and value?

40s

Collision

Key

Hash Table

Hash function

58: The difference between queue and stack is ____.

40s

Queues require dynamic memory but stacks do not

Stack requires dynamic memory but queue do not

Queue uses two ends of the structure, stack uses only one

Stack uses two ends of the structure, queue uses only one

59: In Hashing techniques, A key can be ......

40s

Integer

String

Either integer or string

None

60: How many queues are needed to implement a stack? Consider the situation where no other data structure like arrays, or linked lists is available to you.

40s

1

2

3

None

61: What is the condition for applying binary search?

40s

Data is not sorted

Data must be sorted

Either A or B

None

62: What advantage does a linked list have over an array?

40s

A linked list is not of a fixed size

It's better

It is easier to use

It is easier to use

63: The function solves a particular problem by calling a copy of itself and solving smaller subproblems of the original problems.

40s

Hashing Functions

Recursive Function

Predefined Function

none

64: Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

40s

Pre-Order

Monastic Orders

In-Order

None of these

65: What is a Single Operand Operator below.?

40s

& Bitwise AND Operator

| Bitwise OR operator

^ Bitwise Exclusive OR

~ Bitwise Negate Operator

66: The last node of the singly-linked list contains ___

40s

NULL

Next pointer

Data

None of the above

67: Dynamic Programming (DP) is defined as a technique that solves some particular type of problems in ....time

40s

Quadratic

Polynomial

Linear

None

68: What is the time complexity for DFS?

40s

O(v +e )

O(v * e)

O(v)

None

69: If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

40s

Insertion sort

selection sort

Merge sort

Quick sort

70: Which of the following syntax correctly declares an Array?

40s

int adypu;

array adypu[20];

geeks{20};

int adypu[20];

71: The stack's ____ determines how many recursive calls are allowed.

40s

Size

Time

Quality

None

72: The tree that has left value smaller than the root value and right node greater than the root value, is called?

40s

Binary tree

Binary search tree

Complete tree

None

73: The left-shift and right-shift operators should not be used for ------numbers.

40s

Positive

Real

Negative

None

74: In a stack, if a user tries to remove an element from an empty stack it is called?

40s

Empty collection

Garbage collection

Overflow

Underflow

75: What type of additional memory is required for each recursive call.

40s

Queue Memory

Heap Memory

Stack Memory

None

76: Which searching technique takes O(1) time complexity for searching the data?

40s

Binary Search

Linear search

AVL search tree

Hashing

77: The list of data in which elements can be inserted and removed at the same end is called ____.

40s

Array

String

Stack

None

78: The method used in dynamic programming to save previously calculated data is known as _______.

40s

Mapping

Saving value property

Memoization

None

79: Which of the following is not a stable sorting algorithm in its typical implementation?

40s

Quick sort

Bubble Sort

Merge sort

Selection sort

80: Which of these operators can be used to concatenate two or more String objects?

40s

"+"

"+="

"&"

None of these

81: In simple chaining, what data structure is used?

40s

Singly linked list

Circular linked list

Doubly linked list

Binary trees

82: Which data structure type allows deleting data elements from front and inserting at rear?

40s

Stack

Queue

Array

None

83: Which of the following sorting algorithms has the worst time complexity for most inputs?

40s

Quick sort

Merge sort

Bubble sort

None

84: In an array int arr[3]={1,2,3}, what will happen if we try to access arr[4] in C/C++?

40s

Run TIme error

3

0

Garbage value

85: Which condition is needed to stop the recursion otherwise infinite loop will occur.

40s

Base case

Best case

Worst case

None

86: Backtracking problems take time complexity ......

40s

High time complexity

Low time complexity

Both

None

87: BFS uses which data structure?

40s

Stack

Queue

Tree

Hash

88: What creates mapping between key and value?

40s

Collision

Key

Hash Table

Hash function

89: The difference between queue and stack is ____.

40s

Queues require dynamic memory but stacks do not

Stack requires dynamic memory but queue do not

Queue uses two ends of the structure, stack uses only one

Stack uses two ends of the structure, queue uses only one

90: In Hashing techniques, A key can be ......

40s

Integer

String

Either integer or string

None

91: How many queues are needed to implement a stack? Consider the situation where no other data structure like arrays, or linked lists is available to you.

40s

1

2

3

None

92: What is the condition for applying binary search?

40s

Data is not sorted

Data must be sorted

Either A or B

None

93: What advantage does a linked list have over an array?

40s

A linked list is not of a fixed size

It's better

It is easier to use

It is easier to use