menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Update on GO Book for GATE 2022
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Discrete Mathematics
(6k)
Mathematical Logic
(2.1k)
Set Theory & Algebra
(1.6k)
Combinatory
(1.4k)
Graph Theory
(885)
Probability
(1.1k)
Linear Algebra
(783)
Calculus
(645)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Ohh, yeah now turned off. Got it sir, Thank you :)
I guess you might have turn on "Only GATE...
https://gateoverflow.in/280484/tifr2019-b-11 Arju...
Which question disappeared? Can you share a link?
OFFTOPIC:- @Arjun sir why are the questions of...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
ISRO2018-15
2
votes
2.9k
views
The domain of the function log (log sin(x)) is:
$0<x<$$\pi$
$2n$$\pi$$<$$x$$<$$(2n+1)$$\pi$, for $n$ in $N$
Empty set
None of the above
isro2018
functions
set-theory&algebra
asked
Apr 22, 2018
in
Set Theory & Algebra
Arjun
recategorized
Dec 31, 2019
2.9k
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
4
Answers
8
votes
Best answer
log( log sin(x) )
-1 <= sinx<= +1
log a is defined for positive values of a,
log sin(x) is defined for sin(x)= (0,1]
Possible values for log sin(x) = ($-\infty$ , 0]
Domain of log( log sin(x) )=Not defined
Therefore, Answer (c) Empty Set
answered
Apr 23, 2018
VS
edited
Apr 26, 2018
by
VS
comment
0
there is a difference between range and domain of a function, Question is asking domain not range.
0
* log sin(x) is defined for sin(x)= (0,1]
Please
log in
or
register
to add a comment.
1
vote
C empty set
answered
Apr 22, 2018
Vikas Yadav 1
comment
Please
log in
or
register
to add a comment.
1
vote
Option C is correct.
We can satisfy inner log using $x=\pi / 2$, but can't satisfy outer log at the same time. Thus, empty set.
answered
Apr 22, 2018
Akhilesh Singla
comment
Please
log in
or
register
to add a comment.
0
votes
$\log sin(x)>0 => sin (x)>e^0.$
Now this is impossible because the value of sin cannot be greater than 1.
Therefore, empty set is the answer.
answered
Jun 9, 2020
Asim Siddiqui 4
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Answer:
C
Related questions
5
votes
3
answers
1
1.8k
views
ISRO2018-17
$(G, *)$ is an abelian group. Then $x= x^{^{-1}}$ for any x belonging to $G$ $x=$ $x^{^{2}}$ for any x belonging to $G$ $\left( x*y \right )^{2}$= $x^{^{2}}*y^{^{2}}$ , for any $x, y$ belonging to $G$ $G$ is of finite order
$(G, *)$ is an abelian group. Then $x= x^{^{-1}}$ for any x belonging to $G$ $x=$ $x^{^{2}}$ for any x belonging to $G$ $\left( x*y \right )^{2}$= $x^{^{2}}*y^{^{2}}$ , for any $x, y$ belonging to $G$ $G$ is of finite order
asked
Apr 22, 2018
in
Set Theory & Algebra
Arjun
1.8k
views
isro2018
group-theory
set-theory&algebra
1
vote
4
answers
2
881
views
ISRO2018-56
The time complexity of computing the transitive closure of binary relation on a set of $n$ elements is known to be $O(n)$ $O(n*\log(n))$ $O(n^{\frac{3}{2}})$ $O(n^{3})$
The time complexity of computing the transitive closure of binary relation on a set of $n$ elements is known to be $O(n)$ $O(n*\log(n))$ $O(n^{\frac{3}{2}})$ $O(n^{3})$
asked
Apr 22, 2018
in
Set Theory & Algebra
Arjun
881
views
isro2018
set-theory&algebra
relations
4
votes
2
answers
3
4.7k
views
ISRO2018-1
Consider the following program { int x=1; printf("%d",(*char(char*)&x)); } Assuming required header files are included and if the machine in which this program is executed is little endian, then the output will be 0 99999999 1 unpredictable
Consider the following program { int x=1; printf("%d",(*char(char*)&x)); } Assuming required header files are included and if the machine in which this program is executed is little endian, then the output will be 0 99999999 1 unpredictable
asked
Apr 22, 2018
in
Programming
Arjun
4.7k
views
isro2018
programming
5
votes
3
answers
4
3.2k
views
ISRO2018-2
Consider the following declaration : structaddr { char city[10]; char street[30]; int pin; }; struct { char name[30]; int gender; struct addr locate; } person, *kd = &person; Then *$(kd->name + 2)$ can be used instead of: $person.name+2$ $kd-> (name+2)$ $*((*kd).name+2)$ either $A)$ or $B)$ , not $C)$
Consider the following declaration : structaddr { char city[10]; char street[30]; int pin; }; struct { char name[30]; int gender; struct addr locate; } person, *kd = &person; Then *$(kd->name + 2)$ can be used instead of: $person.name+2$ $kd-> (name+2)$ $*((*kd).name+2)$ either $A)$ or $B)$ , not $C)$
asked
Apr 22, 2018
in
Programming
Arjun
3.2k
views
isro2018
programming
...