Time Left - 35:00 mins
GATE 2018 Mini Mock 9 (full syllabus)
Attempt now to get your rank among 1213 students!
Question 1
Consider the following statements.
S1: f(x) = x5 + 3x - 1 is an increasing function for all values of x.
S2: f(x) = 1-x3-x9 is decreasing function for all values of x where x 0.
Which of the above statements are TRUE.
S1: f(x) = x5 + 3x - 1 is an increasing function for all values of x.
S2: f(x) = 1-x3-x9 is decreasing function for all values of x where x 0.
Which of the above statements are TRUE.
Question 2
What will be the postfix equivalent of the following infix expression:
Question 3
Consider the following polynomial equation where a,b,c,d and e are not equal to zero. What would be the minimum number of multiplication required to calculate the polynomial ?
Question 4
Assume CPU is implemented using 4 stage pipepine IF, ID, EX and WB latencies are 6, 4, 8 and 4 respectively (in ns). IF ALU is made 50% faster then find time (in ns) to execute N instructions?
Question 5
Choose the correct option:
I. Pure Aloha is a continuous system.
II. Pure Aloha sends data in time slots.
I. Pure Aloha is a continuous system.
II. Pure Aloha sends data in time slots.
Question 6
The number of 4 line to-16 line decoders required to make an 8-line-to-256 line decoder is
Question 7
Consider the following languages.
Which of the following are CORRECT?
I. is context-free but not regular.
II. is not context-free.
III. is not context-free but recursive.
IV. is deterministic context-free.
Which of the following are CORRECT?
I. is context-free but not regular.
II. is not context-free.
III. is not context-free but recursive.
IV. is deterministic context-free.
Question 8
A B+ tree is build with the following parameters.
1. System block size is 230 bytes.
2. Ignore space needed for block pointer.
3. Record pointer is 16 bytes
4. Block pointer is 14 bytes.
5. Index keys are of 8 bytes each.
What is the maximum order of leaf node that can be constructed using above parameters.
1. System block size is 230 bytes.
2. Ignore space needed for block pointer.
3. Record pointer is 16 bytes
4. Block pointer is 14 bytes.
5. Index keys are of 8 bytes each.
What is the maximum order of leaf node that can be constructed using above parameters.
Question 9
Identify the type of error (earliest phase) identified during compilation of the following program.
#include<stdio.h>
main()
{
int gate, exam, rank;
gate= exam= rank=10.3;
printf (“ %c”, gate);
}
#include<stdio.h>
main()
{
int gate, exam, rank;
gate= exam= rank=10.3;
printf (“ %c”, gate);
}
Question 10
In excess-127 format when exponent E′ = 225 and mantissa M ≠ 0, in such situation if we perform 0/0 or then result is ________
Question 11
Consider the following set of processes, with the length of the CPU burst given in milliseconds:
If the average waiting time for the process is 4 ms. Then which of the processes among the following will give the result?
Question 12
Let z = x sin y-y sin x. The partial differential of z = ____.
Question 13
Consider the following code snippet in C:
int *p, *q;
p = malloc(4);
*p = 20;
p = malloc(4); q = p; free(p);
*q = 88;
Consider the following situations
1) Memory Leak
2) Danglingpointer
Among these problems what can be found in the above code?
int *p, *q;
p = malloc(4);
*p = 20;
p = malloc(4); q = p; free(p);
*q = 88;
Consider the following situations
1) Memory Leak
2) Danglingpointer
Among these problems what can be found in the above code?
Question 14
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?
P : Minimum spanning tree of G does not change
Q : Shortest path between any pair of vertices does not change
P : Minimum spanning tree of G does not change
Q : Shortest path between any pair of vertices does not change
Question 15
Which of the following instruction processing activity of the CPU can’t be pipelined.
Question 16
Consider a CIDR IP address 178.168.0.0/14. Find total number of valid hosts.
Question 17
What is the number of select lines required in a single input n-output demultiplexer?
Question 18
Consider the following languages.
L1 = { <M> | M takes at least 2016 steps on some input},
L2 = { <M> | M takes at least 2016 steps on all inputs} and
L3 = { <M> | M accepts ε},
where for each Turing machine M, <M> denotes a specific encoding of M. Which one of the following is TRUE?
L1 = { <M> | M takes at least 2016 steps on some input},
L2 = { <M> | M takes at least 2016 steps on all inputs} and
L3 = { <M> | M accepts ε},
where for each Turing machine M, <M> denotes a specific encoding of M. Which one of the following is TRUE?
Question 19
Consider the following set of relation schemas
STUDENTS (ROLLNO, NAME, DOB, AGE)
ENROLL (ROLLNO, COURSENO)
COURSES (COURSENO, COURSENAME, INSTRUCTOR)
GRADES (ROLLNO, COURSENO, GRADE)
Consider the following SQL Query: -
Select distinct Name, Rollno
From Students, Courses, Grades
Where ((Students.Rollno = Grades.Rollno) and (Courses.Instructor = ‘Mohan’) and (Courses.Courseno = Grades.Courseno) and Grades.Grade = ‘A’))
Which of the following sets is computed by above query?
STUDENTS (ROLLNO, NAME, DOB, AGE)
ENROLL (ROLLNO, COURSENO)
COURSES (COURSENO, COURSENAME, INSTRUCTOR)
GRADES (ROLLNO, COURSENO, GRADE)
Consider the following SQL Query: -
Select distinct Name, Rollno
From Students, Courses, Grades
Where ((Students.Rollno = Grades.Rollno) and (Courses.Instructor = ‘Mohan’) and (Courses.Courseno = Grades.Courseno) and Grades.Grade = ‘A’))
Which of the following sets is computed by above query?
Question 20
The idea of automation with a stack as auxiliary storage is supported by?
- 1213 attempts
- 7 upvotes
- 12 comments
Tags :
GATE & PSU CSMock TestsAug 18GATE & PSU CS