Courses
Tutorials
Jobs
Practice
Contests
Data Structure
Java
Python
HTML
Interview Preparation
Trending Now
DSA
Web Tech
Foundational Courses
Data Science
Practice Problem
Python
Machine Learning
JavaScript
System Design
Django
DevOps Tutorial
Java
C
C++
ReactJS
NodeJS
CP Live
Aptitude
Puzzles
Projects
GBlog
Frontend Developer Roadmap 2024
Frontend development means to design the face of a website or application. It involves working on the appearance of the website. Building interactive buttons, using images...
Read More
GATE | GATE-CS-2014-(Set-2) | Question 2
Who ___________ was coming to see us this evening?(A) you said (B) did you say(C) did you say that(D) had you Answer: (B) Explanation: Only (B) makes sense, others don't f...
Read More
GATE
GATE-GATE-CS-2014-(Set-2)
GATE-CS-2014-(Set-2)
GATE | GATE-CS-2014-(Set-2) | Question 1
Choose the most appropriate phrase from the options given below to complete the following sentence.India is a post-colonial country because(A) it was a former British colo...
Read More
GATE
GATE-GATE-CS-2014-(Set-2)
GATE-CS-2014-(Set-2)
GATE | GATE-CS-2014-(Set-1) | Question 65
Consider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 25% less ti...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id) You want...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 63
Which one of the following propositional logic formulas is TRUE when exactly two of p, q, and r are TRUE?(A) A(B) B(C) C(D) D Answer: (B) Explanation: Draw the truth table...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 62
An ordered n-tuple (d1, d2, … , dn) with d1 >= d2 >= ⋯ >= dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, … , dn resp...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 = i = 12, 1 = j = 12}. There is an edge between (a, b) and (...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 60
Let S denote the set of all functions f: {0,1}4 - {0,1}. Denote by N the number of functions from S to the set {0,1}. The value of Log2Log2N is ______.(A) 12(B) 13(C) 15(D...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
A pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of numbers with sum equal to n. For example, (1,1,2) is a 4-pennant. The set of al...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
Four fair six-sided dice are rolled. The probability that the sum being 22 is X/1296. The value of X is ________(A) 7(B) 8(C) 9(D) 10 Answer: (D) Explanation: In general,...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
A function is continuous in the interval [0, 2]. It is known that f(0) = f(2) = -1 and f(1) = 1. Which one of the following statements must be true. (A) There exist a y i...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 56
The function f(x) = x sinx satisfies the following equation f''(x) + f(x) + t cosx = 0. The value of t is(A) -1(B) -2(C) 1(D) 2 Answer: (B) Explanation: We have f(x) = x s...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
Consider a 4-to-1 multiplexer with two select lines S1 and S0, given belowThe minimal sum-of-products form of the Boolean expression for the output F of the multiplexer is...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
An access sequence of cache block address is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to th...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
GATE | GATE-CS-2014-(Set-1) | Question 65
Consider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executi...
Read More
GATE
GATE-GATE-CS-2014-(Set-1)
GATE-CS-2014-(Set-1)
1
...
11372
11373
11374
11375