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 amaity
3
answers
1
NIELIT 2017 DEC Scientist B - Section B: 43
Which one is the correct translation of the following statement into mathematical logic? “None of my friends are perfect.” $\neg\:\exists\:x(p(x)\land q(x))$ $\exists\:x(\neg\:p(x)\land q(x))$ $\exists\:x(\neg\:p(x)\land\neg\:q(x))$ $\exists\:x(p(x)\land\neg\:q(x))$
Which one is the correct translation of the following statement into mathematical logic?“None of my friends are perfect.”$\neg\:\exists\:x(p(x)\land q(x))$$\exists\:x...
1.3k
views
commented
Dec 18, 2017
Mathematical Logic
nielit2017dec-scientistb
discrete-mathematics
mathematical-logic
first-order-logic
+
–
1
answer
2
Theory of Computation - Determine if a language is regular/CFL/CSL from the first sight
Is there any alternate ways to identify if a language is regular/contex-free/context-sensitive etc. from the first sight. (Without using Pumping lemma/Myhill-Nerode theorem(s)) For e.g Identify the following whether the languages are regular/contex-free/ ...
Is there any alternate ways to identify if a language is regular/contex-free/context-sensitive etc. from the first sight. (Without using Pumping lemma/Myhill–Nerode the...
608
views
commented
Nov 15, 2017
2
answers
3
C Programming
Which of the following is the correct output for the program given below? #include<stdio.h> void fun(int); int main() { int a; a=3; fun(a); printf("\n"); return 0; } void fun(int n) { if(n>0) { fun(--n); printf("%d",n); fun(--n); } } (a) 0 2 1 0 (b) 1 1 2 0 (c) 0 1 0 2 (d) 0 1 2 0
Which of the following is the correct output for the program given below?#include<stdio.h void fun(int); int main() { int a; a=3; fun(a); printf("\n"); return 0; } void f...
386
views
answer selected
Oct 31, 2017
0
answers
4
C Programming
If variable can take any integral values from $0$ to $n$, where $n$ is a constant integer, then the variable can be represented as a bits field whose width is the integral parts of (a) $\log_{2}(n)+1$ (b) $\log_{2}(n+1)+2$ (c) $\log_{2}(n-1)+1$ (d) None of these
If variable can take any integral values from $0$ to $n$, where $n$ is a constant integer, then the variable can be represented as a bits field whose width is the integra...
261
views
commented
Oct 31, 2017
1
answer
5
self doubt
what are global functions in c ? can anyone give some insight >?
what are global functions in c ? can anyone give some insight >?
196
views
answered
Oct 29, 2017
1
answer
6
virtualgate
Someone explain it
Someone explain it
228
views
answered
Oct 29, 2017
1
answer
7
Gate question on semigroup
Can anyone please solve and explain this question clearly?
Can anyone please solve and explain this question clearly?
432
views
answered
Oct 27, 2017
1
answer
8
Source for learning floating point representation
Source for learning floating point representation
Source for learning floating point representation
666
views
answered
Oct 21, 2017
Others
floating-point-representation
+
–
1
answer
9
ethernet network
Station A and Station B attempt to transmit a frame and collide on an ethernet network, after collision, a wins and started transmission. At the end of this successful transmission, both A and B attempt to transmits & collide again. The probability that A wins the second is— (A) 0.5 (B) 0.625 (C) 0.75 (D) 0.33
Station A and Station B attempt to transmit aframe and collide on an ethernet network,after collision, a wins and startedtransmission. At the end of this successfultransm...
416
views
answered
Oct 19, 2017
1
answer
10
Discrete
Consider the graph G given below. The graph G is (a) planar (b) non- planar
Consider the graph G given below. The graph G is (a) planar (b) non- planar
510
views
commented
Oct 19, 2017
Others
discrete
+
–
1
answer
11
Discrete
Find the chromatic number of the graph G below (a) 3 (b) 4 (c) 5 (d) None of the above
Find the chromatic number of the graph G below (a) 3 (b) 4 (c) 5 (d) None of the above
371
views
commented
Oct 19, 2017
Others
discrete
+
–
2
answers
12
GATE CSE 2000 | Question: 1.9
The 8085 microprocessor responds to the presence of an interrupt as soon as the TRAP pin becomes 'high' by checking the TRAP pin for 'high' status at the end of each instruction by checking the TRAP pin for 'high' ... the end of the execution of each instruction. by checking the TRAP pin for 'high' status at regular intervals.
The 8085 microprocessor responds to the presence of an interruptas soon as the TRAP pin becomes 'high'by checking the TRAP pin for 'high' status at the end of each instru...
2.0k
views
answered
Oct 18, 2017
CO and Architecture
gatecse-2000
co-and-architecture
8085-microprocessor
normal
out-of-syllabus-now
+
–
1
answer
13
Memory management
When some pages are referred more number of time, initially and then there were no references later, then which of the following page replacement technique will result in more number of faults? A) LFU B) MFU C) LRU D) MRU
When some pages are referred more number of time, initially and then there were no references later, then which of the following page replacement technique will result in...
2.3k
views
answered
Oct 18, 2017
1
answer
14
n-bit counter
352
views
answered
Oct 18, 2017
2
answers
15
OUTPUT OF THE SQL QUERY
862
views
comment moved
Oct 17, 2017
Databases
sql
databases
+
–
1
answer
16
Solution of Hackerrank problem
Below 2 codes are given, the code is printing the total number of matching pairs in a given array. Example: if n=9; & the array values are: 10 20 20 10 10 30 50 10 20 Output: 3 Explanation: (10,10) (20,20) (10,10) total 3 matching pairs. There is a ... if(sock[i] == sock[i+1]) pairs++, i++; cout << pairs << endl; return 0; } Explain the difference...
Below 2 codes are given, the code is printing the total number of matching pairs in a given array.Example:if n=9;& the array values are: 10 20 20 10 10 30 50 10 20Output:...
874
views
comment moved
Oct 17, 2017
Programming in C
algorithms
programming-in-c
+
–
2
answers
17
1.Programming
int main() { char str[10]="GATE2018"; int length=strlen(str); str[length]='\0'; for(i=0;str[i];i++) printf("%c",str[i]); return 0; } Find the output?
int main() { char str[10]="GATE2018"; int length=strlen(str); str[length]='\0'; for(i=0;str[i];i++) printf("%c",str[i]); return 0; }Find the output?
449
views
answered
Oct 17, 2017
Programming in C
programming-in-c
programming
+
–
3
answers
18
NPTEL
State True/ False Message passing is slow compared to shared memory and more error-prone. 1. True 2. False
State True/ False Message passing is slow compared to shared memory and more error-prone.1. True2. False
774
views
answered
Oct 14, 2017
3
answers
19
NPTEL
Interprocess communication with message passing, the shared memory is in 1. Userspace 2. Kernel space 3. Virtual memory 4. None of these
Interprocess communication with message passing, the shared memory is in1. Userspace2. Kernel space3. Virtual memory4. None of these
579
views
answered
Oct 14, 2017
1
answer
20
Converting NFA to DFA
Is it possible to convert a NFA having 'n' states to some DFA having less than 'n' states?
Is it possible to convert a NFA having 'n' states to some DFA having less than 'n' states?
1.4k
views
answered
Oct 14, 2017
Theory of Computation
finite-automata
theory-of-computation
+
–
2
answers
21
UGC NET CSE | January 2017 | Part 2 | Question: 32
Consider the following assembly language instructions: mov al, 15 mov ah, 15 xor al, al mov cl, 3 shr ax, cl add al, 90H add ah, 0 What is the value in $ax$ register after execution of above instructions? $0270H$ $0170H$ $01E0H$ $0370H$
Consider the following assembly language instructions:mov al, 15 mov ah, 15 xor al, al mov cl, 3 shr ax, cl add al, 90H add ah, 0What is the value in $ax$ register after ...
3.7k
views
answer selected
Oct 12, 2017
CO and Architecture
ugcnetjan2017ii
co-and-architecture
machine-instruction
+
–
7
answers
22
NIELIT 2017 July Scientist B (CS) - Section B: 13
For the graph shown, which of the following paths is a Hamilton circuit? $ABCDCFDEFAEA$ $AEDCBAF$ $AEFDCBA$ $AFCDEBA$
For the graph shown, which of the following paths is a Hamilton circuit?$ABCDCFDEFAEA$$AEDCBAF$$AEFDCBA$$AFCDEBA$
2.1k
views
answer selected
Oct 12, 2017
Graph Theory
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
+
–
5
answers
23
UGC NET CSE | January 2017 | Part 2 | Question: 36
There are three processes $P_{1}, P_{2}$ and $P_{3}$ sharing a semaphore for synchronizing a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access ... section $P1$ exits critical section The final value of semaphore will be : $0$ $1$ $-1$ $-2$
There are three processes $P_{1}, P_{2}$ and $P_{3}$ sharing a semaphore for synchronizing a variable. Initial value of semaphore is one. Assume that negative value of se...
2.4k
views
answered
Oct 11, 2017
Operating System
ugcnetjan2017ii
operating-system
semaphore
+
–
3
answers
24
UGC NET CSE | January 2017 | Part 2 | Question: 31
Which of the following strings would match the regular expression : $p+ [3-5] * [xyz]$? $p443y$ $p6y$ $3xyz$ $p35z$ $p353535x$ $ppp5$ I, IlI and VI only IV, V and VI only II, IV and V only I, IV and V only
Which of the following strings would match the regular expression : $p+ [3-5] * [xyz]$?$p443y$$p6y$$3xyz$$p35z$$p353535x$$ppp5$I, IlI and VI onlyIV, V and VI onlyII, IV ...
1.5k
views
answer selected
Oct 11, 2017
Theory of Computation
ugcnetjan2017ii
regular-expression
theory-of-computation
+
–
5
answers
25
UGC NET CSE | January 2017 | Part 2 | Question: 28
A packet whose destination is outside the local $TCP/IP$ network segment is sent to ________. File server $DNS$ server $DHCP$ server Default gateway
A packet whose destination is outside the local $TCP/IP$ network segment is sent to ________.File server$DNS$ server$DHCP$ serverDefault gateway
1.5k
views
answered
Oct 11, 2017
Computer Networks
ugcnetjan2017ii
computer-networks
tcp
+
–
4
answers
26
UGC NET CSE | January 2017 | Part 2 | Question: 25
Which of the following statements is false? Optimal binary search tree construction can be performed efficiently using dynamic programming. Breadth-first search cannot be used to find connected components of a graph. Given the prefix ... cannot be reconstructed uniquely. Depth-first-search can be used to find the connected components of a graph.
Which of the following statements is false?Optimal binary search tree construction can be performed efficiently using dynamic programming.Breadth-first search cannot be u...
4.0k
views
answered
Oct 11, 2017
Algorithms
ugcnetjan2017ii
algorithms
binary-tree
binary-search-tree
+
–
7
answers
27
UGC NET CSE | January 2017 | Part 2 | Question: 23
Which of the following is a valid heap? $a$ $b$ $c$ $d$
Which of the following is a valid heap? $a$$b$$c$$d$
1.6k
views
answer selected
Oct 11, 2017
DS
ugcnetjan2017ii
data-structures
binary-heap
+
–
5
answers
28
UGC NET CSE | January 2017 | Part 2 | Question: 21
Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array ? Insertion - $0(1)$, Deletion - $0(1)$, Maximum - $0(1)$, Minimum - $0(1)$ Insertion - $0(1)$, Deletion - $0(1)$, ... , Minimum - $0(1)$ Insertion - $0(n)$, Deletion - $0(n)$, Maximum - $0(n)$, Minimum - $0(n)$
Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array ?Insertion – $0(1)$, Deletion – $...
3.7k
views
answer selected
Oct 11, 2017
Algorithms
ugcnetjan2017ii
algorithms
array
+
–
4
answers
29
UGC NET CSE | January 2017 | Part 2 | Question: 19
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left (PQ \right )$ ... but not lossless join Dependency preserving and lossless join Lossless join but not dependency preserving Neither dependency preserving nor lossless join.
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left...
2.3k
views
answer selected
Oct 11, 2017
Databases
ugcnetjan2017ii
databases
dependency-preserving
+
–
5
answers
30
UGC NET CSE | January 2017 | Part 2 | Question: 47
__________ refers loosely to the process of semi-automatically analyzing large databases to find useful patterns. Datamining Data warehousing DBMS Data mirroring
__________ refers loosely to the process of semi-automatically analyzing large databases to find useful patterns.DataminingData warehousingDBMSData mirroring
1.4k
views
answer selected
Oct 10, 2017
Databases
ugcnetjan2017ii
databases
data-mining
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register