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

Recent questions and answers in Others

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions and answers in Others

0 votes
1 answer
2
UGCNET-June2005-II: 3
The transitive closure of a relation $R$ on set $A$ whose relation matrix $\begin{bmatrix} 0 & 1 & 0\\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{bmatrix}$ ... $\begin{bmatrix} 0 & 1 & 1\\ 0 & 1 & 1 \\ 0 & 1 & 1 \end{bmatrix}$
The transitive closure of a relation $R$ on set $A$ whose relation matrix $\begin{bmatrix} 0 & 1 & 0\\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{bmatrix}$ is : $\begin{bmatrix} 0 & 1 & 0\\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{bmatrix}$ $\begin{bmatrix} 1 & 1 & 0\\ 1 & 1 & 0 \\ 1 & 1 & 0 \end{bmatrix}$ ... $\begin{bmatrix} 0 & 1 & 1\\ 0 & 1 & 1 \\ 0 & 1 & 1 \end{bmatrix}$
answered 4 days ago in Others Jatin Gupta 31 views
0 votes
1 answer
3
ACM ICPC Elibility
Can anybody please tell me, what is the age limit for ACM ICPC? By next year, I'll be 24, so will I be eligible for the same?
Can anybody please tell me, what is the age limit for ACM ICPC? By next year, I'll be 24, so will I be eligible for the same?
answered Aug 4 in Others s_dr_13 250 views
0 votes
1 answer
4
UGCNET-Dec2005-II: 7
A half-adder is also known as : $AND$ Circuit $NAND$ Circuit $NOR$ Circuit $EX-OR$ Circuit
A half-adder is also known as : $AND$ Circuit $NAND$ Circuit $NOR$ Circuit $EX-OR$ Circuit
answered Jul 24 in Others nany0256 23 views
0 votes
2 answers
5
NIELIT 2016 MAR Scientist B - Section C: 11
What is the correct way to round off $x$, $a$ $\text{float}$ to an $\text{int}$ value? $y=(\text{int})(x+0.5)$ $y=\text{int} (x+0.5)$ $y=(\text{int}) x+0.5$ $y=(\text{int})(\text{int})x+0.5)$
What is the correct way to round off $x$, $a$ $\text{float}$ to an $\text{int}$ value? $y=(\text{int})(x+0.5)$ $y=\text{int} (x+0.5)$ $y=(\text{int}) x+0.5$ $y=(\text{int})(\text{int})x+0.5)$
answered Jul 22 in Others visrai447 79 views
0 votes
1 answer
6
NIELIT 2016 MAR Scientist C - Section C: 16
If $f:\{a,b\}^{\ast}\rightarrow \{a,b\}^{\ast }$ be given by $f(n)=ax$ for every value of $n\in \{a,b\}$, then $f$ is one to one not onto one to one and onto not one to one and not onto not one to one and onto
If $f:\{a,b\}^{\ast}\rightarrow \{a,b\}^{\ast }$ be given by $f(n)=ax$ for every value of $n\in \{a,b\}$, then $f$ is one to one not onto one to one and onto not one to one and not onto not one to one and onto
answered Jul 18 in Others ayush.5 62 views
0 votes
1 answer
7
UGCNET-Dec2005-II: 36
Producer consumer problem can be solved using : semaphores event counters monitors all the above
Producer consumer problem can be solved using : semaphores event counters monitors all the above
answered Jul 17 in Others arungate 27 views
0 votes
2 answers
8
UGCNET-DEC2016-III: 41
Which of the following HTML code will affect the vertical alignment of the table content? <td style = “vertical-align : middle” > Text Here <\td> <td valign = “centre”> Text Here <\td> <td style = “text-align : center” > Text Here <\td> <td align = “ middle” > Text Here <\td>
Which of the following HTML code will affect the vertical alignment of the table content? <td style = “vertical-align : middle” > Text Here <\td> <td valign = “centre”> Text Here <\td> <td style = “text-align : center” > Text Here <\td> <td align = “ middle” > Text Here <\td>
answered Jun 11 in Others spsharmag 1.1k views
0 votes
1 answer
9
NIELIT 2016 DEC Scientist B (CS) - Section B: 60
The sequence of operation in which PCM is done is Sampling, quantizing, encoding Quantizing, sampling, encoding Quantizing, encoding, sampling None of the above
The sequence of operation in which PCM is done is Sampling, quantizing, encoding Quantizing, sampling, encoding Quantizing, encoding, sampling None of the above
answered Jun 10 in Others Ollie 34 views
0 votes
1 answer
10
NIELIT 2016 DEC Scientist B (CS) - Section B: 41
The IETF standard documents are called: RFC RCF ID none of the above
The IETF standard documents are called: RFC RCF ID none of the above
answered Jun 10 in Others Ollie 35 views
0 votes
1 answer
11
NIELIT 2016 DEC Scientist B (CS) - Section B: 36
The graph that shows basic blocks and their successor relationship is called: DAG Control graph Flow graph Hamiltonian graph
The graph that shows basic blocks and their successor relationship is called: DAG Control graph Flow graph Hamiltonian graph
answered Jun 10 in Others Ollie 35 views
0 votes
1 answer
12
NIELIT 2016 MAR Scientist B - Section C: 52
Which of the following is possible in a token passing bus network? in-service expansion. unlimited number of stations. both (A) and (B). unlimited distance.
Which of the following is possible in a token passing bus network? in-service expansion. unlimited number of stations. both (A) and (B). unlimited distance.
answered Jun 9 in Others Ollie 44 views
0 votes
1 answer
13
NIELIT 2016 MAR Scientist B - Section C: 48
The shell accepts command from the user maintains directories of files translates the keyboard’s character codes none of these
The shell accepts command from the user maintains directories of files translates the keyboard’s character codes none of these
answered Jun 9 in Others Ollie 37 views
0 votes
1 answer
14
NIELIT 2016 MAR Scientist B - Section C: 35
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.
answered Jun 9 in Others Ollie 38 views
0 votes
1 answer
15
NIELIT 2016 MAR Scientist B - Section C: 34
Global locks synchronize access to local resources. synchronize access to global resources. are used to avoid local locks. prevent access to global resources.
Global locks synchronize access to local resources. synchronize access to global resources. are used to avoid local locks. prevent access to global resources.
answered Jun 9 in Others Ollie 34 views
0 votes
1 answer
16
UGCNET-June2007-II: 18
A subclass having more than one super class is called: Category Classification Combination Partial Participation
A subclass having more than one super class is called: Category Classification Combination Partial Participation
answered Jun 7 in Others Mohit Kumar 6 39 views
0 votes
1 answer
17
UGCNET-June2007-II: 17
A recursive foreign key is a : references a relation. references a table. references its own relation references a foreign key.
A recursive foreign key is a : references a relation. references a table. references its own relation references a foreign key.
answered Jun 7 in Others Mohit Kumar 6 32 views
0 votes
1 answer
18
UGCNET-June2007-II: 16
Which of the following statements is wrong? $2-$ phase Locking Protocols suffer from dead locks. Time-Stamp Protocols suffer from more aborts. Time-Stamp Protocols suffer from cascading roll back where as $2-$ locking Protocol donot. None of these
Which of the following statements is wrong? $2-$ phase Locking Protocols suffer from dead locks. Time-Stamp Protocols suffer from more aborts. Time-Stamp Protocols suffer from cascading roll back where as $2-$ locking Protocol donot. None of these
answered Jun 7 in Others Mohit Kumar 6 25 views
0 votes
1 answer
19
UGCNET-June2007-II: 15
Runtime polymorphism can be achieved by: Accessing virtual function through the pointer of the base class Accessing virtual function through the object The derived class None of these
Runtime polymorphism can be achieved by: Accessing virtual function through the pointer of the base class Accessing virtual function through the object The derived class None of these
answered Jun 7 in Others Mohit Kumar 6 23 views
0 votes
1 answer
20
UGCNET-June2007-II: 13
What keyboard in class specification helps to hide data: Public Private Static Void
What keyboard in class specification helps to hide data: Public Private Static Void
answered Jun 7 in Others Mohit Kumar 6 25 views
0 votes
1 answer
21
UGCNET-June2007-II: 12
In case of right shift bitwise operator in $’C’$ language, after shifting $n$ bits, the leftmost $n$ bits: are always filled with zeros are always filled with ones are filled with zeros or ones and is machine dependent none of the above
In case of right shift bitwise operator in $’C’$ language, after shifting $n$ bits, the leftmost $n$ bits: are always filled with zeros are always filled with ones are filled with zeros or ones and is machine dependent none of the above
answered Jun 7 in Others Mohit Kumar 6 26 views
0 votes
1 answer
22
UGCNET-June2007-II: 10
What is the maximum counting speed of a $4$-bit binary counter which is composed of Flip-Flop with a propagation delay of $25$ns? $1$ MHz $10$ MHz $100$ MHz $4$ MHz
What is the maximum counting speed of a $4$-bit binary counter which is composed of Flip-Flop with a propagation delay of $25$ns? $1$ MHz $10$ MHz $100$ MHz $4$ MHz
answered Jun 7 in Others Mohit Kumar 6 39 views
2 votes
6 answers
23
UGCNET-DEC2016-III: 26
Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milliseconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is ______ 20 10 30 40
Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milliseconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is ______ 20 10 30 40
answered Jun 5 in Others meetesh06 4k views
0 votes
2 answers
24
NIELIT 2016 MAR Scientist C - Section C: 26
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms
answered Jun 4 in Others Ollie 54 views
0 votes
1 answer
25
UGCNET-Dec2005-II: 33
A general macroprocessor is an in built function of : Loader Linker Editor Assembler
A general macroprocessor is an in built function of : Loader Linker Editor Assembler
answered Jun 4 in Others Mohit Kumar 6 24 views
0 votes
1 answer
26
UGCNET-June2007-II: 29
What services does the Internet Layer provide? Quality of service Routing Addressing Connection-oriented delivery Framming bits $1,2,3$ $2,3,4$ $1,3,4,5$ $2,3,4,5$
What services does the Internet Layer provide? Quality of service Routing Addressing Connection-oriented delivery Framming bits $1,2,3$ $2,3,4$ $1,3,4,5$ $2,3,4,5$
answered Jun 3 in Others Mohit Kumar 6 19 views
0 votes
1 answer
27
UGCNET-June2006-II: 43
In a good software design, ____coupling is desirable between modules. Highest Lowest Internal External
In a good software design, ____coupling is desirable between modules. Highest Lowest Internal External
answered Jun 3 in Others Mohit Kumar 6 21 views
0 votes
1 answer
28
UGCNET-June2007-II: 43
Match the following: ...
Match the following: $\begin{array}{ll} \\ \text{(a) Unit test} & \text{(i) Requirements} \\ \text{(b)System test} & \text{(ii) Design} \\ \text{(c) Validation test} & \text{(iii) Code} \\ \text{(d) Integration test} & \text{(iv) System Engineering} \end{array}$ ...
answered Jun 1 in Others Mohit Kumar 6 29 views
0 votes
1 answer
29
UGCNET-June2007-II: 40
Cache memory is: High-Speed Register Low-Speed RAM Non-Volatile RAM High-speed RAM
Cache memory is: High-Speed Register Low-Speed RAM Non-Volatile RAM High-speed RAM
answered Jun 1 in Others Mohit Kumar 6 24 views
0 votes
2 answers
30
NIELIT 2016 MAR Scientist C - Section C: 6
Memory mapped displays are utilized for high resolution graphics such as maps uses ordinary memory to store the display data in character form stores the display data as individual bits are associated with electromechanical teleprinters
Memory mapped displays are utilized for high resolution graphics such as maps uses ordinary memory to store the display data in character form stores the display data as individual bits are associated with electromechanical teleprinters
answered May 30 in Others DIBAKAR MAJEE 69 views
0 votes
2 answers
31
NIELIT 2016 MAR Scientist C - Section C: 63
The range of the numbers which can be stored in an eight bit register is $-128$ to $+127$ $-128$ to $+128$ $-999999+ \: +999999$ none of these
The range of the numbers which can be stored in an eight bit register is $-128$ to $+127$ $-128$ to $+128$ $-999999+ \: +999999$ none of these
answered May 30 in Others DIBAKAR MAJEE 33 views
0 votes
2 answers
32
NIELIT 2016 MAR Scientist C - Section C: 64
How many flip-flop are needed to divide the input frequency by $64$? $4$ $5$ $6$ $8$
How many flip-flop are needed to divide the input frequency by $64$? $4$ $5$ $6$ $8$
answered May 30 in Others DIBAKAR MAJEE 44 views
0 votes
2 answers
33
NIELIT 2016 MAR Scientist C - Section C: 65
In propositional logic, which of the following is equivalent to $p \rightarrow q$? $\sim p\rightarrow q$ $ \sim p \vee q$ $ \sim p \vee \sim q$ $p\rightarrow \sim q$
In propositional logic, which of the following is equivalent to $p \rightarrow q$? $\sim p\rightarrow q$ $ \sim p \vee q$ $ \sim p \vee \sim q$ $p\rightarrow \sim q$
answered May 30 in Others DIBAKAR MAJEE 58 views
0 votes
1 answer
34
NIELIT 2016 MAR Scientist B - Section C: 40
In a relational Schema, each tuple is divided into fields called relations domains queries none of these
In a relational Schema, each tuple is divided into fields called relations domains queries none of these
answered May 27 in Others Mohit Kumar 6 35 views
0 votes
1 answer
35
NIELIT 2016 MAR Scientist B - Section C: 30
Bounded minimalization is a technique for proving whether a promotive recursive function is turning computable or not proving whether a primitive recursive function is a total function or not generating primitive recursive functions generating partial recursive functions
Bounded minimalization is a technique for proving whether a promotive recursive function is turning computable or not proving whether a primitive recursive function is a total function or not generating primitive recursive functions generating partial recursive functions
answered May 27 in Others Mohit Kumar 6 58 views
0 votes
1 answer
36
NIELIT 2016 DEC Scientist B (CS) - Section B: 39
External Interrupt may not arise because of illegal or erroneous use of an instruction. a timing device. external source. I/O devices.
External Interrupt may not arise because of illegal or erroneous use of an instruction. a timing device. external source. I/O devices.
answered May 25 in Others Mohit Kumar 6 35 views
0 votes
1 answer
37
NIELIT 2016 DEC Scientist B (CS) - Section B: 17
$T1$ carrier system is used: For delta modulation Industrial noise For frequency modulated signals None of the above
$T1$ carrier system is used: For delta modulation Industrial noise For frequency modulated signals None of the above
answered May 25 in Others Mohit Kumar 6 27 views
0 votes
2 answers
38
UGCNET-Jan2017-II: 1
Consider a sequence $F_{00}$ defined as : $F_{00}\left ( 0 \right )= 1, F_{00}\left ( 1 \right )= 1\\$ $F_{00}\left ( n \right )= \frac{10 * F_{00}\left ( n-1 \right )+100}{F_{00}\left ( n-2 \right )} \text{ for }n\geq 2 \\$ Then what shall be the set ... $\left ( 1,110, 600,1200 \right )$ $\left ( 1, 2, 55, 110, 600, 1200 \right )$ $\left ( 1, 55, 110, 600, 1200 \right )$
Consider a sequence $F_{00}$ defined as : $F_{00}\left ( 0 \right )= 1, F_{00}\left ( 1 \right )= 1\\$ $F_{00}\left ( n \right )= \frac{10 * F_{00}\left ( n-1 \right )+100}{F_{00}\left ( n-2 \right )} \text{ for }n\geq 2 \\$ Then what shall be the set of values of ... $\left ( 1,110, 600,1200 \right )$ $\left ( 1, 2, 55, 110, 600, 1200 \right )$ $\left ( 1, 55, 110, 600, 1200 \right )$
answered May 24 in Others Mohit Kumar 6 76 views
0 votes
1 answer
39
NIELIT 2016 MAR Scientist C - Section C: 48
In a microprocessor, WAIT states are used to make the processor wait during a DMA operation make the processor wait during a power interrupt processing make the processor wait during a power shutdown interface slow peripherals to the processor
In a microprocessor, WAIT states are used to make the processor wait during a DMA operation make the processor wait during a power interrupt processing make the processor wait during a power shutdown interface slow peripherals to the processor
answered May 19 in Others Mohit Kumar 6 29 views
0 votes
3 answers
40
NIELIT 2017 DEC Scientist B - Section B: 38
Which of the following is false? The smallest and fastest computer imitating brain working is called quantum computer. A computer with a speed of around $100$ million instructions per second with the word length of around $64$ bits is known as super computer. The term Exa-byte $= 1024$ Tera Bytes. None of the options.
Which of the following is false? The smallest and fastest computer imitating brain working is called quantum computer. A computer with a speed of around $100$ million instructions per second with the word length of around $64$ bits is known as super computer. The term Exa-byte $= 1024$ Tera Bytes. None of the options.
answered May 19 in Others Hradesh patel 78 views
To see more, click for all the questions in this category.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...