Courses
Tutorials
Jobs
Practice
Contests
Data Structure
Java
Python
HTML
Interview Preparation
AI ML DS
Data Analysis
Data Visualization
Machine Learning
Deep Learning
NLP
Computer Vision
AI ML DS Interview Series
AI ML DS Projects series
Data Engineering
Web Scrapping
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 2021 | Set 1 | Question 46
Let G=(V,E) be an undirected unweighted connected graph. The diameter of G is defined as:Let M be the adjacency matrix of G.Define graph G2 on the same set of vertices wit...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 45
Consider the two statements.S1: There exist random variables X and Y such that S2: For all random variables X and Which one of the following choices is correct?(A) Both S1...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 44
Let G be a group of order 6, and H be a subgroup of G such that 1<|H|<6. Which one of the following options is correct?(A) Both G and H are always cyclic(B) G may not be c...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 43
Consider the relation R(P,Q,S,T,X,Y,Z,W) with the following functional dependencies.Consider the decomposition of the relation R into the constituent relations according t...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 42
Let ri(z) and wi(z) denote read and write operations respectively on a data item z by a transaction Ti. Consider the following two schedules.S1: r1(x)r1(y)r2(x)r2(y)w2(y)...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 41
Consider the following context-free grammar where the set of terminals is {a,b,c,d,f}.The following is a partially-filled LL(1) parsing table.Which one of the following ch...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 40
Consider the following recurrence relation.Which one of the following options is correct?(A) T(n) = Θ(n5/2)(B) T(n) = Θ(nlogn)(C) T(n) = Θ(n)(D) T(n) = Θ((logn)5/2) Answer...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 39
Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5c8d4d4d3d2c4d1c2c1, where the data bits and the check bits are given in the foll...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 38
Consider a 3-bit counter, designed using T flip-flops, as shown below: Assuming the initial state of the counter given by PQR as 000, what are the next three states?(A) 01...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 37
The following relation records the age of 500 employees of a company, where empNo ( indicating the employee number) is the key:Consider the following relational algebra ex...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 36
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation (SDT) actions, given as pseud...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 35
Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum ach...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 34
Consider the following representation of a number in IEEE 754 single-precision floating point format with a bias of 127.S : 1 E : 10000001 F : 1111000000000000000...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 33
A relation r(A,B) in a relational database has 1200 tuples. The attribute A has integer values ranging from 6 to 20, and the attribute B has integer values ranging from 1 ...
Read More
GATE
GATE | GATE CS 2021 | Set 1 | Question 32
Consider a computer system with a byte-addressable primary memory of size 232 bytes. Assume the computer system has a direct-mapped cache of size 32 KB (1 KB = 210 bytes),...
Read More
GATE
1
...
6500
6501
6502
...
11402