Register

NIELIT 2016 MAR Scientist B - Section B: 8

• recategorized by
476 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

597
views
1 answers
3 votes
admin asked Mar 31, 2020
597 views
NIELIT 2016 MAR Scientist B - Section C: 23
If $S$ be an infinite set and $S _1 \dots\dots ,S _n $ be sets such that $S _1 \cup S _2 \cup \dots \cup S _n =S$ ... sets $S _i $ is an infinite set.not more than one of the sets $S _i $ can be infinite.
User Avatar
846
views
1 answers
3 votes
admin asked Mar 31, 2020
846 views
NIELIT 2016 MAR Scientist B - Section C: 21
A polynomial $p(x)$ is such that $p(0)=5, \: p(1)=4, \: p(2)=9$ and $p(3)=20$. The minimum degree it can have is$1$2$3$4$
User Avatar
948
views
1 answers
2 votes
admin asked Apr 2, 2020
948 views
NIELIT 2016 MAR Scientist C - Section C: 16
If $f:\{a,b\}^{\ast}\rightarrow \{a,b\}^{\ast }$ be given by $f(n)=ax$ for every value of $n\in \{a,b\}$, then $f$ isone to one not ontoone to one and ontonot one to one and not ontonot one to one and onto
User Avatar
2.2k
views
2 answers
0 votes
admin asked Mar 31, 2020
2,197 views
NIELIT 2016 MAR Scientist B - Section B: 1
The number of ways to cut a six sided convex polygon whose vertices are labeled into four triangles using diagonal lines that do not cross is$13$14$12$11$
User Avatar
Link Copied!