menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Questions by Dulqar

4 votes
3 answers
1
How to make user authenticated Internet Acceess
I wanted to convert my home modem to coffee shop and give internet to my customers . But due to security reasons users should register their mobile before they get access to inernet. How can I build this project ? Where should I start with ? Currently i have got D-Link modem
I wanted to convert my home modem to coffee shop and give internet to my customers . But due to security reasons users should register their mobile before they get access to inernet. How can I build this project ? Where should I start with ? Currently i have got D-Link modem
asked Mar 21, 2017 in Pure Web Development 352 views
1 vote
0 answers
2
How to Prepare SOP for IIITH - PGEEE
How to prepare SOP (Statement Of Purpose ) ? What are the important points to be taken in mind while preparing SOP
How to prepare SOP (Statement Of Purpose ) ? What are the important points to be taken in mind while preparing SOP
asked Mar 13, 2017 in IIITH-PGEE 944 views
0 votes
1 answer
3
Does anyone having Precious Questions of IIIT Hyderbad PGEE ?
If anyone has got previous year question papers or link pls do share
If anyone has got previous year question papers or link pls do share
asked Feb 27, 2017 in IIITH-PGEE 2.4k views
0 votes
0 answers
4
Numbers Divisible by 15
in a set of odd numbers less than 500, What is the total number of numbers divisible by 15?
in a set of odd numbers less than 500, What is the total number of numbers divisible by 15?
asked Feb 3, 2017 in Numerical Ability 600 views
2 votes
1 answer
5
Union of Two Language
WHat is the union of the following wo languages L=0*1+0+1* ∪ 10*1 L=001 U 0*1*
WHat is the union of the following wo languages L=0*1+0+1* ∪ 10*1 L=001 U 0*1*
asked Feb 3, 2017 in Theory of Computation 118 views
0 votes
1 answer
6
NPTEL-Design and Analysis of Algorithms-Week2-Quiz-2-Q3
Suppose we want to sort an array in ascending order and we implement quicksort so that we always choose the last element in the array as the pivot element. Assume that the input is a permutation of {1, 2, , n}. Which of the following ... {1, 2, . . . , n} with all odd numbers in ascending order followed by all even numbers in random order.
Suppose we want to sort an array in ascending order and we implement quicksort so that we always choose the last element in the array as the pivot element. Assume that the input is a permutation of {1, 2, , n}. Which of the following would definitely be a worst case ... some random order. {1, 2, . . . , n} with all odd numbers in ascending order followed by all even numbers in random order.
asked Feb 3, 2017 in Algorithms 2.2k views
0 votes
1 answer
7
NPTEL-Internetwork Security-Week2-Quiz-2-Q6
Q6. ___________Data Encryption Standard (DES) was designed to increase the size of the Data Encryption Standard (DES) key. (A) Double (B) Triple (C) Quadruple (D) none of these
Q6. ___________Data Encryption Standard (DES) was designed to increase the size of the Data Encryption Standard (DES) key. (A) Double (B) Triple (C) Quadruple (D) none of these
asked Feb 3, 2017 in Computer Networks 1.7k views
0 votes
2 answers
8
NPTEL-Internetwork Security-Week2-Quiz-2-Q3
Q3: What kind of ciphers Electronic Codebook (ECB) mode and Cipher Block Chaining (CBC) mode are (A) Block cipher (B) Stream cipher (C) Field cipher (D) both (A) and (B)
Q3: What kind of ciphers Electronic Codebook (ECB) mode and Cipher Block Chaining (CBC) mode are (A) Block cipher (B) Stream cipher (C) Field cipher (D) both (A) and (B)
asked Feb 3, 2017 in Computer Networks 338 views
0 votes
1 answer
9
NPTEL-Operating System-Week1-Quiz-2-Q14
State True or False . Please explain in 2 or 3 sentences Temporal locality states if a page is accessed, then there is a high chance that the nearby pages will be accessed.
State True or False . Please explain in 2 or 3 sentences Temporal locality states if a page is accessed, then there is a high chance that the nearby pages will be accessed.
asked Feb 3, 2017 in Operating System 260 views
0 votes
1 answer
10
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-2-Q12
State true or false. When a user encounters a page fault, 1) The user application informs the OS, 2) User uses API calls to the hardware Memory Management unit, 3) Memory Management unit brings the page from hard disk to main memory. Is Statement 2 correct ?
State true or false. When a user encounters a page fault, 1) The user application informs the OS, 2) User uses API calls to the hardware Memory Management unit, 3) Memory Management unit brings the page from hard disk to main memory. Is Statement 2 correct ?
asked Feb 3, 2017 in Operating System 676 views
0 votes
1 answer
11
NPTEL-Operating System,-Week2-Quiz-2-Q5
In the Contiguous allocation for disk blocks, files cannot grow dynamically because _______ The next block could be occupied by another file The scheme does not allow files to grow (by design itself) (No answer is correct because files can grow) The disk does not have enough space I think both 1 and 2 are correct . What do you say ?
In the Contiguous allocation for disk blocks, files cannot grow dynamically because _______ The next block could be occupied by another file The scheme does not allow files to grow (by design itself) (No answer is correct because files can grow) The disk does not have enough space I think both 1 and 2 are correct . What do you say ?
asked Feb 3, 2017 in Operating System 351 views
0 votes
1 answer
12
C program
What is the error in the following code . Please do correct them #include <stdio.h> int main () { char *x[5] = {"raju","ramu","tinu","ben","ali"}; printf("%s\n",(x[2][0]) ); return 0; }
What is the error in the following code . Please do correct them #include <stdio.h> int main () { char *x[5] = {"raju","ramu","tinu","ben","ali"}; printf("%s\n",(x[2][0]) ); return 0; }
asked Feb 3, 2017 in Programming 116 views
1 vote
4 answers
13
Determine the highest possible normal form of the given relation?
Consider the relation R(Name,courseNO,rolNO,grade) name,courseno ->grade rollno,courseno->grade name->rollno rollno->name Given answer as it is 3NF . But Im getting 1NF. is it correct ?
Consider the relation R(Name,courseNO,rolNO,grade) name,courseno ->grade rollno,courseno->grade name->rollno rollno->name Given answer as it is 3NF . But Im getting 1NF. is it correct ?
asked Feb 1, 2017 in Computer Networks 284 views
0 votes
1 answer
14
NPTEL-Operating System-Week2-Quiz-Q9
Creating many threads is advisable than creating many processes. Which of the statements below do not support this claim? Threads can share the address space and global data. None of the options. Programmer should ensure that it is ok to share data between two threads. Context switching is faster for threads as compared to Processes
Creating many threads is advisable than creating many processes. Which of the statements below do not support this claim? Threads can share the address space and global data. None of the options. Programmer should ensure that it is ok to share data between two threads. Context switching is faster for threads as compared to Processes
asked Jan 30, 2017 in Operating System 176 views
0 votes
0 answers
15
NPTEL-Operating System,-Week2-Quiz-1-Q2
State true or false. With Reason In a Micro-Kernel based OS, different modules communicate with each other using message passing. This is a secure way to enable communication. In a Modular OS, kernel modules can directly call any other ... . In a Modular OS, kernel modules can directly call any other module. This, however, suffers from efficiency issues.
State true or false. With Reason In a Micro-Kernel based OS, different modules communicate with each other using message passing. This is a secure way to enable communication. In a Modular OS, kernel modules can directly call any other module. This, however, ... enable communication. In a Modular OS, kernel modules can directly call any other module. This, however, suffers from efficiency issues.
asked Jan 30, 2017 in Operating System 457 views
0 votes
2 answers
16
NPTEL-Operating Syste,-Week2-Quiz-1-Q1
Which of the following statements about Softwares is false? System Softwares provide an API that can be accessed by the Application Softwares. DBMS, Compilers, Assemblers are examples of System Software. OS Interface is used by the System Softwares to interact with the hardware/OS. System Softwares can control and coordinate the use of hardware.
Which of the following statements about Softwares is false? System Softwares provide an API that can be accessed by the Application Softwares. DBMS, Compilers, Assemblers are examples of System Software. OS Interface is used by the System Softwares to interact with the hardware/OS. System Softwares can control and coordinate the use of hardware.
asked Jan 30, 2017 in Operating System 426 views
0 votes
1 answer
17
Difference Between
Difference between Conflict Serial schedule and Conflict Serializable Scheule
Difference between Conflict Serial schedule and Conflict Serializable Scheule
asked Jan 27, 2017 in Databases 84 views
2 votes
0 answers
18
Minimum Spanning Tree
Show the different minimum spanning Trees Possible in each of the following Algorithms Prims Algorithm Kruskal
Show the different minimum spanning Trees Possible in each of the following Algorithms Prims Algorithm Kruskal
asked Jan 26, 2017 in Algorithms 204 views
0 votes
1 answer
19
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-1-Q6
if T(n) = n2 √ n then T(n) = O(n2) T(n) = O(n2 log n) T(n) = O(n3) None of the above Im getting option 2 is it correct ?
if T(n) = n2 √ n then T(n) = O(n2) T(n) = O(n2 log n) T(n) = O(n3) None of the above Im getting option 2 is it correct ?
asked Jan 24, 2017 in Algorithms 2.8k views
0 votes
2 answers
20
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-1-Q3
An algorithm has two phases. The first phase, initialization, takes time O(n2 log n). The second phase, which is the main computation, takes time O(n3). What is the most accurate description of the complexity of the overall algorithm? O(n2 log n) O(n3) O(n3 log n) O(n3 + log n) Im getting option 2 , is it correct ?
An algorithm has two phases. The first phase, initialization, takes time O(n2 log n). The second phase, which is the main computation, takes time O(n3). What is the most accurate description of the complexity of the overall algorithm? O(n2 log n) O(n3) O(n3 log n) O(n3 + log n) Im getting option 2 , is it correct ?
asked Jan 24, 2017 in Algorithms 2.7k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...