Skip to content
All Medium Articles
Let, x1⊕x2⊕x3⊕x4 = 0 where x1, x2, x3, x4 are Boolean variables, and ⊕ is the XOR operator. Which one of the following must always… Read More
Consider that B wants to send a message m that is digitally signed to A. Let the pair of private and public keys for A… Read More
Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j} g is given by the entry Wij in the matrix… Read More
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap… Read More
What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a=3; void n(x) {x =… Read More
The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer a file of 29,154 kilobytes from… Read More
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are: (A) Θ(n log n), Θ(n log n) and Θ(n2)Attention reader!… Read More
Consider the following directed graph. Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes… Read More
We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this… Read More
In a process, the number of cycles to failure decreases exponentially with an increase in load. At a load of 80 units, it takes 100… Read More
C++ 11 introduced lambda expression to allow us write an inline function which can be used for short snippets of code that are not going… Read More
15 MCQs on c/c++ output based, 1 java questions was also there. Coding Round: 1. Convert a binary tree to its sum tree (https://www.geeksforgeeks.org/convert-a-given-tree-to-sum-tree/). 2.… Read More
I had an interview recently with HP R&D Lab Bangalore for 2+ years Java Developer position. There were 5 rounds. Anyway I sharing my interview… Read More
We have discussed Thread based Morris Traversal. Can we do inorder traversal without threads if we have parent pointers available to us?  Input: Root of… Read More
Statement: The game of Tic-Tac-Toe is being played between two players and it is in below state after six moves. Can you answer following questions?… Read More
Written round: One programming question of 3 hours duration. There were two rounds : tech PI and HR round. A. Tech. PI : Firstly,interviewer went… Read More
The interview took place for 3 days, consisting of 5 rounds. The procedure is as follows: Round I: This round is a basic round as… Read More
Introduction and Installation Grid System Buttons, Glyphicons, Tables DropDowns and Responsive Tabs Progress Bar and Jumbotron   In this article, we’ll learn creating forms. Forms are… Read More
The longest Zig-Zag subsequence problem is to find length of the longest subsequence of given sequence such that all elements of this are alternating. If a… Read More
Which of the following is correct about Python? (A) It supports automatic garbage collection. (B) It can be easily integrated with C, C++, COM, ActiveX,… Read More