GATE Overflow for GATE CSE
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 LeenSharma
  • Wall
  • Recent activity
  • All questions
  • All answers
  • Exams Taken
  • All Blogs

Answers by LeenSharma

1 vote
1
MadeEasy Test Series: Linear Algebra - Matrices
If $A=\begin{bmatrix} cos \alpha & sin \alpha \\ -sin \alpha & cos \alpha \end{bmatrix}$ be such that $A +A ^{'}=I$ then the value of $\alpha$ is
answered in Linear Algebra Jan 9, 2018
675 views
  • made-easy-test-series
  • matrix
  • linear-algebra
2 votes
2
Linear Homogeneous Equation (Allen 2017)
Consider a system of equations (λ – a)x + 2y +3z = 0, x +2(λ – b) y + 3z = 0, x + 2y + 3(λ – c) z = 0, which has a non-trivial solution. Product of all values of λ for above system is (1) abc + a + b + c + 2 (2) abc + a + b + c – 2 (3) abc – a – b – c – 2 (4) abc – a – b – c + 2 Ans given is Option C. Can anyone explain the complete solution?
answered in Linear Algebra Dec 1, 2017
549 views
  • system
  • of
  • system-of-equations
  • non-trivial-solution
  • homogeneous-equation
3 votes
3
Which of the following is NOT true?
$(a^+)^∗=(a^∗)^+$ $(a^+)^+=aa^+$ $(a^∗)^∗=a^∗$ $aa^+ +a=a^+$
answered in Theory of Computation Nov 13, 2017
1.5k views
  • regular-expression
  • multiple-selects
0 votes
4
MadeEasy Subject Test: Theory of Computation - Regular Expressions
answered in Theory of Computation Nov 9, 2017
274 views
  • made-easy-test-series
  • theory-of-computation
  • regular-expression
2 votes
5
Matrices
Consider the following matrix $A=\begin{bmatrix} a&a^{2} &a^{3}-1 \\ b& b^{2} &b^{3}-1 \\ c& c^{2}&c^{3}-1 \end{bmatrix}$ if $|A|=0$, then the value of $abc$ is _______________
answered in Linear Algebra Nov 7, 2017
725 views
  • engineering-mathematics
  • matrix
  • linear-algebra
3 votes
6
Aptitude
The sum of all the real roots of the equation $|x-2|^{2}+|x-2|-2=0$ is;
answered in Quantitative Aptitude Nov 6, 2017
237 views
4 votes
7
NUMBER OF STATES IN DFA
answered in Theory of Computation Nov 6, 2017
1.3k views
  • finite-automata
  • theory-of-computation
  • number-of-states
2 votes
8
UGC NET CSE | November 2017 | Part 2 | Question: 8
Let $P$ and $Q$ be two propositions $\neg (P \leftrightarrow Q)$ is equivalent to $P\leftrightarrow \neg Q$ $\neg P\leftrightarrow Q$ $\neg P \leftrightarrow \neg Q$ $Q\rightarrow P$
answered in Mathematical Logic Nov 5, 2017
1.6k views
  • ugcnetcse-nov2017-paper2
  • discrete-mathematics
  • mathematical-logic
1 vote
9
UGC NET CSE | November 2017 | Part 2 | Question: 4
How many distinguishable permutations of the letters in the word of BANANA are there? $720$ $120$ $60$ $360$
answered in Unknown Category Nov 5, 2017
584 views
  • ugcnetcse-nov2017-paper2
6 votes
10
#DAG #Ullman
((x+y)-((x+y)*(x-y)))+((x+y)*(x-y)) Is this correct DAG for given expression ?
answered in Compiler Design Nov 2, 2017
6.2k views
  • compiler-design
  • code-optimization
  • directed-acyclic-graph
7 votes
11
Discrete maths Combinatorics
How many ways can the letters $\{a,b,c,d,e\}$ be placed into $3$ identical boxes such that no box is empty?
answered in Combinatory Nov 1, 2017
382 views
  • discrete-mathematics
  • combinatory
4 votes
12
rank of matrix
If X=[x1 x2 x3… xn ]T is an n-tuple non-zero vector. Then m×n matrix V=XXT will be Is orthogonal Having a rank 1 . Having a rank n-1 Having a rank zero
answered in Mathematical Logic Nov 1, 2017
3.9k views
5 votes
13
No of states in finite automata whose string length is divisible by 3 or 8 ?
No of states in finite automata whose string length is divisible by 3 or8?
answered in Theory of Computation Nov 1, 2017
4.1k views
  • finite-automata
  • theory-of-computation
8 votes
14
ace test series
If $A=\left \{ 1,2,3 \right \}$, then number of relations possible on $A$, which are neither reflexive nor symmetric is _____________
answered in Set Theory & Algebra Nov 1, 2017
299 views
  • relations
3 votes
15
Practice Set
The system of equation x + y + z = 1, 2x + 3y + 4z = 1 and 4x + 5y + 6z = 2 has (a) unique solution (b) infinite solution (c) no solution (d) none of these
answered in Linear Algebra Oct 31, 2017
345 views
0 votes
16
propositional logic
A) ((P->Q)->Q) ==> P V Q is given How i solved ((~P V Q)-->Q) ~(~P V Q) V Q (P and ~Q) V Q (P V Q) and ( ~Q VQ) (P V Q) and Q after this.. how to proceed? B) ( P <--> Q ) ==> (P and Q ) V ( ~p and ~Q)..............how ??
answered in Mathematical Logic Oct 10, 2017
372 views
2 votes
17
TOC: Number of states in minimum DFA
I think, there will be 4 states in minimum DFA, following states will be merged in the resulted DFA {q0&q3}, {q4&q5}, {q1&q6}, {q2&q7}
answered in Theory of Computation Oct 10, 2017
1.3k views
  • minimal-state-automata
  • theory-of-computation
  • finite-automata
