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 Murali
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Murali
1
answer
1
Gate 2017 score 611 and rank 1666, can i get any new iit's or old nit's
commented
in
IISc/IITs
Mar 27, 2017
2.0k
views
0
answers
2
IIT Indore VS IIT Ropar VS IIT Mandi VS IIT Patna VS ISM Dhanbad
edited
in
Other Colleges
Feb 21, 2017
2.8k
views
1
answer
3
IIT Patna VS IIIT Alahabad VS IIT Indore VS IIIT Banglore in terms of faculties, curriculum and placements.
asked
in
Other Colleges
Feb 19, 2017
2.3k
views
0
answers
4
Consider the following circuit of counter
commented
in
Digital Logic
Apr 14, 2016
891
views
sequential
digital-logic
2
answers
5
Asymptotic bounds
how to solve the recurrence relation T(n)=16T(n/4)+n^2+nlogn
asked
in
Programming in C
Jan 22, 2016
496
views
recurrence-relation
asymptotic-notation
2
answers
6
Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L
answered
in
Theory of Computation
Nov 23, 2015
3.3k
views
theory-of-computation
minimal-state-automata
2
answers
7
dfa
No of states in minimal dfa of binary strings starting with 100 and length is congruent to 1 mod 12
commented
in
Theory of Computation
Nov 23, 2015
840
views
theory-of-computation
1
answer
8
Number of Substrings
Total number of sub strings present in "GATE" is A)7 B) 10 C) 11 D) 8
asked
in
Theory of Computation
Nov 23, 2015
3.3k
views
2
answers
9
Determine the cardinality of the following set
Determine the cardinality of the following set: $\{x \mid x\text{ is an integer and } 1/8 < x < 17/2\}$
answered
in
Set Theory & Algebra
Oct 20, 2015
911
views
set-theory&algebra
set-theory
5
answers
10
Digital Logic
No of switching fn for f (A, B, C, D)=BD+B'D' How to approach this question ?
answered
in
Digital Logic
Oct 1, 2015
1.7k
views
digital-logic
9
answers
11
GATE CSE 1993 | Question: 6-3
For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is: Shift Register $\text{Mod- 3}$ Counter $\text{Mod- 6}$ Counter $\text{Mod- 2}$ Counter None of the above
commented
in
Digital Logic
Sep 30, 2015
12.6k
views
gate1993
digital-logic
sequential-circuit
flip-flop
digital-counter
circuit-output
multiple-selects
8
answers
12
GATE CSE 1995 | Question: 2.20
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$? $E \rightarrow xEy\mid xy$ $x y \mid (x^+xyy^+$) $x^+y^+$ I only I and II II and III II only
answered
in
Theory of Computation
Jul 13, 2015
10.5k
views
gate1995
theory-of-computation
easy
context-free-language
6
answers
13
GATE CSE 1996 | Question: 1.8
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string). $(00)^ * (\varepsilon +0)$ $(00)^*$ $0^*$ $0(00)^*$ (i) and (ii) (ii) and (iii) (i) and (iii) (iii) and (iv)
answered
in
Theory of Computation
Jul 13, 2015
10.1k
views
gate1996
theory-of-computation
regular-expression
easy
3
answers
14
GATE CSE 2014 Set 3 | Question: 40
Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfilled after the first $3$ insertions? $(97 \times 97 \times 97) / 100^3$ $(99 \times 98 \times 97) / 100^3$ $(97 \times 96 \times 95) / 100^3$ $(97 \times 96 \times 95 / (3! \times 100^3)$
answered
in
DS
Jun 25, 2015
21.9k
views
gatecse-2014-set3
data-structures
hashing
probability
normal
12
answers
15
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
answered
in
DS
Jun 25, 2015
16.2k
views
gatecse-2010
data-structures
binary-tree
normal
2
answers
16
Time complexity
Consider a sorted array of 'n' elements an element in the array is said to be majority element if it is occuring more than n/2 times of the array, the time complexity of algorithm which is most efficient to determine if the array contains majority element or not is O(... )?
answer edited
in
Algorithms
Jun 25, 2015
329
views
sorting
time-complexity
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:...