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
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
12751
admit card
when come admit card of isro
Chandrabhan Vishwa 1
asked
in
Others
Dec 5, 2017
by
Chandrabhan Vishwa 1
165
views
1
vote
0
answers
12752
waiting time
Frames of 1000 bits are sent over a 106 duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let I be the minimum number of bits (I) that will be ... packets again(full duplex)...so fully transit the link by 51 packets right ? why asssuming only for one way propogation as 25 frames
A_i_$_h
asked
in
Computer Networks
Dec 5, 2017
by
A_i_$_h
514
views
0
votes
0
answers
12753
#DBMS #SQL Define Check Constraint in SQL
Kindly explain Check Constraint in SQL with a small example!
iarnav
asked
in
Databases
Dec 5, 2017
by
iarnav
193
views
databases
sql
query
0
votes
0
answers
12754
Spooling
What is spooling device
Swami patil
asked
in
Operating System
Dec 5, 2017
by
Swami patil
729
views
0
votes
0
answers
12755
relational calculus
Parshu gate
asked
in
Databases
Dec 5, 2017
by
Parshu gate
966
views
relational-calculus
databases
tuple-relational-calculus
relational-algebra
1
vote
0
answers
12756
Half adders
Parshu gate
asked
in
Digital Logic
Dec 5, 2017
by
Parshu gate
648
views
combinational-circuit
digital-logic
adder
1
vote
0
answers
12757
RIPPLE COUNTER
ripple counter using negative edge triggered D flip-flops is shown below. The flip-flops are cleared to ‘0’ at the R input. The feedback logic is to be designed to obtain the count sequence shown in the same figure. The correct feedback logic is
Meenakshi Sharma
asked
in
Digital Logic
Dec 5, 2017
by
Meenakshi Sharma
972
views
0
votes
0
answers
12758
output of program
Parshu gate
asked
in
Programming in C
Dec 5, 2017
by
Parshu gate
477
views
programming-in-c
output
programming
0
votes
0
answers
12759
Probability
Parshu gate
asked
in
Probability
Dec 5, 2017
by
Parshu gate
625
views
engineering-mathematics
probability
conditional-probability
0
votes
0
answers
12760
combinatrics
Parshu gate
asked
in
Combinatory
Dec 5, 2017
by
Parshu gate
389
views
combinatory
0
votes
0
answers
12761
Maximum triples in the relation
Parshu gate
asked
in
Databases
Dec 5, 2017
by
Parshu gate
601
views
databases
0
votes
0
answers
12762
Equality of parsers
Parshu gate
asked
in
Compiler Design
Dec 5, 2017
by
Parshu gate
2.4k
views
compiler-design
parsing
lr-parser
0
votes
0
answers
12763
ISRO GATE
The answer is given as (A) but according to me it should be (B). Can anyone explain please?
Aakanchha
asked
in
Programming in C
Dec 5, 2017
by
Aakanchha
327
views
programming-in-c
matrix
1
vote
0
answers
12764
Data communication and Networking
In the Figure assume that the link between R1 and R2 is upgraded to 170 kbps and the link between the source host and R1 is now downgraded to 140 kbps. What is the throughput between the source and destination after these changes? Which link is the bottleneck now?
PallabiC
asked
in
Computer Networks
Dec 4, 2017
by
PallabiC
940
views
0
votes
0
answers
12765
Time Complexity
hope(n){ if (n == 1) G(n) else F() + hope(n/2); } What is the time complexity for the given function, if the function G' and function F' take O(1) and O(n) unit of time respectively. My views: If we take the recursion in the form of " ... ;log n' times as well? Why can't the answer be O(nlogn) since F() (whose complexity is O(n)) is called 'log n' times?
Warlock lord
asked
in
Algorithms
Dec 4, 2017
by
Warlock lord
365
views
time-complexity
algorithms
asymptotic-notation
recursion
0
votes
0
answers
12766
madeeasy
Nils
asked
in
Computer Networks
Dec 4, 2017
by
Nils
136
views
0
votes
0
answers
12767
virtualgate
How demand paging makes VAS independent of physical memory??
Niharika 1
asked
in
Operating System
Dec 4, 2017
by
Niharika 1
217
views
0
votes
0
answers
12768
ace test series
Aditya Bahuguna
asked
in
Compiler Design
Dec 4, 2017
by
Aditya Bahuguna
369
views
0
votes
0
answers
12769
self_doubt operating system
what is the work of " logical address " (which is generated by cpu) what is the perfect meaning of the logical address . and same doubt in physical address ..?? please explain with example (if possible)
air1ankit
asked
in
Operating System
Dec 4, 2017
by
air1ankit
253
views
operating-system
1
vote
0
answers
12770
Serial Schedules
LINKED QUESTION: Answers to both are 10 . In general , what is the exact way to calculate number of serial schedules conflict and view equivalent to the given schedule.
shaurya vardhan
asked
in
Databases
Dec 4, 2017
by
shaurya vardhan
230
views
0
votes
0
answers
12771
B+tree
The following key values are inserted into a B^+tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf nodes is the ... 6, 8, 4, 2, 1 The maximum number of times leaf nodes would get split up as a result of these insertions is 2 3 4 5
heena singh
asked
in
Databases
Dec 4, 2017
by
heena singh
316
views
0
votes
0
answers
12772
MadeEasy Test Series: Databases - B Tree
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels? given ans is 2499 but I am getting 2450
sunaina rawat
asked
in
Databases
Dec 4, 2017
by
sunaina rawat
401
views
made-easy-test-series
databases
b-tree
1
vote
0
answers
12773
MadeEasy Test Series: Databases - Indexing
Which of the following statement is/are true? For any data file it is possible to construct two separate sparse first level indexes on different keys. For any data file, it is possible to construct two separate dense first level indexes ... possible to construct a sparse first level index and a dense second level index,both should be useful. All the above
shivangi5
asked
in
Databases
Dec 4, 2017
by
shivangi5
594
views
made-easy-test-series
databases
indexing
1
vote
0
answers
12774
Practice: Deadlock
Deadlock Question
Vasu_gate2017
asked
in
Operating System
Dec 4, 2017
by
Vasu_gate2017
627
views
0
votes
0
answers
12775
Made Easy Test Series
Consider the following relational schema R(ABCDE) with: Functional Dependency: {A → B, C → D, BD → E, E → C} The number of given FD’s violate 3NF?
Brij Mohan Gupta
asked
in
Databases
Dec 4, 2017
by
Brij Mohan Gupta
288
views
0
votes
0
answers
12776
C programing
Harikesh Kumar
asked
in
Programming in C
Dec 4, 2017
by
Harikesh Kumar
194
views
programming-in-c
0
votes
0
answers
12777
test series
Total number of AND gates present inside a 6-bit carry look ahead generator circuit is
Chandrabhan Vishwa 1
asked
in
Digital Logic
Dec 4, 2017
by
Chandrabhan Vishwa 1
355
views
0
votes
0
answers
12778
Isro gate nielit
Please explain the answer as much details as possible
Harikesh Kumar
asked
in
Operating System
Dec 4, 2017
by
Harikesh Kumar
342
views
operating-system
1
vote
0
answers
12779
Deadlock implies No Progress (in process synchronization) ?
Hi Guys, Deadlock implies no progress. This statement is mentioned at many places. But i just want to verify my reasoning with respect to Progress definition Progress If no process is executing in its critical section and some ... of Deadlock. If my reasoning is not complete or incorrect then please notify. It will be a great help.
Chhotu
asked
in
Operating System
Dec 4, 2017
by
Chhotu
814
views
process-synchronization
deadlock-prevention-avoidance-detection
critical-section
progress
1
vote
0
answers
12780
Simple doubt in Reg Exp of TOC
why $bb^*$ is $b^*$ and not $b^+$? Ref: $a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
Tuhin Dutta
asked
in
Theory of Computation
Dec 4, 2017
by
Tuhin Dutta
444
views
theory-of-computation
regular-expression
finite-automata
Page:
« prev
1
...
421
422
423
424
425
426
427
428
429
430
431
...
591
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
Engineering Mathematics
Digital Logic
Programming and DS
Algorithms
Theory of Computation
Compiler Design
Operating System
Databases
CO and Architecture
Computer Networks
Artificial Intelligence
Machine Learning
Data Mining and Warehousing
Non GATE
Others
Admissions
Exam Queries
Tier 1 Placement Questions
Job Queries
Projects
Unknown Category
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions without answers
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:...