0 votes
18
min number of states
(a+b)*aa(a+b) mininum num of states to represent this
answered in Theory of Computation Oct 7, 2017
222 views
1 vote
19
Kenneth Rosen Edition 6th Exercise 7.1 Question 41 (Page No. 473)
How many of the 16 different relations on {0,1} contain the pair (0,1)?
answered in Combinatory Oct 7, 2017
619 views
  • relations
  • kenneth-rosen
  • discrete-mathematics
  • combinatory
0 votes
20
peter linzdfa
(4.d) dfa of L (((aa*)* b)*).
answered in Theory of Computation Oct 7, 2017
247 views
2 votes
21
BST search
Identify the correct sequence for searching 105 in a binary search tree? a. 500,250,190,220,150,120,105 b. 80,800,500,90,270,280,105 c. 20,30,80,200,90,120,105 d. 30,50,80,200,90,120,105 Plz help me.
answered in DS Oct 5, 2017
999 views
  • data-structures
  • binary-search-tree
3 votes
22
Number of States in minimal DFA
How many states will have the minimal DFA accepting the language L={w|wϵ{0,1}* and contains atleast one 0 and two 1's} a) 6 b)7 c)8 d)12
answered in Theory of Computation Oct 5, 2017
497 views
0 votes
23
minimal DFA
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
answered in Theory of Computation Oct 2, 2017
512 views
  • finite-automata
  • theory-of-computation
  • minimal-state-automata
0 votes
24
minimal DFA
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
answered in Theory of Computation Oct 2, 2017
512 views
  • finite-automata
  • theory-of-computation
  • minimal-state-automata
3 votes
25
REGULAR GRAMMARS
if a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars? (a) S → ε, A → aS|b (b) A → aB|a, B → bA|b (c) A → Ba|Bab (d) A → abB|aB please explain how u proceed? The answer is given "b"
answered in Compiler Design Oct 1, 2017
2.7k views
  • regular-grammar
  • compiler-design
  • regular-language
5 votes
26
GATE Aptitude
Look at this series: 8, 6, 9, 23, 87, ... What number should come next? A. 128 B. 226 C. 324 D. 429
answered in Quantitative Aptitude Sep 30, 2017
598 views
  • quantitative-aptitude
2 votes
27
madeeasy#workbook
Find the number of parse trees which can generate 'a' ? $G\rightarrow ATE / a /\epsilon$ $A\rightarrow bT/b/a/\epsilon$ $T\rightarrow aE/b/a/\epsilon$ $E\rightarrow a/\epsilon$
answered in Theory of Computation Sep 29, 2017
197 views
0 votes
28
ace test
The keys 7,3,11,13 are inserted into avl tree .what will be the the root once 12 is inserted into above AVL tree.
answered in DS Sep 29, 2017
157 views
  • avl-tree
  • data-structures
  • ace-test-series
5 votes
29
UGC NET CSE | June 2007 | Part 2 | Question: 9
If $A\oplus B=C,$ then: $A\oplus C=B$ $B\oplus C=A$ $A\oplus B\oplus C=1$ $A\oplus B\oplus C=0$
answered in Others Sep 28, 2017
409 views
  • ugcnetcse-june2007-paper2
3 votes
30
MadeEasy Subject Test: Theory of Computation - Regular Expressions
sometimes questions like this will take more time plz anyone provide shortcut to this type ,this is easy but many time checking from 0 length to onward is very time consuming. length of the shortest string not in the language over the alphabet${a,b}$ of following regular expression is............ $a^{*}(a+ba)^{*}b^{*}$
answered in Theory of Computation Sep 28, 2017
229 views
  • made-easy-test-series
  • theory-of-computation
  • regular-expression
Page:
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • ...
  • 13
  • next »

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

  • From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
  • What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
  • All India GO Classes Mock test
  • NTA UGC NET JRF December 2022 Apply Online Form 2023
  • Life happens, just chill and do hardwork

Subjects

  • All categories
  • General Aptitude (2.5k)
  • Engineering Mathematics (9.3k)
  • Digital Logic (3.3k)
  • Programming and DS (5.8k)
  • 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 (74)
  • Projects (9)
  • Unknown Category (853)

Recent Blog Comments

  • This was very nice blog man!!😂😂
  • @abhi_3_0_12 bro revise now, Gate is on upcoming...
  • I want to buy the test series today but I want to...
  • @mahendrapatel The more you give those (some...
  • @ChatGPT bhai muze vo test bhi dena tha...
  • Send feedback
  • Rank Predictor
  • College Prediction
  • Useful Links
  • FAQ
  • Corrections
  • Discuss
  • Copyright
  • Request
  • Testimonials
  • Chat Logs
  • Chat
  • Badges
  • Search tips
  • Exam Category
  • Blog Category
  • Blog Tags
  • Privacy
  • Test Series
  • Contact Us
Developed by Chun