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
Filter
User Kaushik.P.E
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Kaushik.P.E
1
vote
1
IIT Madras MS Interview Call Letter
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR > 800 - General Category) Program in Computer Science ?
answered
in
Written Exam
Apr 20, 2017
2.0k
views
iit-madras
ms
admissions
0
votes
2
what is the probability that the mother could have had the very long or very short pregnancy
An expert witness in a paternity suit testifies that the length (in days) of distributed with parameters μ=270 and σ^2=100. The defendant in the suit is able to prove that he was out of the country ... very long or very short pregnancy indicated by the testimony? 0.241 0.0241 how to solve such questions??
answered
in
Probability
Feb 8, 2017
712
views
probability
engineering-mathematics
2
votes
3
Choose the correct statement about HEAP
I. A heap is always nearly complete tree. II. Worst case complexity of heapify operation is O( log n) III. Worst case complexity of build heap operation is O( n log n) a. I only b. I and II only c. II and III only d. I, II and III
answered
in
DS
Feb 7, 2017
4.1k
views
data-structures
binary-heap
time-complexity
0
votes
4
gate ec
How C Iam getting D
answered
in
Verbal Aptitude
Feb 7, 2017
889
views
0
votes
5
gate ece
answered
in
Quantitative Aptitude
Feb 7, 2017
4.4k
views
0
votes
6
NPTEL-Operating System,-Week2-Quiz-2-Q5
In the Contiguous allocation for disk blocks, files cannot grow dynamically because _______ The next block could be occupied by another file The scheme does not allow files to grow (by design itself) (No answer is correct because files can grow) The disk does not have enough space I think both 1 and 2 are correct . What do you say ?
answered
in
Operating System
Feb 3, 2017
972
views
nptel-quiz
operating-system
1
vote
7
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-2-Q12
State true or false. When a user encounters a page fault, 1) The user application informs the OS, 2) User uses API calls to the hardware Memory Management unit, 3) Memory Management unit brings the page from hard disk to main memory. Is Statement 2 correct ?
answered
in
Operating System
Feb 3, 2017
1.1k
views
nptel-quiz
operating-system
3
votes
8
C program
What is the error in the following code . Please do correct them #include <stdio.h> int main () { char *x[5] = {"raju","ramu","tinu","ben","ali"}; printf("%s\n",(x[2][0]) ); return 0; }
answered
in
Programming in C
Feb 3, 2017
416
views
programming-in-c
0
votes
9
risc vs cisc
State True/False: "CISC architectures may perform better than RISC architectures in network centric applications."
answered
in
CO and Architecture
Feb 2, 2017
724
views
1
vote
10
Choose the regular langauge
L1:{wwR∣w,x∈{a,b}∗ and |w|>0},wR is the reverse of string w L2:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0},wR is the reverse of string w L1 is regular but not L2 L2 is regular but not L1 Both L1 and L2 are regular Neither L1 nor L2 is regular
answered
in
Theory of Computation
Feb 1, 2017
196
views
theory-of-computation
0
votes
11
MadeEasy Workbook: CO & Architecture - Clock Frequency
answered
in
CO and Architecture
Feb 1, 2017
424
views
co-and-architecture
made-easy-booklet
clock-frequency
2
votes
12
OS conceptual problem
In a system, there are 2 process and Round robin policy is employed. After some time one process gets completed, but another process is remaining with 6 unit burst time.Time Quantam is 2 unit. So, how many context switch occurs to complete this remaining process?(Ignore previous and last context switch.) A. 0 B. 2 C. 3 D. 4
answered
in
Operating System
Feb 1, 2017
341
views
operating-system
1
vote
13
Compiler design
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
answered
in
Compiler Design
Feb 1, 2017
308
views
compiler-design
parsing
lr-parser
1
vote
14
DBMS normalization concept problem
R(ABCDEF) FD set{ AB->CDE. CD->E, E->C } False statement? A. 2 NF decomposition possible B.3 NF decomposition possible C.BCNF decomposition possible D. ALL
answered
in
Databases
Feb 1, 2017
1.1k
views
databases
0
votes
15
Programming problem : Test Series
answered
in
Programming in C
Feb 1, 2017
302
views
0
votes
16
TOC Test Series
L1 and L2 Are Decidable. then L1 union L2 is (a)______ and L1 - L2 is(b) _________. a. Regular, cfl ,csl, rel. rec b. decidable, undecidable
answered
in
Theory of Computation
Feb 1, 2017
227
views
theory-of-computation
1
vote
17
Intersection and concatenation in CFG
Given that L1 is regular and L2 context free. i) L3 = L1 ∩ L2 ii) L4= L1.L2 Selct the most appropriate statement: a. L3 , L4 are regular b. L3 is regular L4 is CFG not regular c. L3 is CFG, not regular L4 is regular d. L3,L4 are CFG not regular
answered
in
Theory of Computation
Feb 1, 2017
813
views
theory-of-computation
regular-language
context-free-grammar
1
vote
18
UGC NET CSE | January 2017 | Part 3 | Question: 63
Which of the following statements is false? Every context-sensitive language is recursive The set of all languages that are not recursively enumerable is countable The family of recursively enumerable language is closed under union The families of recursively enumerable and recursive languages are closed under reversal
answered
in
Theory of Computation
Feb 1, 2017
3.6k
views
ugcnetcse-jan2017-paper3
theory-of-computation
recursive-and-recursively-enumerable-languages
3
votes
19
UGC NET CSE | January 2017 | Part 3 | Question: 64
Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error $t+1$ $t$ $t-2$ $t/2$
answered
in
Computer Networks
Feb 1, 2017
3.0k
views
ugcnetcse-jan2017-paper3
computer-networks
hamming-code
0
votes
20
UGC NET CSE | January 2017 | Part 3 | Question: 62
Which of the following pairs have different expressive power? Single-tape-turing machine and multi-dimensional turing machine Multi-tape-turing machine and multi-dimensional turing machine Deterministic push down automata and non-deterministic push down automata Deterministic finite automata and non-deterministic finite automata
answered
in
Theory of Computation
Feb 1, 2017
950
views
ugcnetcse-jan2017-paper3
theory-of-computation
turing-machine
1
vote
21
BFS traversal
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
answered
in
Algorithms
Feb 1, 2017
217
views
breadth-first-search
test-series
2
votes
22
True/false
Consider the following statements with respect to storage allocation: 1. Names local to a procedure are allocated space on a heap automatically. 2. Stack allocation is used for data that may live even after a procedure call returns. 3. Heap allocation is used for symbol table. Which one of ... false 1, 3 are true but 2 is false 2, 3 are true but 1 is false 1, 2 are false but 3 is true
answered
in
Programming in C
Feb 1, 2017
2.2k
views
6
votes
23
Determine the highest possible normal form of the given relation?
Consider the relation R(Name,courseNO,rolNO,grade) name,courseno ->grade rollno,courseno->grade name->rollno rollno->name Given answer as it is 3NF . But Im getting 1NF. is it correct ?
answered
in
Computer Networks
Feb 1, 2017
929
views
database-normalization
databases
0
votes
24
madeeasy
Consider the two hosts A and B are connected Via a Router R which is having a queuing delay of 7 μsec . The Router R has two links Link1 and Link2, connected to A and B respectively. Each link is 250 meters long and has a bandwidth of 10 9 bps. The propagation speed is 500,000 km/sec. The total transfer delay for 2 KB packet from A to B is __________ μsec. (ignore the processing delay).
answered
in
Computer Networks
Feb 1, 2017
283
views
0
votes
25
Self doubt
If the productions were: S-> AC | BD A -> a B -> a C-> c D-> d For considering whethr this grmmar is LL(k) where, k>=2 , is left factoring essential? I think no because based on atleast 2 lookaheads, it would decide which production to take. In above example, only 1 lookahead is same.
answered
in
Compiler Design
Feb 1, 2017
408
views
left-factoring
1
vote
26
madeeasy
Which of the following statements is true ? S1 : Source to destination delivery is the functionality that must be implemented by network layer above datalink layer. S2 : Packet delivery in correct order is the functionality that must be implemented by network layer above datalink layer. Which of ... S1 is true b. Only S2 is true c. Both S1 and S2 are true d. Neither of S1 or S2 is true
answered
in
Computer Networks
Feb 1, 2017
864
views
0
votes
27
ER Diagram to RDMS Model
while converting one to one relationship from ER diagram to RDMS, without total participation on either side, we can represent the relationship using primary- foreign key contraint without making a new table?? Am i right??
answered
in
Databases
Feb 1, 2017
1.1k
views
databases
er-diagram
er-to-relational
relational
1
vote
28
concurrency control
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
answered
in
Databases
Feb 1, 2017
457
views
databases
transaction-and-concurrency
3
votes
29
UGC NET CSE | January 2017 | Part 3 | Question: 31
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \left( \frac{n}{2} \right) +\frac{n}{\lg \: n}$ is $O(n^2)$ $O(n \:\lg \: n )$ $O(n \:\lg \:\lg \: n)$ $O(\lg \:\lg \: n)$
answered
in
Algorithms
Jan 31, 2017
5.0k
views
ugcnetcse-jan2017-paper3
algorithms
asymptotic-notation
recurrence-relation
Page:
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation