Skip to content

Tag Archives: Gate IT 2007

Early binding refers to a binding performed at compile time and late binding refers to a binding performed at execution time. Consider the following statements:… Read More
Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping. int i ; program… Read More
Consider the program below in a hypothetical language which allows global variable and a choice of call by reference or call by value methods of… Read More
Consider the following C program:    #include             #define EOF -1            void push (int); /* push the argument on the stack */            int pop  (void); /* pop… Read More
Consider the C program given below : #include <stdio.h> int main ()    {     int sum = 0, maxsum = 0,  i,  n = 6;     int… Read More
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) —… Read More
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are… Read More
Consider a hash function that distributes keys uniformly. The hash table size is 20. After hashing of how many keys will the probability that any… Read More
The function f is defined as follows: int f (int n) {     if (n <= 1) return 1;     else if (n % 2  ==  0)… Read More
Consider n jobs J1, J2,……Jn such that job Ji has execution time ti and a non-negative integer weight wi. The weighted mean completion time of… Read More
What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?… Read More
A depth-first search is performed on a directed acyclic graph. Let d[u] denote the time at which vertex u is visited for the first time… Read More
A partial order P is defined on the set of natural numbers as follows. Here x/y denotes integer division. i. (0, 0) ∊ P. ii.… Read More
The trapezoidal method is used to evaluate the numerical value of . Consider the following values for the step size h. i. 10-2 ii. 10-3… Read More
Which one of these first-order logic formula is valid? (A) ∀x(P(x) => Q(x)) => (∀xP(x) => ∀xQ(x)) (B) ∃x(P(x) ∨ Q(x)) => (∃xP(x) => ∃xQ(x))… Read More

Start Your Coding Journey Now!