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
Filter
User GoalSet1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by GoalSet1
0
votes
1
group
if (G,*) is a cyclic group of order 97 , then number of generator of G is equal to ___
answered
in
Set Theory & Algebra
Nov 29, 2019
1.5k
views
group-theory
discrete-mathematics
set-theory&algebra
1
vote
2
#set theory #groups
Consider the set H of all 3 × 3 matrices of the type: $\begin{bmatrix} a&f&e\\ 0&b&d\\ 0&0&c\\ \end{bmatrix}$ where a, b, c, d, e and f are real numbers and $abc ≠ 0$. Under the matrix multiplication operation, the set H is: (a) a group (b) a monoid but not a group (c) a semigroup but not a monoid (d) neither a group nor a semigroup
answered
in
Set Theory & Algebra
Nov 29, 2019
576
views
set-theory&algebra
group-theory
matrix
0
votes
3
isro exam december 2017
The number of elements in the power set of {{1,2},{2,1,1},{2,1,1,2}} is:
answered
in
Set Theory & Algebra
Sep 1, 2019
1.1k
views
isro2017
1
vote
4
UGC NET CSE | June 2013 | Part 2 | Question: 40
The truth value of the statements: $\exists ! xP(x) \rightarrow \exists xP(x) \text{ and } \exists ! x \rceil P(x) \rightarrow \rceil \forall xP(x)$, (where the notation $\exists ! x P(x)$ denotes the proposition “There exists a unique $x$ such that $P(x)$ is true”) are: True and False False and True False and False True and True
answered
in
Mathematical Logic
Aug 31, 2019
1.6k
views
ugcnetcse-june2013-paper2
0
votes
5
UGC NET CSE | December 2012 | Part 2 | Question: 43
Data Encryption Techniques are particularly used for _____ protecting data in Data Communication System reduce Storage Space Requirement enhances Data Integrity decreases Data Integrity
answered
in
Computer Networks
Aug 31, 2019
3.3k
views
ugcnetcse-dec2012-paper2
computer-networks
osi-model
1
vote
6
UGC NET CSE | December 2014 | Part 2 | Question: 35
The following Context-Free Grammar (CFG) : $S \rightarrow aB | bA$ $A \rightarrow a | as | bAA$ $B \rightarrow b | bs | aBB$ will generate Odd numbers of $a's$ and odd numbers of $b's$ Even numbers of $a's$ and even numbers of $b's$ Equal numbers of $a's$ and $b's$ Different numbers of $a's$ and $b's$
answered
in
Theory of Computation
Aug 28, 2019
8.7k
views
ugcnetcse-dec2014-paper2
theory-of-computation
context-free-grammar
0
votes
7
#Normal distribution
If a certain normal distribution of $X$, the probability is $0.5$ that $X$ is less than $500$ and $0.0227$ that $X$ is greater than $650$. What is the standard deviation of $X$? How to compute S.D, of above?
answered
in
Probability
Aug 24, 2019
1.1k
views
probability
0
votes
8
UGC NET CSE | December 2015 | Part 2 | Question: 22
Which of the following fields in IPv 4 datagram is not related to fragmentation? Type of service Fragment offset Flags Indentification
answered
in
Computer Networks
Aug 24, 2019
1.8k
views
ugcnetcse-dec2015-paper2
computer-networks
0
votes
9
UGC NET CSE | November 2017 | Part 3 | Question: 7
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $X$, denoted by $r(X)$ and $w(X)$ respectively. Which one of them is conflict serializable? $S1$: $r1(X); r2(X); w1(X); r3(X); w2(X)$ $S2$ : ... $S4$ : $r2(X); w2(X); r3(X); r1(X); w1(X)$ $S1$ $S2$ $S3$ $S4$
answered
in
Databases
Aug 22, 2019
1.0k
views
ugcnetcse-nov2017-paper3
databases
transaction-and-concurrency
0
votes
10
UGC NET CSE | November 2017 | Part 3 | Question: 59
Consider the following two well-formed formulas in prepositional logic. $F1 : P \Rightarrow \neg P$ $F2: (P \Rightarrow \neg P) \vee (\neg P \Rightarrow P)$ Which of the following statements is correct? $F1$ is Satisfiable, $F2$ ... $F1$ is unsatisfiable, $F2$ is Satisfiable $F1$ is unsatisfiable, $F2$ is valid $F1$ and $F2$ both are Satisfiable
answered
in
Unknown Category
Aug 22, 2019
605
views
ugcnetcse-nov2017-paper3
0
votes
11
UGC NET CSE | November 2017 | Part 3 | Question: 58
“If $X$, then $Y$ unless $Z$” is represented by which of the following formulae in propositional logic? $(X \wedge Y) \rightarrow \neg Z$ $(X \wedge \neg Z) \rightarrow Y$ $X \rightarrow (Y \wedge \neg Z)$ $Y \rightarrow (X \wedge \neg Z)$
answered
in
Unknown Category
Aug 22, 2019
619
views
ugcnetcse-nov2017-paper3
0
votes
12
UGC NET CSE | July 2018 | Part 2 | Question: 75
Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence? $B \vee C$ 10 12 15 16
answered
in
Quantitative Aptitude
Aug 21, 2019
2.3k
views
ugcnetcse-july2018-paper2
quantitative-aptitude
0
votes
13
UGC NET CSE | July 2018 | Part 2 | Question: 62
Consider a relation book (title, price) which contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query? Select title from book as B where (select ... Title of the sixth most expensive books Titles of the seven most expensive books Title of the seventh most expensive books
answered
in
Databases
Aug 21, 2019
1.9k
views
ugcnetcse-july2018-paper2
databases
rdbms
sql
0
votes
14
UGC NET CSE | December 2018 | Part 2 | Question: 89
Identify the correct sequence in which the following packets are transmitted on the network by a host when a browser requests a webpage from a remote server, assuming that the host has just been restarted. HTTP GET request, DNS query, TCP SYN ... , HTTP GET request, TCP SYN TCP SYN, DNS query, HTTP GET request DNS query, TCP SYN, HTTP GET request
answered
in
Computer Networks
Aug 20, 2019
971
views
ugcnetcse-dec2018-paper2
computer-networks
0
votes
15
UGC NET CSE | December 2018 | Part 2 | Question: 90
Suppose that everyone in a group of $N$ people wants to communicate secretly with $(N-1)$ other people using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys ... whole to satisfy the confidentiality requirement is $N(N-1)$ $N(N-1)/2$ $2N$ $(N-1)^2$
answered
in
Computer Networks
Aug 20, 2019
1.0k
views
ugcnetcse-dec2018-paper2
computer-networks
network-security
0
votes
16
UGC NET CSE | December 2018 | Part 2 | Question: 37
Consider the following problems : Whether a finite state automaton halts on all inputs? Whether a given context free language is regular? Whether a Turing machine computes the product of two numbers? Which one of the following is ... ii and iii are undecidable problems Only i and ii are undecidable problems i, ii and iii are undecidable problems
answered
in
Theory of Computation
Aug 20, 2019
1.8k
views
ugcnetcse-dec2018-paper2
decidability
theory-of-computation
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...