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 Vimal Patel
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Vimal Patel
9
answers
1
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
comment edited
in
DS
Feb 13, 2020
20.1k
views
gatecse-2020
linked-list
1-mark
9
answers
2
GATE CSE 2015 Set 1 | Question: 29
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than ... respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is__________________.
commented
in
Computer Networks
Jan 19, 2020
10.1k
views
gatecse-2015-set1
computer-networks
normal
numerical-answers
congestion-control
3
answers
3
GATE2014 EC-4: GA-8
Industrial consumption of power doubled from $2000-2001$ to $2010-2011$. Find the annual rate of increase in percent assuming it to be uniform over the years. $5.6$ $7.2$ $10.0$ $12.2$
commented
in
Quantitative Aptitude
Jan 9, 2020
2.2k
views
gate2014-ec-4
percentage
normal
quantitative-aptitude
3
answers
4
TIFR CSE 2013 | Part A | Question: 1
An infinite two-dimensional pattern is indicated below. The smallest closed figure made by the lines is called a unit triangle. Within every unit triangle, there is a mouse. At every vertex there is a laddoo. What is the average number of laddoos per mouse? $\quad 3$ $\quad 2$ $\quad 1$ $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{3}\right)$
answered
in
Combinatory
Jan 8, 2020
1.2k
views
tifr2013
combinatory
counting
4
answers
5
GATE2015 ME-3: GA-5
Five teams have to compete in a league, with every team playing every other team exactly once, before going to the next round. How many matches will have to be held to complete the league round of matches? $20$ $10$ $8$ $5$
answered
in
Quantitative Aptitude
Jan 8, 2020
3.6k
views
gate2015-me-3
quantitative-aptitude
combinatory
4
answers
6
GATE CSE 1996 | Question: 1.13
An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above
commented
in
DS
Dec 23, 2019
10.9k
views
gate1996
data-structures
hashing
normal
2
answers
7
GATE2014 EC-3: GA-8
A man can row at $8$ km per hour in still water. If it takes him thrice as long to row upstream, as to row downstream, then find the stream velocity in km per hour.
commented
in
Quantitative Aptitude
Dec 13, 2019
3.8k
views
gate2014-ec-3
quantitative-aptitude
speed-time-distance
normal
numerical-answers
4
answers
8
column major in 3d array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B].
commented
in
Programming
Dec 12, 2019
13.7k
views
array
programming-in-c
data-structures
1
answer
9
PI and EPI in case of Don't care
Consider the below function $f=\sum m(0,1,2,5,8,15)+d(6,7,10)$ In this Prime Implicant count comes-7 and Essential Prime Implicant Count comes 2. Please verify.
commented
in
Digital Logic
Dec 7, 2019
4.1k
views
digital-logic
6
answers
10
GATE CSE 2000 | Question: 6
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the corresponding sets has ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?
answered
in
Set Theory & Algebra
Dec 2, 2019
5.0k
views
gatecse-2000
set-theory&algebra
normal
descriptive
set-theory
11
answers
11
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
commented
in
Databases
Nov 23, 2019
31.1k
views
gatecse-2009
databases
b-tree
normal
15
answers
12
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
answered
in
Operating System
Nov 21, 2019
18.1k
views
gateit-2007
operating-system
disk-scheduling
normal
1
answer
13
Test by Bikram | Theory of Computation | Test 1 | Question: 25
If all the strings of a language can be enumerated in $\text{lexicographic}$ order, then this is an example of a _______ language. Regular CFL but need not be regular CSL but need not be a CFL Recursive but need not be a CSL
comment edited
in
Theory of Computation
Oct 22, 2019
387
views
tbb-toc-1
1
answer
14
Test by Bikram | Databases | Test 1 | Question: 1
What is the minimum number of tables required to represent this E-R diagram in the relational model? Considering that for both R1 and R2 cardinality is $1:1$ $2$ $3$ $4$ $5$
commented
in
Databases
Oct 18, 2019
602
views
tbb-dbms-1
9
answers
15
GATE CSE 2018 | Question: 34
The size of the physical address space of a processor is $2^P$ bytes. The word length is $2^W$ bytes. The capacity of cache memory is $2^N$ bytes. The size of each cache block is $2^M$ words. For a $K$-way set-associative cache memory, the length (in number of bits) of the tag field is $P-N- \log_2K$ $P-N+ \log_2 K$ $P-N-M-W- \log_2 K$ $P-N-M-W+ \log_2 K$
commented
in
CO and Architecture
Jun 7, 2019
8.9k
views
gatecse-2018
co-and-architecture
cache-memory
normal
2-marks
1
answer
16
Ullman (TOC) Edition 3 Exercise 5.1 Question 8 (Page No. 183)
Consider the CFG $G$ defi ned by productions$:$ $S\rightarrow aSbS|bSaS|\in$ Prove that $L(G)$ is the set of all strings with an equal number of $a's$ and $b's.$
answered
in
Theory of Computation
Apr 9, 2019
839
views
ullman
theory-of-computation
context-free-grammar
context-free-language
1
answer
17
Ullman (TOC) Edition 3 Exercise 5.1 Question 7 (Page No. 183)
Consider the CFG $G$ defi ned by productions$:$ $S\rightarrow aS|Sb|a|b$ Prove by induction on the string length that no string in $L(G)$ has $ba$ as a substring. Describe $L(G)$ informally. Justify your answer using part $(a).$
answered
in
Theory of Computation
Apr 8, 2019
1.3k
views
ullman
theory-of-computation
context-free-grammar
context-free-language
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
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
IIIT-Delhi MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.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.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(844)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent Blog Comments
congrats pranab
Congratulations @Pranab Paul 10 🥳
sir give access to these tests at least mid May...
Was there interview for mtech as well?
Check CCMT website for previous year cutoff for...