ISRO | ISRO CS 2015 | Question 41

The number of spanning tree for a complete graph with seven vertices are: (A) 25 (B) 75 (C) 35 (D) 22×5 Answer: (B) Explanation: The… Read More »

ISRO | ISRO CS 2015 | Question 40

The time complexity of the following C function is (assume n > 0) int recursive (int n) { if(n == 1) return (1); else return… Read More »

Euler Tour of Tree

A Tree is a generalization of connected graph where it has N nodes that will have exactly N-1 edges, i.e one edge between every pair… Read More »

Number of Unicolored Paths between two nodes

Given an undirected colored graph(edges are colored), with a source vertex ‘s’ and a destination vertex ‘d’, print number of paths which from given ‘s’… Read More »

PHP | Remove duplicate elements from Array

You are given an Array of n-elements.You have to remove the duplicate values without using any loop in PHP and print the array. Examples: Input… Read More »

ISRO | ISRO CS 2015 | Question 39

If a node has K children in Btree, then the node contains exactly _____ keys. (A) K2 (B) K – 1 (C) K + 1… Read More »

ISRO | ISRO CS 2015 | Question 38

Suppose two jobs, each of which needs 10 minutes of CPU time, start simultaneously. Assume 50% I/O wait time. How long will it take for… Read More »

ISRO | ISRO CS 2015 | Question 37

Consider the following program. main() { fork(); fork(); fork(); } How many new processes will be created? (A) 8 (B) 6 (C) 7 (D) 5… Read More »

ISRO | ISRO CS 2015 | Question 36

Increasing the RAM of a computer typically improves performance because: (A) Virtual Memory increases (B) Larger RAMs are faster (C) Fewer page faults occur (D)… Read More »

Count smaller elements in sorted array in C++

Given a sorted array and a number x, count smaller elements than x in the given array. Examples: Input : arr[] = {10, 20, 30,… Read More »

ISRO | ISRO CS 2015 | Question 35

At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operations were completed on… Read More »

Sum of special triplets having elements from 3 arrays

Given three arrays A, B and C, the task is to find sum of values of all special triplets. A special triplet is defined as… Read More »

ISRO | ISRO CS 2015 | Question 34

A hard disk system has the following parameters : Number of tracks = 500 Number of sectors/track = 100 Number of bytes /sector = 500… Read More »

ISRO | ISRO CS 2015 | Question 33

Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited for ready queue… Read More »

C++ map having key as a user define data type

C++ map stores keys in ordered form (Note that it internally use a self balancing binary search tree). Ordering is internally done using operator ”… Read More »