About

Pursuing M.Tech in Computer Science & Engineering at IIT Kharagpur and Editor at Techtud.

Role

Alma Mater:

B.tech in Compter Science and Engineering
Kamla Nehru Institute of Technology, Sultanpur
2012 to 2016

Experience:

Not updated.
Techtud Editor
Answer
3 hours 54 min ago

i is getting incremented in the loop.
So it will check First Option:1<3, 2<3 and 3<3 (Total 3 Checking)

moreless
Techtud Editor
Short answer
4 weeks 1 hour ago

@gaterank @ujjwal10 This is GATE 2017, Set-1 question.

Notice the line:

 unsigned int c = 0;

c is an unsigned integer so you can not compare it with signed integer.
Here 

(strlen (s) - strlen (t)) > c)

Will be treated as 2 > 0  (Not -2 > 0)

So, as a result we will get 3 as the answer.

 

moreless
Techtud Editor
Answer
4 weeks 1 hour ago

Digital Logic:
1 day, Gates and Minimization.
1 day, Number System
1 day, Combinational Circuits
1 day, Sequential Circuits
So you can cover Digital in 4+1days. (It's very easy so do this 1st)

Discrete Maths: 
2 days proposition logic + First order logic
(You can skip other parts and cover them later)

CN:

1st cover IP addresing part. (Most important)
Cover reamining parts as time permits.

 

P.S - It's my personal suggestions. You can make your own schedule better.

 

moreless
Techtud Editor
Multichoice
1 month 1 week ago

@orhtig
It will print same matrix. Notice the for loop carefully.
I have verified it. See this
https://ideone.com/yFpNP0

moreless
piyushi025's picture
piyushi
vg653's picture
Vaibhav Gupta
niket151194's picture
Niket Gangwar
anshukumar's picture
Anshu Agarwal
nirdeshjoshiya's picture
Nirdesh Kumar Joshiya
Prashant Sharma
Prof R.K. Dhawan
sharadshukla's picture
Sharad Shukla
sheshang's picture
Sheshang Ajwalia
shivani1234's picture
shivani
thegatebook's picture
KIRAN KUMAR
KIRAN KUMAR
narasimha's picture
Narasimha Karumanchi
rishiyadav's picture
Rishi Yadav
rbrgate's picture
Ravindra Babu Ravula

Pages

pritam's picture
Pritam Prasun
shabinmuhammed's picture
Shabin Muhammed
rajeshkpandey008's picture
Rajesh Kumar Pandey
vinitasangwan's picture
Vinita Sangwan
partha
sayanbose's picture
Sayan Bose
rohit37s's picture
Rohit Kumar
techtudgate's picture
techtud
biduromahara's picture
Biduro Maharana
virtualgate's picture
Virtual GATE
rakhi's picture
Rakhi Mahanta
prab_1's picture
Anjan
habibkhan's picture
Habib Mohammad Khan
phanindra's picture
phanindra
shiveshroy's picture
Shivesh Kumar Roy

Pages

i is getting incremented in the loop.
So it will check First Option:1<3, 2<3 and 3<3 (Total 3 Checking)

more less
19 Nov 2017 - 12:44am

Digital Logic:
1 day, Gates and Minimization.
1 day, Number System
1 day, Combinational Circuits
1 day, Sequential Circuits
So you can cover Digital in 4+1days. (It's very easy so do this 1st)

Discrete Maths: 
2 days proposition logic + First order logic
(You can skip other parts and cover them later)

CN:

1st cover IP addresing part. (Most important)
Cover reamining parts as time permits.

 

P.S - It's my personal suggestions. You can make your own schedule better.

 

more less
29 Oct 2017 - 2:00pm

We are working for ECE but till now only CSE contents are published.

more less
26 Oct 2017 - 9:31pm

I will highly suggest you to do not waste time specially in pre increment and post increment type questions. We all know these things are system dependent .

more less
25 Oct 2017 - 7:30pm

@setgate
After 1 you can not accpet 0. (You will go to C, which is a dead state)
 

more less
25 Oct 2017 - 6:48pm

0*1*

more less

Suppose you have attributes 10 attributes in a relation R as below

R(A, B, C, D, E, F, G, H, I, J )

Now you start finding the candidate key. 
Candidate key:- The mininal set of attribute which can uniquely determine all the other attributes.(Note - NOT Minimum set).

You started by taking one attribute.

Suppose B can determine all the other (9) attributes then B is our candidate fine. (It's minimal)

Now, you know that any superset of B will also determine all the other attributes[ Consider AB, It will determine all the attributes because of B.
Now it can not be the candidate key because it's minimal version that it B, is already a candidate key ]. So now we can check taking 2 attributes at a time [example, CD , AD, IJ,....](but not BD, BA...).

You found that { GH, IJ } both the pair can determine all the other attributes. So both GH and IJ will also be our candidate keys. {Note- these are minimal version of itself because you can not remove I or H}.

And so on. 

more less

How will it be negation of the given statement?

more less

"None of my friends are perfect."
negation of above statement will be "atleast one of my friend  is perfect." 

more less

Pages

Enter your search keyword:

Search form

Wait!

Here is a chance to join biggest community of technical Students,
Tutors with FREE learning resources and so much more.
It takes less then 60 seconds.