All Medium Articles
The control signal functions of a 4-bit binary counter are given below (where X is “don’t care”) The counter is connected as follows: The counter… Read More
Define the connective * for the Boolean variables X and Y as: X * Y = XY + X’ Y’. Let Z = X *… Read More
Consider the series Xn+1 = Xn/2 + 9/(8 Xn), X0 = 0.5 obtained from the Newton-Raphson method. The series converges to (A) 1.5 (B) sqrt(2)… Read More
(A) A (B) B (C) C (D) D Answer: (C) Explanation: A partition is said to refine another partition if it splits the sets in… Read More
Find the distance between two keys in a binary tree, no parent pointers are given. The distance between two nodes is the minimum number of… Read More
Which of the following graphs has an Eulerian circuit? (A) Any k-regular graph where kis an even number. (B) A complete graph on 90 vertices… Read More
Which of the following is TRUE? (A) Every subset of a regular set is regular. (B) Every finite subset of a non-regular set is regular.… Read More
Given a binary tree (not a binary search tree) and two values say n1 and n2, write a program to find the least common… Read More
What is the maximum number of different Boolean functions involving n Boolean variables? (A) n2 (B) 2n (C) 22n (D) 2n2 Answer: (C) Explanation: No… Read More
Consider the data given in above question. Which of the following is a correct attribute set for one of the tables for the correct answer… Read More
A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is… Read More
Given a linked list, reverse alternate nodes and append them to the end of the list. Extra allowed space is O(1)  Examples: Attention reader! Don’t stop… Read More
Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as… Read More
In the previous post, we discussed the introduction to Red-Black Trees. In this post, insertion is discussed. In AVL tree insertion, we used rotation as… Read More
You are given the postorder traversal, P, of a binary search tree on the n elements 1, 2, …, n. You have to determine the… Read More
I have a total experience of two years. I am sharing my interview experience with Amazon. This is for SDE1 Amazon. A very big thanks… Read More
I recently went through the Amazon interview process for the post of SDE-1. Round 1 (Written) 1. Given an array, output an array where every… Read More
class Test {     public static void main(String args[])  {        System.out.println(10  +  20 + "GeeksQuiz");         System.out.println("GeeksQuiz" + 10 + 20);     }   } (A) 30GeeksQuiz GeeksQuiz30 (B)… Read More
Let fsa and pda be two predicates such that fsa(x) means x is a finite state automaton, and pda(y) means that y is a pushdown… Read More
Hello geeks, Last month I appeared for the Internship Interview of Amazon. What my personal experience says is that never try to jump to the… Read More