GATE Overflow for GATE CSE
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 Shubhanshu
  • Wall
  • Recent activity
  • All questions
  • All answers
  • Exams Taken
  • All Blogs

Questions by Shubhanshu

0 votes
1 answer
1
Ace Test Series: Computer Networks - IP Inverse
asked in Computer Networks Jan 19, 2019
483 views
  • ace-test-series
  • computer-networks
  • network-security
1 vote
1 answer
2
Calculate number of times Zero Flag is Reset
I am getting 37.
asked in CO and Architecture Jan 8, 2019
1.0k views
  • co-and-architecture
  • instruction-execution
  • machine-instructions
1 vote
1 answer
3
Ace Test Series: DBMS - Correlated Sql Query
According to me it should be – “Retrieve the names of all students with a lower rank, than all students with age < 18 ”
asked in Databases Dec 24, 2018
953 views
  • sql
  • databases
  • query
  • ace-test-series
1 vote
0 answers
4
IEEE 754 Implicit and Explicit 1 Representation
Represent $(2.5)_{10}$ in IEEE 754 Single precision standard: When 1 is implicit. When 1 is explicit. For the part A I am getting:- 0 100 0000 010 0000 And for part B:- 0 100 0000 1010 0000 In explicit $1$ we have to explicitly give memory to that leading $1$ and in implicit notation, we don’t allocate memory to that leading $1$. @Arjun Sir…...
asked in CO and Architecture Dec 1, 2018
1.2k views
  • co-and-architecture
  • ieee-representation
  • floating-point-representation
  • digital-logic
1 vote
3 answers
5
Adaptive sorting Algorithm.
Is Quick sort an adaptive sorting Algorithm? I think no. Because as per the definition given in the Wikipedia is that A adaptive sorting Algorithm is one who takes the advantage of preorderedness of the input. But in case of Quick sort it act as disadvantage.
asked in Algorithms Dec 1, 2018
4.4k views
  • algorithms
  • sorting
  • quick-sort
  • merge-sort
0 votes
0 answers
6
Tautology
Consider the following statements: $P_1$: Sachin Tendulkar gets out before the tea break only if Ishant Sharma comes out to bat. $P_2$: Ishant Sharma won't come out to bat, if Lasith Malinga is not called to bowl. $P_3$: Sachin Tendulkar got out before the tea break. Which ... Keeping A, B, C option as X one by one, and all follows, thus option D is correct but given answer is C.
asked in Mathematical Logic Nov 29, 2018
289 views
  • propositional-logic
  • mathematical-logic
1 vote
2 answers
7
Subnetting
An organization has a class C network and wishes to from subnet for 32 departments. The subnet mask would be:- $255.255.255.248$ $255.255.255.252$
asked in Computer Networks Nov 26, 2018
756 views
  • subnetting
  • computer-networks
  • ip-address
0 votes
0 answers
8
Compiler design
Q1: Consider G :- $X \rightarrow X + Y | Y$ $Y \rightarrow Y*Z|Z$ $Z \rightarrow (X)$ $Z \rightarrow id$ if LR(1) parser is used to parse the above grammar, then total how many lookahead will be present in the dfa state I0 for the items $X \rightarrow .Y \text{ and } Z \rightarrow .id$ ... ------------------------------------------------------------ Someone verify all these answers.
asked in Compiler Design Nov 8, 2018
449 views
  • compiler-design
  • parsing
  • syntax-directed-translation
  • basic-block-construction
  • compiler-tokenization
1 vote
1 answer
9
Internal and External fragmentation
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{KB}$refers to $\text{kilobyte}$. ... be calculated when we have the information about free memory slots and the process size whose size must be greater than Max free slot size. Someone verify it.
asked in Operating System Oct 31, 2018
2.5k views
  • memory-management
  • operating-system
  • fragmentation
3 votes
0 answers
10
MadeEasy Test Series: CO & Architecture - Cache Memory
asked in CO and Architecture Oct 12, 2018
571 views
  • co-and-architecture
  • cache-memory
  • made-easy-test-series
1 vote
2 answers
11
CPU Scheduling
Pno Arrival Time 1st IO Burst time 2nd IO P1 0 4 14 2 P2 0 8 28 4 P3 0 12 42 6 Using SRTF:- Completion time :- P1 - 18, P2 - 46, P3 - 88 Turnaround Time:- According to the definition of Galvin it is Turnaround time is the sum of the periods spent waiting to get into the memory, ... - 4 - 2 = 0. P2 = 50 - 28 - 8 - 4 = 10 P3 = 94 - 42 - 12 - 6 = 34. Someone Verify these calculations.
asked in Operating System Feb 3, 2018
743 views
  • operating-system
  • process-scheduling
12 votes
5 answers
12
Lexical, Syntax and Semantic error
int main() { int 1a, b; Printf("\nGate 2018"); Printf("%d",x); } How many types of error are there in this code?
asked in Compiler Design Jan 31, 2018
5.8k views
  • compiler-design
  • lexical-analysis
