Register
Filter

Questions by himgta

0 votes
1 answer
1
Rosen ch.3
Q.1 :Give a big-O estimate for f(n)=3n log(n!) + ($n^2$+3)log n, where n is positive integer Answer is given as O($n^2$ logn), Why it is not O($n^3$)? Q.2: Find the least integer n such that f(x) is O($x^n$) f(x)=2$x^2$ + $x^3$logx here n is given as 4, why it can not be 3??
Q.1 :Give a big-O estimate for f(n)=3n log(n!) + ($n^2$+3)log n, where n is positive integerAnswer is given as O($n^2$ logn), Why it is not O($n^3$)?Q.2: Find the least i...
1 votes
2 answers
3
ME TEST1
Match the following List 1 Link time load time compile time Run time List 2 A. Resolving references B. Relocation C. Token Recognition D. Activation record
Match the followingList 1Link timeload timecompile timeRun timeList 2 A. Resolving references B. Relocation C. Token Recognition D. Activation record
1 votes
1 answer
4
ME TEST
in selective repeat(SR) protocol the sender window size is K frames. What is the number of sequence bits required for the communication to take place? $log_2$(k+1) 1+$log_2$k 1+$log_2$(2k) None
in selective repeat(SR) protocol the sender window size is K frames. What is the number of sequence bits required for the communication to take place?$log_2$(k+1)1+$log_2...
0 votes
1 answer
7
Rosen Ex.6.1
Find a recurrence relation for the number of ways to lay out a walkway with slate tiles if the tiles are red, green, or gray so that no two red tiles are adjacent and tiles of the same color are considered indistinguishable
Find a recurrence relation for the number of ways to lay out a walkway with slate tiles if thetiles are red, green, or gray so that no two red tiles are adjacent and tile...
1 votes
1 answer
8
Rosen example 12 Ch 5.2
Show that every sequence of $n^2$+1 distinct real numbers contains a subsequence of length n+1 that is either strictly increasing or strictly decreasing.
Show that every sequence of $n^2$+1 distinct real numbers contains a subsequence of length n+1 that is either strictly increasing or strictly decreasing.
3 votes
1 answer
10
kenneth rosen Ex2.4 Q.46
Show that the set of functions from the positive integers to the set {0,1,2,3,4,5,6,7,8,9} is uncountable.
Show that the set of functions from the positive integers to the set {0,1,2,3,4,5,6,7,8,9} is uncountable.
0 votes
0 answers
11
#programming
https://www.sanfoundry.com/c-program-checks-strings-anagrams/ what is the meaning of line number 32?
https://www.sanfoundry.com/c-program-checks-strings-anagrams/what is the meaning of line number 32?
0 votes
1 answer
13
Kenneth Rosen Edition 6th Exercise 2.3 Question 36 (Page No. 147)
Let f be a function from the set A to the set B.Let S and T be subsets of A.Show that $f(S\cup T)=f(S)\cup f(T)$ $f(S\cap T)\subseteq f(S)\cap f(T)$ Show that inclusion in part b can be proper
Let f be a function from the set A to the set B.Let S and T be subsets of A.Show that$f(S\cup T)=f(S)\cup f(T)$$f(S\cap T)\subseteq f(S)\cap f(T)$Show that inclusion in p...
0 votes
1 answer
14
kenneth rosen Ex 2.3 Q.29,30
Justify the statements. 1. if f and f o g are one to one,does it follows that g is one to one. 2 if f and f o g are onto,does it follow that g is onto
Justify the statements.1. if f and f o g are one to one,does it follows that g is one to one.2 if f and f o g are onto,does it follow that g is onto
–1 votes
0 answers
15
Kenneth Rosen Ex.2.3 Q.3(c)
https://prnt.sc/cncgcv plz explain the c part!
https://prnt.sc/cncgcvplz explain the c part!
1 votes
0 answers
17
Kenneth Rosen Ex.1.3 Q.37
Express each of these statements using predicates and quantifiers. a) A passenger on an airline qualifies as an elite flyer if the passenger flies more than 25,000 miles in a year or takes more than 25 flights during that year.
Express each of these statements using predicates and quantifiers.a) A passenger on an airline qualifies as an elite flyer if the passenger flies more than 25,000 miles i...
0 votes
1 answer
18
ME MOCK 2
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n--; } } Let X be the number of times the comparission inside the while loop ( i.e., m<=n ) is performed, when mystery(127,255) is called. Then the value of X is _______________
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n ; } }Let X be the number of times the comparission inside the while loo...
0 votes
0 answers
19
ME DISCRETE MATHS
Consider the following partial order relations: Note that Z+ and Z– denote the set of positive integers and the set of negative integers respectively. How many of the above POSETs are well ordered?
Consider the following partial order relations:Note that Z+ and Z– denote the set of positive integers and the set of negative integers respectively. How many of the ab...
Page: