What is the time complexity of searching for an element in a circular linked list?
Anonymous Quiz
47%
O(n)
35%
O(nlogn)
10%
O(1)
9%
O(n2)
👍1
Which of the following function of the Array object is used to add one or more elements to the front of an array and returns the new length of the array?
Anonymous Quiz
29%
splice()
42%
unshift()
11%
sort()
18%
toString()
Which of the following application makes use of a circular linked list?
Anonymous Quiz
19%
Undo operation in a text editor
41%
Recursive function calls
27%
Allocating CPU to resources
13%
Implement Hash Tables
Explanation:
Generally, round robin fashion is employed to allocate CPU time to resources which makes use of the circular linked list data structure. Recursive function calls use stack data structure. Undo Operation in text editor uses doubly linked lists. Hash tables uses singly linked lists.
Generally, round robin fashion is employed to allocate CPU time to resources which makes use of the circular linked list data structure. Recursive function calls use stack data structure. Undo Operation in text editor uses doubly linked lists. Hash tables uses singly linked lists.
Which of the following syntax is correct to refer to an external script called "LFC.js"?
Anonymous Quiz
18%
<script source="LFC.js">
27%
<script ref="LFC.js">
53%
<script src="LFC.js">
2%
<script type="LFC.js">
👍1
Which of the following syntax can be used to write "Hello World" in an alert box?
Anonymous Quiz
6%
alertBox("Hello World");
8%
msgBox("Hello World");
83%
alert("Hello World");
2%
msg("Hello World");
❤1👍1
Which of the following is false about a circular linked list?
Anonymous Quiz
15%
Every node has a successor
24%
Time complexity of inserting a new node at the head of the list is O(1)
31%
Time complexity for deleting the last node is O(n)
31%
We can traverse the whole circular linked list by starting from any point
❤2👍2
Which of the following is not a JavaScript framework or library?
Anonymous Quiz
18%
Polymer
16%
Meteor
20%
jQuery
46%
Cassandra
API Architecture Styles
Choosing the Right API Style Today
APIs come in many flavors, each suited for different needs. SOAP, though reliable for enterprise apps, feels outdated with its XML complexity. RESTful APIs are still the go-to for simplicity and wide adoption, but they can suffer from over- or under-fetching data.
GraphQL is the modern favorite, perfect for getting exactly the data you need—great for front-end flexibility. gRPC shines in high-performance, microservices-heavy environments, while WebSockets handle real-time, low-latency communication brilliantly. Finally, Webhooks are ideal for event-driven applications with asynchronous needs.
In today’s world, GraphQL or RESTful APIs often dominate, but your choice should depend on your app’s specific requirements.
Choosing the Right API Style Today
APIs come in many flavors, each suited for different needs. SOAP, though reliable for enterprise apps, feels outdated with its XML complexity. RESTful APIs are still the go-to for simplicity and wide adoption, but they can suffer from over- or under-fetching data.
GraphQL is the modern favorite, perfect for getting exactly the data you need—great for front-end flexibility. gRPC shines in high-performance, microservices-heavy environments, while WebSockets handle real-time, low-latency communication brilliantly. Finally, Webhooks are ideal for event-driven applications with asynchronous needs.
In today’s world, GraphQL or RESTful APIs often dominate, but your choice should depend on your app’s specific requirements.
👍4
Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
Anonymous Quiz
31%
Keep one node as head and traverse another temp node till end to check if its ‘next points to head
45%
Have fast and slow pointers with fast pointer advancing two nodes at a time
8%
Cannot determine, you have to pre-define if the list contains cycles
16%
Circular linked list itself represents a cycle. So no new cycles cannot be generated
Explanation:
Advance the pointers in such a way that the fast pointer advances two nodes at a time and slow pointer advances one node at a time and check to see if at any given instant of time if the fast pointer points to slow pointer or if the fast pointer’s ‘next’ points to the slow pointer. This is applicable for smaller lists.
Advance the pointers in such a way that the fast pointer advances two nodes at a time and slow pointer advances one node at a time and check to see if at any given instant of time if the fast pointer points to slow pointer or if the fast pointer’s ‘next’ points to the slow pointer. This is applicable for smaller lists.
Why does the name of JavaScript and Java are similar?
Anonymous Quiz
18%
JavaScript is a stripped-down version of Java.
40%
The syntax of JavaScript is loosely based on the syntax of Java.
9%
JavaScript and Java both are originated on the island of Java.
33%
None of the above
Which of the following real world scenarios would you associate with a stack data structure?
Anonymous Quiz
75%
piling up of chairs one above the other
13%
people standing in a line to be serviced at a counter
7%
offer services based on the priority of the customer
5%
tatkal Ticket Booking in IRCTC
👍1
Explanation:
Stack follows Last In First Out (LIFO) policy. Piling up of chairs one above the other is based on LIFO, people standing in a line is a queue and if the service is based on priority, then it can be associated with a priority queue. Tatkal Ticket Booking Follows First in First Out Policy. People who click the book now first will enter the booking page first.
Stack follows Last In First Out (LIFO) policy. Piling up of chairs one above the other is based on LIFO, people standing in a line is a queue and if the service is based on priority, then it can be associated with a priority queue. Tatkal Ticket Booking Follows First in First Out Policy. People who click the book now first will enter the booking page first.
👍1
Sorry I've forwarded it wrong, here is a complete post: