Acrimonious

Abstruse

Bellicose

Chicanery

Convivial

Dilatory

Encomium

Fatuous

Garrulous

Cacophony : Sound :: Garble : ?

Quiescent : Activity :: Desiccated : ?

Indomitable : Subdue :: Immutable : ?

Ephemeral : Lasting :: Languid : ?

Nexus : Connection :: Chasm : ?

Ebullient : Enthusiasm :: Lachrymose : ?

Mendicant : Wealth :: Ascetic : ?

Propitious : Omen :: Salutary : ?

Turgid : Subtlety :: Bombastic : ?

Miser : Generosity :: Blasphemer : ?

Despite his reluctance _______ confront the issue, he eventually addressed it head-on.

The new policy is aimed _______ reducing the environmental impact of the company’s operations.

He was engrossed _______ his book, oblivious to the noise around him.

The professor insisted _______ the importance of academic integrity in all research.

She prides herself _______ her ability to solve complex problems.

The conference will focus _______ the latest developments in artificial intelligence.

He was immune _______ the criticism, remaining calm and collected.

The results are consistent _______ the hypothesis proposed by the researchers.

She has a reputation _______ being one of the most dedicated workers in the company.

His ideas were met _______ skepticism by his colleagues.

A, B, C, D, E and F are 6 villages situated in a line. Yuvraj has to go from A to F. He can walk at 1 kmph from A to B and from D to E; at 3 kmph from B to C; and at 5 kmph from C to D and E to F. The distance between B and E is 51 km, A and C is 29 km which is equal to the distance between B and D. The distance between C and E is 42 km and the distance between D and F is 37 km. How long would it take for Yuvraj to go from A to F assuming he will not take any rest during the journey?

A bath tub can be filled by the cold water pipe in 9 minutes and by the hot water pipe in minutes. A person leaves the bath room after turning on both the pipes simultaneously and return the moment when the bath tub should be just full.However, finding that the waste pipe was open, he closes it and now the bath tub gets filled in more minutes. The time in which the waste pipe empties the bath tub is

There are four towns in a straight line at the milestones of A at 10 miles, B at 20 miles, C at 35 miles and D at 45 miles respectively. Sunil wants to set up a shop to service these four towns. If the demand from each of these towns is found to be identical and there are no other shops servicing these towns then, which of the following is the only way to minimize the cost of transportation?

Rudrapratap has five children, 3 daughters and 2 sons. Five years ago, the combined age of his daughters is thrice that of his sons and five years hence, the combined age of his daughters will be twice that of his sons. If the present age of Rudrapratap’s youngest child is at least six years, then the present average age of his five children is

Number S is obtained by squaring the sum of digits of a two digit number D. If difference between S and D is 27, then the two digit number D is

The owner of a local jewellery store hired 3 watchmen to guard his diamonds, but a thief still got in and stole some diamonds. On the way out, the thief met each watchman, one at a time. To each he gave half of the diamonds he had then, and 2 more besides. He escaped with one diamond. How many did he steal originally?

If a number 774958A96B is to be divisible by 8 and 9, the respective values of A and B will be

A report consists of 20 sheet each of 55 lines and each such lines consists of 65 characters. This report is reduced onto sheets each of 65 lines such that each line consists of 70 characters. The percentage reduction in number of sheets is closest to

A can complete a piece of work in 4 days. B takes double the time taken by A, C takes double that of B and D takes double that of C to complete the same task. They are paired in groups of two each. First pair takes two-thirds the time needed by the second pair to complete the work. The first pair consist of

The principal wants to arrange 5 students on the platform such that the boy ‘AJAY’ occupies the second position and such that the girl ‘SITA’ is always adjacent to the girl ‘RITA’. How many such arrangements are possible?

How many numbers greater than a million can be formed with the digits 2, 3, 0, 3, 4, 2, 3?

If the product of the roots of the equation x2 – 3kx + 2e2logk – 1 = 0 is 7, then the roots of the equation are real for k =

The integer sequence a1, a2, a3, ... satisfies an + 2 = an + 1 – an for n > 0. If the sum of the first 1492 terms of this sequence is 1985 and the sum of the first 1985 terms is 1492, then the sum of the first 2001 terms is

On a TV quiz show, Mr. and Mrs. Nath are given two red blocks and two blue blocks that they must distribute into two boxes any way they wish. Mrs. Nath will then be blindfolded and asked to pick one block at random from one of the boxes, if she picks a red block , then she will win Rs.1 million. The maximum probability of drawing a red block by Mrs. Nath could be

A hare sees a dog 100 metres away from her and scuds off in the opposite direction at a speed of 12 km an hour. A minute later the dog perceives her and gives chase at a speed of 16 km per hour. How soon will the dog overtake the hare, and at what distance from the spot whence the hare took flight?

Ram and Shyam attended a food festival. Ram gave an order for 3 burgers, 4 pastries and 2 pizzas whereas Shyam placed an order for 2 burgers, a pastry and 3 pizzas. The bill for Ram and Shyam was Rs.1050 and Rs.950 respectively. If Ram exchanges a pizza for a pastry from Shyam, then which of the following is true?

The average score of 25 students in a class test in maths is 75. If the top three ranker's are dropped, the average drops by 2. If the maximun marks for the paper is 100 and the second highest score is less than 90, then what could be the least highest score, if all scores are integers?

The inhabitants of Planet – X measure time in hours and minutes which is different from our measurement of earth. The day in Planet – X consists of 36 hours with each hour having 120 minutes. The dials of their clock shows 36 hours. What is the angle (in Planet – X degrees) between the hours and the minute hands when it shows a time of 11:24 am? (The angle around the dial in planet – X watch is 720°.)

The digits of a four digit number form an arithmetic progression, not necessarily in the same order. If the arithmetic mean of all the digits is an integer, then how many such numbers are possible?

A washerman can wash 6 trousers or 8 shirts in 1 hour while his wife can wash 6 trousers or 8 shirts in 2 hours. The couple get a work of 160 trousers and 200 shirts to wash. The man and the woman work on alternate hours and for a total of 12 hours daily. Every morning except the first the lady starts the work. If the couple worked for only 5 hours on the first day with the man starting the work at noon, then

There are triplet brothers who look identical. The oldest is John, he always tells the truth. The second is Jack, he always tells a lie. The third is Joe, he either tells the truth or a lie. Jimmie went to visit them one day. He was wondering who was who? He asked the one who was sitting on the left: "Who is the guy sitting in the middle?" The answer was "He is John." He asked the one who was sitting in the middle: "What is your name?" The answer was "I am Joe." He asked the one who was sitting on the right: "Who is the guy sitting in the middle?" The answer was "He is Jack." The guy sitting in the middle was

There are two alloys I and II. Alloy I contains metals A, C and D. Alloy II contains metals A and B. Both alloys contain 60% of metal A They are mixed to form a third alloy. The percentage of metal B in the third alloy is half of that of metal A in it. The ratio of percentages of C and D in Alloy I is 3 : 1.The ratio of quantities of C in alloy I and B in alloy II, which are mixed to form the third alloy is

Mr. Sharma has two containers. He usually keeps them filled up but due to some problem, he found that the smaller one was only 5/6th full on a particular day. He now emptied this smaller container into the bigger one and found that only 4/9th of it was filled up. If we know that the capacity of the smaller container is 536 litres, then the capacity of the larger one would be (litres)

Devilal lives in Sham Sharvan colony where each house has a number. If Devilal’s house number is a multiple of 3, then it is a number from 50 through 59. If his house number is not a multiple of 4, then it is a number from 60 through 69. If his house number is not multiple of 6, then it is a number from 70 through 79. What is his house number?

600 people voted on a resolution, but after some discussion, the opponents were increased by 150%. The motion was then rejected by a majority two times as great as that by which it was formerly passed. How many voted for and how many voted against (agst) the initial resolution?

A merchant buys 40 bicycles and marks them at 25% above the cost price. He allows a discount on the marked price at 10% for cash sales, and at 5% for credit sales. If three-fourth of the stock is sold for cash and the rest for credit, and if the total profit be Rs.2025, what is the cost price of a bicycle?

A trader gives a discount of 10% on the list price of goods. Further, to every fourth customer to enter his shop, he gives an article worth Rs. 592 free. If each article cost him Rs. 500 and he makes a profit of 20% on his investment after selling 80 articles. Find at what percentage mark-up is his list price from his cost?

A hound takes 5 leaps to every 7 leaps of a hare. But 3 leaps of the hound are equal to 7 leaps of the hare. What is the ratio of the speed of the hound to the speed of the hare?

Box A contains 25 paise coins alone and box B contains 50 paise coins alone. For every 4 coins transferred from A to B, 3 coins are transferred from B to A. The total amount in both the boxes is Rs 50. If the amounts are same in both the boxes and the number of coins are equal after n such transfers, the value of n is

Given a binary tree, what is the output of an in-order traversal of the following tree? 4 / \ 2 6 / \ / \ 1 3 5 7

Given a linked list with nodes containing values 1, 2, 3, and 4, what will be the output after reversing the linked list?

What will be the output of a Depth-First Search (DFS) starting from node 1 for the following graph? lua 1 -- 2 | | 3 -- 4

What is the output of the following dynamic programming code for the input array [2, 3, 1, 1, 4]? python Copy code def minJumps(arr): n = len(arr) jumps = [float('inf')] * n jumps[0] = 0 for i in range(1, n): for j in range(i): if i <= j + arr[j]: jumps[i] = min(jumps[i], jumps[j] + 1) return jumps[-1] print(minJumps([2, 3, 1, 1, 4]))

What is the output of the following quick sort implementation on the input array [3, 6, 8, 10, 1, 2, 1]? python Copy code def quickSort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quickSort(left) + middle + quickSort(right) print(quickSort([3, 6, 8, 10, 1, 2, 1]))

What is the output of the following recursive function for n=5? python Copy code def factorial(n): if n == 0: return 1 else: return n * factorial(n-1) print(factorial(5))

What will be the output of the following greedy algorithm for the fractional knapsack problem with weights [2, 3, 5, 7] and values [10, 5, 15, 7] and a knapsack capacity of 15? python Copy code def fractionalKnapsack(weights, values, capacity): index = list(range(len(values))) ratio = [v/w for v, w in zip(values, weights)] index.sort(key=lambda i: ratio[i], reverse=True) max_value = 0 for i in index: if weights[i] <= capacity: max_value += values[i] capacity -= weights[i] else: max_value += values[i] * (capacity / weights[i]) break return max_value print(fractionalKnapsack([2, 3, 5, 7], [10, 5, 15, 7], 15))

What is the output of the following code for finding the length of the longest increasing subsequence of the array [10, 9, 2, 5, 3, 7, 101, 18]? python Copy code def lengthOfLIS(nums): if not nums: return 0 dp = [1] * len(nums) for i in range(1, len(nums)): for j in range(i): if nums[i] > nums[j]: dp[i] = max(dp[i], dp[j] + 1) return max(dp) print(lengthOfLIS([10, 9, 2, 5, 3, 7, 101, 18]))

What is the output of the following code for reversing the words in a string "Hello World"? python Copy code def reverseWords(s): return ' '.join(reversed(s.split())) print(reverseWords("Hello World"))

What is the output of the following code for generating all subsets of the set [1, 2, 3]? python Copy code def subsets(nums): res = [] def backtrack(start, path): res.append(path) for i in range(start, len(nums)): backtrack(i + 1, path + [nums[i]]) backtrack(0, []) return res print(subsets([1, 2, 3]))

What is the output of the following binary search implementation for the array [1, 2, 3, 4, 5, 6, 7] and target 5? python Copy code def binarySearch(arr, target): left, right = 0, len(arr) - 1 while left <= right: mid = (left + right) // 2 if arr[mid] == target: return mid elif arr[mid] < target: left = mid + 1 else: right = mid - 1 return -1 print(binarySearch([1, 2, 3, 4, 5, 6, 7], 5))

What is the output of the following code to insert elements into a min-heap and then extract the minimum element? python Copy code import heapq heap = [] elements = [3, 1, 4, 1, 5, 9, 2, 6] for element in elements: heapq.heappush(heap, element) min_element = heapq.heappop(heap) print(min_element)

What is the output of the pre-order traversal of the following binary tree? markdown Copy code 5 / \ 3 8 / \ \ 1 4 9

What is the output of the following code for rotating a matrix 90 degrees clockwise? python Copy code def rotate(matrix): matrix[:] = zip(*matrix[::-1]) return matrix matrix = [ [1, 2, 3], [4, 5, 6], [7, 8, 9] ] print(rotate(matrix))

What will be the output of the following code that uses a stack to check for balanced parentheses? python Copy code def isValid(s): stack = [] mapping = {')': '(', '}': '{', ']': '['} for char in s: if char in mapping: top_element = stack.pop() if stack else '#' if mapping[char] != top_element: return False else: stack.append(char) return not stack print(isValid("()[]{}"))

What is the output of the following code that inserts words into a trie and checks if a word exists? python Copy code class TrieNode: def _init_(self): self.children = {} self.is_end_of_word = False class Trie: def _init_(self): self.root = TrieNode() def insert(self, word): node = self.root for char in word: if char not in node.children: node.children[char] = TrieNode() node = node.children[char] node.is_end_of_word = True def search(self, word): node = self.root for char in word: if char not in node.children: return False node = node.children[char] return node.is_end_of_word trie = Trie() trie.insert("hello") print(trie.search("hello"))

What will be the output of the Breadth-First Search (BFS) starting from node A for the following graph? css Copy code A -- B | | C -- D

What is the output of the following code that finds the minimum value in a Binary Search Tree (BST)? python Copy code class TreeNode: def _init_(self, value): self.value = value self.left = None self.right = None def findMin(root): current = root while current.left is not None: current = current.left return current.value root = TreeNode(10) root.left = TreeNode(5) root.right = TreeNode(20) root.left.left = TreeNode(2) root.left.right = TreeNode(8) print(findMin(root))

What is the output of the following code for the longest common subsequence of "ABCD" and "ACBAD"? python Copy code def lcs(X, Y): m = len(X) n = len(Y) L = [[None]*(n+1) for i in range(m+1)] for i in range(m+1): for j in range(n+1): if i == 0 or j == 0: L[i][j] = 0 elif X[i-1] == Y[j-1]: L[i][j] = L[i-1][j-1] + 1 else: L[i][j] = max(L[i-1][j], L[i][j-1]) return L[m][n] print(lcs("ABCD", "ACBAD"))

What is the output of the following code for finding the maximum subarray sum using the divide and conquer approach for the array [-2, 1, -3, 4, -1, 2, 1, -5, 4]? python Copy code def maxSubArraySum(arr, l, h): if l == h: return arr[l] m = (l + h) // 2 return max(maxSubArraySum(arr, l, m), maxSubArraySum(arr, m+1, h), maxCrossingSum(arr, l, m, h)) def maxCrossingSum(arr, l, m, h): sm = 0 left_sum = float('-inf') for i in range(m, l-1, -1): sm = sm + arr[i] if (sm > left_sum): left_sum = sm sm = 0 right_sum = float('-inf') for i in range(m+1, h+1): sm = sm + arr[i] if (sm > right_sum): right_sum = sm return left_sum + right_sum arr = [-2, 1, -3, 4, -1, 2, 1, -5, 4] n = len(arr) print(maxSubArraySum(arr, 0, n-1))

What is the output of the following code for finding the single number in an array where every element appears twice except for one? python Copy code def singleNumber(nums): result = 0 for num in nums: result ^= num return result print(singleNumber([4, 1, 2, 1, 2]))

What will be the output of the following code for finding the topological sort of the given graph? python Copy code from collections import defaultdict class Graph: def _init_(self): self.graph = defaultdict(list) def addEdge(self, u, v): self.graph[u].append(v) def topologicalSortUtil(self, v, visited, stack): visited[v] = True for i in self.graph[v]: if not visited[i]: self.topologicalSortUtil(i, visited, stack) stack.insert(0, v) def topologicalSort(self): visited = {i: False for i in self.graph} stack = [] for i in list(self.graph): if not visited[i]: self.topologicalSortUtil(i, visited, stack) return stack g = Graph() g.addEdge(5, 2) g.addEdge(5, 0) g.addEdge(4, 0) g.addEdge(4, 1) g.addEdge(2, 3) g.addEdge(3, 1) print(g.topologicalSort())

What is the output of the following code for the edit distance between "kitten" and "sitting"? python Copy code def editDistance(str1, str2): m = len(str1) n = len(str2) dp = [[0 for x in range(n+1)] for x in range(m+1)] for i in range(m+1): for j in range(n+1): if i == 0: dp[i][j] = j elif j == 0: dp[i][j] = i elif str1[i-1] == str2[j-1]: dp[i][j] = dp[i-1][j-1] else: dp[i][j] = 1 + min(dp[i][j-1], dp[i-1][j], dp[i-1][j-1]) return dp[m][n] print(editDistance("kitten", "sitting"))

What will be the output of the following code for finding the minimum spanning tree using Kruskal's algorithm? python Copy code class Graph: def _init_(self, vertices): self.V = vertices self.graph = [] def addEdge(self, u, v, w): self.graph.append([u, v, w]) def find(self, parent, i): if parent[i] == i: return i return self.find(parent, parent[i]) def union(self, parent, rank, x, y): xroot = self.find(parent, x) yroot = self.find(parent, y) if rank[xroot] < rank[yroot]: parent[xroot] = yroot elif rank[xroot] > rank[yroot]: parent[yroot] = xroot else: parent[yroot] = xroot rank[xroot] += 1 def KruskalMST(self): result = [] i = 0 e = 0 self.graph = sorted(self.graph, key=lambda item: item[2]) parent = [] rank = [] for node in range(self.V): parent.append(node) rank.append(0) while e < self.V - 1: u, v, w = self.graph[i] i = i + 1 x = self.find(parent, u) y = self.find(parent, v) if x != y: e = e + 1 result.append([u, v, w]) self.union(parent, rank, x, y) return result g = Graph(4) g.addEdge(0, 1, 10) g.addEdge(0, 2, 6) g.addEdge(0, 3, 5) g.addEdge(1, 3, 15) g.addEdge(2, 3, 4) print(g.KruskalMST())

What will be the output of the following code for finding the minimum number of coins for a given amount using the greedy algorithm? (Denominations are 1, 5, 10, 25) python Copy code def minCoins(coins, amount): coins.sort(reverse=True) count = 0 for coin in coins: while amount >= coin: amount -= coin count += 1 return count print(minCoins([1, 5, 10, 25], 63))

What is the output of the post-order traversal of the following binary tree? markdown Copy code 10 / \ 5 20 / \ \ 2 7 30

What will be the output of the following code that finds the height of a binary search tree? python Copy code class TreeNode: def _init_(self, value): self.value = value self.left = None self.right = None def height(root): if root is None: return 0 else: return max(height(root.left), height(root.right)) + 1 root = TreeNode(10) root.left = TreeNode(5) root.right = TreeNode(20) root.left.left = TreeNode(2) root.left.right = TreeNode(7) root.right.right = TreeNode(30) print(height(root))

What will be the output of the following code for finding the shortest path using Dijkstra's algorithm for the given graph? python Copy code import heapq def dijkstra(graph, start): heap = [(0, start)] visited = set() distances = {start: 0} while heap: (cost, u) = heapq.heappop(heap) if u in visited: continue visited.add(u) for v, weight in graph[u].items(): if v not in visited: old_cost = distances.get(v, float('inf')) new_cost = distances[u] + weight if new_cost < old_cost: distances[v] = new_cost heapq.heappush(heap, (new_cost, v)) return distances graph = { 'A': {'B': 1, 'C': 4}, 'B': {'A': 1, 'C': 2, 'D': 5}, 'C': {'A': 4, 'B': 2, 'D': 1}, 'D': {'B': 5, 'C': 1} } print(dijkstra(graph, 'A'))

What will be the output of the following code for representing a graph as an adjacency list and printing it? python Copy code class Graph: def _init_(self): self.graph = defaultdict(list) def addEdge(self, u, v): self.graph[u].append(v) def printGraph(self): for node in self.graph: print(f"{node} -> {', '.join(map(str, self.graph[node]))}") g = Graph() g.addEdge(0, 1) g.addEdge(0, 4) g.addEdge(1, 2) g.addEdge(1, 3) g.addEdge(1, 4) g.addEdge(2, 3) g.addEdge(3, 4) g.printGraph()

What is the output of the following code for finding the longest palindromic substring of "babad"? python Copy code def longestPalindrome(s): res = "" for i in range(len(s)): odd = expandAroundCenter(s, i, i) even = expandAroundCenter(s, i, i + 1) res = max(res, odd, even, key=len) return res def expandAroundCenter(s, l, r): while l >= 0 and r < len(s) and s[l] == s[r]: l -= 1 r += 1 return s[l + 1:r] print(longestPalindrome("babad"))