menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent posts tagged mtech-admission

2
GATECSE 2020 Admissions Live Discussion
At 9pm on April 10. https://youtu.be/P1KmNS75TEA Please add your questions as chat comment from now onwards.
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them
posted Apr 7, 2020 in From GO Admins Arjun 1,829 views
5
IIT Kanpur Interview Experience
IITK-2018 IITK-2018 IITK-2017 IITK-2016 IITK-2016
If $g(x) = 1 - x$ and $h(x) = \frac{x}{x-1}$, then $\frac{g(h(x))}{h(g(x))}$ is: $\frac{h(x)}{g(x)}$ $\frac{-1}{x}$ $\frac{g(x)}{h(x)}$ $\frac{x}{(1-x)^{2}}$
posted Apr 25, 2019 in Interview Experience Pooja Khatri 973 views
6
IIIT Hyderabad Interview Experience
IIITH-2018 IIITH-2018 IIITH-2018 IIITH-2017
C) P - iii, Q - i, R - iv, S - ii Ref: https://en.wikipedia.org/wiki/Software_testing
posted Apr 25, 2019 in Interview Experience Pooja Khatri 760 views
8
IIT Hyderabad Interview Experience
IITH-RA-2019 IITH-RA-2019 IITH-RA-2019 IITH-RA-2018 IITH-TA-2018 IITH-RA-2017 IITH-TA-2017
Answer is D. $L_1$ is context-free and hence recursive also. Recursive set being closed under complement, $L_1$' will be recursive. $L_1$' being recursive it is also recursively enumerable and Recursively Enumerable set is closed under Union. So, $L_1' \cup L_2$ is recursively enumerable. ... $L_2$')' $= L_2$ is also recursive which is not the case here. So, $II$ is also false.
posted Apr 25, 2019 in Interview Experience Pooja Khatri 959 views
9
IIT Bombay Interview Experience
IITB-RA-2017 IITB-RA-2017 IITB-RA-2017
$\lim_{x\rightarrow \infty } x^{ \tfrac{1}{x}}$ is $\infty $ 0 1 Not defined
posted Apr 25, 2019 in Interview Experience Pooja Khatri 352 views
10
IISc Research Interview Experience
IISc CD-CS-2018 IISc RA-2018 IISc-CD-CS-2017 IISc-CD-CS-2016
B. Worst case for quick sort happens when $1$ element is on one list and $n-1$ elements on another list.
posted Apr 25, 2019 in Interview Experience Pooja Khatri 399 views
11
IIT BHUBANESWAR MTECH WRITTEN TEST/INTERVIEW
Can someone please tell me, what are the required things to prepare for mtech cse written test and interview in IIt Bhubaneswar?
Match the following: (P) Condition Coverage (i) Black-box testing (Q) Equivalence class partitioning (ii) System testing (R) Volume testing (iii) White-box testing (S) Alpha testing (iv) Performance testing P - ii, Q - iii, R - i, S - iv P - iii, Q - iv, R - ii, S - i P - iii, Q - i, R - iv, S - ii P - iii, Q - i, R - ii, S - iv
posted Apr 21, 2019 in Interview Experience dharmesh7 985 views
12
Tips for COAP-2019
Greetings y' all! Almost everyone may have applied to various IITs by now and as we all (i hope) know that IITs will make their admission offers to the students through the COAP. I'm of the students who have applied to various IITs and is waiting ... the applicants to post their queries in the comments so that they can be answered. It will be really helpful to all. Thanks!
Option is D. $foo$ is printing the lowest digit. But the $printf$ inside it is after the recursive call. This forces the output to be in reverse order $2, 0, 4, 8$ The final value $sum$ printed will be $0$ as $C$ uses pass by value and hence the modified value inside $foo$ won't be visible inside $main$.
posted Apr 8, 2019 in Preparation Advice Akash Mishra 1,011 views
14
IITH Mtech RA Interview Experience
250 students got interview call for the 2nd round, out of which finally 7 got selected for this program. Shortlisting criteria 3 rounds were taken- Aptitude test(about 23 got shortlisted, about 100 showed up), 1st Interview(13 got shortlisted) and in ... about this journey, where an average scorer landed up in the best. I wish you all the luck. Thanks for reading
2 is correct answer. fig 2, b and c have {f,g} as upperbound. but for the graph to be a lattice it should have a least upper bound. Since b and c have two upper bounds they cannot have a least upper bound<which is always unique for a pair for vertices>. In ... {f,g}. therefore it is not a join semilattice(every pair of element should have a least upper bound). henceforth it is also not a lattice
posted Mar 16, 2019 in Interview Experience Prashansa Mittal Agr 1,882 views
16
For GATECSE Admissions 2019
GATE 2019 results are now out. Check here. Please fill this form Result Responses You can see the below video for getting details about Admissions, Research, Cutoffs, where to apply, whether to repeat etc. You can see the below video ... masters 2018- placement statistics for cse IISC vs IITB Prepare written interviews major subjects focus questions GATE to ISRO air-1
Here bound of the loop are constants, therefore compiler will do the loop unrolling(If compiler won't then prefetcher will do) to increase the instruction level parallelism. And after loop unrolling $23$ cycles are required for execution. Therefore, correct answer would be (B). PS: We ...
posted Feb 23, 2019 in From GO Admins Arjun 15,245 views
17
IIIT Hyderabad Interview Experience
Following are the details of my interview at IIITH: My Interview was on 11th of June 2018.I was allotted Panel 13 and my serial number was 6. Due to my serial number I didn't have to wait for long and I was called in at 10:45 ... Tell them what you know properly. Be confident. Don't answer like a robot, be friendly while answering and keep interacting with them.
The sequence &hellip;&hellip;&hellip;&hellip;&hellip; is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for &hellip;&hellip;&hellip;&hellip;&hellip;&hellip;&hellip; unit(s) of time. ---------------------------- Job Arrival_Time Burst_Time ------------------ ... (2,1,3},0 (c) {3,2,1),0 (d) {1,2,3},5 Ans: option (a) please explain why answer is a)....
posted Jun 21, 2018 in Interview Experience priyendu mori 1 1,873 views
18
Selected for M.Tech Computer Science in University of Hyderabad
Hello everyone, I am selected for M.Tech Computer Science in University of Hyderabad through CCMT counselling in round 1. Please let me know if it is worth it to do M.Tech from here. How is the faculty and location? I have also ... already dropped a year after b.tech for GATE. Do I have a chance to get M.Tech AI in further rounds?
The function terminates for all powers of $2$ (which is infinite), hence (i) is false and (ii) is TRUE. Let $n = 5. $ Now, recursive calls will go like $5 - 14 - 7 - 20 - 10 - 5 -$ And this goes into infinite recursion. And if we multiply $5$ with ... possible, there are infinite recursions possible (even considering this case only). So, (iv) is TRUE and (iii) is false. So, correct answer is (D).
posted May 19, 2018 in Preparation Advice Shikha Mallick 2,382 views
26
Admission in IITS through COAPS
Hey, I know there is much detail regarding the question I am going to ask but all I want a simpler explanation of things. Q1 At every round of COAPS cut-offs will I have to choose a single IIT out of all choices that I will get ... interviews for each IIT chosen in COAPS will happen after 5th round or in between too. and any further simple details regarding all this.
A software project plan has identified ten tasks with each having dependencies as given in the following table: Task Depends On T1 - T2 T1 T3 T1 T4 T1 T5 T2 T6 T3 T7 T3, T4 T8 T4 T9 T5, T7, T8 T10 T6, T9 Answer the following questions: (Q1) What is the maximum number of tasks ... one time unit and there is no restriction on the number of tasks that can be done in parallel ? 5, 5 4, 4 4, 5 5, 4
posted Feb 19, 2018 in Others Mayank19j 1,493 views
29
seat filling and counseling issue
Hello friends !! Good morning to you all..I know being an aspirant like you all the post that I am going to write should be in view of as much aspirants as possible..Although myself not getting that good rank this year , but still I want to ... look into this and also no one should take it personally( I mean those who are getting good ranks ).. Thank you all..
Consider the following data path of a CPU. The ALU, the bus and all the registers in the data path are of identical size. All operations including incrementation of the PC and the GPRs are to be carried out in the ALU. Two clock cycles are needed for memory read operation - the ... <= R0 + R1. The minimum number of clock cycles needed for execution cycle of this instruction is: $2$ $3$ $4$ $5$
posted Mar 14, 2017 in Others Habibkhan 1,844 views
To see more, click for the full list of questions or popular tags.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...