Time Left - 08:00 mins
DMRC CS 2018 Practice Quiz - 14(Tech)
Attempt now to get your rank among 169 students!
Question 1
Which of the following sorting methods will be the best, it the number of swapping done, is the only measure of efficiency?
Question 2
What is the minimum number of stacks of size n required to implement a queue of size n?
Question 3
Sending an e-mail is similar to____.
Question 4
A program consist of four major types of instructions. The instruction mix and the CPI for each instruction type are given in the following table.
If the clock frequency of the processor is 400 MHz. what is the average CPI of the processor?
If the clock frequency of the processor is 400 MHz. what is the average CPI of the processor?
Question 5
Let R1 (
, B, C) and R2 (
, E) be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in R1 referring to R2. Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r1and r2. Which one of the following relational algebra expressions would necessarily produce an empty relation?
, B, C) and R2 (, E) be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in R1 referring to R2. Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r1and r2. Which one of the following relational algebra expressions would necessarily produce an empty relation?Question 6
Which of the following is not a necessary condition to occur the deadlock?
Question 7
What is the number of select lines required in a single input n-output demultiplexer?
Question 8
The term used to describe those people whose jobs involve sponsoring and funding the project to develop, operate, and maintain the information system is
Question 9
An attempt to make a computer resource unavailable to its intended users is called
Question 10
What is the value printed by the following C program?
#include < stdio.h >
int f(int * a, int n)
{
if (n <= 0)return 0;
else if(*a % 2 = = 0) return * a + f(a + 1, n – 1);
else return * a – f(a + 1, n – 1);
}
int main ( )
{
int a[ ] = {12, 7, 13, 4, 11, 6};
printf ("%d", f(a,6));
return 0;
}
#include < stdio.h >
int f(int * a, int n)
{
if (n <= 0)return 0;
else if(*a % 2 = = 0) return * a + f(a + 1, n – 1);
else return * a – f(a + 1, n – 1);
}
int main ( )
{
int a[ ] = {12, 7, 13, 4, 11, 6};
printf ("%d", f(a,6));
return 0;
}
- 169 attempts
- 3 upvotes
- 1 comment
Tags :
GATE & PSU CSGeneralJun 16GATE & PSU CS
