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 shipra tressa
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by shipra tressa
1
answer
1
forouzan 4th edition chapter 19
An organization is granted the block 16.0.0.0/8. The administrator wants to create 500 fixed-length subnets.Find the first and last addresses in subnet 500.
answered
in
Computer Networks
Jul 22, 2019
547
views
computer-networks
2
answers
2
DISCRETE MATHEMATICS
Determine which one of the following is a partition of the set R of real numbers. a.[{x:x>4},{x:x<5}] b.[{x:x>0},{0},{x:x<0}] c.[{x:x^2>11},{x:x^2<11}] d.none
recategorized
in
Set Theory & Algebra
Dec 28, 2018
346
views
1
answer
3
combinatorics
What is the sum of the terms in the nth bracket of the series (1), (2,3,4), (5,6,7,8,9) …? (2n-1)^2 (4n+n-1)^3 (n-1)^3+n^3 n^3+(n+1)^3
commented
in
Combinatory
Dec 27, 2018
164
views
1
answer
4
Theory of computation
Let L={aba}. Prefix and suffix operations over the language L is used to perform the following. X=(prefix(L) intersection suffix (L))/L Quotient operation (/) is also used in the above.how many strings exist in the language X?
edited
in
Theory of Computation
Dec 21, 2018
702
views
2
answers
5
dfa toc
let l be a language and l={w|w has exactly one b ,w belongs to {a,b}*,|w| is even} minimum number of states in minimized dfa?????
commented
in
Theory of Computation
Dec 21, 2018
848
views
1
answer
6
graph theory
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connected unilaterally connected strongly connected disconnected
asked
in
Graph Theory
Dec 14, 2018
779
views
3
answers
7
Made easy CA q17
The time delays of 4 segments are 60 ns, 70 ns, 100 ns and 80 ns respectively. Interface registers are have the delay of 10 ns. what is the speed up? a. 2.9 b. 2.6 c. 3.2 d. 1.8
commented
in
CO and Architecture
Dec 2, 2018
3.8k
views
co-and-architecture
pipelining
speedup
5
answers
8
GATE CSE 2007 | Question: 71
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$
commented
in
CO and Architecture
Nov 29, 2018
17.7k
views
gatecse-2007
co-and-architecture
machine-instructions
interrupts
normal
3
answers
9
GATE CSE 2005 | Question: 85-b
Consider the following floating-point format. Mantissa is a pure fraction in sign-magnitude form. The normalized representation for the above format is specified as follows. The mantissa has an implicit $1$ preceding the binary (radix) point. Assume that only $0's$ are padded in while ... above number $(0.239 \times 2^{13})$ is: $0A\;20$ $11\;34$ $49\;D0$ $4A\;E8$
commented
in
Digital Logic
Nov 26, 2018
6.5k
views
gatecse-2005
digital-logic
number-representation
floating-point-representation
normal
1
answer
10
merge sort
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
asked
in
Algorithms
Sep 15, 2018
286
views
sorting
merge-sort
time-complexity
2
answers
11
TOC Finite Automata
How to construct a finite automata equivalent to the regular expression: ( 0 + 1 )* ( 00 + 11 ) ( 0 + 1 )*
answered
in
Theory of Computation
Sep 1, 2018
13.5k
views
finite-automata
theory-of-computation
regular-expression
1
answer
12
Discrete mathematics
What is a discrete set?
asked
in
Mathematical Logic
Sep 1, 2018
649
views
1
answer
13
Algorithms
what is space complexity of an algo? and what is the number of function calls in general?
asked
in
Algorithms
Aug 31, 2018
183
views
space-complexity
descriptive
0
answers
14
Toc prefixes
What is init operation?
asked
in
Theory of Computation
Aug 16, 2018
109
views
2
answers
15
nfa to dfa
Consider the following NFA for ∑={ g,a,t,e}.Find the number of states in equivalent minimal dfa. a)4 b)5 c)6 d)8
commented
in
Theory of Computation
Aug 16, 2018
996
views
1
answer
16
Dynamic programming
Given a sequence of n real numbers a1,a2,a3...an then to find contiguous subsequence ai,ai+1,ai+2....aj. Such that it's sum is maximum. How much time the above problem will take if you use dynamic programming?
asked
in
Algorithms
Jul 17, 2018
1.1k
views
dynamic-programming
time-complexity
1
answer
17
bubble sort
a machine took 200 sec to sort 200 names using bubble sort . in 800 sec it can approx sort how many names a)400 b)800 c)750 d)850
commented
in
Programming
Jun 28, 2018
16.0k
views
5
answers
18
GATE CSE 1999 | Question: 1.13
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is $n-1$ $n$ $n+1$ None of the above
commented
in
Algorithms
Jun 27, 2018
16.1k
views
gate1999
algorithms
time-complexity
normal
2
answers
19
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
commented
in
Algorithms
Jun 27, 2018
16.5k
views
algorithms
sorting
time-complexity
3
answers
20
Of the following which best describes the growth of f(x) as a function of x?
int f(int x) { if(x<1) return 1; else return f(x-1) +g(x/2); } int g(int x) { if(x<2) return 1; else return f(x-1) +g(x/2); } a. Logarithmic B. Quadratic C. Linear D. Exponential
commented
in
Algorithms
Jun 23, 2018
2.5k
views
algorithms
time-complexity
recursion
0
answers
21
Time complexity
D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 What are the number of multiplications in this code
asked
in
Algorithms
Jun 23, 2018
149
views
1
answer
22
Algorithm
Which of the given options provides the increasing order of asymptotic complexity of functions $f1$, $f2$, $f3$ and $f4$? $f1(n) = 2^n \\ f2(n) = n^{(3/2)} \\ f3(n) = nlogn \\ f4(n) = n^{(logn)}$ How $n^{3/2}$ is greater than $n^{logn}$
commented
in
Algorithms
Jun 18, 2018
1.3k
views
algorithms
time-complexity
2
answers
23
Engineering mathematics
Standard books required for linear algebra and calculus for gate syllabus ?
asked
in
Linear Algebra
Aug 18, 2017
511
views
linear
algebra
and
calculus
2
answers
24
Gate 2018
Is network devices (bridges,routers,switches) in gate syllabus for 2018 ?
answered
in
Computer Networks
Aug 11, 2017
252
views
0
answers
25
Discrete mathematics
Proofs questions are asked in mathematical logic gate?
asked
in
Mathematical Logic
Aug 11, 2017
264
views
general
0
answers
26
General Doubt
what should i study from standard books? is it sufficient to solve the examples or should i study all the theory part and do all the exercises?
commented
in
GATE
Aug 10, 2017
175
views
general-doubt
exam
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Pip box does not detect latex code properly. $$...
GO Classes CN Test-4 is here.