UGC NET CSE | June 2023 | Part 2: 41

admin asked Jul 28, 2023 • edited Aug 24, 2023 by makhdoom ghaya

179 views

See all

Please log in or register to answer this question.

Related questions

0 votes

1 answer

admin asked Jul 28, 2023

483 views

UGC NET CSE | June 2023 | Part 2: 1
What is the output of following code? main () struct s1 { char * z; int i; struct s1 * p; } static struct s 1 a []}={ {"Nagpur", 1, a+1} {"Raipur', 2, a+2} {"Kanpur', 3, a} }; struct s 1* ptr =a ... %s\n", a[0].z. ptr $/rightarrow$ z, a [2]. p $/rightarrow$ z;) Nagpur Raipur Kanpur Nagpur Nagpur Nagpur Kanpur Kanpur Kanpur Error

What is the output of following code?main () struct s1 { char * z; int i; struct s1 * p; } static struct s 1 a []}={ {"Nagpur", 1, a+1} {"Raipur', 2, a+2} {"Kanpur', 3, a...

admin

483 views

admin asked Jul 28, 2023

0 votes

0 answers

admin asked Jul 28, 2023

327 views

UGC NET CSE | June 2023 | Part 2: 2
Which of the following statement is correct? Ackermann's function is primitive recursive. $L=\left\{a^{n} b^{k} c^{n+k}: n \geq 0, k \geq 0\right\}$ is regular language. $L=\left\{a^{n} b^{J}: n=J^{2}\right\}$ ... language For every context sensitive language $L$ not including $\lambda$, there exists some linear bounded automata $M$ such that $L \neq L(M)$.

Which of the following statement is correct?Ackermann's function is primitive recursive.$L=\left\{a^{n} b^{k} c^{n+k}: n \geq 0, k \geq 0\right\}$ is regular language.$L=...

admin

327 views

admin asked Jul 28, 2023

0 votes

0 answers

admin asked Jul 28, 2023

183 views

UGC NET CSE | June 2023 | Part 2: 3
There are $M$ points on one straight line $A B$ and $n$ points on another straight line $A C$ none of them being $A$. How many triangles can be formed with these points as vertices? $m n(m+n-2)$ $\frac{1}{2} m n(m+n-2)$ $\frac{1}{2} m n(m+n-1)$ $m n(m+n-1)$

There are $M$ points on one straight line $A B$ and $n$ points on another straight line $A C$ none of them being $A$. How many triangles can be formed with these points a...

admin

183 views

admin asked Jul 28, 2023

0 votes

1 answer

admin asked Jul 28, 2023

407 views

UGC NET CSE | June 2023 | Part 2: 4
Consider the following statements. The identity is unique in any monoid. A monoid is a group if there exists inverse of each element of monoid. Semi group has closure, associative and identity properties. Quasi group has closure property. Choose the correct answer from the options given ... only $\text{A, B}$ and $\text{C}$ only $\text{A, C}$ and $\text{D}$ only

Consider the following statements.The identity is unique in any monoid.A monoid is a group if there exists inverse of each element of monoid.Semi group has closure, assoc...

admin

407 views

admin asked Jul 28, 2023

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

UGC NET CSE | June 2023 | Part 2: 41

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0