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

Recent questions in Written Exam

0 votes
2 answers
1
An address sequence S experiences 100 compulsory cache misses. The sequence S experiences 500 misses when it is passed through a 32 KB fully-associative cache. The sequence S experiences 1000 misses when it is passed through a 32 KB 8-way set-associative cache. The number of conflict misses that the sequence S experiences when it is passed through a 32 KB 8-way set-associative cache is _________
asked May 4, 2018 in Written Exam Rishabh Malhotra 198 views
0 votes
0 answers
2
Consider a processor with a six-stage pipeline: instruction fetch (IF), instruction decode (ID), register fetch (RF), execution (EX), data memory access (DMEM), register writeback (WB). The processor has no branch predictor and the instruction fetcher stalls after ... decoded in the ID stage. If a program has 30% branch instructions, the loss in CPI due to branch-related stalls is ________
asked May 4, 2018 in Written Exam Rishabh Malhotra 197 views
0 votes
1 answer
3
Maximum spanning tree problem (MaxST) defined for a weighted undirected graph aims to compute the spanning tree of maximum weight. Longest path problem (LongP) in a weighted directed graph aims to compute path of maximum weight from a given source to a given ... there are no negative edge weights, and LongP does not have any polynomial time algorithm till date except for directed acyclic graphs.
asked May 4, 2018 in Written Exam Rishabh Malhotra 108 views
0 votes
0 answers
4
There is a height-balanced tree T storing n elements. The greatest element smaller than x in T is called the predecessor of s in T. Given any positive number k, we wish to compute k predecessors of x in T. What is the time complexity of the best algorithm that can do this task? A. O(k + log n) B. O(k log n) C. O(log(n + k)) D. O(n + k)
asked May 4, 2018 in Written Exam Rishabh Malhotra 140 views
2 votes
0 answers
5
Please guide me if i should consider DESE course in IISC Bangalore, instead of going for IIT Kanpur CSE. (since the interview dates are clashing). I'm from CSE background. I would also like to know the type of questions asked in the DESE written and interview from CSE students.
asked May 1, 2018 in Written Exam Rishabh Malhotra 429 views
0 votes
0 answers
6
In the BITS HD entrance application form, they have also asked for relevant work experience, if any. So what documents should I upload in order to show that I am working. Presently I am working in a service based company and my experience is around 1.75 years.
asked Apr 28, 2018 in Written Exam Subham Nagar 241 views
0 votes
0 answers
7
how is iit gandhinagar written test? subjective or objective . what should i prepare it?
asked Apr 27, 2018 in Written Exam Mayank Gupta 3 1.2k views
1 vote
2 answers
8
Two sets of numbers are given as sorted arrays in increasing order, A and B, with n and m numbers respectively. What is the best estimate for the complexity of computing the set A \ B? $O(n.m)$ $O(n^2 .m)$ $O(n + m)$ $(n log n + m log m)$
asked Apr 27, 2018 in Written Exam Rishabh Malhotra 224 views
2 votes
0 answers
9
Hi, I am from Computer Science, GATE rank 687.Could you please let me know how to go for IITs MS and MTech written and interview round. Are there any links for how to go for written exams first and then interviews.I could only find few people sharing their experiences but didn't find not any mock tests for the same !!!! Please help fast so that I can prepare properly
asked Apr 20, 2018 in Written Exam Aditya456 251 views
0 votes
0 answers
10
Hey Guys, How to prepare for the IITK programming test. what is the level of questions?? Any sample questions from previous years?? Please guys any help wud be appreciated. Thank you.
asked Apr 20, 2018 in Written Exam ne0n 279 views
0 votes
0 answers
11
What criteria IITB use to make offers? Are TA and RA offers made separately or simultaneously? Example: If 1st preference's TA doesn't meet cutoff then the same preference's RA is considered or 2nd preference TA? Are TA offers irrespective of RA offers? Meaning a person can simultaneously get both TA and RA offers for same or different preference if within cutoff ofcourse.?
asked Apr 18, 2018 in Written Exam tuttski 500 views
1 vote
1 answer
12
Do someone have any idea upto what rank we should fill BITS MTECH CSE THROUGH GATE ??
asked Apr 18, 2018 in Written Exam pankaj joshi 1 9.6k views
0 votes
0 answers
13
I belong to obc category.while filling the form for mtech in iit i have uploaded obc certificate which was old(before 31 march 2017) i cross the cuttof of obc in kanpur but i did not get call for exam and interview will te same happen in case of all iit what to do
asked Apr 18, 2018 in Written Exam dm4006 82 views
0 votes
0 answers
15
What was last year cutoff to get call for written from iit b ra for obc-ncl? I have gate score of 644 and rank 1121 in year 2018. I belong to obc-ncl. Is there any chance to get call for iit b ra?
asked Apr 14, 2018 in Written Exam Sakshi Choudhary 873 views
0 votes
0 answers
16
10. In the process of designing an $n$ storey building, an architect designed $k$ types of floor modules. Even though the ground floor can use any of the $k$ modules, subsequent floors need to satisfy compatibility constraints. For each module $M_{i}$, there is some subset $B_{i}$ of modules on top of which $M_{i}$ can ... . A. $O(k^{n})$ B. $O(n^{k})$ C. $O(nk)$ D. $O(nk^{2})$ E $O(n^{2}k)$
asked Apr 13, 2018 in Written Exam Shubham Pandey 2 158 views
0 votes
1 answer
17
9 Three men (Tom, Peter and Jack) and three women (Eliza, Anne and Karen) are spending a few months at a hillside. They are to stay in a row of nine cottages, each one living in his or her own cottage. There are no others staying in this row of houses. a ... the above statements can be said to have been derived from two other statements? A. Statement a B. Statement b C. Statement c D. Statement d
asked Apr 13, 2018 in Written Exam Shubham Pandey 2 205 views
0 votes
1 answer
18
8. If India is a stronger team than Australia then India will lose the cricket series. Which of the following is logically equivalent: A. If India lose the cricket series then India is a stronger team than Australia, B. If India is weaker team than Australia ... than Australia or India will lose the cricket series, D. India is a stronger team than Australia or India will win the cricket series
asked Apr 13, 2018 in Written Exam Shubham Pandey 2 75 views
0 votes
1 answer
19
7. Which of the following statements are known to be true. A. P is a subset of NP. B. NP is a subset of P. C. P is not a subset of NP. D. NP is not a subset of P.
asked Apr 13, 2018 in Written Exam Shubham Pandey 2 108 views
0 votes
1 answer
20
6. let E ={a,b,c}. Which of the following sets are context-free languages A. X = {ai bj ck | i < j < k} B. Y = (the complement of X) C. Z = {an b2n c3m | n, m >=0} D. None of the above sets are context free languages.
asked Apr 13, 2018 in Written Exam Shubham Pandey 2 96 views
...