Full Stack Developer Quiz MCQ Question and Answer

Full Stack Developer Quiz

(R) Means Right Answer

1. Which of these is not an asynchronous operation in JavaScript?

Callback

Promises

Generators

Async/Await

Closure (R)

2. If the elements "A", "B", "C" and "D" are placed in a queue and are deleted one at a time, in what order will they be removed?

ABCD (R)

DCBA

DCAB

ABDC

3. An algorithmic technique for solving an optimization problem by breaking it down into simpler subproblems is called

Recursion

Dynamic Programming (R)

Tree

Merge Sort

4. Which of the following is correct?

O(1) > O(n)

O(n^3) > O(n^2) > O(n) > O(1) (R)

O(n^3) < O(n^2) < O(n) < O(1)

O(n) > O(nlogn)

5. What is the best way to store student information if 5000 students of a college have to be accessed by their roll numbers?

Store it in an array of student objects where objects contain student information

Store it in an object where the key is the roll number and the value is the student information (R)

Store it in an object where the key is the student name and the value is the student information

All of the above

6. The data structure preferred for reversing a string is

Stack (R)

Queue

LinkedList

Tree

7. Queues follow

FIFO (R)

LIFO

FILO

LILO

8. Which is not an application of stack?

Balancing symbols

Line at ticket counter (R)

Evaluation of postfix expression

Both A and B

9. First Index of an array is

0 (R)

1

null

depends on the way the array is declared

10. Asymptotic time complexity to find an element in the linked list is

O(N+1)

n

O(n) (R)

1

11. Which searching technique do you use to search in a Oxford Dictionary?

Linear Search

Binary Search (R)

Google Search

Bubble Sort

Selection Sort

12. Process of inserting an element into a stack is known as

Insert

Add

Push (R)

Append

13. The following formula left_subtree (keys) <= node (key) <= right_subtree (keys) is

Binary Tree

Complete Binary Tree

Binary Search Tree (R)

All of the above

14. The data structure required to check whether an expression contains balanced parenthesis is?

Stack (R)

Queue

Array

Truee

15. Asymptotic time complexity to find an element in the linked list is

O(N+1)

N

O(N) (R)

1

16. Which of these sorting techniques has the least time complexity overall?

Bubble sort

Merge sort (R)

Insertion sort

All of these are the same

17. Linked list is considered as an example of ___________ type of memory allocation.

Dynamic (R)

Static

Compile Time

Null

18. Which of the following is a valid expression in SQL?

SELECT NULL FROM SALES;

SELECT NAME FROM SALES; (R)

SELECT * FROM SALES WHEN PRICE = NULL;

SELECT ALL FROM SALES;

19. Which of these data structures cannot have a loop?

Tree (R)

Graph

Linked List

None of the above

20. What is the full form of LIFO?

Low Information Facility Outage

Last In First Out (R)

Last Input First Output

Less Inner Full Outer

21. The data structure required for Breadth First Traversal on a graph is?

Stack

Array

Queue (R)

Tree

22. Best way to solve sudoku is using which technique?

Matrix multiplication

Backtracking (R)

Greedy Technique

Searching Technique

23. How is time complexity represented ?

O(n) (R)

Time(n)

Complexity(n)

T(n)

24. How do you declare a JavaScript function?

function abc(){ } (R)

func abc(){ }

public abc(){ }

def abc():

25. How do you find the lenght of an array in Javascript?

Array.length(arr)

len(arr)

arr.len

arr.length (R)

26. Can we store a duplicate key in HashMap?

Yes

No (R)

Maybe

Depends

27. How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

0

3

2 (R)

1

28. Which of these statements is true

A process can have multiple threads (R)

A thread can have multiple processes

Processes and Threads are independent

None of the above

29. Which Data Structure is used to reverse a string in a optimized way?

Stack (R)

Queue

Linked List

All of the above

30. Circular wait over a resource can cause

Hard disk crash

Security breach

Deadlock (R)

None of the above

31. What is the next number in the series : 0 1 1 2 3 5 8 13 21

32

34 (R)

36

39

32. What is the output of the following?

50

30

60 (R)

2030

33. What is the output of the following code?

sam (R)

ram+bam

rambam 

Invalid function call

34.  What is the output of the following code?

hello (R)

hello hello hello

hello hello hello hello hello hello hello hello hello

Error

35. What is the output of the following code?

["Audi", "Saab", "BMW"]

["AudiVolvo", "Saab", "BMW"]

["Volvo", "Audi", "BMW"] (R)

["Volvo", "AudiSaab", "BMW"]

36. What is the output of the following code?

3 3

3 0 (R)

3 undefined

3 null 

37. What is the output of the following code?

Shirt

Pant

TShirt (R)

["Shirt", "Pant"]

38. What is the output of the following code?

undefined

Samsung Galaxy S20 costs Rs. 120000

Samsung Galaxy+S20+" costs Rs."+120000

Samsung GalaxyS20 costs Rs.120000 (R)

39. What is the time complexity of the following code?

O(n)

O(n^3) (R)

O(1)

None of the above

40. What is the output of the following code?

["Shirt", "Pant"] (R)

["Pant", "TShirt"]

TShirt

Shirt