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 Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Soumya29
1
vote
31
#Algorithms #MST Doubt in MST Questions.
Question 1) The shortest-path tree computed by Dijkstra's algorithm is necessarily an MST? Question2 ) Prim's algorithm works with negative weighted edges?
answered
in
Algorithms
Apr 29, 2018
1.5k
views
algorithms
minimum-spanning-tree
graph-algorithm
0
votes
32
Theory of computetion
Suppose we have a FA N(a)mod3=0 In this FA the initial state and final state is same If we will reverse this FA the state will be remain same or not that initial state and final state is going to be the same or not and after reversing the string the strings are not getting reverse it will accept only $L=\{\epsilon,b,bb,bbbb,bbb,bbbbbb.............\}$ plzz rectify my doubt
answered
in
Theory of Computation
Apr 29, 2018
271
views
theory-of-computation
3
votes
33
IIT Kanpur Test Sample Paper
(Batman and Robin) The city of Gotham keeps propping up newer challenges for our dynamic duo. The criminals in the city are so organized that they have come up with a schedule to commit the crimes. a. The Mad Hatter commits maddeningly despicable ... . What is the probability of that? 4) In the above scenario, what is the probability that two criminals get defeated?
answered
in
Probability
Apr 29, 2018
482
views
iit-kanpur
written-test
mtech
2
votes
34
#Doubt
#include<stdio.h> void main(){ char loop; do{ char c; printf("Enter a character: "); scanf("%c",&c); printf("ASCII value of %c is %d",c,c); printf("\nAnother test: (y/n)? "); scanf("%c",&loop); }while( ... two numbers %d",sum); printf("\nOne more time: (0/1)?"); scanf("%d",&loop); }while(loop==1); }
answered
in
Programming in C
Apr 29, 2018
319
views
programming-in-c
0
votes
35
C programming
#include<stdio.h> #include<stdlib.h> #include<conio.h> int * show(); int main() { int *p=show(); //clrscr(); printf("%d",*p); } int * show() { int x=10; /*int *p; p=(int *)malloc(4); *p=x;*/ return &x; } Here as the $show()$ ends variable $x$ gets destroyed but still I am able to access its value why is it so?
answered
in
Programming in C
Apr 28, 2018
1.0k
views
programming-in-c
programming
output
pointers
0
votes
36
C programming
#include<stdio.h> #include<stdlib.h> #include<conio.h> int * show(); int main() { int *p=show(); //clrscr(); printf("%d",*p); } int * show() { int x=10; /*int *p; p=(int *)malloc(4); *p=x;*/ return &x; } Here as the $show()$ ends variable $x$ gets destroyed but still I am able to access its value why is it so?
answered
in
Programming in C
Apr 28, 2018
1.0k
views
programming-in-c
programming
output
pointers
2
votes
37
#Algorithms #MST Self Doubt.
Let G be a connected simple graph with non distinct edge weights. Now, e be the lightest edge in G. So, does this edge e is present in every MST of G? My take - when all edge weights are same then lightest edge e won't be there.
answered
in
Algorithms
Apr 28, 2018
394
views
algorithms
minimum-spanning-tree
3
votes
38
gilbert strang Problem Set 2.1
Which of the following descriptions are correct? The solutions x of Ax = $\begin{bmatrix} 1 & 1 & 1\\ 1 & 0 & 2 \end{bmatrix}$ $\begin{bmatrix} x1\\ x2\\ x3 \end{bmatrix}$ = $\begin{bmatrix} 0\\ 0\\ \end{bmatrix}$ form (a) a plane. (b) a line. (c) a point. (d) a subspace. (e) the nullspace of A. (f) the column space of A
answered
in
Linear Algebra
Apr 27, 2018
3.2k
views
21
votes
39
ISRO2018-9
In the diagram above, the inverter (NOT gate) and the AND-gates labeled $1$ and $2$ have delays of $9, 10$ and $12$ nanoseconds (ns), respectively. Wire delays are negligible. For certain values $a$ and $c$, together with certain transition of $b$, a glitch (spurious output) is ... correct value. The duration of glitch is: $7\;\text{ns}$ $9\;\text{ns}$ $11\;\text{ns}$ $13\;\text{ns}$
answered
in
Digital Logic
Apr 25, 2018
6.0k
views
isro2018
digital-logic
circuit-output
0
votes
40
C programming
why did the statement c++=b%(b-a) will gives error
answered
in
Programming in C
Apr 24, 2018
487
views
programming-in-c
programming
output
12
votes
41
ISRO2018-45
Assuming that for a given network layer implementation, connection establishment overhead is $100\;\text{bytes}$ and disconnection overhead is $28\;\text{bytes}$. What would be the minimum size of the packet the transport layer needs to keep up, if it wishes to implement a ... transport layer overhead) $512\;\text{bytes}$ $768\;\text{bytes}$ $1152\;\text{bytes}$ $1024\;\text{bytes}$
answered
in
Computer Networks
Apr 24, 2018
5.9k
views
isro2018
transport-layer
10
votes
42
PGEE 2018
p: n is a prime number q: n mod 30 is prime number 1) p implies q 2) q implies p 3) p implies q or q implies p 4) If p implies q then q implies p
answered
in
Mathematical Logic
Apr 23, 2018
834
views
iiith-pgee
mathematical-logic
7
votes
43
ISRO2018-8
A language with string manipulation facilities uses the following operations. head$(s)$- returns the first character of the string $s$ tails$(s)$- returns all but the first character of the string $s$ concat$(s1, s2)$- concatenates string $s1$ with $s2.$ The output of concat(head$(s)$, head(tail(tail$(s)$))), where s is $acbc$ is: ab ba ac aa
answered
in
Programming in C
Apr 23, 2018
2.7k
views
isro2018
programming
output
7
votes
44
ISRO2018-79
A doubly linked list is declared as: struct Node { int Value; struct Node *Fwd; struct Node *Bwd; }; Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segment of code deletes the node pointed to by ... Bwd = X.Bwd; X$\rightarrow$Bwd$\rightarrow$Fwd = X$\rightarrow$Bwd; X$\rightarrow$Fwd$\rightarrow$Bwd = X$\rightarrow$Fwd;
answered
in
DS
Apr 23, 2018
28.6k
views
isro2018
linked-list
data-structures
7
votes
45
ISRO2018-74
Avalanche effect in cryptography Is desirable property of cryptographic algorithm Is undesirable property of cryptographic algorithm Has no effect on encryption algorithm None of the above
answered
in
Computer Networks
Apr 23, 2018
2.3k
views
isro2018
computer-networks
network-security
3
votes
46
PGEE 2018
void main(){ fork(); fork(); printf("Hello"); } How many time print function will execute
answered
in
Operating System
Apr 23, 2018
833
views
iiith-pgee
operating-system
fork-system-call
0
votes
47
TOC#DECIDABLE
L1= RE U NOT RE. $L2=RE\cap NOT RE$. WHERE RE IS recursively enumerable. then L1 and L2 are ???
answered
in
Theory of Computation
Apr 20, 2018
233
views
3
votes
48
GATE question
Q. 6 Xs has to be placed in the figure below such that each row contains at least one X. In how many ways can this be done? a) 160 b) 180 c) 170 d) 26
answered
in
Combinatory
Apr 15, 2018
528
views
combinatory
0
votes
49
Made easy workbook
An IP router implementing CIDR services a packet with address 131.23.151.76.The routers routing table has the following entries Prefix. Output interface identifier 131.16.0.0/12 3 131.16.0.0/14 5 131.19.0.0/16 2 131.22.0.0/15 1 The identifier of the output interface on which this packet will be forwarded is,.,........
answered
in
Computer Networks
Apr 14, 2018
510
views
1
vote
50
IIT Kanpur
8. If India is a stronger team than Australia then India will lose the cricket series. Which of the following is logically equivalent: A. If India lose the cricket series then India is a stronger team than Australia, B. If India is weaker team than ... Australia or India will lose the cricket series, D. India is a stronger team than Australia or India will win the cricket series
answered
in
Written Exam
Apr 13, 2018
256
views
1
vote
51
No of Schedules
Given, Transaction T1 has n operation Transaction T2 has m operation Prove that, the total number of schedules possible is $\frac{(m+n)!}{m!n!}$
answered
in
Databases
Apr 13, 2018
673
views
transaction-and-concurrency
databases
2
votes
52
Doubt Question
In this Question :- Let there is a Table named Stud_records with 3000 records of fixed length , each record size is 50 Bytes and records are stored in a block of size 512 Bytes , If secondary index is built on the key field of size 10 Bytes and a block pointer of size 5 ... 88 Blocks The number of blocks in First level index = (88 * 15)/512 = 3 ???? Why am i wrong ?? Please Help?
answered
in
Databases
Apr 13, 2018
637
views
indexing
databases
5
votes
53
ISRO-DEC2017-12
Consider a table that describes the customers: $\text{Customers(custid, name, gender, rating)}$ The rating value is an integer in the range $1$ to $5$ and only two values $\text{(male and female)}$ are recorded for $gender.$ Consider the ... The best indexing mechanism appropriate for the query is Linear hashing Extendible hashing B+ tree Bit-mapped index
answered
in
Databases
Apr 10, 2018
2.1k
views
isrodec2017
12
votes
54
ISRO-DEC2017-1
Suppose $A$ is a finite set with $n$ elements.The number of elements and the rank of the largest equivalence relation on $A$ are $\{n,1\}$ $\{n,n\}$ $\{n^2,1\}$ $\{1,n^2\}$
answered
in
Linear Algebra
Apr 9, 2018
5.8k
views
isrodec2017
2
votes
55
Indistinguishable objects and Indistinguishable boxes
Can please anybody explain how to solve the case for indistinguishable objects and indistinguishable boxes. Ques. How many ways are there to pack six copies of the same book into four identical boxes,where a box can contain as many as ... it's equivalent of writing n as the sum of at most k positive integers in non increasing order. How??
answered
in
Combinatory
Apr 7, 2018
1.8k
views
combinatory
1
vote
56
MadeEasy Test Series: Probability
answered
in
Probability
Apr 4, 2018
414
views
made-easy-test-series
probability
engineering-mathematics
1
vote
57
Decidablelity
L1= M#X/ M halts on X. L2= M#X / M does not halts on X. a) L1 is recursive. And L2 is recursive ennumrable. b) both are recursive ennumrable. C) L1 is recursive ennumrable and L2 is non recursive ennumrable. D) none. Can somone give an easy explanation.
answered
in
Theory of Computation
Apr 4, 2018
387
views
3
votes
58
counting
Using the letters PQRST , without repetition , how many 4 letters strings can be formed that, 1) start or end with P.. 2) start with either P or Q. 3) start with Q or end with T. 4) contain the letter R.. 5) don't have the letter P. 6) contain S and T.
answered
in
Mathematical Logic
Apr 4, 2018
409
views
counting
combinatory
87
votes
59
GATE IT 2004 | Question: 25
A sender is employing public key cryptography to send a secret message to a receiver. Which one of the following statements is TRUE? Sender encrypts using receiver's public key Sender encrypts using his own public key Receiver decrypts using sender's public key Receiver decrypts using his own public key
answered
in
Computer Networks
Nov 18, 2017
13.4k
views
gateit-2004
computer-networks
network-security
normal
out-of-gate-syllabus
21
votes
60
GATE CSE 1987 | Question: 1-xiv
An operator precedence parser is a Bottom-up parser. Top-down parser. Back tracking parser. None of the above.
answered
in
Compiler Design
Nov 3, 2017
3.6k
views
gate1987
compiler-design
parsing
Page:
« prev
1
2
3
next »
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:...