Register
Filter

Recent activity by Sagar475

0 answers
1
C++ vector of Vector
can anyone tell me vector<vector<int>>arr[n] this creates kind of 2D array of nXn size?? Actually i can’t imagine it’s structure!!
can anyone tell me vector<vector<int>>arr[n] this creates kind of 2D array of nXn size??Actually i can’t imagine it’s structure!!
1 answer
2
IISC- SIGNED VERSION OF INTERVIEW UNDERTAKING
ACTUALLY CAN’T FIGURE OUT WHERE DO I WILL GET THIS DOCUMENT
ACTUALLY CAN’T FIGURE OUT WHERE DO I WILL GET THIS DOCUMENT
1 answer
4
MADE-EASY FULL LENGTH TEST
Let A={2,3,4,5,6,7,8,9,10,11,12,13,14,15,16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal element, and m the number of minimal elements. Which is true? C=3,M=8,m=6 C=4,M=8,m=6 C=3,M=6,m=6 C=4,M=6,m=4
Let A={2,3,4,5,6,7,8,9,10,11,12,13,14,15,16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal element, and m ...
0 answers
5
Self Made Doubt
If it’s written that some synchronization construct statisfies bounded waiting than it means the process is going to wait nearly forever fo it’s turn to execute?
If it’s written that some synchronization construct statisfies bounded waiting than it means the process is going to wait nearly forever fo it’s turn to execute?
1 answer
6
Self Made Doubt
if we write in C char a[]=”TAJ”; char b[]=”TAJ”; and on comparing (a==b) false is returned where as in char *p=”TAJ”; char *q=”TAJ” it return TRUE why??
if we write in C char a[]=”TAJ”;char b[]=”TAJ”;and on comparing (a==b) false is returnedwhere as in char *p=”TAJ”;char *q=”TAJ” it return TRUE why??
1 answer
9
Made Easy Full length Test
Options Given were: (pi)/2 pi -(pi) none
Options Given were:(pi)/2pi-(pi)none
1 answer
11
Gate Applied Test Series
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element is _______.(Assume that we are allowed to access the array indexes)
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element i...
1 answer
13
Discrete Maths(Applied Test Series)
The number of all abelian groups, up to isomorphism, of order 32 is not: 4 5 6 7
The number of all abelian groups, up to isomorphism, of order 32 is not:4567
0 answers
15
Made Easy Full length Test
Options Given were---- ADC ABC Both the above None of these According to me the answer should be {A,B,C,D} as this is the largest set and every node is capable to reach every other node.. but the answer given was option C so can anyone plz tell me whats the correct answer?
Options Given were ADCABCBoth the aboveNone of these According to me the answer should be {A,B,C,D} as this is the largest set and every node is capable to reach every o...
1 answer
16
Made Easy Test Series Engineering Maths
Dear Friends can any body tell me limit exists at 1 or not? as According to me the limit exists at 1 as both gives -1 at 1 but in madeeasy it’s given that the limit doesn’t exists...
Dear Friends can any body tell me limit exists at 1 or not? as According to me the limit exists at 1 as both gives -1 at 1 but in madeeasy it’s given that the limit doe...
1 answer
19
Applied Test Series
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple index. If the disk sector is 512 bytes, which is the closest option for maximum file size in this allocation scheme?
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple inde...
3 answers
20
Applied Test Series
A fair coin is tossed 20 times. The probability of getting the three or more heads in a row is 0.7870 and the probability of getting three or more heads in a row or three or more tails in a row is 0.9791. What is the probability of getting three or more heads in a row and three or more tails in a row________
A fair coin is tossed 20 times. The probability of getting the three or more heads in a row is 0.7870 and the probability of getting three or more heads in a row or three...
1 answer
21
Best book to practice Discrete maths Questions
As during giving test i am facing main problem with Discrete maths and specially group theory so can anyone guide me the best source or book to practice discrete maths
As during giving test i am facing main problem with Discrete maths and specially group theory so can anyone guide me the best source or book to practice discrete maths
0 answers
22
Self made doubt
suppose we are given the congestion window 30KB and TO occurs than new th=15 and mss given =2 so when we start with slow start than sequence goes like:- 2 → 4 → 8 → 15 → 17 and so on or 2 → 4 → 8 → 14 → 16 → 18 and so on?
suppose we are given the congestion window 30KB and TO occurs than new th=15 and mss given =2 so when we start with slow start than sequence goes like:-2 → 4 → 8 → ...
1 answer
23
Made Easy Test Series
If 2,-4 are the eigen value of a non-singular matrix A and IAI=-8, then the eigen vaule of Adj A are x and -y then the value x+y is ?
If 2,-4 are the eigen value of a non-singular matrix A and IAI=-8, then the eigen vaule of Adj A are x and -y then the value x+y is ?
1 answer
24
Applied Gate Test Series Question
Consider the following code segments, the total number of processes (including the initial process) is ______.
Consider the following code segments, the total number of processes (including the initial process) is ______.
0 answers
28
DBMS ER Diagram from Made. Easy Test Series Gate 2022
What i got is 4 table of RDBMS is required but given answer is 2
What i got is 4 table of RDBMS is required but given answer is 2
1 answer
29
COA Applied Course
Assume that we are using the classic MIPS five-stage(IF, ID, EX, MEM and WB) integer pipeling.
Assume that we are using the classic MIPS five-stage(IF, ID, EX, MEM and WB) integer pipeling.
1 answer
30
made easy
Which of the following is/are correct? Circuit Switching is Store and Forward technique. Packet Switching is faster than Circuit Switching. Packet Switching wastes less resource than Circuit Switching. Packet Switching is not a Store and Forward technique.
Which of the following is/are correct?Circuit Switching is Store and Forward technique.Packet Switching is faster than Circuit Switching.Packet Switching wastes less reso...