Tutorials
- Algorithms
- Data Structures
  - Arrays
  - Linked List
  - Stack
  - Queue
  - Binary Tree
  - Binary Search Tree
  - Heap
  - Hashing
  - Graph
  - Advanced Data Structure
  - Matrix
  - Strings
  - All Data Structures
- Languages
  - C
  - C++
  - Java
  - Python
  - C#
  - Javascript
  - jQuery
  - SQL
  - PHP
  - Scala
  - Perl
  - Go Language
  - HTML
  - CSS
  - Kotlin
- Interview Corner
- GATE
- ISRO CS
- UGC NET CS
- CS Subjects
- Web Technologies
  - HTML
  - CSS
  - Javascript
  - jQuery
  - PHP
Student
Courses

GATE | GATE-CS-2007 | Question 26

Last Updated: 13-11-2017

(A) A
(B) B
(C) C
(D) D

Answer: (C)

Explanation: A partition is said to refine another partition if it splits the sets in the second partition to a larger number of sets.
Therefore, the partial order contains the following ordered pairs-
$\{(\pi_4,\pi_1),(\pi_4,\pi_2),(\pi_4,\pi_3),(\pi_3,\pi_1),(\pi_2,\pi_1)\}$
Corresponding Hasse diagram is Option C.

Quiz of this Question

My Personal Notes

Recommended Posts: