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
UGC NET CSE | Junet 2015 | Part 2 | Question: 13
go_editor
asked
in
Programming
Jul 30, 2016
edited
Jun 5, 2020
by
go_editor
2,490
views
1
vote
1
vote
Given that $x=7.5, j=-1.0, n=1.0, m=2.0$ the value of $--x+j==x>n>=m$ is:
$0$
$1$
$2$
$3$
ugcnetcse-june2015-paper2
programming-in-c
go_editor
asked
in
Programming
Jul 30, 2016
edited
Jun 5, 2020
by
go_editor
by
go_editor
2.5k
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
2
votes
2
votes
Best answer
--x+j==x>n>=m
6.5 +(-1.0) ==6.5 > 1.0 >= 2.0
5.5 == 1 > = 2.0
3.5 == 0
false so 0 is ans
Prashant.
answered
Jul 30, 2016
selected
Feb 16, 2017
by
Sanjay Sharma
by
Prashant.
comment
Follow
share this
1 comment
by
JashanArora
commented
Nov 19, 2020
reply
Follow
share this
3.5, how?
0
0
Please
log in
or
register
to add a comment.
0
votes
0
votes
$--x+j==x>n>=m$
Priority: $increment > arithmetic > inequality > equality$
Associativity is left to right for the inequality operators.
$((6.5-1.0)==((6.5>1.0)>=2.0))$
$=> 5.5==(1>=2.0)$
$=> 5.5==0$
$=>0$
JashanArora
answered
Nov 19, 2020
by
JashanArora
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
A
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
3
answers
1
go_editor
asked
in
Programming
Jul 30, 2016
2,085
views
UGC NET CSE | Junet 2015 | Part 2 | Question: 11
What is the output of the following program: (Assume that the appropriate preprocessor directives are included and there is not syntax error) main( ) { char S[]="ABCDEFGH"; printf("%C", *(&S[3])); printf("%s", S+4 ... of S is 1000 */ } $\text{ABCDEFGH}1000$ $\text{CDEFGH}1000$ $\text{DDEFGHH}1000$ $\text{DEFGH}1000$
go_editor
asked
in
Programming
Jul 30, 2016
by
go_editor
2.1k
views
ugcnetcse-june2015-paper2
programming-in-c
array
2
votes
2
votes
1
answer
2
go_editor
asked
in
Programming
Jul 30, 2016
1,877
views
UGC NET CSE | Junet 2015 | Part 2 | Question: 23
Level order Traversal of a rooted Tree can be done by starting from root and performing: Breadth First Search Depth First Search Root Search Deep Search
go_editor
asked
in
Programming
Jul 30, 2016
by
go_editor
1.9k
views
ugcnetcse-june2015-paper2
data-structures
tree-traversal
1
vote
1
vote
1
answer
3
go_editor
asked
in
Distributed Computing
Jul 31, 2016
2,565
views
UGC NET CSE | Junet 2015 | Part 2 | Question: 50
Which of the following is not valid with reference to Message Passing Interface(MPI)? MPI can run on any hardware platform The programming model is a distributed memory model All parallelism is implicit MPI- Comm - Size returns the total number of MPI processes in specified communication
go_editor
asked
in
Distributed Computing
Jul 31, 2016
by
go_editor
2.6k
views
ugcnetcse-june2015-paper2
parallel-computing
message-passing
6
votes
6
votes
3
answers
4
go_editor
asked
in
Databases
Jul 31, 2016
4,812
views
UGC NET CSE | Junet 2015 | Part 2 | Question: 49
Which of the following statements is false about weak entity set? Weak entities can be deleted automatically when their strong entity is deleted Weak entity set avoids the data duplication and consequent possible inconsistencies caused by ... a weak entity set are not partitioned according to their relationship with tuples with a strong entity set
go_editor
asked
in
Databases
Jul 31, 2016
by
go_editor
4.8k
views
ugcnetcse-june2015-paper2
er-diagram
databases
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Programming
(3.9k)
DS
(1.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy