1st Round (Online) 15mcq 30mins – Most from C/C++. Few from OS 2nd Round: Coding Online (1 hour) 1st quest: https://www.geeksforgeeks.org/intersection-of-two-sorted-linked-lists/ 2nd quest: https://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/ 13th… Read More
Gblog
100 Days of Code – A Complete Guide For Beginners and Experienced
Do you want to become a successful software developer and dreaming about getting into the big tech companies? Are you someone who is already working… Read More
Videos
Explore
Online written Round: Initially an online written round was conducted consisting of following sections: 1. General aptitude 2. Logical Reasoning 3. Technical (Basic C/C++ questions)… Read More
Ques1. Find top 10 selling product given the count of sales of each product. Ques2. Design a valet parking lot with basic use-case of assigning… Read More
So recently Amadeus Labs visited my college for Campus Placements and finally picked 10 students. It also offered us 6 month training before the job.… Read More
Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A–>B, BC–>D, E–>C, D–>A}. What are… Read More
The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the… Read More
The following table has two attributes A and C where A is the primary key and C is the foreign key referencing A with on-delete… Read More
Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2,… Read More
Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 ms. The minimum frame size is (A) 94… Read More
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is… Read More
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf(“%d,%d\n”, a, &a); } else { a = a –5;… Read More
Suppose n processes, P1, …. Pn share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement… Read More
Consider a disk drive with the following specifications: 16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in… Read More
A device with data transfer rate 10 KB/sec is connected to a CPU. Data is transferred byte-wise. Let the interrupt overhead be 4 microsec. The… Read More
A 5 stage pipelined CPU has the following sequence of stages: IF — Instruction fetch from instruction memory, RD — Instruction decode and register read,… Read More