2 votes
1 answer
13
Calculus Limit
Find the value of Here I got till $lim_{x \rightarrow \infty} \frac{4^2 + \frac{3^x}{4^x}}{4^{-2}}$. But how to proceed further?
asked in Calculus Jan 30, 2018
653 views
  • limits
  • calculus
  • engineering-mathematics
1 vote
1 answer
14
Programming
#include <stdio.h> int main() { int arr[5], brr[5][5], crr[5][5][5]; int i,j,k; for(i=0;i<5;i++) arr[i] = i; for(i=0;i<5;i++) { for(j=0;j<5;j++) { brr[i][j] = i+ j; } } for(i=0;i<5;i++) { for(j=0;j< ... of 3rd 2D array. So, it should print BA of 0th 1D array of 3rd D array but it is directly printing the value which is stored at the BA of 0th 1D of 3rd 2D array. why?
asked in Programming Jan 27, 2018
171 views
  • programming-in-c
  • programming
1 vote
0 answers
15
Mulitsubject CO and CN
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 24 KB. Assume that 3 duplicate ACK are received during the 5th ... WB and ID stage i.e. in one half of cycle doing WB and in another half doing ID. Given answer is 14.
asked in Programming Jan 26, 2018
547 views
  • computer-networks
  • sliding-window
  • co-and-architecture
  • pipelining
3 votes
0 answers
16
MultiSubject (CO, DIgital, DS)
A 4-bit modulo-16 ripple counter uses JK flip-flops. If the propagation delay of each FF is 100 ns, the maximum clock frequency that can be used is equal to: Ans 2.5MHz. I think it should be $\frac{1}{16*10^{-7}} = 0.625MHz$ ... minimum number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is Ans = 840 I am getting 860.
asked in Programming Jan 25, 2018
1.4k views
  • data-structures
  • co-and-architecture
  • binary-tree
  • digital-logic
  • ripple-counter-operation
  • merge-sort
2 votes
1 answer
17
Hash Table and IPv6
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = kmod 10 and linear probing. The number of different insertion sequence of the key values using the given hash function and linear ... send the packet from source to destination with minimum number of hops. D) both b and c. I think it is B).
asked in Programming Jan 22, 2018
798 views
  • hashing
  • data-structures
  • chaining
  • computer-networks
  • ipv6
3 votes
1 answer
18
Graph Coloring
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below graphs: The number of vertex colouring possible with 4 colours are _________. ... Red and D with also blue which is other than Green, now this case is clearly violating graph coloring property. How, to solve this one?
asked in Graph Theory Jan 22, 2018
1.6k views
  • graph-theory
  • graph-coloring
6 votes
1 answer
19
Recurrence Relation
$T(n) = 2T(\sqrt{n}) + n$
asked in Algorithms Jan 20, 2018
816 views
  • algorithms
  • time-complexity
  • recurrence-relation
1 vote
0 answers
20
Maxima and Minima of 2 variable
Is the followIng case is possible rt-s^2 > 0 and r= 0?
asked in Calculus Jan 18, 2018
973 views
  • engineering-mathematics
  • calculus
  • maxima-minima
Page:
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • ...
  • 10
  • 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

  • IIITA M.TECH IT COMPLETE EXPLANATION FROM ADMISSION TO PLACEMENT
  • GO Classes NIELIT Test Series For 2023
  • Interview Experience : MTech Research(Machine Learning) at IIT Mandi
  • DRDO Scientist -B
  • ISRO Scientist-B 2023

Subjects

  • All categories
  • General Aptitude (2.8k)
  • Engineering Mathematics (9.8k)
  • Digital Logic (3.4k)
  • Programming and DS (5.9k)
  • Algorithms (4.6k)
  • Theory of Computation (6.7k)
  • Compiler Design (2.3k)
  • Operating System (5.0k)
  • Databases (4.6k)
  • CO and Architecture (3.8k)
  • Computer Networks (4.7k)
  • Non GATE (1.4k)
  • Others (2.5k)
  • Admissions (667)
  • Exam Queries (1.0k)
  • Tier 1 Placement Questions (17)
  • Job Queries (77)
  • Projects (9)
  • Unknown Category (867)

Recent Blog Comments

  • This story is same like my tier 3 college btech...
  • @Nikhil_dhamaHi , now i am in 2nd semester...
  • You can attempt now:...
  • where is the free test link ? how i can attempt...
  • Left with 10days, nothing heard back from them,...
  • Send feedback
  • Rank Predictor
  • College Prediction
  • Useful Links
  • FAQ
  • Corrections
  • Discuss
  • Copyright
  • Request
  • Testimonials
  • Chat Logs
  • Chat
  • Badges
  • Search tips
  • Exam Category
  • Blog Category
  • Blog Tags
  • Privacy
  • Test Series
  • GATER
  • Contact Us
Developed by Chun