All Hard Articles
Interview Experience with Synopsys – On Campus
1st Round: MCQ test consisting of 60 question from Quantitative Aptitude, Logical Ability, C, C++, Algorithm, Data structures, Digital Design. 2nd Round: (20 minutes) 1.… Read More
Synopsys
Experiences
Interview Experiences
ServiceNow Interview Experience | Set 3 (On-Campus)
1st Round: MCQ test consisting of 30 questions to be done in 30 minutes with from topics like Trees, Graphs, SQL, Data bases, Computer Architecture,… Read More
Service Now
Experiences
Interview Experiences
Accolite Interview | Set 2 (On-Campus)
Accolite came to our campus for recruitment. First Round Written Test: 30 MCQs in which question related to DS Networking OS Unix commands DBMS. Questions… Read More
Accolite
DSA
Experiences
Heap
Interview Experiences
Linked List
Matrix
Tree
Microsoft Interview Experience | Set 41 (On-Campus)
MCQ Round: 15 MCQS were asked on c,c++, OS. Coding Round: 1) Given a linked list of co-ordinates where adjacent points either form a vertical… Read More
Microsoft
Experiences
Interview Experiences
LinkedIn Interview Experience | Set 4 (On-Campus)
ONLINE ROUND: 3 coding Questions in 1 hour : 1) Given a binary search tree and a key, if found return 1 else -1. 2)… Read More
Linkedin
Experiences
Interview Experiences
GATE | GATE-CS-2001 | Question 41
What is the minimum number of stacks of size n required to implement a queue of size n? (A) One (B) Two (C) Three (D)… Read More
GATE-CS-2001
GATE-GATE-CS-2001
GATE
GATE | GATE-CS-2001 | Question 50
How many undirected graphs (not necessarily connected) can be constructed out of a given set V = {v1, v2, … vn} of n vertices? (A)… Read More
GATE-CS-2001
GATE-GATE-CS-2001
GATE
GATE | GATE-CS-2001 | Question 38
Consider the following data path of a simple non-pilelined CPU. The registers A, B, A1, A2, MDR, the bus and the ALU are 8-bit wide.… Read More
GATE-CS-2001
GATE-GATE-CS-2001
GATE
GATE | GATE-CS-2001 | Question 13
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged (A) a hardware interrupt is needed (B) a… Read More
GATE-CS-2001
GATE-GATE-CS-2001
GATE
Walmart Labs Interview Experience
There was 1 coding round and 4 F2F interviews. This was for Software Developer Position(Note:-It was not for the research division in Walmart Labs)  Coding… Read More
Walmart
Arrays
DSA
Dynamic Programming
Experiences
Hash
Interview Experiences
Linked List
Sorting
Amazon Interview Experience | Set 152 (Kindle Team SDE-1 )
Recently I have participated in Amazon SDE interview for Chennai location Kindle team. Kindle team has arrived Bangalore location to take drive. I have given… Read More
Amazon
Experiences
Interview Experiences
K’th Smallest/Largest Element in Unsorted Array | Worst case Linear Time
We recommend reading the following posts as a prerequisite for this post.K’th Smallest/Largest Element in Unsorted Array K’th Smallest/Largest Element in Unsorted Array | Expected Linear… Read More
ABCO
Cisco
Microsoft
Order-Statistics
VMWare
Arrays
DSA
Searching
Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
Given two sorted linked lists, construct a linked list that contains maximum sum path from start to end. The result list may contain nodes from… Read More
DSA
Linked List
Goldman Sachs Interview Experience | Set 5
Goldman Sachs Interview Experience Round1: Introduce yourself and what are the projects you have worked on and detail discussion about the most recent project. Implement… Read More
Goldman Sachs
Experiences
Interview Experiences
GATE | GATE-CS-2003 | Question 90
Consider the C program shown below. C #include <stdio.h>#define print(x) printf(\"%d \", x)int x;void Q(int z){    z += x;    print(z);}void P(int *y){    int x = *y + 2;    Q(x);    *y… Read More
GATE-CS-2003
GATE-GATE-CS-2003
GATE
GATE | GATE-CS-2003 | Question 90
A 2 km long broadcast LAN has 107 bps bandwidth and uses CSMA/CD. The signal travels along the wire at 2 × 108 m/s. What… Read More
GATE-CS-2003
GATE-GATE-CS-2003
GATE
GATE | GATE-CS-2003 | Question 81
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T. The code for the processes P and Q… Read More
GATE-CS-2003
GATE-GATE-CS-2003
GATE
GATE | GATE-CS-2003 | Question 79
A processor uses 2-level page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and… Read More
GATE-CS-2003
GATE-GATE-CS-2003
GATE
GATE | GATE-CS-2003 | Question 78
A processor uses 2-level page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and… Read More
GATE-CS-2003
GATE-GATE-CS-2003
GATE
GATE | GATE-CS-2003 | Question 76
Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed to… Read More
GATE-CS-2003
GATE-GATE-CS-2003
GATE
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox