What is the worst case time complexity of inserting a node in a doubly linked list?
Anonymous Quiz
30%
O(nlogn)
18%
O(logn)
37%
O(n)
15%
O(1)
Why is JavaScript called a structured programming language?
Anonymous Quiz
37%
Because all popular web browsers support JavaScript as they provide built-in execution environments
35%
Because it is an OOP language that uses prototypes rather than using classes for inheritance
20%
Because it follows syntax and structure of C language, which is a structured programming language
8%
Because it ignores spaces, tabs, and newlines that appear in JavaScript programs
Which of these is long data type literal?
Anonymous Quiz
36%
0x99fffL
16%
ABCDEFG
26%
0x99fffa
23%
99671246
For the below mention C statement, what is your comment?
signed int *p=(int*)malloc(sizeof(unsigned int));
signed int *p=(int*)malloc(sizeof(unsigned int));
Anonymous Quiz
22%
Would throw Runtime error
32%
Improper typecasting
28%
int value in the memory
18%
No problem with the statement
What differentiates a circular linked list from a normal linked list?
Anonymous Quiz
59%
You cannot have the ‘next’ pointer point to null in a circular linked list
10%
It is faster to traverse the circular linked list
24%
In a circular linked list, each node points to the previous node instead of the next node
7%
Head node is known in circular linked list
Explanation:
In a normal linked list, the ‘next’ pointer of the last node points to null. However, in a circular linked list, the ‘next’ pointer of the last node points to the head (first element) of the list. Every node in a circular linked list can be a starting point(head).
In a normal linked list, the ‘next’ pointer of the last node points to null. However, in a circular linked list, the ‘next’ pointer of the last node points to the head (first element) of the list. Every node in a circular linked list can be a starting point(head).