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 himgta
0
answers
1
Mathematical Logic: Which of the following is a logical consequence of $∀x(p(x)∨q(x))$
The following question is on the NPTEL archive of Assignment 2 of Discrete Mathematics Course,(Link : assessment id-15 (nptel.ac.in)) . I am not able to get how the answer is given option A but I am getting B, C and D. I have also attached my reasoning below. Let me know If I am missing something.
The following question is on the NPTEL archive of Assignment 2 of Discrete Mathematics Course,(Link : assessment id-15 (nptel.ac.in)) . I am not able to get howthe answe...
258
views
commented
Dec 26, 2023
Mathematical Logic
mathematical-logic
first-order-logic
discrete-mathematics
+
–
0
answers
2
Peter Linz Edition 5 Exercise 12.1 Question 1 (Page No. 307)
If the halting problem were decidable, then every recursively enumerable language would be recursive. Consequently, the halting problem is undecidable. Describe in detail how $H$ in given Theorem can be modified to produce $H^{\prime} $.
If the halting problem were decidable, then every recursively enumerable language would be recursive. Consequently, the halting problem is undecidable.Describe in detail ...
235
views
commented
Mar 15, 2019
Theory of Computation
peter-linz
peter-linz-edition5
decidability
theory-of-computation
+
–
1
answer
3
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.0k
views
commented
Mar 13, 2019
Algorithms
kenneth-rosen
asymptotic-notation
+
–
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...
690
views
commented
Mar 10, 2019
0
answers
5
ME TEST2
Pick the true statements among the following Circuit switching is stored and forward technique Packet switching is faster as compared to circuit switching Packet switching wastes less resources as compare to circuit switching Packet switching is not store and forward technique Only 2nd 2nd and 3rd both 1st and 4th both all are correct
Pick the true statements among the followingCircuit switching is stored and forward techniquePacket switching is faster as compared to circuit switchingPacket switching w...
260
views
asked
Mar 10, 2019
2
answers
6
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
687
views
asked
Mar 10, 2019
Compiler Design
compiler-design
runtime-environment
match-the-following
made-easy-test-series
+
–
0
answers
7
LIC AAO
$P,Q,R,S,T,V,$ and $W$ are seven members of a family each one of them has a different profession. Doctor, Teacher, Lawyer, Engineer, Architect and Banker and their incomes are different. There are two married couples in the group. $R$ is the Doctor and ... Lawyer. The charted Accountant earns less than Lawyer but more than the Banker. Who earns the maximum in the family ? V W R S None
$P,Q,R,S,T,V,$ and $W$ are seven members of a family each one of them has a different profession. Doctor, Teacher, Lawyer, Engineer, Architect and Banker and their income...
903
views
commented
Mar 4, 2019
1
answer
8
LIC AAO question
Statements: Some boxes are triangles. All Spheres are triangles. All circles are boxes. All triangles are quadrilaterals. Conclusions: Some quadrilaterals are boxes. Some quadrilaterals are triangles. Some triangles are spheres. No circle is quadrilaterals. Options. 1 only 1st follow 2 only 1 ,2 ,3 follows 3 only 3rd follows 4 all follows
Statements:Some boxes are triangles. All Spheres are triangles.All circles are boxes.All triangles are quadrilaterals.Conclusions:Some quadrilaterals are boxes.Some quadr...
844
views
commented
Mar 3, 2019
Mathematical Logic
analytical-aptitude
logical-reasoning
statements-follow
+
–
1
answer
9
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...
873
views
commented
Mar 3, 2019
4
answers
10
GATE CSE 2019 | Question: 5
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$. $\mid A \mid = n2^{n-1}$ $\mid A \mid = \Sigma_{k=1}^{n} k \begin{pmatrix} n \\ k \end{pmatrix}$ Which of the above statements is/are TRUE? Only I Only II Both I and II Neither I nor II
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$.$\mid A \mid = n2^{n-1}$$\mid A \mi...
11.7k
views
commented
Feb 27, 2019
Combinatory
gatecse-2019
engineering-mathematics
discrete-mathematics
combinatory
1-mark
+
–
1
answer
11
Peter Linz Edition 4 Exercise 4.3 Question 6 (Page No. 122)
Given $L_1=${$a^nb^n$|$n\geqslant 1$} , $L_2=${$a^nb^m|n\geq 1, m\geq 1$}, $L_3=${$a^nb^{n+2}|n\geqslant 1$} if $L_1 \cup L_2$ is regular then why $L_1 \cup L_3$ is not regular? also what is the language of $L_1 \cup L_3$?
Given $L_1=${$a^nb^n$|$n\geqslant 1$} , $L_2=${$a^nb^m|n\geq 1, m\geq 1$}, $L_3=${$a^nb^{n+2}|n\geqslant 1$}if $L_1 \cup L_2$ is regular then why $L_1 \cup L_3$ is not re...
997
views
commented
Feb 26, 2019
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-language
pumping-lemma
+
–
1
answer
12
Distinguishable objects and indistinguishable boxes
How many number of ways are there to put 4 different Employees into 3 indistinguishable offices,when each office can contain any number of Employees? Please tell me the approach not formula given in ROSEN. :)
How many number of ways are there to put 4 different Employees into 3 indistinguishable offices,when each office can contain any number of Employees?Please tell me the ap...
2.6k
views
commented
Feb 26, 2019
Mathematical Logic
combinatory
+
–
1
answer
13
kenneth rosen chapter 5 exercise 5.5 ques 51
How many ways are there to distribute six distinguishable objects into four indistinguishable objects so that each of the boxes contain at least one object?? Plss tell how to solve questions based on distributing Distinguishable objects ... boxes and Indistinguishable objects into indistinguishable boxes. I am not able to solve problem based on these.
How many ways are there to distribute six distinguishable objects into four indistinguishable objects so that each of the boxes contain at least one object??Plss tell how...
2.0k
views
commented
Feb 26, 2019
1
answer
14
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.
1.8k
views
answer selected
Feb 25, 2019
2
answers
15
Kenneth Rosen Example 9 Ch.5.2
Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to a server. For each server, only one direct connection to that server can be active at any time. We ... ;t understand this part. How is it concluded that remaining nine servers are insufficient when at most 59 connections are used?
Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to a server. For each server, only on...
584
views
commented
Feb 25, 2019
1
answer
16
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.
1.6k
views
commented
Feb 22, 2019
1
answer
17
2018 PGEE SAMPLE Paper : Q4
All shirts are T-shirts with buttons. No yellow T-shirt has buttons. No shirt is yellow. If the first two statements are true, the third statement is (A) True (B) False (C) Uncertain
All shirts are T-shirts with buttons. No yellow T-shirt has buttons. No shirt is yellow. If the first two statements are true, the third statement is(A) True(B) False(C) ...
2.1k
views
comment reshown
Feb 21, 2019
Analytical Aptitude
logical-reasoning
+
–
0
answers
18
#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?
377
views
commented
Feb 20, 2019
1
answer
19
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...
490
views
commented
Feb 19, 2019
Set Theory & Algebra
kenneth-rosen
set-theory&algebra
discrete-mathematics
+
–
1
answer
20
NPTEL CODING ASSIGNMENT
Consider a matrix M of integers. Divide M into 4 sub-matrices. These sub-matrices are called as Quadrants. Report the Quadrant number which has the smallest minimum-element. If two or more quadrants have same smallest minimum, report the smallest ... than 1 and less than 12 OUTPUT FORMAT: Print in a separate line, the quadrant number with the smallest minimum-element.
Consider a matrix M of integers. Divide M into 4 sub-matrices. These sub-matrices are called as Quadrants. Report the Quadrant number which has the smallest minimum-eleme...
1.8k
views
commented
Feb 19, 2019
1
answer
21
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
487
views
commented
Feb 18, 2019
0
answers
22
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!
397
views
commented
Feb 18, 2019
0
answers
23
#Nptel assignment
https://ide.geeksforgeeks.org/BX0OOC4rpt please explain what is wrong with the following code! The Collatz function is defined for a positive integer n as follows. f(n) = 3n+1 if n is odd n/2 if n is even We consider the repeated application of the Collatz ... positive number <= 32,000. You have to output how many times f has to be applied repeatedly in order to first reach 1.
https://ide.geeksforgeeks.org/BX0OOC4rptplease explain what is wrong with the following code!The Collatz function is defined for a positive integer n as follows.f(n) = 3n...
1.1k
views
commented
Feb 17, 2019
1
answer
24
Dfa doubt
What is the number of states in the minimal dfa representing the language a*b* ?
What is the number of states in the minimal dfa representing the language a*b* ?
378
views
commented
Feb 16, 2019
0
answers
25
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...
1.7k
views
commented
Feb 12, 2019
0
answers
26
mathematical logic doubt
Let L(x, y) be the statement “x loves y,” where the domain for both x and y consists of all people in the world. Use quantifiers to express each of these statements. a)There is exactly one person whom everybody loves. b) There is somebody whom no one loves. c)There are exactly two people whom Lynn loves. d)There is someone who loves no one besides himself or herself.
Let L(x, y) be the statement “x loves y,” where the domain for both x and y consists of all people in the world.Use quantifiers to express each of these statements.a)...
434
views
commented
Feb 11, 2019
1
answer
27
PREDICATE LOGIC DOUBT
Only Area 51 has Extra-Terresstrials A(x) = x is Area 51 E(x) = x has Extra-Terresstrials Which of the following is correct? (∀x)(A(x) -> E(x)) (∀x)(E(x) -> A(x)) (∀x)(A(x) <-> E(x))
Only Area 51 has Extra-TerresstrialsA(x) = x is Area 51E(x) = x has Extra-TerresstrialsWhich of the following is correct?(∀x)(A(x) - E(x))(∀x)(E(x) - A(x))(∀x)(A(x)...
526
views
commented
Feb 11, 2019
Mathematical Logic
mathematical-logic
first-order-logic
+
–
4
answers
28
GATE CSE 2019 | Question: 33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size i...
22.0k
views
commented
Feb 7, 2019
Operating System
gatecse-2019
operating-system
virtual-memory
2-marks
+
–
4
answers
29
GATE CSE 2019 | Question: 28
Consider three machines M, N, and P with IP addresses $100.10.5.2, \: 100.10.5.5$, and $100.10.5.6$ respectively. The subnet mask is set to $255.255.255.252$ for all the three machines. Which one of the following is true? M, N, and P ... subnet Only M and N belong to the same subnet Only N and P belong to the same subnet M, N, and P belong to three different subnets
Consider three machines M, N, and P with IP addresses $100.10.5.2, \: 100.10.5.5$, and $100.10.5.6$ respectively. The subnet mask is set to $255.255.255.252$ for all the ...
9.4k
views
commented
Feb 7, 2019
Computer Networks
gatecse-2019
computer-networks
subnetting
2-marks
+
–
0
answers
30
Work and Time
Chandan and Falguni work on alternate days; Chandan working on the 1st day, Falguni on the 2nd, then Chandan again on the 3rd followed by Falguni on the 4th and so on. In this way, they can finish the work in 25 days. The work done by Chandan varies every day ... my doubt is here asked is number of days so shouldn't we fill(answer) 55 instead of 54.25 as days cant be in decimal
Chandan and Falguni work on alternate days; Chandan working on the 1st day, Falguni on the 2nd, then Chandan again on the 3rd followed by Falguni on the 4th and so on. In...
1.1k
views
commented
Feb 1, 2019
Quantitative Aptitude
work-time
quantitative-aptitude
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register