Question
The question below is based on the given series I. The
series I satisfy a certain pattern, follow the same pattern in series II and answer the questions given below.  I: 80, 158, 312, 616, 1216, 2400 II: 136 …… 2112. If 2112 is the nth term, find the value of (n+1) ² .Solution
Series I pattern: 80 * 2 – 2 = 158 158 * 2 – 22 = 312 312 * 2 – 23 = 616 616 * 2 – 24 = 1216 1376 * 2 – 25 = 2400 Series II pattern: 136 is the first term 136 * 2 – 2 = 270 270 * 2 – 22 = 536 536 * 2 – 23 = 1064 1064 * 2 – 24 = 2112 (5th term) (n + 1) 2  = 36
Which of the following is NOT a common wireless security protocol?
Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?
The time complexity of the best case for QuickSort is:
Consider a directed acyclic graph (DAG). The problem of finding the longest path in a DAG (with edge weights) can be solved in:
Which of the following algorithms uses a greedy approach?
Which of the following is true for a min-heap?
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
In Data Communication, what protocol is used to ensure reliable transmission of data over a network?
Which of the following sorting algorithms is considered stable (i.e., preserves the relative order of equal elements)?
What is the time complexity of inserting an element in a heap?
