## Prop Tiger Interview Experience | Set 3 (On-Campus)

Round 1 : This was an online objective round comprising of 4 sections : aptitude, basic Reasoning, English and a technical section which included questions… Read More »

## Program for FCFS CPU Scheduling | Set 1

Given n processes with their burst times, the task is to find average waiting time and average turn around time using FCFS scheduling algorithm. First… Read More »

## Count minimum bits to flip such that XOR of A and B equal to C

Given a sequence of three binary sequences A, B and C of N bits. Count the minimum bits required to flip in A and B… Read More »

## Distance of nearest cell having 1 in a binary matrix

Given a binary matrix of N x M, containing at least a value 1. The task is to find the distance of nearest 1 in… Read More »

## Make all array elements equal with minimum cost

Given an array which contains integer values, we need to make all values of this array equal to some integer value with minimum cost where… Read More »

## Generation of n numbers with given set of factors

Given an array of k numbers factor[], the task is to print first n numbers (in ascending order) whose factors are from the given array.… Read More »

## Implementation of Affine Cipher

The Affine cipher is a type of monoalphabetic substitution cipher, wherein each letter in an alphabet is mapped to its numeric equivalent, encrypted using a… Read More »

Given two polynomial numbers represented by a linked list. Write a function that add these lists means add the coefficients who have same variable powers.… Read More »

## Complex numbers in C++ | Set 2

We introduced and discussed the concept in Complex numbers in C++ | Set 1 The remaining functions with example are discussed here: log() – It… Read More »

## Find an Integer point on a line segment with given two ends

Given two points pointU and pointV in XY-space, we need to find a point which has integer coordinates and lies on a line going through… Read More »

## Encapsulation in Java

Encapsulation is defined as the wrapping up of data under a single unit. It is the mechanism that binds together code and the data it… Read More »

## Check if a given directed graph is strongly connected | Set 2 (Kosaraju using BFS)

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if there is a path… Read More »

## GATE | GATE-CS-2017 (Set 1) | Question 65

Instruction execution in a processor is divided into 5 stages. Instruction Fetch(IF), Instruction Decode (ID), Operand Fetch(OF), Execute(EX), and Write Back(WB), These stages take 5,4,20,… Read More »

## GATE | GATE-CS-2017 (Set 1) | Question 64

The output of executing the following C program is ________. # include int total(int v) { static int count = 0; while (v) { count… Read More »

## GATE | GATE-CS-2017 (Set 1) | Question 63

Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: S1: Random… Read More »