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 Shaik Masthan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Shaik Masthan
1
vote
1
answer
1
IIIT BLR TEST 1 : ALGORITHMS 3
Given an array of ( both positive and negative ) integers, $a_0,a_1,….a_{n-1}$ and $l, 1<l<n$. Design a linear time algorithm to compute the maximum product subarray, whose length is atmost $l$.
asked
in
Algorithms
Aug 27, 2019
826
views
iiit-blr
array
time-complexity
0
votes
1
answer
2
IIIT BLR TEST 1 : ALGORITHMS 2
A 3 way (ternary) min heap is a 3 way ( ternary - each node as atmost three children nodes, left, mid, right ) complete tree with min heap property ( value of the parent is less than the value of the children ) satisfied at every node ... c) In Heapsort, binary heap is preferred over ternary heap. State if this statement is true or false, you must justify your answer.
asked
in
Programming
Aug 27, 2019
534
views
iiit-blr
data-structures
binary-heap
descriptive
0
votes
1
answer
3
IIIT BLR TEST 1 : ALGORITHMS 1
Solve the following recursions ( in terms of Θ ). T(0) = T(1) = Θ(1) in all of the following. $T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{2}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{4}{n}\sum_{i=0}^{i=n/2}T(i)$ $T(n) = n + \frac{40}{n}\sum_{i=0}^{i=n/5}T(i)$
asked
in
Algorithms
Aug 27, 2019
582
views
iiit-blr
algorithms
time-complexity
recurrence-relation
3
votes
1
answer
4
ISI MTECH CS 2019 INTERVIEW question
As due to rain, the match between the teams in ICC world cup got canceled , So lets the total team be 10, exclude semi finals and finals , consider only league match, What is the total number of matches that played between the teams ... many ways those n matches can be conducted ? Source : https://gateoverflow.in/blog/8548/isi-mtech-cs-2019-interview-experience
asked
in
Combinatory
Aug 8, 2019
788
views
combinatory
1
vote
0
answers
5
Direct Mapping and set associative Mapping
https://gateoverflow.in/1851/gate2006-74 https://gateoverflow.in/43565/gate2006-75 can someone check this questions ? i am not getting, how without help of MULTIPLEXER or DECODER, we are searching hit/miss i mean in direct mapping, how we select lines and their respective Tags without help of Multiplexer ?
asked
in
CO and Architecture
Dec 18, 2018
1.5k
views
cache-memory
direct-mapping
comparators
4
votes
0
answers
6
Can't understand the intution behind the shortcut
let the ∑ = {0,1} ===> strings possible are should be Binary strings. No.of States in Minimal DFA that accepts, Decimal( Binary String ) = 0 mod n in ACE coaching institute, i learned that For Decimal( Binary String ) = 0 mod n i) if n ... String ) = 0 mod x or 0 mod y neither x divides y nor y divides x either x is divides y or y divides x
asked
in
Theory of Computation
Nov 30, 2018
574
views
minimal-state-automata
regular-language
0
votes
0
answers
7
Self Doubt
"Every cyclic K-map given cyclic function and every cyclic function can be the self-dual function." What is the meaning of cyclic K-map?
asked
in
Digital Logic
Sep 23, 2018
261
views
k-map
0
votes
0
answers
8
Self Doubt on Fork with logical OR
if (e1 || e2 ) { print "OK" } print "HAI" if e1 is true, with out checking e2 ===> it directly prints OK then HAI let take, it is fork in the place of e1 ===> 1) parent ( which have > 0 ) ===> e1 is true, ===> OK HAI printed 2) child ( which have = 0 ) ==> e1 false, ==> check e2. is it right or wrong?
asked
in
Programming
Sep 16, 2018
599
views
fork-system-call
logical-or
0
votes
0
answers
9
Self Derivation
I want to derive a formula that, with n nodes how many AVL trees can possible. we know that, with 0 ==> 1,with 1 ==> 1, with 2 ==> 2, with 3 ==> 1 with 4 ===> root is fixed ==> remaining 3 nodes we have to distribute on ... find by maximum height achieve by left nodes, and right nodes atmost differ by 1. Can we simplify further.... i am not able to do further...
asked
in
Programming
Aug 7, 2018
223
views
0
votes
0
answers
10
Confusion in Synchronus Series Counter
I am not getting any difference between these two questions but answers are not matching, https://gateoverflow.in/86195/me-test https://gateoverflow.in/26442/gate1991-5-c
asked
in
Digital Logic
Jul 29, 2018
935
views
sequential-circuit
digital-circuits
digital-logic
0
votes
0
answers
11
self doubt on HUFFMAN
in Huffman Code, we get extract the minimum at each time, but my minimum is creating duplicate, then which one i choose? i am getting the same avg.no.of bits for every Huffman tree, but the problem is my tree is changing therefore representing the character also changed, if some one asks ... $\frac{12}{30} $
asked
in
Algorithms
Jul 26, 2018
858
views
greedy-algorithm
huffman-code
1
vote
2
answers
12
Doubt about fork()
#include <stdio.h> int main(void) { int i=0; printf("HAI\n"); for(i=1;i<=3;i++) { if(fork()==0) printf("*"); } return 0; } How many times * will be printed? and How many times HAI will be printed?
asked
in
Operating System
Jun 4, 2018
571
views
operating-system
fork-system-call
2
votes
0
answers
13
Doubt about string
#include <stdio.h> int main () { char *ptr = "\123456789\n"; printf("%s",ptr); } Can anyone explain what happend with escaping character before 1 ?
asked
in
Programming
May 25, 2018
363
views
strings
0
votes
1
answer
14
operator ambiguity
The following program main( ) { int a=5,b=2; printf("%d", a +++ b); } Is it a++ + b or a + ++b ?
asked
in
Programming
May 23, 2018
1.6k
views
programming-in-c
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....