Javascript uses _____ brackets to delineate code blocks.

Question 1 options:

Save

Question 2 (1 point)

What is the time complexity of the following function? function fun(n) { if (n

Question 2 options:

1)

O(1)

2)

O(n)

3)

O(n^2)

4)

O(n logn)

Save

Question 3 (1 point)

What will be the output of the following code? var fruits = ["Banana", "Orange"]; document.getElementById("demo2").innerHTML = fruits.unshift("Apple");

Question 3 options:

Save

Question 4 (1 point)

Is it possible to create a doubly linked list using only one pointer with every node?

Question 4 options:

1)

No

2)	Yes, by storing XOR of addresses of previous and next node.

3)	Yes, by storing XOR of current node and next node

4)	Yes, by storing XOR of current node and previous node

Save

Question 5 (1 point)

The results of evaluating the Post-fix expression 10 5 + 60 6 / * 8 is

Question 5 options:

Save

Question 6 (1 point)

A traditional use of the Stack data structure is evaluation of arithmentidc expressions

Question 6 options:

	1) True
	2) False

Save

Question 7 (1 point)

What is the output of the following function with the input "( ( ) ) )" function g(s) { var a = s.split(""); var b = []; for (var i = 0; i 0) b.pop();} } return b.length; }

Question 7 options:

Save

Question 8 (1 point)

The Stack implements FIFO

Question 8 options:

	1) True
	2) False

Save

Question 9 (1 point)

What is the time complexity for the pop operation for an efficiently implemented stack using a linked list.

Question 9 options:

1)

O(1)

2)

O(n)

Save

Question 10 (1 point)

A traditional use ofthe Stack data structures is the stock span problem.

Question 10 options:

	1) True
	2) False