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
POSET
Recent questions tagged partial-order
1
vote
0
answers
31
NIELIT 2018-19
If $u=f(y-z, \: \: z-x, \: \: x-y)$, then $\frac{ \partial u}{ \partial x} + \frac{ \partial u}{ \partial y} + \frac{ \partial u}{ \partial z} $ is equal to: $x+y+z$ $1+x+y+z$ $1$ $0$
Arjun
asked
in
Others
Dec 7, 2018
by
Arjun
466
views
nielit-2018
non-gate
differentiation
partial-order
1
vote
0
answers
32
NIELIT 2018-23
If $w=f(z)=u(x,y)+i \: v(x,y)$ is an analytic function, then $\frac{dw}{dz}$ is: $\frac{ \partial u } {\partial x}- i \frac{ \partial u}{\partial y}$ $\frac{ \partial u } {\partial x}+ i \frac{ \partial v}{\partial y}$ $\frac{ \partial u } {\partial x}- i \frac{ \partial v}{\partial x}$ $\frac{ \partial u } {\partial x}+ i \frac{ \partial u}{\partial y}$
Arjun
asked
in
Others
Dec 7, 2018
by
Arjun
1.0k
views
nielit-2018
non-gate
differentiation
partial-order
2
votes
0
answers
33
NIELIT 2018-25
The general solution of the partial differential equation $(D^2-D’^2-2D+2D’)Z=0$ where $D= \frac{\partial}{\partial x}$ and $D’=\frac{\partial}{\partial y}$: $f(y+x)+e^{2x}g(y-x)$ $e^{2x} f(y+x)+g(y-x)$ $e^{-2x} f(y+x)+g(y-x)$ $f(y+x)+e^{-2x}g(y-x)$
Arjun
asked
in
Others
Dec 7, 2018
by
Arjun
523
views
nielit-2018
non-gate
differential-equation
partial-order
2
votes
0
answers
34
Partial and Total Order
The set of all English words ordered in a dictionary is ________ $A)$ not a poset $B)$ a poset but not totally ordered $C)$ a totally ordered set but not well ordered $D)$ a well ordered set
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Oct 6, 2018
by
Lakshman Patel RJIT
681
views
discrete-mathematics
set-theory&algebra
partial-order
0
votes
2
answers
35
Test Series
Is 1 a lattice?
Subham Nagar
asked
in
Set Theory & Algebra
Sep 1, 2018
by
Subham Nagar
963
views
test-series
lattice
partial-order
discrete-mathematics
1
vote
2
answers
36
UGC NET CSE | July 2018 | Part 2 | Question: 90
Which of the following statements is true? $(Z, \leq)$ is not totally ordered The set inclusion relation $\subseteq$ is a partial ordering on the power set of a set S $(Z, \neq)$ is a poset The directed graph is not a partial order
Pooja Khatri
asked
in
Discrete Mathematics
Jul 13, 2018
by
Pooja Khatri
3.0k
views
ugcnetcse-july2018-paper2
discrete-mathematics
partial-order
3
votes
1
answer
37
Kenneth Rosen Edition 6th Exercise 7.6 Example 21 (Page No. 519 )
How is this a lattice?
_jerry
asked
in
Set Theory & Algebra
Jan 25, 2018
by
_jerry
603
views
kenneth-rosen
discrete-mathematics
lattice
partial-order
2
votes
1
answer
38
Ace Test series: Set Theory & Algebra - Partial Order
L={d,g,h,0} R={f,i,h,0} Am I doing it Correct?
Ananya Jaiswal 1
asked
in
Set Theory & Algebra
Jan 7, 2018
by
Ananya Jaiswal 1
300
views
ace-test-series
set-theory&algebra
partial-order
4
votes
1
answer
39
Self-Doubt
Is the Poset (Q,Less than or equal to) a well ordered set? Where Q denotes set of all rational numbers and relation R is less than or equal to.
Ayush Upadhyaya
asked
in
Set Theory & Algebra
Nov 9, 2017
by
Ayush Upadhyaya
557
views
partial-order
0
votes
0
answers
40
Kenneth Rosen Ex 7.6
Ayush Upadhyaya
asked
in
Set Theory & Algebra
Nov 9, 2017
by
Ayush Upadhyaya
522
views
partial-order
lattice
0
votes
0
answers
41
Self Doubt
Is the dual of TOSET, a TOSET always?
Ayush Upadhyaya
asked
in
Set Theory & Algebra
Nov 9, 2017
by
Ayush Upadhyaya
249
views
partial-order
2
votes
2
answers
42
Set Relation
Answer please explain the ans. R is antisymmetric then aRb, bRa -> a=b so a-b=0 and 0 is not odd positive then how it is antisymmetric?
Dilip Puri
asked
in
Set Theory & Algebra
Aug 11, 2017
by
Dilip Puri
954
views
engineering-mathematics
set-theory&algebra
equivalence-relation
partial-order
anti-symmetric
4
votes
1
answer
43
Relation and Partial order
Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people, if a is not taller than b?
ram_18051996
asked
in
Set Theory & Algebra
Jul 7, 2017
by
ram_18051996
1.4k
views
engineering-mathematics
relations
relational-algebra
partial-order
set-theory&algebra
7
votes
1
answer
44
Test by Bikram | Mock GATE | Test 3 | Question: 20
The maximum length of cycles in a digraph of partial order on $G$ having $p$ elements is _______: $p$ $p^{-1}$ $1$ $2^{p}$
Bikram
asked
in
GATE
Feb 9, 2017
by
Bikram
347
views
tbb-mockgate-3
discrete-mathematics
set-theory&algebra
partial-order
4
votes
2
answers
45
Test by Bikram | Mock GATE | Test 1 | Question: 3
Consider the Hasse diagram $D_1$ and $D_2$ as follows: $D_1:$ The Hasse diagram for the partial ordering $\left \{ \langle a, b \rangle \mid a \mod \: b=0 \right \}$ on the set of positive divisors of $24 \}$ $D_2:$ The Hasse diagram for ... $D_1$ and $D_2$ is/are a total ordering? Only $D_1$ Only $D_2$ Both $D_1$ & $D_2$ None $D_1$ & $D_2$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
373
views
tbb-mockgate-1
partial-order
set-theory&algebra
0
votes
2
answers
46
UGC NET CSE | December 2010 | Part 2 | Question: 3
A partially ordered set is said to be a lattice if every two elements in the set have A unique least upper bound A unique greatest lower bound Both $(A)$ and $(B)$ None of the above
makhdoom ghaya
asked
in
Discrete Mathematics
Sep 5, 2016
by
makhdoom ghaya
1.8k
views
ugcnetcse-dec2010-paper2
discrete-mathematics
partial-order
0
votes
1
answer
47
GATE Overflow | Mathematics | Test 1 | Question: 5
Let $X = \{2,3,6,12,24\}$ and $£$ be the partial order defined by $X £ Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X,£)$ is? 3 4 9 None of the above
Bikram
asked
in
Set Theory & Algebra
Aug 8, 2016
by
Bikram
112
views
go-mathematics-1
partial-order
5
votes
1
answer
48
Discrete MAthematics question veii imp
LavTheRawkstar
asked
in
Set Theory & Algebra
Jul 4, 2016
by
LavTheRawkstar
2.6k
views
lattice
partial-order
25
votes
3
answers
49
GATE CSE 1992 | Question: 14b
Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the following algebraic structures does this represent? group ring field lattice
go_editor
asked
in
Set Theory & Algebra
Apr 24, 2016
by
go_editor
3.5k
views
gate1992
set-theory&algebra
partial-order
lattice
normal
0
votes
4
answers
50
Ace Test Series: Set Theory & Algebra - Partial Order
Argument: R2 is straight away eliminated. For R3, to satisfy Antisymmetric relation.. Say -2 and +2 satisfy it then +2 and -2 should not satisfy. But its not the case. Answer is given as C. Am I so blind that I couldn't figure out my mistake?
Tushar Shinde
asked
in
Set Theory & Algebra
Jan 30, 2016
by
Tushar Shinde
435
views
ace-test-series
engineering-mathematics
discrete-mathematics
set-theory&algebra
partial-order
17
votes
5
answers
51
TIFR CSE 2014 | Part B | Question: 16
Consider the ordering relation $x\mid y \subseteq N \times N$ over natural numbers $N$ such that $x \mid y$ if there exists $z \in N$ such that $x ∙ z = y$. A set is called lattice if every finite subset has a least upper bound and greatest lower ... $(N, \mid)$ is a complete lattice. $(N, \mid)$ is a lattice but not a complete lattice.
makhdoom ghaya
asked
in
Set Theory & Algebra
Nov 20, 2015
by
makhdoom ghaya
3.6k
views
tifr2014
set-theory&algebra
partial-order
lattice
16
votes
3
answers
52
TIFR CSE 2014 | Part B | Question: 15
Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is true? $N^{*}$ is uncountable. $\leq_{p}$ is a total order. Every non ... -empty subset of $N^{*}$ has a greatest lower bound. Every non-empty finite subset of $N^{*}$ has a least upper bound.
makhdoom ghaya
asked
in
Set Theory & Algebra
Nov 20, 2015
by
makhdoom ghaya
2.7k
views
tifr2014
set-theory&algebra
partial-order
lattice
5
votes
3
answers
53
Boolean Algebra
Consider a Hasse Diagram for a Boolean Algebra of Order 3 What can we comment about it? How is it successfully able to represent the Boolean Algebra System? Is there an easy way to check for distributive lattice, or any other properties of a lattice? ... that one should provide a complete answer to all parts of the question. Whatever one can supply to support its answer is welcomed.
amarVashishth
asked
in
Set Theory & Algebra
Nov 11, 2015
by
amarVashishth
3.1k
views
partial-order
boolean-algebra
lattice
engineering-mathematics
set-theory&algebra
2
votes
2
answers
54
Number of edges in the Hasse Diagram of a boolean algebra with 8 elements.
LeenSharma
asked
in
Set Theory & Algebra
Nov 11, 2015
by
LeenSharma
1.9k
views
partial-order
17
votes
5
answers
55
TIFR CSE 2013 | Part B | Question: 4
A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elements from $S$ such that $x_{i+1} \ll x_i$ and $x_{i+1} \neq x_i$ for all $i$. ... $2^{24}$ words. $W$ is not a partial order. $W$ is a partial order but not a well order. $W$ is a well order.
makhdoom ghaya
asked
in
Set Theory & Algebra
Nov 6, 2015
by
makhdoom ghaya
1.9k
views
tifr2013
set-theory&algebra
partial-order
12
votes
3
answers
56
TIFR CSE 2012 | Part B | Question: 5
Let $R$ be a binary relation over a set $S$. The binary relation $R$ is called an equivalence relation if it is reflexive transitive and symmetric. The relation is called partial order if it is reflexive, transitive and anti symmetric. ... $\sqsubseteq $ is neither a partial order nor an equivalence relation.
makhdoom ghaya
asked
in
Set Theory & Algebra
Oct 31, 2015
by
makhdoom ghaya
1.3k
views
tifr2012
set-theory&algebra
partial-order
30
votes
6
answers
57
GATE IT 2007 | Question: 23
A partial order $P$ is defined on the set of natural numbers as follows. Here $\frac{x}{y}$ denotes integer division. $(0, 0) \in P.$ $(a, b) \in P$ if and only if $(a \% 10) \leq (b \% 10$) and $(\frac{a}{10},\frac{b}{10})\in P.$ ... $P$? (i) and (iii) (ii) and (iv) (i) and (iv) (iii) and (iv)
Ishrat Jahan
asked
in
Set Theory & Algebra
Oct 30, 2014
by
Ishrat Jahan
8.7k
views
gateit-2007
set-theory&algebra
partial-order
normal
19
votes
4
answers
58
GATE CSE 1996 | Question: 1.2
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is $3$ $4$ $9$ None of the above
Kathleen
asked
in
Set Theory & Algebra
Oct 9, 2014
by
Kathleen
11.6k
views
gate1996
set-theory&algebra
partial-order
normal
18
votes
3
answers
59
GATE CSE 1993 | Question: 8.5
The less-than relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above
Kathleen
asked
in
Set Theory & Algebra
Sep 30, 2014
by
Kathleen
7.4k
views
gate1993
set-theory&algebra
partial-order
easy
39
votes
2
answers
60
GATE CSE 1997 | Question: 6.1
A partial order $≤$ is defined on the set $S=\left \{ x, a_1, a_2, \ldots, a_n, y \right \}$ as $x$ $\leq _{i}$ $a_{i}$ for all $i$ and $a_{i}\leq y$ for all $i$, where $n ≥ 1$. The number of total orders on the set S which contain the partial order $≤$ is $n!$ $n+2$ $n$ $1$
Kathleen
asked
in
Set Theory & Algebra
Sep 29, 2014
by
Kathleen
7.0k
views
gate1997
set-theory&algebra
partial-order
normal
Page:
« prev
1
2
3
next »
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged partial-order
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...