Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User dutta18
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by dutta18
4
answers
1
GATE IT 2005 | Question: 4
Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ ... TRUE? It is necessarily regular but not necessarily context-free. It is necessarily context-free. It is necessarily non-regular. None of the above
commented
in
Theory of Computation
Dec 29, 2022
6.3k
views
gateit-2005
theory-of-computation
normal
identify-class-language
1
answer
2
Self doubt
How to do this Boolean multiplication? And which Boolean law is applicable here ? ( P' + Q ) ( Q' + P )
answer selected
in
Mathematical Logic
Dec 9, 2022
95
views
self-doubt
digital-logic
boolean-algebra
5
answers
3
GATE CSE 2022 | Question: 20
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
answered
in
Graph Theory
Dec 1, 2022
3.6k
views
gatecse-2022
numerical-answers
graph-theory
graph-connectivity
1-mark
4
answers
4
GATE CSE 2006 | Question: 71
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of vertices of degree zero in $G$ is: $1$ $n$ $n + 1$ $2^n$
commented
in
Graph Theory
Nov 22, 2022
13.9k
views
gatecse-2006
graph-theory
normal
degree-of-graph
2
answers
5
GATE CSE 2020 | Question: 38
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space $202.61.0.0/17$. The ... $202.61.144.0/21$ I and II only II and III only III and IV only I and IV only
answered
in
Computer Networks
Nov 18, 2022
16.4k
views
gatecse-2020
computer-networks
subnetting
2-marks
2
answers
6
GATE CSE 2021 Set 2 | GA Question: 3
If $\theta$ is the angle, in degrees, between the longest diagonal of the cube and any one of the edges of the cube, then, $\cos \theta =$ $\frac{1}{2} \\$ $\frac{1}{\sqrt{3}} \\$ $\frac{1}{\sqrt{2}} \\$ $\frac{\sqrt{3}}{2}$
commented
in
Quantitative Aptitude
Nov 7, 2022
5.6k
views
gatecse-2021-set2
quantitative-aptitude
mensuration
cube
1-mark
4
answers
7
GATE CSE 2014 Set 2 | Question: 43
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
commented
in
CO and Architecture
Nov 4, 2022
16.7k
views
gatecse-2014-set2
co-and-architecture
cache-memory
normal
2
answers
8
GATE CSE 2022 | Question: 44
Consider a system with $2 \;\text{KB}$ direct mapped data cache with a block size of $64 \; \text{bytes}.$ The system has a physical address space of $64 \; \text{KB}$ and a word length of $16 \; \text{bits.}$ During the execution of a program, four data ... only $\text{R}$ and $\text{S}$ reside in the cache. Every access to $\text{R}$ evicts $\text{Q}$ from the cache.
commented
in
CO and Architecture
Nov 2, 2022
3.5k
views
gatecse-2022
co-and-architecture
direct-mapping
multiple-selects
2-marks
3
answers
9
GATE CSE 2018 | Question: 8
Which one of the following statements is FALSE? Context-free grammar can be used to specify both lexical and syntax rules Type checking is done before parsing High-level language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack
commented
in
Compiler Design
Oct 20, 2022
9.4k
views
gatecse-2018
compiler-design
easy
compilation-phases
1-mark
6
answers
10
GATE CSE 2022 | Question: 41
Consider the following recurrence: $\begin{array}{} f(1) & = & 1; \\ f(2n) & = & 2f(n) - 1, & \; \text{for}\; n \geq 1; \\ f(2n+1) & = & 2f(n) + 1, & \; \text{for}\; n \geq 1. \end{array}$ Then, which of the following statements is/are $\text{TRUE}?$ ... $f(2^{n}) = 1$ $f(5 \cdot 2^{n}) = 2^{n+1} + 1$ $f(2^{n} + 1) = 2^{n} + 1$
answered
in
Combinatory
Oct 11, 2022
3.8k
views
gatecse-2022
combinatory
recurrence-relation
multiple-selects
2-marks
0
answers
11
GATE CSE 2020
Is this language a regular language ? If yes why and if No why ? The last part is “x!=y” cropped in the picture According to my understanding this is not regular because its says number of x = number of y But Finite automata cant compare the number of x and y here with limited memory. Can you please explain ?
asked
in
Theory of Computation
Sep 22, 2022
640
views
number-of-dfa
theory-of-computation
1
answer
12
context free language
Show that the language L={xy∣|x|=|y|,x≠y} is context free. Do not give links plz explain in simple manner
commented
in
Theory of Computation
Sep 22, 2022
2.6k
views
3
answers
13
GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.
commented
in
Theory of Computation
Sep 22, 2022
13.0k
views
gatecse-2020
theory-of-computation
identify-class-language
2-marks
6
answers
14
GATE CSE 2020 | Question: 51
Consider the following language. $L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$ The minimum number of states in DFA that accepts $L$ is _________
answered
in
Theory of Computation
Sep 22, 2022
9.5k
views
gatecse-2020
numerical-answers
theory-of-computation
regular-language
2-marks
1
answer
15
Conversion of Regular expression to Finite Automata
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?
commented
in
Theory of Computation
Sep 21, 2022
148
views
theory-of-computation
finite-automata
number-of-dfa
4
answers
16
GATE CSE 2017 Set 1 | Question: 21
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$ ... available. The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .
commented
in
Digital Logic
Sep 11, 2022
10.8k
views
gatecse-2017-set1
digital-logic
k-map
numerical-answers
normal
6
answers
17
GATE CSE 2009 | Question: 6
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates? $2$ $3$ $4$ $5$
commented
in
Digital Logic
Jan 13, 2021
16.1k
views
gatecse-2009
digital-logic
min-no-gates
normal
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...