Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rameshbabu
1
answer
1
toc doubt
1.4k
views
commented
Jan 15, 2017
Theory of Computation
theory-of-computation
decidability
recursive-and-recursively-enumerable-languages
+
–
1
answer
2
OS-Test
In thread switch of same process, which of the following value will be changed a)Program Counter & Stack pointer b)memory management info & PC c)mm info and SP d) only PC
In thread switch of same process, which of the following value will be changeda)Program Counter & Stack pointerb)memory management info & PCc)mm info and SPd) only PC
252
views
commented
Nov 26, 2016
1
answer
3
probabilty
There are two boxes namely A and B. A contains 20 green and 15 blue balls and B contains 7 green and 8 blue balls. You can move the balls between the two boxes. If you are allowed to choose a box at random then what will be the maximum probability of getting a green ball from the chosen box?
There are two boxes namely A and B. A contains 20 green and 15 blue balls and B contains 7 green and 8 blue balls. You can move the balls between the two boxes. If you ar...
595
views
commented
Nov 26, 2016
2
answers
4
ISO-OSI MODEL
Which layer is responsible for synchronizing sending and receiving applications? A.) Presentation B.) Session C.) Transport D.) Application E.) Network I found the answer (D) in internet. But according to forouzen "session layer is responsible for synchronization"
Which layer is responsible for synchronizing sending andreceivingapplications?A.) PresentationB.) SessionC.) TransportD.) ApplicationE.) NetworkI found the answer (D) in ...
3.2k
views
commented
Nov 25, 2016
3
answers
5
thread execution
Consider the following code segment: pid_t pid; pid = fork(); if (pid == 0) { /* child process */ fork(); thread create( . . .); } fork(); a. How many unique processes are created? b. How many unique threads are created?
Consider the following code segment:pid_t pid;pid = fork();if (pid == 0) { /* child process */fork();thread create( . . .);} fork();a. How many unique processes are creat...
7.0k
views
commented
Nov 25, 2016
4
answers
6
ARRAYS
Consider an array containing ‘n’ elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time complexity to find the position of the missing element using divide and conquer?
Consider an array containing ‘n’ elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time ...
2.8k
views
commented
Nov 25, 2016
Algorithms
algorithms
binary-search
time-complexity
+
–
1
answer
7
Ace Test Series: Compiler Design - Grammar
Is the following question even valid? Shouldn't there be a production for all variables?
Is the following question even valid? Shouldn't there be a production for all variables?
400
views
answered
Nov 20, 2016
Compiler Design
ace-test-series
compiler-design
grammar
+
–
1
answer
8
Forouzan
An ISP is granted a block of addresses starting with 190.100.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follows: a. The first group has 64 customers; each needs 256 addresses. b. ... group has 128 customers; each needs 64 addresses. Design the subblocks and find out how many addresses are still available after these allocations
An ISP is granted a block of addresses starting with 190.100.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follow...
1.9k
views
commented
Nov 20, 2016
1
answer
9
ME FLT-1 q29
please explain this anyone
please explain this anyone
739
views
commented
Nov 20, 2016
1
answer
10
Explain??
222
views
commented
Nov 19, 2016
1
answer
11
DIGITALS
how to solve this question and what is the feedback ckt in the above fig.
how to solve this question and what is the feedback ckt in the above fig.
1.2k
views
commented
Nov 19, 2016
4
answers
12
GATE CSE 2006 | Question: 85
The grammar $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \epsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$ generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In this grammar what is the length of the derivation (number of steps starting from $S$) to generate ... $l\neq m$ $\max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $\max (l,m) + 3$
The grammar$S\rightarrow AC\mid CB$$C\rightarrow aCb\mid \epsilon$$A\rightarrow aA\mid a$$B\rightarrow Bb\mid b$generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j...
7.3k
views
answered
Nov 7, 2016
Compiler Design
gatecse-2006
compiler-design
grammar
normal
+
–
2
answers
13
permutation combo
In how many ways can seven different jobs be assigned to 4 different employees so that each employee is assigned at least one job and the most difficult job is assigned to the best employee?
In how many ways can seven different jobs be assigned to 4 different employees so that each employee is assigned at least one job and the most difficult job is assigned t...
3.5k
views
commented
Nov 7, 2016
Combinatory
combinatory
+
–
1
answer
14
ME-PracticeSet-COA Q#54
305
views
commented
Nov 7, 2016
0
answers
15
contents of registers after 4 clock pulse
If initially register contains byte B7 , Then contents of registers after 4 clock pulse will be a)73 b)72 c)7E d)74
If initially register contains byte B7 , Then contents of registers after 4 clock pulse will bea)73 b)72 c)7E d)74
640
views
commented
Nov 4, 2016
2
answers
16
How many address operations are possible
A computer has 40 bit instruction code . It uses one register operand and one memory operand .There are 128 general purpose regsiters and 256 M bytes of RAM If there are n 2 address operations which uses both register and memory then how many one address operations are possible a) (16-n)x 2^7 b)(32-n)x 2^6 c)64x 2^18 d)none
A computer has 40 bit instruction code . It uses one register operand and one memory operand .There are 128 general purpose regsiters and 256 M bytes of RAM If there are ...
2.1k
views
commented
Nov 4, 2016
1
answer
17
SQL
Consider the following database table: Create table test( one integer, two integer, primary key(one), unique(two), check(one>=1 and <=10), check (two>=1 and <=5) ); How many data records/tuples atmost can this table contain? 5 10 15 50 I am getting 50 .Am I correct?
Consider the following database table:Create table test( one integer, two integer, primary key(one), unique(two), check(one>=1 and <=10), check (two>=1 and <=5) );How man...
699
views
answered
Sep 12, 2016
1
answer
18
book[cormen - solution 2nd edition] solution to problem 3-3
Prove that : log*(log n) = log*n -1.
Prove that : log*(log n) = log*n -1.
402
views
commented
Jul 18, 2016
Algorithms
algorithms
asymptotic-notation
descriptive
+
–
1
answer
19
ISI Maths
Suppose L is a language which contains the empty word, the word $\alpha$ and the word $\beta$ ... $n_1, n_2, \dots , n_k$ are nonnegative integers; none of the foregoing languages
Suppose L is a language which contains the empty word, the word $\alpha$ and the word $\beta$ and has the property that whenever P and Q are in L, the word P.Q is also in...
799
views
answered
Jul 16, 2016
15
answers
20
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...
37.2k
views
comment reshown
Jul 8, 2016
Algorithms
gatecse-2007
algorithms
time-complexity
normal
isro2016
+
–
2
answers
21
UGC NET CSE | June 2012 | Part 3 | Question: 16
Given the following statements: The power of deterministic finite state machine and non- deterministic finite state machine are same. The power of deterministic pushdown automaton and non- deterministic pushdown automaton are same. Which of the above is the correct statement(s)? Both I and II Only I Only II Neither I nor II
Given the following statements:The power of deterministic finite state machine and non- deterministic finite state machine are same.The power of deterministic pushdown au...
3.3k
views
answered
Jul 6, 2016
Theory of Computation
ugcnetcse-june2012-paper3
theory-of-computation
finite-automata
+
–
3
answers
22
ISRO2016-30
A complete binary tree with $n$ non-leaf nodes contains $\log_{2}n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
A complete binary tree with $n$ non-leaf nodes contains$\log_{2}n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
9.2k
views
commented
Jul 5, 2016
DS
data-structures
binary-tree
isro2016
+
–
4
answers
23
ISRO2016-68
Dynamic routing protocol enable routers to Dynamically discover and maintain routes Distribute routing updates to other routers Reach agreement with other routers about the network topology All of the above
Dynamic routing protocol enable routers toDynamically discover and maintain routesDistribute routing updates to other routersReach agreement with other routers about the ...
4.3k
views
answered
Jul 4, 2016
Computer Networks
isro2016
computer-networks
routing
+
–
3
answers
24
UGC NET CSE | June 2012 | Part 2 | Question: 5
Networks that use different technologies can be connected by using Packets Switches Bridges Routers
Networks that use different technologies can be connected by usingPacketsSwitchesBridgesRouters
4.7k
views
answered
Jul 4, 2016
Computer Networks
ugcnetcse-june2012-paper2
computer-networks
+
–
1
answer
25
Suggestion for Front page of GATE Overflow
Hi, Front page of GATE Overflow is not useful now. Any suggestions for a better look?
Hi,Front page of GATE Overflow is not useful now. Any suggestions for a better look?
780
views
commented
Jul 3, 2016
Others
gateoverflow
+
–
6
answers
26
ISRO2014-17
If each address space represents one byte of storage space, how many address lines are needed to access RAM chips arranged in a $4 \times 6$ array, where each chip is $8\;\text{K} \times 4$ bits? $13$ $15$ $16$ $17$
If each address space represents one byte of storage space, how many address lines are needed to access RAM chips arranged in a $4 \times 6$ array, where each chip is $8\...
10.4k
views
commented
Jul 1, 2016
CO and Architecture
co-and-architecture
memory-interfacing
isro2014
+
–
3
answers
27
ISRO2014-44
A computer has 16 pages of virtual address space but the size of main memory is only four frames. Initially the memory is empty. A program references the virtual pages in the order 0, 2, 4, 5, 2, 4, 3, 11, 2, 10. How many page faults occur if LRU page replacement algorithm is used? 3 5 7 8
A computer has 16 pages of virtual address space but the size of main memory is only four frames. Initially the memory is empty. A program references the virtual pages in...
4.7k
views
commented
Jul 1, 2016
Operating System
isro2014
operating-system
virtual-memory
paging
+
–
5
answers
28
ISRO2014-41
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T? Q V W X
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T?QVWX
6.0k
views
answered
Jul 1, 2016
DS
isro2014
data-structures
binary-search-tree
+
–
1
answer
29
Kenneth Rosen Edition 6th Exercise 1.3 Example 17 (Page No. 38)
The restriction of a universal quantification is the same as the universal quantification of a conditional statement. For instance, ∀x < 0 (x2 > 0) is another way of expressing ∀x(x < 0 ... whereas existential quantification is same as existential quantification of a conjunction? Please provide proper details. Thank You.
The restriction of a universal quantification is the same as the universal quantificationof a conditional statement. For instance, ∀x < 0 (x2 0) is another way of expr...
547
views
answered
Jul 1, 2016
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
quantifiers
+
–
2
answers
30
UGC NET CSE | June 2014 | Part 2 | Question: 21
Consider the graph given below as : Which one of the following graph is isomorphic to the above graph ?
Consider the graph given below as :Which one of the following graph is isomorphic to the above graph ?
3.5k
views
commented
Jul 1, 2016
Graph Theory
ugcnetcse-june2014-paper2
graph-theory
non-gate
graph-isomorphism
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register