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 Souvik33
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Souvik33
0
votes
1
answer
1
Data Structure | Set | IIT Kanpur Interview question
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible? $n^{2}$ nlogn n logn
asked
in
DS
Apr 2, 2023
416
views
iit-kanpur
interview
data-structures
0
votes
0
answers
2
GATE 2023 question
In which of the given operations, will a user level to kernel level switch, surely happen? Page Fault System Call Subroutine Call Malloc()
asked
in
Operating System
Feb 6, 2023
504
views
operating-system
multiple-selects
0
votes
1
answer
3
Programming and Data Structure | Static int | Made Easy Test series (Modified)
Consider the following C code snippets, labeled as P1, P2 and P3, the output of P1 is X , of P2 is Y and of P3 as Z . What is the value of X+Y+Z P1 #include <stdio.h> int f(int n) { static int r=40; if (n==0 | ... 1,r)-r; } else return f(n-1,r)+(2*r); } int main() { printf("%d",f(6,40)); return 0; }
asked
in
Programming in C
Jan 29, 2023
453
views
data-structures
programming-in-c
0
votes
1
answer
4
Made Easy Test Series | HTTP & TCP
Assume that we are retrieving a HTML file with 10 embedded objects. To retrieve the base file and the objects under non-persistent HTTP with no parallel connections, X' number of round trip time is required. Y' number of round trip time is required to retrieve the base file and the objects under ... 14) X=22, Y=6, Z= 56 (∵ X+Y = 28) X=21, Y=5, Z= 26 (∵ X+Y = 26)
asked
in
Computer Networks
Jan 20, 2023
468
views
http
made-easy-test-series
computer-networks
tcp
5
votes
2
answers
5
GATE CSE 2014 Set 2 | Question: 10 | Modified
Consider the function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); } The value returned by func(-435) is: 6 9 Will loop forever Depends on computer architecture
asked
in
Programming in C
Jan 15, 2023
1.1k
views
algorithms
identify-function
numerical-answers
easy
0
votes
2
answers
6
Made Easy Test Series | 3NF | True/False
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of R TRUE FALSE
asked
in
Databases
Jan 14, 2023
522
views
made-easy-test-series
databases
true-false
1
vote
2
answers
7
Compiler Design | Error in which stage detection
What is the earliest stage compiler error for the following C code snippet: int x = @33; Lexical Error Syntax Error Semantic Error None
asked
in
Compiler Design
Jan 12, 2023
573
views
compiler-design
lexical-analysis
error-detection
1
vote
1
answer
8
Made Easy Test Series | Prog And DS | Linked List
The following C function rearranges the members of a single-linked list of integers that is passed as a parameter. The list of numbers 1, 2, 3, 4, 5, 6, and 7 in the specified order is passed to the function when it is called. How many components will move about in the list once the function is finished running?
asked
in
Programming in C
Jan 11, 2023
751
views
programming-in-c
made-easy-test-series
data-structures
linked-list
1
vote
0
answers
9
Made Easy Test Series | Prog. and DS | Dynamic Memory Allocation | Malloc
Which line number contains an error or warning:
asked
in
Programming in C
Jan 9, 2023
723
views
programming-in-c
data-structures
memory-management
made-easy-test-series
numerical-answers
0
votes
0
answers
10
Theory Of Computation | Minimum Pumping Length | MPL
MSQ Consider the following languages and their MPL (Minimum Pumping Length) Which among these are TRUE: L1 = aa(b)* :: MPL(L1) = 3 L2 = aa(aa)* :: MPL(L2) = 2 L2 = aa(aa)* :: MPL(L2) = 3 L2 = aa(aa)* :: MPL(L2) = 4 L3 = aa(ab)* :: MPL(L3) = 4 L4 = aa(b)* + aad(c)* :: MPL(L4) = 4
asked
in
Theory of Computation
Jan 7, 2023
735
views
theory-of-computation
pumping-lemma
0
votes
1
answer
11
Made Easy Test Series | Discrete Maths | POSET | Chain length
50 51 52 53
asked
in
Graph Theory
Jan 5, 2023
508
views
made-easy-test-series
discrete-mathematics
0
votes
1
answer
12
Set Theory, Basic | Power of a set
Given set A= {a,b}$^3$ What do the formed set look like and what is |A| (cardinility of A)
asked
in
Set Theory & Algebra
Jan 5, 2023
401
views
discrete-mathematics
set-theory
self-doubt
1
vote
1
answer
13
MADE EASY test series | Computer Networks
Can someone please suggest weather to go for 20.5 or 21 in these kind of problems in GATE? As logically 21 is correct, but mathematically 20.5 is correct. Both the answers can be reasoned correct and wrong, feels like “Umpire’s call” in DRS, cricket.
asked
in
Computer Networks
Jan 3, 2023
438
views
made-easy-test-series
computer-networks
go-back-n
sliding-window
0
votes
1
answer
14
Made Easy Textbook Problem | Compiler Design | CLR(1) | Look-a-heads
Let G be any grammar with the following productions: X → X+Y | Y Y→ Y*Z | Z Z → (X) Z → id If LR(1) parser is used to parse the above grammar, then total how many look-a-heads are present for the item “X→.Y” and “Z →.id” in the initial state?
asked
in
Compiler Design
Jan 1, 2023
845
views
compiler-design
made-easy-test-series
parsing
made-easy-booklet
lr-parser
0
votes
1
answer
15
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
asked
in
Theory of Computation
Dec 27, 2022
497
views
theory-of-computation
finite-automata
regular-language
made-easy-test-series
0
votes
1
answer
16
Number Of Substrings | Made Easy Test Series
The number of subwords for w=’SCALABLE” is equal to: 34 35 37
asked
in
Combinatory
Dec 21, 2022
845
views
combinatory
counting
made-easy-test-series
0
votes
1
answer
17
Push Down Automation | Parsing | Input Buffer and Stack
Consider a situation, where the input buffer is still having elements, and our PDA has reached final state. Given that for next input element the final state has no transition defined. In above situation will the i/p string be ... in all cases May be accepted if empty stack acceptance is allowed in the given PDA Something else, I can explain
asked
in
Compiler Design
Dec 20, 2022
476
views
theory-of-computation
pushdown-automata
context-free-grammar
1
vote
1
answer
18
Dijkstra's algorithm | Negative Weight Cycle
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUE FALSE
asked
in
Algorithms
Dec 19, 2022
692
views
dijkstras-algorithm
graph-algorithm
shortest-path
0
votes
1
answer
19
Deadlock prevention techniques | Wait-Die | Wound-Wait
MSQ Which among the following is/are TRUE regarding the deadlock prevention techniques: Wound-wait is premptive Wait-die is non-premptive Starvation is possible in wound-wait Starvation does not occur in wait-die
asked
in
Databases
Dec 19, 2022
341
views
databases
deadlock-prevention-avoidance-detection
operating-system
multiple-selects
1
vote
1
answer
20
Array P&DS | Time Complexity
What is the worst case time complexity of an efficient algorithm (in order of n) to get the last index for an actually filled element, in an array, given the condition that we may not fill the entire initialized array with elements, the array is initialized as “int a[n]; ” [Array may not be filled in a sorted order] O(n) O(1) O(log(n)) O($n^2$)
asked
in
DS
Dec 17, 2022
665
views
algorithms
time-complexity
array
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
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...