GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Answers by just_bhavana
User just_bhavana
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User just_bhavana
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
GATE20073
What is the maximum number of different Boolean functions involving $n$ Boolean variables? $n^2$ $2^n$ $2^{2^n}$ $2^{n^2}$
answered
Oct 14
in
Set Theory & Algebra

650
views
gate2007
permutationsandcombinations
functions
normal
+1
vote
2
integration question
$f(x) = \int_{ \infty}^{\infty} f(x) e^{2\pi x} dx$ solve f(x)
answered
Oct 12
in
Calculus

69
views
integration
definiteintegration
calculus
engineeringmathematics
0
votes
3
Inverse of a function
Consider a function f from A to B such that f : A → B is bijective. f–1 represents inverse of f. Than could we say that f1 :B>A is also bijective..Please give proper reasoning thanks
answered
Oct 7
in
Set Theory & Algebra

28
views
discretemathematics
functions
0
votes
4
compound interest
Rs . 5887 is divided between ram and shyam such that shyams share at the end of 9 years is equal to ram's share at the end of 11 years compounded annualy at the rate of 5%. The share of shyam is _________________
answered
Sep 27
in
Numerical Ability

33
views
+1
vote
5
Self doubtByte Offset or Word OffsetEg from Stallings
answered
Sep 27
in
CO & Architecture

27
views
co&architecture
+2
votes
6
Probability
Let X and Y be independent random variables each taking the values 1 or 1 with probability 1/2. Let Z=XY . Show that X,Y,Z are pairwise independent . Are they indepenedent ?
answered
Sep 26
in
Probability

46
views
probability
conditionalprobability
+1
vote
7
Doubt
A bag contains 10 red marbles, 10 white marbles, and 10 blue marbles. What is the minimum no. of marbles you have to choose randomly from the bag to ensure that we get 4 marbles of same color?
answered
Sep 26
in
Probability

33
views
+4
votes
8
Number System
How do I calculate (54)10 in hexadecimal? The way I am doing it currently is that I am first converting (54)10 into hexadecimal which is (34)16. Next I am taking 16's complement. i.e. I am doing (FF)16  (34)16 + 1, which comes to (CA)16. Thus, (54)10 = (CA)16. Is this the right way to convert or is there some better method ?
answered
Sep 25
in
Programming

47
views
number
system
digitallogic
+1
vote
9
Memory management
The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page with 1 free main memory frame is recorded as follows.What is the number of page faults ? 780,450,456,520,599,098,108,109,754,555
answered
Sep 22
in
Operating System

22
views
+1
vote
10
Memory management
The page fault service time is 10 ms in a computer with average memory access time being 20 ns.If one page fault is generated for every 106 memory accesses.What is the effective access time for the memory? A)21 ns B)30 ns C)23 ns D)35 ns I am confused with the conversions.Could anybody answer this with proper explanation.
answered
Sep 22
in
Operating System

31
views
+1
vote
11
comparison
Consider a set of n distinct elements, by comparison Amit wants to find the largest 3 elements in the set. Which of the following is true a) Three largest elements can be determined using O(log ^2 n ) comparison b)O(log ^2 n ) comparison is not ... n comparisons c)n + O(1) comparison are needed d)n + O(1) not sufficient , n + O(log n) comparisons required
answered
Sep 18
in
Algorithms

29
views
+1
vote
12
flow control
answered
Sep 18
in
Computer Networks

47
views
computernetworks
testbooktestseries
networkflow
+1
vote
13
TOPIC : REGULAR EXPRESSIONS,
1.One of the following Regular Expressions is not the same as others. Which one? A. (a* + b*a*)* B. (a*b* + b*a*)* (a*b*)* C. ((ab)* + a*)* D. (a + b)* a*b*a*b*
answered
Sep 1
in
Theory of Computation

77
views
regularexpressions
theoryofcomputation
finiteautomata
#theoryofcomputation
regularlanguages
0
votes
14
#first course in probability #sheldon_ross 8th edition Qn. #12(a)
answered
Sep 1
in
Probability

49
views
permutationsandcombinations
engineeringmathematics
+1
vote
15
Self Doubt
Primary key is subset or proper subset of superkey ?
answered
Sep 1
in
Databases

42
views
databases
primarykey
superkey
subset
0
votes
16
networking
Which of the following is the valid host range for the subnet on which the IP address 192.168.168.188 255.255.255.192 resides? A. 192.168.168.129190 B. 192.168.168.129191 C. 192.168.168.128190 D. 192.168.168.128192
answered
Aug 24
in
Computer Networks

54
views
+1
vote
17
Logic gates and switching ckt
1 simply the following logic exp F=AB'+ABC'+ABCD+ABCD' and realize it using NADND GATE only ..
answered
Aug 24
in
Digital Logic

28
views
digitallogic
+1
vote
18
NAND gate
The number of _________ NAND gate required to realize the following function f given below: f= AB+BC+CD+DE+................+YZ
answered
Aug 24
in
Digital Logic

36
views
digitallogic
numericalanswers
+2
votes
19
Circular Queue
a)a_cb_ b)_abc_ c)abc_ _ d)_ab_c
answered
Aug 21
in
Programming

71
views
datastructure
circularqueue
queues
+3
votes
20
binary tree
If a binary tree contains 1056 nodes the what is the height of binary tree??
answered
Aug 21
in
DS

