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
Answers by vijaycs
2
votes
121
Logic basic
Express the quantification ∃!xP(x) using Universal , Existential Quantification and Logical Connectives
Express the quantification ∃!xP(x) using Universal , Existential Quantification and Logical Connectives
401
views
answered
May 17, 2016
Mathematical Logic
mathematical-logic
+
–
2
votes
122
Prog \ Which of the following will print the value 2 for the above code?
#include<stdio.h> int main() { int a[10][20][30] = {0}; a[5][2][1] = 2; return 0; } (a) printf("%d",*(((a+5)+2)+1)); (b) printf("%d",***((a+5)+2)+1); (c) printf("%d",*(*(*(a+5)+2)+1)); (d) None of these
#include<stdio.h int main() { int a[10][20][30] = {0}; a[5] = 2; return 0; }(a) printf("%d",*(((a+5)+2)+1));(b) printf("%d", *((a+5)+2)+1);(c) printf("%d",*(*(*(a+5)+2)...
4.1k
views
answered
May 16, 2016
Programming in C
programming-in-c
output
+
–
2
votes
123
Prog \ Predict the output
#include <stdio.h> int main() { char p; char buf[10] = {1, 2, 3, 4, 5, 6, 9, 8}; p = (buf + 1)[5]; printf("%d\n", p); return 0; } (a) 5 (b) 6 (c) 9 (d) none of the above
#include <stdio.h int main() { char p; char buf[10] = {1, 2, 3, 4, 5, 6, 9, 8}; p = (buf + 1)[5]; printf("%d\n", p); return 0; }(a) 5 (b) 6 (c) 9 (d) none of the above
3.0k
views
answered
May 16, 2016
Programming in C
programming-in-c
output
array
+
–
0
votes
124
Logic basic
Let T (x,y) mean that student x like cuisine y where the domain for x consists off all students at your school and domain for y consists of all cuisines. Express the following in English statement ∀x∀y∃y((x!=z)-----> ∼(T(x,y) ⋀ T(z,y)))
Let T (x,y) mean that student x like cuisine y where the domain for x consists off all students at your school and domain for y consists of all cuisines. Express the foll...
394
views
answered
May 16, 2016
Mathematical Logic
mathematical-logic
+
–
3
votes
125
interview\ C program\ What is output
main() { int arr2D[3][3]; printf("%d\n", ((arr2D==* arr2D)&&(* arr2D == arr2D[0])) ); }
main() { int arr2D[3][3]; printf("%d\n", ((arr2D==* arr2D)&&(* arr2D == arr2D[0])) ); }
2.6k
views
answered
May 15, 2016
Puzzles
programming-in-c
output
pointers
+
–
1
votes
126
difference bw declerations
1. const char *a; 2. char* const a; 3. char const *a; -Differentiate the above declarations.
1. const char *a; 2. char* const a; 3. char const *a; -Differentiate the above declarations.
245
views
answered
May 15, 2016
1
votes
127
TIFR2010-Maths-B-8
The function $f(x)$ defined by $f(x)= \begin{cases} 0 & \text{if x is rational } \\ x & \text{if } x\text{ is irrational } \end{cases}$ is not continuous at any point is continuous at every point is continuous at every rational number is continuous at $x=0$
The function $f(x)$ defined by $$f(x)= \begin{cases} 0 & \text{if x is rational } \\ x & \text{if } x\text{ is irrational } \end{cases}$$is not continuous at any po...
1.1k
views
answered
May 15, 2016
Calculus
tifrmaths2010
calculus
+
–
1
votes
128
Algorithms: Master Method Testbook
464
views
answered
May 15, 2016
Algorithms
algorithms
master-theorem
recurrence-relation
testbook-test-series
+
–
21
votes
129
GATE2015 ME-3: GA-9
Right triangle $PQR$ is to be constructed in the $xy$ - plane so that the right angle is at $P$ and line $PR$ is parallel to the $x$-axis. The $x$ and $y$ coordinates of $P, Q,$ and $R$ are to be integers that satisfy the inequalities: $−4\leq x\leq 5$ and $6 \leq y \leq16.$ How many different triangles could be constructed with these properties? $110$ $1,100$ $9,900$ $10,000$
Right triangle $PQR$ is to be constructed in the $xy$ - plane so that the right angle is at $P$ and line $PR$ is parallel to the $x$-axis. The $x$ and $y$ coordinates of ...
3.8k
views
answered
May 15, 2016
Quantitative Aptitude
gate2015-me-3
quantitative-aptitude
triangles
+
–
2
votes
130
TIFR-2014-Maths-A-3
Let $f: \mathbb{R} \to \mathbb{R}$ be a differentiable function such that $\displaystyle \lim_{x \to +\infty} f'(x)=1$, then $f$ is bounded $f$ is increasing $f$ is unbounded $f'$ is bounded
Let $f: \mathbb{R} \to \mathbb{R}$ be a differentiable function such that $\displaystyle \lim_{x \to +\infty} f'(x)=1$, then$f$ is bounded $f$ is increasing $f$ is unboun...
680
views
answered
May 14, 2016
Calculus
tifrmaths2014
differentiation
+
–
1
votes
131
TIFR-2011-Maths-A-11
For any real number $c$, the polynomial $x^{3}+x+c$ has exactly one real root.
For any real number $c$, the polynomial $x^{3}+x+c$ has exactly one real root.
412
views
answered
May 14, 2016
Set Theory & Algebra
tifrmaths2011
polynomials
+
–
1
votes
132
TIFR-2011-Maths-A-14
$\log x$ is uniformly continuous on $( \frac{1}{2}, \infty)$.
$\log x$ is uniformly continuous on $( \frac{1}{2}, \infty)$.
1.6k
views
answered
May 14, 2016
Calculus
tifrmaths2011
continuity
+
–
0
votes
133
Combinatory
. A, B are two 8-bit numbers such that A+B < 28 . The number of possible combinations of A and B
. A, B are two 8-bit numbers such that A+B < 28 . The number of possible combinations of A and B
991
views
answered
May 14, 2016
2
votes
134
expression
the expression 1*2^3*4^5*6 will be evaluated as a)32^30 b)162^30 c)49152 d)173458
the expression 1*2^3*4^5*6 will be evaluated as a)32^30 b)162^30 c)49152 d)173458
4.7k
views
answered
May 14, 2016
9
votes
135
ISRO-2013-71
Let $P(E)$ denote the probability of the occurrence of event $E$. If $P(A)= 0.5$ and $P(B)=1$ then the values of $P(A|B)$ and $P(B|A)$ respectively are $0.5, 0.25$ $0.25, 0.5$ $0.5, 1$ $1, 0.5$
Let $P(E)$ denote the probability of the occurrence of event $E$. If $P(A)= 0.5$ and $P(B)=1$ then the values of $P(A|B)$ and $P(B|A)$ respectively are$0.5, 0.25$$0.25, 0...
5.4k
views
answered
May 13, 2016
Probability
isro2013
probability
conditional-probability
+
–
1
votes
136
processes
188
views
answered
May 13, 2016
4
votes
137
Conflict Misses
Will conflict misses increase if k-way set associative cache is used and we increase the cache capacity?
Will conflict misses increase if k-way set associative cache is used and we increase the cache capacity?
609
views
answered
May 13, 2016
CO and Architecture
co-and-architecture
cache-memory
misses
+
–
0
votes
138
Dividing a set of n elements in r groups where groups are of size n1,n2,n3... and n1+n2+n3+ ...(uo to r terms ) = n
(Reference- A first course in probablity by Sheldon Ross [Example 5b and 5c of chapter 1])Q1. Ten children are to be divided into an A team and a B team of 5 each. The A ...
371
views
answered
May 13, 2016
Combinatory
combinatory
+
–
0
votes
139
GATE CSE 1990 | Question: 2-viii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|} \hline (a) & \text{A heap construction} & (p) & \ \Omega(n\log_{10}n) \\\hline (b) & \text{Construct...
5.1k
views
answered
May 13, 2016
DS
gate1990
match-the-following
data-structures
binary-heap
+
–
4
votes
140
The binary number 10011101 is equal to the hexadecimal number
The binary number 10011101 is equal to the hexadecimal number (a) 103 (b) 76 (c) 67 (d) - 67
The binary number 10011101 is equal to the hexadecimal number (a) 103 (b) 76 (c) 67 (d) - 67
8.4k
views
answered
May 13, 2016
Digital Logic
number-representation
digital-logic
+
–
0
votes
141
B+ tree convention
In B+ trees, what convention is followed in GATE? A. The node to the left is < than the parent index node and the right node is >= to the parent index node. B. The node to the left is < = to the parent index node and the right node is > the parent index node.
In B+ trees, what convention is followed in GATE?A. The node to the left is < than the parent index node and the right node is >= to the parent index node.B. The node to ...
378
views
answered
May 13, 2016
3
votes
142
UGC NET CSE | June 2014 | Part 2 | Question: 48
A clustering index is created when _______. Primary key is declared and ordered No key ordered Foreign key ordered There is no key and no order
A clustering index is created when _______. Primary key is declared and ordered No key orderedForeign key orderedThere is no key and no order
4.2k
views
answered
May 13, 2016
Databases
ugcnetcse-june2014-paper2
databases
indexing
+
–
21
votes
143
GATE CSE 2000 | Question: 15
Suppose you are given arrays $p [1......N]$ and $q [1......N]$ both uninitialized, that is, each location may contain an arbitrary value), and a variable count, initialized to $0$. Consider the following procedures $set$ and $is\_set$: set(i) { count ... $set(i)$ has not been called for some $i$, then regardless of what $p[i]$ contains, $is\_set(i)$ will return false.
Suppose you are given arrays $p [1......N]$ and $q [1......N]$ both uninitialized, that is, each location may contain an arbitrary value), and a variable count, initiali...
4.9k
views
answered
May 13, 2016
DS
gatecse-2000
data-structures
array
easy
descriptive
+
–
10
votes
144
GATE2015 EC-3: GA-8
From a circular sheet of paper of radius $30$ cm, a sector of $10\%$ area is removed. If the remaining part is used to make a conical surface, then the ratio of the radius and height of the cone is _____
From a circular sheet of paper of radius $30$ cm, a sector of $10\%$ area is removed. If the remaining part is used to make a conical surface, then the ratio of the radiu...
5.9k
views
answered
May 12, 2016
Quantitative Aptitude
gate2015-ec-3
geometry
quantitative-aptitude
normal
+
–
5
votes
145
GATE2015 ME-3: GA-5
Five teams have to compete in a league, with every team playing every other team exactly once, before going to the next round. How many matches will have to be held to complete the league round of matches? $20$ $10$ $8$ $5$
Five teams have to compete in a league, with every team playing every other team exactly once, before going to the next round. How many matches will have to be held to co...
4.1k
views
answered
May 12, 2016
Quantitative Aptitude
gate2015-me-3
quantitative-aptitude
combinatory
+
–
4
votes
146
Kenneth Rosen Edition 7 Exercise 1.1 Question 40 (Page No. 16)
Explain, without using a truth table, why$ (p \vee \neg q) \wedge (q \vee \neg r) \wedge (r \vee \neg p)$ is true when p, q, and r have the same truth value and it is false otherwise.
Explain, without using a truth table, why$ (p \vee \neg q) \wedge (q \vee \neg r) \wedge (r \vee \neg p)$ is true when p, q, and r have the same truth value and it is fal...
2.8k
views
answered
May 12, 2016
Mathematical Logic
mathematical-logic
discrete-mathematics
kenneth-rosen
descriptive
+
–
1
votes
147
Kenneth Rosen Edition 7 Exercise 1.2 Question 4 (Page No. 22)
Translate the given statement into propositional logic using the propositions provided. To use the wireless network in the airport you must pay the daily fee unless you are a subscriber to the service.Express your answer in terms of w: You can ... the airport, d: You pay the daily fee, and s: You are a subscriber to the service.
Translate the given statement into propositional logic using the propositions provided.To use the wireless network in the airport you must pay the daily fee unless you ar...
7.2k
views
answered
May 12, 2016
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
+
–
8
votes
148
ISRO-2013-65
Consider the list of page references in the time line as below: 9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7 What is the working set at the penultimate page reference if ∆ is 5? {8, 5, 3, 2, 9, 6} {4, 3, 6, 2, 5} {3, 9, 6, 2, 7} {3, 9, 6, 2}
Consider the list of page references in the time line as below:9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7What is the working set at the ...
9.3k
views
answered
May 12, 2016
Operating System
isro2013
operating-system
memory-management
page-replacement
+
–
6
votes
149
GATE CSE 1991 | Question: 10b
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... with redundant parentheses. Do this with minimum number of changes to the given production rules and adding at most one more production rule.
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...
4.1k
views
answered
May 12, 2016
Compiler Design
gate1991
grammar
compiler-design
normal
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register