i didd not get this question

The Gateway to Computer Science Excellence

+12 votes

0 votes

Given sets $D_{1}, \ D_{2}, \ …, \ D_{n} $ not necessarily distinct.

The **Cartesian product** $D_{1}XD_{2}X.....XD_{n}$ is the set of all (ordered) $n-tuples$ $< d_{1}, \ d_{2}, \ d_{3}, \ ....... \, \ d_{n} >$ such that $d_{1} \ \epsilon \ D_{1} , \ d_{2} \ \epsilon \ D_{2} \ ..........., \ d_{n} \ \epsilon \ D_{n}$

A mathematical relation on $D_{1}, \ D_{2}, \ …, \ D_{n} $ is a subset of the Cartesian product $D_{1}XD_{2}X.....XD_{n}$

$D_{1}, \ D_{2}, \ …, \ D_{n} $ are the * domains* of the relations.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,391 answers

198,589 comments

105,442 users