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 Satbir
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Satbir
0
votes
121
Peter Linz Edition 4 Exercise 7.3 Question 9 (Page No. 200)
Is the language {$wcw^R : w ∈ ${$a, b$}$^*$} deterministic?
answered
in
Theory of Computation
Jun 23, 2019
293
views
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
0
votes
122
Graph Coloring
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
answered
in
Graph Theory
Jun 21, 2019
2.6k
views
graph-theory
graph-coloring
combinatory
2
votes
123
Finding the minimum element in a Heap
I was going through the heap concept and one question came into my mind what will be the best case time complexity of finding the minimum element in a max heap? Thank you:)
answered
in
DS
Jun 21, 2019
3.3k
views
binary-heap
time-complexity
2
votes
124
Planar Graph
Can minimum degree of a planar graph be $5$? Give some example
answered
in
Graph Theory
Jun 21, 2019
1.7k
views
graph-theory
graph-planarity
0
votes
125
Model Question IISc CDS CS Written Test Sample question
Anand is preparing a pizza with 8 slices, and he has 10 toppings to put on the pizza. He can put only one topping on each slice but can use the same topping on zero or more slices. In how many unique ways can he prepare the slices so that the same topping is not used in adjacent slices?
answered
in
Combinatory
Jun 18, 2019
1.8k
views
iisc
cds
8
votes
126
GATE CSE 1999 | Question: 4
Let $G$ be a finite group and $H$ be a subgroup of $G$. For $a \in G$, define $aH=\left\{ah \mid h \in H\right\}$. Show that $|aH| = |bH|.$ Show that for every pair of elements $a, b \in G$, either $aH = bH$ or $aH$ and $bH$ are disjoint. Use the above to argue that the order of $H$ must divide the order of $G.$
answered
in
Set Theory & Algebra
Jun 16, 2019
3.1k
views
gate1999
set-theory&algebra
group-theory
descriptive
proof
36
votes
127
GATE CSE 1998 | Question: 11
Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A $\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$ List the ordered pairs of the equivalence relations induced by $\Pi_1$. Draw the graph of the above ... $\left\langle\left\{\Pi_1, \Pi_2, \Pi_3, \Pi_4\right\}, \text{ refines } \right\rangle$.
answered
in
Set Theory & Algebra
Jun 15, 2019
11.5k
views
gate1998
set-theory&algebra
normal
partial-order
descriptive
22
votes
128
GATE CSE 1988 | Question: 2xvii
Construct a DAG for the following set of quadruples: E:=A+B F:=E-C G:=F*D H:=A+B I:=I-C J:=I+G
answered
in
Compiler Design
Jun 15, 2019
2.5k
views
gate1988
descriptive
compiler-design
intermediate-code
19
votes
129
GATE CSE 1989 | Question: 9
An input files has $10$ records with keys as given below: $25\quad 7\quad 34\quad 2\quad 70\quad 9\quad 61\quad 16\quad 49\quad 19$ This is to be sorted in non-decreasing order. Sort the input file using QUICKSORT by ... to demarcate subfiles. Sort the input file using $2$-way- MERGESORT showing all major intermediate steps. Use square brackets to demarcate subfiles.
answered
in
Algorithms
Jun 15, 2019
5.0k
views
gate1989
descriptive
algorithms
sorting
quick-sort
0
votes
130
GATE CSE 1989 | Question: 4-xi
Express the following list in terms of a linked list structure suitable for internal representation. $(((ab)c)d((e)))$
answered
in
DS
Jun 15, 2019
793
views
gate1989
descriptive
data-structures
linked-list
unsolved
12
votes
131
GATE CSE 1988 | Question: 12iia
Using Armstrong’s axioms of functional dependency derive the following rules: $\{ x \rightarrow y, \: x \rightarrow z \} \mid= x \rightarrow yz$ (Note: $x \rightarrow y$ denotes $y$ is functionally dependent on $x$, $z \subseteq y$ denotes $z$ is subset of $y$, and $\mid =$ means derives).
answered
in
Databases
Jun 15, 2019
1.3k
views
gate1988
easy
descriptive
databases
database-normalization
6
votes
132
GATE CSE 1988 | Question: 12iib
Using Armstrong’s axioms of functional dependency derive the following rules: $\{ x \rightarrow y, \: wy \rightarrow z \} \mid= xw \rightarrow z$ (Note: $x \rightarrow y$ denotes $y$ is functionally dependent on $x$, $z \subseteq y$ denotes $z$ is subset of $y$, and $\mid =$ means derives).
answered
in
Databases
Jun 15, 2019
1.0k
views
gate1988
normal
descriptive
databases
database-normalization
1
vote
133
GATE CSE 1988 | Question: 2xiii
What is referential transparency?
answered
in
Programming in C
Jun 15, 2019
613
views
gate1988
normal
descriptive
programming-languages
out-of-gate-syllabus
13
votes
134
GATE CSE 1989 | Question: 13a
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$ ... Design a prefix binary code for the language which would minimize the average length of the encoded words of the language.
answered
in
Algorithms
Jun 15, 2019
2.6k
views
descriptive
gate1989
algorithms
huffman-code
10
votes
135
GATE CSE 1987 | Question: 10c
Give a minimal DFA that performs as a $\mod - 3,\;$ $1$'s counter, i.e. outputs a $1$ each time the number of $1$'s in the input sequence is a multiple of $3$.
answered
in
Digital Logic
Jun 15, 2019
2.4k
views
gate1987
digital-logic
digital-counter
descriptive
9
votes
136
GATE CSE 1995 | Question: 8
Construct the $\text{LL(1)}$ table for the following grammar. $Expr \rightarrow \_Expr$ $Expr \rightarrow (Expr)$ $Expr \rightarrow Var\; ExprTail$ $ExprTail \rightarrow \_Expr$ $Expr \rightarrow \lambda$ $Var \rightarrow Id\; VarTail$ $VarTail \rightarrow (Expr)$ $VarTail \rightarrow \lambda$ $Goal \rightarrow Expr$
answered
in
Compiler Design
Jun 15, 2019
2.5k
views
gate1995
compiler-design
parsing
normal
descriptive
1
vote
137
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
answered
in
Operating System
Jun 13, 2019
1.7k
views
memory-management
paging
operating-system
multilevel-paging
self-doubt
1
vote
138
Master's Theorem: Validity of Format
How to check if a given recurrence relation is in a format that is valid to apply Master’s Theorem? Also, how to distinguish between Master’s Theorem and extended Master’s Theorem?
answered
in
Algorithms
Jun 12, 2019
1.3k
views
algorithms
master-theorem
time-complexity
asymptotic-notation
4
votes
139
Circuit related doubt in digital logic
Given circuit is to be implemented with minimum number of 2 input NAND & NOR Gates.. Tell the minimum number of NAND NOR GATES required.. 1,4 4,1 2,4 None
answered
in
Digital Logic
Jun 12, 2019
781
views
7
votes
140
Sheldon Ross Example-5n
Compute the probability that if 10 married couples are seated at random at a round table, then no wife sits next to her husband 1 wife sits next to her husband. pick one of the 10 couples=$\binom{10}{1}$. These couples can interchange their position such that ... sits together=$\frac{N}{19!}$ so probability that no couple sits together=$1-\frac{N}{19!}$ is this correct?
answered
in
Probability
Jun 11, 2019
5.3k
views
combinatory
probability
discrete-mathematics
sheldon-ross
10
votes
141
GATE CSE 2018 | Question: GA-10
A six sided unbiased die with four green faces and two red faces is rolled seven times. Which of the following combinations is the most likely outcome of the experiment? Three green faces and four red faces. Four green faces and three red faces. Five green faces and two red faces. Six green faces and one red face
answered
in
Quantitative Aptitude
Jun 11, 2019
14.7k
views
gatecse-2018
quantitative-aptitude
probability
normal
2-marks
2
votes
142
GATE Overflow | General Aptitude | Test 2 | Question: 5
It takes a pendulum of a clock $5$ seconds to strike 2 o’clock. How much time (in seconds) will it take to strike 10 o’clock?
answered
in
Quantitative Aptitude
Jun 9, 2019
514
views
go-general-aptitude-2
numerical-answers
ratio-proportions
6
votes
143
GATE Overflow | General Aptitude | Test 2 | Question: 4
Choose the set in which the combinations are logically equivalent. All flowers are roses. No rose is a flower. No flower is a rose. Some flowers are roses. No rose is not a flower. All roses are flowers. (i), (v) (ii), (iv) (iii), (iv) (v), (vi)
answered
in
Analytical Aptitude
Jun 9, 2019
695
views
go-general-aptitude-2
logical-reasoning
13
votes
144
GATE Overflow | General Aptitude | Test 2 | Question: 1
Two liquids $A$ and $B$ are in the ratio $4:1$ in container $1$ and in container $2,$ they are in the ratio $1:3.$ In what ratio should the contents of the two containers be mixed so as to obtain a mixture of $A$ and $B$ in the ratio $1:1$? $5:6$ $4:3$ $3 :4$ $6:5$
answered
in
Quantitative Aptitude
Jun 9, 2019
922
views
go-general-aptitude-2
quantitative-aptitude
ratio-proportions
3
votes
145
UGC NET CSE | December 2015 | Part 2 | Question: 6
Which of the following arguments are not valid? "If Gora gets the job and works hard, then he will be promoted. if Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard. ... $n^2 > 1$, then $n>1$. i and iii ii and iii i,ii, and iii i and ii
answered
in
Mathematical Logic
Jun 6, 2019
6.2k
views
ugcnetcse-dec2015-paper2
discrete-mathematics
mathematical-logic
2
votes
146
Self doubt in percentage
In Medical certificate, by mistake a candidate gave his height as 25% more than normal. In the interview panel,he clarified his height was 5 feet 5inches. Find the percentage correction made by the candidate from his stated height to his actual height. 20 28.56 25 None of these
answered
in
Quantitative Aptitude
Jun 5, 2019
656
views
2
votes
147
Self doubt on probability
An element is to be inserted in an array and the probability that it has been entered correctly is 0.9. Find the probability that the sorting algorithm worked correctly. How to solve this type of questions?
answered
in
Quantitative Aptitude
Jun 5, 2019
298
views
13
votes
148
GATE CSE 1987 | Question: 9d
Specify an adjacency-lists representation of the undirected graph given above.
answered
in
Graph Theory
Jun 5, 2019
1.6k
views
gate1987
graph-theory
easy
graph-connectivity
descriptive
5
votes
149
Mathematical Logic Ques:Self doubt
“Not every satisfiable logic is valid” Representation of it will be $1)\sim \left ( \forall S(x)\rightarrow V(x) \right )$ or $2)\sim \left ( \forall S(x)\vee V(x) \right )$ Among $1)$ and $2)$, which one is correct? and why?
answered
in
Mathematical Logic
Jun 4, 2019
991
views
discrete-mathematics
mathematical-logic
1
vote
150
Profit and loss Self doubt
The marked price of a table is Rs. 1200, which is 20% above the cost price. It is sold at a discount of 10% on the marked price. Find the profit percent. (a) 10% (b) 8% (c) 7.5% (d) 6% What approach can I use for these type of questions?
answered
in
Quantitative Aptitude
Jun 4, 2019
3.8k
views
profit-loss
cost-market-price
quantitative-aptitude
general-aptitude
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...