Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Ismail
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ismail
1
answer
1
BITS HD
I got Selected for BITS Pilani SS. Should I go for it or wait for one year to give gate again to get IITs. ?Repaying loan of 10Lac which i will take for BITS is getting me nervous. My this year gate rank is AIR 2047
I got Selected for BITS Pilani SS. Should I go for it or wait for one year to give gate again to get IITs. ?Repaying loan of 10Lac which i will take for BITS is getting m...
5.6k
views
commented
Mar 23, 2023
Written Exam
bits
gate2018-admissions
admissions
+
–
0
answers
2
Testbook Test Series: Combinatory - Permutations And Combinations
NUMBER OF WAYS IN WHICH CORNER OF THE SQUARE CAN BE COLORED WITH TWO COLORS. (ITS IS PERMISSIBLE TO USE A SINGLE COLOUR ON ALL FOUR CORNER)
NUMBER OF WAYS IN WHICH CORNER OF THE SQUARE CAN BE COLORED WITH TWO COLORS. (ITS IS PERMISSIBLE TO USE A SINGLE COLOUR ON ALL FOUR CORNER)
398
views
commented
Apr 13, 2018
Combinatory
combinatory
testbook-test-series
discrete-mathematics
+
–
1
answer
3
Testbook Test Series: Combinatory - Permutations And Combinations
NUMBER OF WAYS WE CAN ARRAYS LETTERS OF THE WORD "TESTBOOK" SO THAT NO TWO VOWELS ARE TOGETHER IS
NUMBER OF WAYS WE CAN ARRAYS LETTERS OF THE WORD "TESTBOOK" SO THAT NO TWO VOWELS ARE TOGETHER IS
803
views
commented
Apr 13, 2018
Combinatory
testbook-test-series
combinatory
discrete-mathematics
+
–
4
answers
4
array pointers
What will the following code fragment output: void fun(int *a, int b) { b++; a[2] = a[1] + 3; } void main() { int A[5] = {0,1,2,3,4}; fun(A, A[2]); printf(%d, A[2]); }
What will the following code fragment output: void fun(int *a, int b) { b++; a = a + 3; } void main() { int A[5] = {0,1,2,3,4}; fun(A, A ); printf(%d, A ); }
1.6k
views
commented
Apr 5, 2018
Programming in C
iiith-pgee-samplequestion
+
–
2
answers
5
GATE CSE 2018 | Question: 53
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, , 199$), and $256$ sectors per track (numbered as $0, 1, 255$). The following $6$ disk ... negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, … , 199$), and $256$ sectors per track (numbered as $0, 1...
15.6k
views
commented
Feb 14, 2018
Operating System
gatecse-2018
operating-system
disk
numerical-answers
2-marks
+
–
0
answers
6
test series fragmentation que
594
views
commented
Jan 30, 2018
Computer Networks
fragmentation
computer-networks
+
–
0
answers
7
test series
339
views
commented
Jan 28, 2018
2
answers
8
MadeEasy Test Series 2018: Digital Logic - Min No Gates
637
views
asked
Jan 27, 2018
Digital Logic
digital-logic
min-no-gates
made-easy-test-series
+
–
0
answers
9
logic test
373
views
commented
Jan 27, 2018
Mathematical Logic
propositional-logic
+
–
0
answers
10
TEST SERIES CO
240
views
asked
Jan 27, 2018
CO and Architecture
co-and-architecture
cache-memory
+
–
1
answer
11
Ace Test Series: Computer Networks - Packet Switching With Pipelining
735
views
commented
Jan 26, 2018
Computer Networks
ace-test-series
computer-networks
ip-packet
+
–
2
answers
12
ACE test series
323
views
answered
Jan 26, 2018
Computer Networks
ace-test-series
computer-networks
+
–
1
answer
13
test series
I m getting A exnor B exnor C which is same as AxorBxorC but answer is (b) how?
I m getting A exnor B exnor C which is same as AxorBxorC but answer is (b) how?
1.5k
views
commented
Jan 23, 2018
1
answer
14
Ace Test Series: Discrete Maths - Combinatory
528
views
commented
Jan 20, 2018
Combinatory
ace-test-series
discrete-mathematics
combinatory
+
–
2
answers
15
Ace Test series: Digital Logic - Digital Circuits
what should be A B and C for F = 1 ??
what should be A B and C for F = 1 ??
974
views
comment edited
Jan 14, 2018
Digital Logic
digital-logic
ace-test-series
digital-circuits
+
–
2
answers
16
cprogramming
#include<stdio.h> int *m(); void main(){ int *k=m(); printf("Hello"); printf("%d",k[0]); } int *m(){ int a[2]={5,8}; return a; } What is the output generated? A)hello 5 8 B)hello 5 C)hello followed by garbage D)compilation error
#include<stdio.h>int *m();void main(){int *k=m();printf("Hello");printf("%d",k[0]);}int *m(){int a ={5,8};return a;} What is the output generated?A)hello 5 8B)hello 5C)he...
3.7k
views
commented
Dec 13, 2017
Programming in C
programming-in-c
+
–
1
answer
17
sets
A set S has 5 elements .How many ways we can choose subset P and Q of S so that P∩Q=∅
A set S has 5 elements .How many ways we can choose subset P and Q of S so that P∩Q=∅
627
views
commented
Sep 7, 2017
1
answer
18
Connectivity Graph Theory
Which of the following statements are true . Please explain why each statement is true/false.. S1 : If a simple graph G is not connected then it's complement G is not connected S2 : If a simple graph G is connected them it's complement G ... S4 : If a simple graph has exactly two vertices of odd degree then there exists a path between two vertices of odd degree
Which of the following statements are true . Please explain why each statement is true/false..S1 : If a simple graph G is not connected then it's complement G is not conn...
4.4k
views
commented
Sep 4, 2017
Graph Theory
graph-theory
graph-connectivity
+
–
1
answer
19
Set theory lattice
why lub of 2 and 3 does not exist ... upper bond of 2 and 3 is 12 18 and 36 ... least among them is 12 thus least upper bond is 12... right? question image : https://drive.google.com/open?id=0ByxeyAYDQMMXakFLYTZ6NE9OWEtOSjQ1LXp5dmhGS0FiT3dF
why lub of 2 and 3 does not exist ... upper bond of 2 and 3 is 12 18 and 36 ... least among them is 12 thus least upper bond is 12... right?question image : https://drive...
932
views
commented
Aug 21, 2017
Set Theory & Algebra
set-theory
lattice
discrete-mathematics
+
–
1
answer
20
graph theory
For complete bipartite graph k2,3 , what is the edge connectivity ?
For complete bipartite graph k2,3 , what is the edge connectivity ?
1.1k
views
commented
Aug 11, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register