Skip to content
Gblog Geek Week 2021 – The Biggest Festival For Programmers
The month of October brings along with itself festive vibes, good food & so many holidays too! Add to all that, a bit of geeky-ness.… Read More
There were total 2 rounds. Round 1: There were 60 MCQs(20 English + 20 Logical reasoning + 20 Data Interpretation ) to be solved in… Read More
A and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt… Read More
The employee information in a company is stored in the relation Employee (name, sex, salary, deptName) Consider the following SQL query select deptName from Employee… Read More
The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer… Read More
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one… Read More
Given three arrays sorted in non-decreasing order, print all common elements in these arrays. Examples:  Input: ar1[] = {1, 5, 10, 20, 40, 80} ar2[] = {6,… Read More
Round 1 : ~200 students Duration 60 minutes Written round, comprising of aptitude question, logical puzzles, and technical questions. (basic aptitude + heavy java) You… Read More
Recently I got interviewed with Amazon for SDE1 position and here is my interview experience which I would like to share with others. Telephonic round:… Read More
Skype round: 1) Print the last n lines of a file (Hint : treat it like a linked list) 2) Length encoding – Input: aaabbc… Read More
The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies: name, courseNo → grade rollNo, courseNo → grade name → rollNo… Read More
A Unix-style i-node has 10 direct pointers and one single, one double and one triple indirect pointers. Disk block size is 1 Kbyte, disk block… Read More
Consider two processes P1 and P2 accessing the shared variables X and Y protected by two binary semaphores SX and SY respectively, both initialized to… Read More
Consider a system with a two-level paging scheme in which a regular memory access takes 150 nanoseconds, and servicing a page fault takes 8 milliseconds.… Read More
Consider the following set of processes, with the arrival times and the CPU-burst times given in milliseconds Process Arrival Time Burst Time P1 0 5… Read More
Consider the grammar with the following translation rules and E as the start symbol. E → E1 # T { E.value = E1.value * T.value… Read More