Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by roman_1997
1
answer
1
MadeEasy Full Length Test 2019: Engineering Mathematics - Linear Algebra
542
views
asked
Jan 16, 2019
Linear Algebra
linear-algebra
engineering-mathematics
made-easy-test-series
+
–
3
answers
2
GATE CSE 2012 | Question: 53
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ E2 : B \rightarrow S, S \rightarrow \varepsilon$ $ E3 : B \rightarrow S$
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\var...
17.5k
views
commented
Dec 17, 2018
Compiler Design
normal
gatecse-2012
compiler-design
parsing
+
–
3
answers
3
Made easy test
Consider the rank of matrix $'A'$ of size $(m \times n)$ is $"m-1"$. Then, which of the following is true? $AA^T$ will be invertible. $A$ have $"m-1"$ linearly independent rows and $"m-1"$ ... $"n"$ linearly independent columns. $A$ will have $"m-1"$ linearly independent rows and $"n-1"$ independent columns.
Consider the rank of matrix $'A'$ of size $(m \times n)$ is $"m-1"$. Then, which of the following is true?$AA^T$ will be invertible.$A$ have $"m-1"$ linearly independent ...
1.4k
views
commented
Dec 4, 2018
Linear Algebra
engineering-mathematics
linear-algebra
matrix
+
–
5
answers
4
MadeEasy Test Series: Programming & DS - Binary Tree
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?
4.2k
views
commented
Dec 2, 2018
DS
made-easy-test-series
data-structures
binary-tree
avl-tree
+
–
4
answers
5
GATE CSE 1997 | Question: 9
Consider a graph whose vertices are points in the plane with integer co-ordinates $(x,y)$ such that $1 \leq x \leq n$ and $1 \leq y \leq n$, where $n \geq 2$ is an integer. Two vertices $(x_1, y_1)$ ... only the answer without any explanations. What is the weight of a maximum weight-spanning tree in this graph? Write only the answer without any explanations.
Consider a graph whose vertices are points in the plane with integer co-ordinates $(x,y)$ such that $1 \leq x \leq n$ and $1 \leq y \leq n$, where $n \geq 2$ is an intege...
6.5k
views
commented
Nov 21, 2018
Algorithms
gate1997
algorithms
spanning-tree
normal
descriptive
+
–
7
answers
6
GATE CSE 2003 | Question: 32
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable)$((∀x)[α] ⇒ (∀x...
16.9k
views
commented
Nov 12, 2018
Mathematical Logic
gatecse-2003
mathematical-logic
first-order-logic
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register