menu
search
Log In
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users 2021 Jun 14 - 20
  1. mtech_student

    60 Points

  2. Subhajit Panday

    6 Points

  3. Sambhrant Maurya

    4 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Recent questions and answers

Recent questions and answers

0 votes
0 answers 4 views
Lecturer In Information Technology KPSC-2015
Which is true for typical RISC architecture? A.Micro Programmed Control Unit B.Instruction takes multiple clock cycles. C.Have few register in CPU D.Emphasis on optimising instruction pipelines
Which is true for typical RISC architecture? A.Micro Programmed Control Unit B.Instruction takes multiple clock cycles. C.Have few register in CPU D.Emphasis on optimising instruction pipelines
asked 1 day ago in CO & Architecture Midhun K R 5 points 4 views
0 votes
0 answers 4 views
[SELF DOUBT] DSA BUBBLE SORT
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?
asked 1 day ago in Algorithms rythmrana 5 points 4 views
0 votes
0 answers 4 views
Book name:- computer networking top down approach
I am reading packet switching vs circuit switching from computer networking a top down approach(pg no. 57) . I came across an example: Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other ... . Now I don,t know how author got 10s as answer while i am getting 100s as answer. Kindly help.
I am reading packet switching vs circuit switching from computer networking a top down approach(pg no. 57) . I came across an example: Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other users remain quiescent and don't ... data has been transmitted. Now I don,t know how author got 10s as answer while i am getting 100s as answer. Kindly help.
asked 1 day ago in Computer Networks saurabh0709 5 points 4 views
3 votes
1 answer 821 views
GATE CSE 2021 Set 1 | Question: 12 | Video Solution
Let $\langle M \rangle$ denote an encoding of an automaton $M$. Suppose that $\Sigma = \{0,1\}$. Which of the following languages is/are $\text{NOT}$ recursive? $L= \{ \langle M \rangle \mid M$ is a $\text{DFA}$ such that $L(M)=\emptyset \}$ $L= \{ \langle M \rangle \mid M$ is ... $L(M)=\emptyset \}$ $L= \{ \langle M \rangle \mid M$ is a $\text{PDA}$ such that $L(M)=\Sigma ^* \}$
answered 1 day ago in Theory of Computation amitkhurana512 53 points 821 views
3 votes
1 answer 821 views
GATE CSE 2021 Set 1 | Question: 3 | Video Solution
Consider the following three functions. $f_1=10^n\quad f_2=n^{\log n}\quad f_3=n^{\sqrt {n}}$ Which one of the following options arranges the functions in the increasing order of asymptotic growth rate? $f_3, f_2, f_1$ $f_2, f_1, f_3$ $f_1, f_2,f_3$ $f_2, f_3, f_1$
answered 1 day ago in Algorithms amitkhurana512 53 points 821 views
0 votes
0 answers 7 views
Self doubt
What is the range of IP addresses spanned by the CIDR address 192.168.10.0/20?
What is the range of IP addresses spanned by the CIDR address 192.168.10.0/20?
asked 2 days ago in Computer Networks swaraj_gore_ 5 points 7 views
0 votes
0 answers 4 views
[SELF DOUBT] DSA INSERTION SORT
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
asked 2 days ago in Algorithms rythmrana 5 points 4 views
0 votes
0 answers 4 views
Which problems in dynamic programming are the most important for GATE 2022?
I am currently studying dynamic programming for GATE 2022. I am kinda stuck with which problems to prioritize. Can someone help? #dynamic-programming
asked 2 days ago in Algorithms ankit-saha 5 points 4 views
0 votes
0 answers 3 views
self doubght
what is difference between preemption and inturrupts on process state diagram
what is difference between preemption and inturrupts on process state diagram
asked 2 days ago in Operating System Sachin85 5 points 3 views
0 votes
0 answers 4 views
[SELF DOUBT] DSA , IN PLACE SORTING
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.
asked 2 days ago in Algorithms rythmrana 5 points 4 views
0 votes
1 answer 11 views
1.GeeksforGeeks
operating-system cpu-scheduling . someone please guide me how to approach this problem.
operating-system cpu-scheduling . someone please guide me how to approach this problem.
answered 3 days ago in Operating System Pratiksha Hegde 5 points 11 views
0 votes
0 answers 9 views
Made easy workbook c programming question
The correct answer is (b). I am not able to understand how it is the correct answer, please explain.
The correct answer is (b). I am not able to understand how it is the correct answer, please explain.
asked 4 days ago in Programming akshansh 15 points 9 views
0 votes
0 answers 3 views
Final exam 2020-2021
If some T FFs are connected in series. The 1st FF is supplied by a clock with frequency 1 MHz and the last FF signal out is 31.25 KHz. Find the number of the Flip Flops are used in the circuit.
If some T FFs are connected in series. The 1st FF is supplied by a clock with frequency 1 MHz and the last FF signal out is 31.25 KHz. Find the number of the Flip Flops are used in the circuit.
asked 5 days ago in Digital Logic Emanjse 5 points 3 views
0 votes
0 answers 4 views
Forouzan's Sliding Window Numerical
I was scrolling through sample questions when I chanced over this question. Consider a sliding window flow control protocol between hosts A and B. Suppose the link propagation delay is 1 time unit, the retransmission timeout is 3 time units ... I would really appreciate any help regarding this question. Also, can someone please leave a link to similar questions?
I was scrolling through sample questions when I chanced over this question. Consider a sliding window flow control protocol between hosts A and B. Suppose the link propagation delay is 1 time unit, the retransmission timeout is 3 time units, and the window size is ... the drops? I would really appreciate any help regarding this question. Also, can someone please leave a link to similar questions?
asked 5 days ago in Computer Networks tuhinnn_py 5 points 4 views
0 votes
0 answers 4 views
Probability books name :- Sheldon m. Ross
"Normal distribution" :- probability density function f(x) =1/√2π σ e^-(x- μ )^2/( σ ) ^2. My question is, why are use √2π as constant. Please explain in details.
"Normal distribution" :- probability density function f(x) =1/√2π σ e^-(x- μ )^2/( σ ) ^2. My question is, why are use √2π as constant. Please explain in details.
asked 5 days ago in Probability Ajitgate21 5 points 4 views
0 votes
0 answers 6 views
Endian concept gate 2021 -- set 2 Question 54
In what subject 'endian' concept had and where I study endian concept?
In what subject 'endian' concept had and where I study endian concept?
asked 5 days ago in Study Resources ykrishnay 7 points 6 views
0 votes
0 answers 7 views
Made Easy DBMS Practice Set - Normalisation - Question 53
Let R be a relation. Which of the following comments about the relation R are correct ? R will necessarily have a composite key if R is in BCNF but not in 4NF If R is in 3NF and if every key of R is simple, then R is in BCNF If R is in BCNF and if R has at least one simple key , then R is in ... and if its every key is simple, then R is in 5NF a) 1 and 4 b) 2 and 3 c) 1, 2 and 3 d) 1, 2, 3 and 4
asked 5 days ago in Databases 10nikhilsharma01 5 points 7 views
0 votes
0 answers 5 views
Made Easy DBMS practice set - Normalization - Question 45
Redundancy is dangerous as it is a potentiad threat to data integrity consistency sufficiency both 1 and 2 Answer is 4 but why ?
asked 5 days ago in Databases 10nikhilsharma01 5 points 5 views
0 votes
0 answers 7 views
Applied Gate Practice Test
Consider the following counter. If the initial states of Q0(MSB) and Q1(LSB) are 0. What is the sequence Q0 Q1 given by the following diagram?
Consider the following counter. If the initial states of Q0(MSB) and Q1(LSB) are 0. What is the sequence Q0 Q1 given by the following diagram?
asked 6 days ago in Digital Logic ketandalvi 5 points 7 views
0 votes
0 answers 5 views
Process management
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not?? My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !! Plz clear this doubt.
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not?? My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !! Plz clear this doubt.
asked Jun 12 in Operating System Vink7389 9 points 5 views
0 votes
0 answers 7 views
Self doubt
Can a person with B.E chemical do Mtech in CSE through Gate??Which colleges allow and at what rank??
Can a person with B.E chemical do Mtech in CSE through Gate??Which colleges allow and at what rank??
asked Jun 12 in IISc/IITs Sury07 5 points 7 views
0 votes
0 answers 7 views
MADE EASY TEST SERIES DBMS 2022
I cannot understand why is option D) incorrect? Can anyone give an example of how in option D) first one can contain duplicate values and second one cannot ? Kindly help me. Thanks in advance
I cannot understand why is option D) incorrect? Can anyone give an example of how in option D) first one can contain duplicate values and second one cannot ? Kindly help me. Thanks in advance
asked Jun 12 in Databases KUSHAL CHAKRABORTY 5 points 7 views
0 votes
0 answers 9 views
What should I retain in round 4 of COAP?
Currently I have retained MTech CSE of iit kanpur one time in round 2 of COAP , and round 3 , i have only got iitK again. I will be retaining iitK again , but now I have retained iitK two times. I want iitMadras but in. Internet I found Iit ... got no new offer , then what should I do, retain iitK?? Or Take risk for round 5 ?? What Would You advice ??
Currently I have retained MTech CSE of iit kanpur one time in round 2 of COAP , and round 3 , i have only got iitK again. I will be retaining iitK again , but now I have retained iitK two times. I want iitMadras but in. Internet I found Iit madras last rank ends upto exactly ... round 4 I got no new offer , then what should I do, retain iitK?? Or Take risk for round 5 ?? What Would You advice ??
asked Jun 12 in IISc/IITs GATE(CS) AIR-152 5 points 9 views
0 votes
0 answers 3 views
Go Back N flow control
I had a doubt regarding one scenario in Go Back N flow control algorithm. Consider the following scenario shown in the image The left hand side is the sender and the right hand side is the reciever. I referred to Kurose Ross Extended FSM Description of GBN sender ... window(packets 1, 2 and 3). Is this correct? Can such a scenario even occur in real life? Thanks in advance.
I had a doubt regarding one scenario in Go Back N flow control algorithm. Consider the following scenario shown in the image The left hand side is the sender and the right hand side is the reciever. I referred to Kurose Ross Extended FSM Description of GBN sender and reciever ... the entire window(packets 1, 2 and 3). Is this correct? Can such a scenario even occur in real life? Thanks in advance.
asked Jun 12 in Computer Networks punter147 5 points 3 views
0 votes
0 answers 5 views
#forozoun#tannenbaum#computernetworks#syllabus#flowcontrol#errorcontrol
Do we have hdlc and ppp protocols(flow and error control) in syllabus?
asked Jun 12 in Computer Networks Dr Regina Phalange 5 points 5 views
0 votes
0 answers 5 views
Clear distinction between Finite automata, Regular expressions
Given language L = strings starting with 'a'. Sigma(Alphabet) = {a,b} DFA: It should only accept the given language and reject other languages. Therefore only strings starting with 'a' MUST be accepted by the DFA, and the strings starting with 'b' MUST ... and Regular expressions are not correctly defined by me, can you please define all these clearly so that it becomes easy to distinguish them.
asked Jun 12 in Theory of Computation akshansh 15 points 5 views
0 votes
0 answers 3 views
GATE previous year question
consider a direct mapped cache of 8 blocks used to implement the following program segment float a[10][10]; int i; for(i=0;i<10;i++) for(j=0;j<10;j++) a[i][j]=8.0; float element occupies 4 bytes, the block size is 12 bytes and ... in row-major form. Find the number of hits. also, if the array was stored in coloumn-major, What the number of hits would've been?
consider a direct mapped cache of 8 blocks used to implement the following program segment float a[10][10]; int i; for(i=0;i<10;i++) for(j=0;j<10;j++) a[i][j]=8.0; float element occupies 4 bytes, the block size is 12 bytes and array is stored in row-major form. Find the number of hits. also, if the array was stored in coloumn-major, What the number of hits would’ve been?
asked Jun 12 in CO & Architecture donniedarko 39 points 3 views
0 votes
0 answers 5 views
Igate bhilai test gate 2022
What is the output of program? void swap (char *x, char *y) { char *t = x; x = y; y = t; } int main() { char *x = "IGATE"; char *y = "BEST IN CG"; char *t; swap(x, y); printf("(%s, %s)", x, y); t = x; x = y; y ... BEST IN CG, IGATE) (IGATE, BEST IN CG) . C: (IGATE, BEST IN CG) (IGATE, BEST IN CG). D: (BEST IN CG, IGATE) (BEST IN CG, IGATE).
What is the output of program? void swap (char *x, char *y) { char *t = x; x = y; y = t; } int main() { char *x = "IGATE"; char *y = "BEST IN CG"; char *t; swap(x, y); printf("(%s, %s)", x, y); t = x; x = y; y = t; printf("\n(%s, %s)", x, y); return ... CG, IGATE) . B: (BEST IN CG, IGATE) (IGATE, BEST IN CG) . C: (IGATE, BEST IN CG) (IGATE, BEST IN CG). D: (BEST IN CG, IGATE) (BEST IN CG, IGATE).
asked Jun 11 in Programming DKY123 15 points 5 views
0 votes
0 answers 6 views
This question is related to Intrested Variable Mechnanism in Operating System.
Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical Section */ wants1 = false; } /* ... IT IS WRITTEN PROGRESS IS THERE? In the case when both wants1 and wants2 are true it will indefinitely be postponed then why progress is there?
asked Jun 10 in Operating System anupam_12 5 points 6 views
0 votes
0 answers 7 views
NPTEL(Theory of Computation )
How is the regular expression (0+1)*0(0+1)*1(0+1)* is equivalent to (0+1)*01(0+1)* ?
How is the regular expression (0+1)*0(0+1)*1(0+1)* is equivalent to (0+1)*01(0+1)* ?
asked Jun 9 in Theory of Computation hrtoimukra 5 points 7 views
0 votes
0 answers 5 views
Topic name : heapify and heapsort
We can reduce the space complexity of heapsort to o(1) by using heapify using loops, then why we dont reduce the space complexity of heapify from o(logn) to o(1) by using loops here also.?
We can reduce the space complexity of heapsort to o(1) by using heapify using loops, then why we dont reduce the space complexity of heapify from o(logn) to o(1) by using loops here also.?
asked Jun 9 in Algorithms Ayush1718 5 points 5 views
0 votes
1 answer 16 views
ACE Academy Test series gate 2021
Consider the following relation R(XYZ) with X as the primary key and Z as the foreign key referencing X with a delete cascade. X Y Z X1 Y1 X7 X3 Y1 X2 X5 Y4 X3 X2 Y2 X1 X9 Y5 X3 X7 Y3 X8 X4 Y2 X2 Suppose tuple (X2, Y2, X1) is deleted, as a result what will be the number of tuples in R after deletion?
Consider the following relation R(XYZ) with X as the primary key and Z as the foreign key referencing X with a delete cascade. X Y Z X1 Y1 X7 X3 Y1 X2 X5 Y4 X3 X2 Y2 X1 X9 Y5 X3 X7 Y3 X8 X4 Y2 X2 Suppose tuple (X2, Y2, X1) is deleted, as a result what will be the number of tuples in R after deletion?
answered Jun 9 in Databases Subhajit Panday 11 points 16 views
0 votes
1 answer 136 views
I am getting admission in IIIT Lucknow M.tech.
I am getting admission in IIIT Lucknow Mtech in ML. Their course and placements seems awesome. Should I take it as it would be first batch. What are the risks? I cannot give next year gate this was my last attempt and I have 6lpa job. Please suggest immediately.
I am getting admission in IIIT Lucknow Mtech in ML. Their course and placements seems awesome. Should I take it as it would be first batch. What are the risks? I cannot give next year gate this was my last attempt and I have 6lpa job. Please suggest immediately.
answered Jun 9 in IIITs mtech_student 71 points 136 views
0 votes
1 answer 9 views
Madeeasy test series gate 2022
The value of k at the end of the execution of following program: int increase(int p) { int amount = 0; amount = amount +p; return(amount); } main( ) { int i, j, k; for(i = 0: i < 4; i++) { for( j = 0: j <=i; j++) { k = increase(j); } } } A) 4 B) 10 C) 20 D) 6
The value of k at the end of the execution of following program: int increase(int p) { int amount = 0; amount = amount +p; return(amount); } main( ) { int i, j, k; for(i = 0: i < 4; i++) { for( j = 0: j <=i; j++) { k = increase(j); } } } A) 4 B) 10 C) 20 D) 6
answered Jun 9 in Programming Subhajit Panday 11 points 9 views
0 votes
1 answer 10 views
Ace Academy test series gate 2021
A relation R (ABCDE) with functional dependency F= {AB ->CD, A->E, C->D} The decomposition of R into R1(ABC), R2(BCD) and R3(CDE) (i) lossless join (ii) lossy decomposition (iii) dependency preserving (iv) not dependency preserving (A) i & ii (B) i & iv (C) ii & iii (D) ii & iv
A relation R (ABCDE) with functional dependency F= {AB ->CD, A->E, C->D} The decomposition of R into R1(ABC), R2(BCD) and R3(CDE) (i) lossless join (ii) lossy decomposition (iii) dependency preserving (iv) not dependency preserving (A) i & ii (B) i & iv (C) ii & iii (D) ii & iv
answered Jun 9 in Databases Subhajit Panday 11 points 10 views
0 votes
0 answers 9 views
can we make DFA for a language where there is comparion between symbols but lanuage is finite a^nb^n;n<=3
can we make DFA for a language where there is comparion between symbols but lanuage is finite a^nb^n;n<=3
asked Jun 8 in Theory of Computation promise 5 points 9 views
0 votes
0 answers 7 views
if language is finite then dfa possible irrespective of comparison between symbols exist or not.is it true??
if language is finite then dfa possible irrespective of comparison between symbols exist or not.is it true??
asked Jun 8 in Theory of Computation promise 5 points 7 views
0 votes
1 answer 9 views
MAC address and its uniqueness
does it generally happens that different hosts at different networks have same mac address or its just rare
does it generally happens that different hosts at different networks have same mac address or its just rare
answered Jun 8 in Computer Networks raun220 23 points 9 views
0 votes
1 answer 10 views
Parity check in Error detection
Do we have Parity check in syllabus?
Do we have Parity check in syllabus?
answered Jun 8 in Computer Networks raun220 23 points 10 views
0 votes
1 answer 16 views
Self Doubt (Digital Logic Design)
A ⊕ B can be represented using 4 NAND gates as well as 5 NAND gates. Is there any predefined procedure to find the minimum number of NAND gate required by an expression?
A ⊕ B can be represented using 4 NAND gates as well as 5 NAND gates. Is there any predefined procedure to find the minimum number of NAND gate required by an expression?
answered Jun 8 in Digital Logic raun220 23 points 16 views
To see more, click for the full list of questions or popular tags.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...