Skip to content
All Hard Articles
Let P(x) and Q(x) be arbitrary predicates. Which of the following statements is always TRUE? (A) ((∀x(P(x)∨Q(x))))⟹((∀xP(x))∨(∀xQ(x))) (B) (∀x(P(x)⟹Q(x)))⟹((∀xP(x))⟹(∀xQ(x))) (C) (∀x(P(x))⟹∀x(Q(x)))⟹(∀x(P(x)⟹Q(x))) (D) (∀x(P(x))⇔(∀x(Q(x))))⟹(∀x(P(x)⇔Q(x))) Answer: (B)… Read More
In a depth-first traversal of a graph G with n vertices, k edges are marked as tree edges. The number of connected components in G… Read More
Given an array that represents Inorder Traversal, find all possible Binary Trees with the given Inorder traversal and print their preorder traversals. Examples: Input: in[]… Read More
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted then the… Read More
Suppose that the maximum transmit window size for a TCP connection is 12000 bytes. Each packet consists of 2000 bytes. At some point of time,… Read More
A relation Empdtl is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state.… Read More
The article describes an approach to solving the problem of finding the LCA of two nodes in a tree by reducing it to a RMQ… Read More
We are given two arrays num[0..k-1] and rem[0..k-1]. In num[0..k-1], every pair is coprime (gcd for every pair is 1). We need to find minimum… Read More
Round 1 Coding Assignment – TCP sender receiver communication with handling of duplicate and out of order packets. Scenario: An application receives packets from a… Read More
Coding Round : Binary tree was given. Return a tree such that each internal node stores sum of all its child nodes. Each leaf node… Read More
Round 1: Discussed about projects Find two elements in BST such that their sum is k Given an array, find minimum positive integer missing in… Read More
I recently interviewed for Visa Inc. on our campus. Coding Test: Platform: Hackerrank Questions: Find the number of islands https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/ I dont remember the other… Read More
The following is a description of the instance of this famous puzzle involving 2 eggs and a building with 100 floors. Suppose that we wish… Read More
1) Coding Round: Write down code in any language for a simple employee hierarchy which has 3 types of employees. 1. CEO 2. Manager 3.… Read More
Think Before You Connect Before you connect to any public Wi-Fi hotspot–like on an airplane or in an airport, hotel, train/bus station or café-be sure… Read More
Q1. Given a sequence of integers, find the longest increasing subsequence. Example: arr = [1, 2, 5, 3, 7] ans : [1, 2, 5, 7]… Read More
Recently Payu came for recruitment in our college. Hiring Process : Online Test + 3 Technical Rounds + HR Round. Position : Software Engineer Online… Read More
MORAGAN STANLEY visited our campus. Selection procedure: Round 1: online test 50 objectives (aptiutde,ds,os,etc…) 2 coding question      1. Simple count the numbers in the given… Read More
One Interview Only (Technical + HR) 1. Tell me about yourself. Your favorite subjects(I mentioned DS, OS, OOPs, DBMS) 2. Tell difference between declaration and… Read More
Smartprix recently visited my campus. First round was of 2 sections; Aptitude-consisted of Diagrammatic reasoning, Image analysis, Picture sequencing related 20 questions in 25 minutes… Read More