88
views
binarytree
0
votes
21
made easy work book
the head of a movin disk with 100 tracks numbered 0 to 99 is serving a request at track 'x' if the requests of track 25, 76, 43,10,67 are served using fifo algo. then head movements are 194 the track 'x' initially served was.?
answered
Aug 21
in
Operating System

67
views
disks
diskscheduling
0
votes
22
Dennis Ritchie doubt pg 49
As an illustration of some of the bit operators, consider the function getbits(x,p,n) that returns the (right adjusted) nbit field of x that begins at position p. We assume that bit position 0 is at the right end and that n and ... makes a mask with ones in the rightmost n bits. Can anyone please explain this to me?? What's happening here???
answered
Aug 19
in
Programming

24
views
+2
votes
23
Generate CFG
What will be the CFG when w$\in$(a,b)* where w contains at least 3 a's?
answered
Aug 18
in
Theory of Computation

38
views
theoryofcomputation
contextfreelanguage
0
votes
24
CN: CRC Rules
From forouzan : If the generator has more than one term and coefficient of x^0 is 1 then all single bit error can be caught. So if e(x)=x^i // means some power of 2 number g(x) = at least two terms and coefficient of x^0 is always 1, means some odd number. So is it saying that the number some 2^i will never be divisible by odd number?
answered
Aug 18
in
Computer Networks

35
views
computernetworks
crcpolynomial
0
votes
25
SET Maharashtra April 2017 Ques38 Paper II
answered
Aug 16
in
CO & Architecture

54
views
digitallogic
+1
vote
26
PARSER
Is this statement true: If Grammar is unambiguous must be LL(1) if not LL(1) it does not mean ambiguous.
answered
Aug 16
in
Compiler Design

83
views
compilerdesign
grammar
parsing
+1
vote
27
TOC BaSiCs
Please explain:
answered
Aug 15
in
Theory of Computation

44
views
theoryofcomputation
regularexpressions
finiteautomata
+1
vote
28
Toc Basics
Complement of (0+1)*1 ?? my answer is (0+11*0)* given answer is (1*0)* please give detail explanation!
answered
Aug 15
in
Theory of Computation

67
views
theoryofcomputation
finiteautomata
regularexpressions
+1
vote
29
INDEXING
Consider a disk with block size B=512 bytes. A block pointer is p=6 bytes long and a record pointer is R=7 bytes long. A file has 30,000 employee records of fixed length. Each record has 100 bytes. Assume that unspanned organization ... required to retrieve a record from the file using single level index and binary search? Please help me to find the answer...
answered
Aug 15
in
Databases

55
views
+1
vote
30
TOCDFA
Design a NFA and DFA for the following :: 1) Accepting all substrings of the string abab. 2) Accepting all prefixes of the string abab. 3) Accepting all suffixes of the string abab.
answered
Aug 12
in
Theory of Computation

83
views
theoryofcomputation
finiteautomata
dfa
+2
votes
31
array
How to get address for this ? As i understood till now that we have 90 (2 d array of 30*40) pls explain the concept of calcultaing address for this ?
answered
Aug 12
in
DS

125
views
arrays
datastructure
0
votes
32
2's compliment
The Decimal equivalent of 2’s complement representation of 8 bit integer is most positive when except _________ (A) MSB are zeros (B) LSB are zeros (C) MSB are ones (D) LSB are ones
answered
Aug 12
in
Digital Logic

55
views
0
votes
33
number system
A number system with base 99 will have X different digits and range from 0 to Y. then appropriate value of X and Y is; a) 100 and 9 b) 99 and 98 c) 98 and 99 d) 99 and 100
answered
Aug 11
in
Digital Logic

48
views
+4
votes
34
BCNF3NF
Consider the following statements. If relation R is in 3NF and every key is simple, then R is in BCNF If relation R is in 3NF and R has only one key, then R is in BCNF Both 1 and 2 are true 1 is true but 2 is false 1 is false and 2 is true Both 1 and 2 are false
answered
Aug 11
in
Databases

182
views
+3
votes
35
TOC Question
Sorry my BAD, it's an infinite language! The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
answered
Aug 10
in
Theory of Computation

108
views
theoryofcomputation
finiteautomata
+1
vote
36
Demand paging
answered
Aug 9
in
Operating System

64
views
+1
vote
37
Computer Networks Supernetting
If I need to have a network of 509 hosts using class C,then do i need to join 2 Class c networks or 3? One class C gives us 2562=254 hosts in case of subnetting.Does the same hold in case of super netting also?Or does in super netting one class c can give 256 hosts?
answered
Aug 9
in
Computer Networks

57
views
computernetworks
network
0
votes
38
B+ tree
The minimum number of keys in a B+ tree is 3. The maximum number of keys in any non root node is ____.
answered
Aug 9
in
Databases

46
views
+1
vote
39
Theory of computation
No of State for minimal DFA for empty language ? If your answer is 1 or 2 then please explain to support your answer
answered
Aug 9
in
Theory of Computation

57
views
+2
votes
40
Stack
A stack is implemented with two queues then what are the minimum enqueue and dequeue operations needed to perform for pop operation where n is the number of elements already in the first queue.?
answered
Aug 9
in
DS

48
views
Page:
1
2
next »
27,422
questions
35,273
answers
84,587
comments
33,511
users