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

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions

0 votes
1 answer
1
UGCNET-Oct2020-II: 1
The number of positive integers not exceeding $100$ that are either odd or the square of an integer is _______ $63$ $59$ $55$ $50$
The number of positive integers not exceeding $100$ that are either odd or the square of an integer is _______ $63$ $59$ $55$ $50$
asked Nov 20 in Set Theory & Algebra jothee 106 views
0 votes
1 answer
2
UGCNET-Oct2020-II: 2
How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books? $4$ $6$ $7$ $9$
How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books? $4$ $6$ $7$ $9$
asked Nov 20 in Combinatory jothee 50 views
0 votes
1 answer
3
UGCNET-Oct2020-II: 3
Which of the following pairs of propositions are not logically equivalent? $((p \rightarrow r) \wedge (q \rightarrow r))$ and $((p \vee q) \rightarrow r)$ $p \leftrightarrow q$ and $(\neg p \leftrightarrow \neg q)$ $((p \wedge q) \vee (\neg p \wedge \neg q))$ and $p \leftrightarrow q$ $((p \wedge q) \rightarrow r)$ and $((p \rightarrow r) \wedge (q \rightarrow r))$
Which of the following pairs of propositions are not logically equivalent? $((p \rightarrow r) \wedge (q \rightarrow r))$ and $((p \vee q) \rightarrow r)$ $p \leftrightarrow q$ and $(\neg p \leftrightarrow \neg q)$ $((p \wedge q) \vee (\neg p \wedge \neg q))$ and $p \leftrightarrow q$ $((p \wedge q) \rightarrow r)$ and $((p \rightarrow r) \wedge (q \rightarrow r))$
asked Nov 20 in Discrete Mathematics jothee 44 views
0 votes
1 answer
4
UGCNET-Oct2020-II: 4
Consider the following linear programming (LP): $\begin{array}{ll} \text{Max.} & z=2x_1+3x_2 \\ \text{Such that} & 2x_1+x_2 \leq 4 \\ & x_1 + 2x_2 \leq 5 \\ & x_1, x_2 \geq 0 \end{array}$ The optimum value of the LP is $23$ $9.5$ $13$ $8$
Consider the following linear programming (LP): $\begin{array}{ll} \text{Max.} & z=2x_1+3x_2 \\ \text{Such that} & 2x_1+x_2 \leq 4 \\ & x_1 + 2x_2 \leq 5 \\ & x_1, x_2 \geq 0 \end{array}$ The optimum value of the LP is $23$ $9.5$ $13$ $8$
asked Nov 20 in Optimization jothee 46 views
1 vote
1 answer
5
UGCNET-Oct2020-II: 5
Consider a machine with a byte addressable main memory of $2^{16}$ bytes block size of $8$ bytes. Assume that a direct mapped cache consisting of $32$ lines used with this machine. How many bits will be there in Tag, line and word field of format of main memory addresses? $8,5,3$ $8,6,2$ $7,5,4$ $7,6,3$
Consider a machine with a byte addressable main memory of $2^{16}$ bytes block size of $8$ bytes. Assume that a direct mapped cache consisting of $32$ lines used with this machine. How many bits will be there in Tag, line and word field of format of main memory addresses? $8,5,3$ $8,6,2$ $7,5,4$ $7,6,3$
asked Nov 20 in CO and Architecture jothee 40 views
0 votes
1 answer
6
UGCNET-Oct2020-II: 6
The following program is stored in memory unit of the basic computer. What is the content of the accumulator after the execution of program? (All location numbers listed below are in hexadecimal). ... $1002\text{H}$ $2011\text{H}$ $2022\text{H}$ $0215\text{H}$
The following program is stored in memory unit of the basic computer. What is the content of the accumulator after the execution of program? (All location numbers listed below are in hexadecimal). ... $1002\text{H}$ $2011\text{H}$ $2022\text{H}$ $0215\text{H}$
asked Nov 20 in CO and Architecture jothee 33 views
0 votes
1 answer
7
UGCNET-Oct2020-II: 7
A non-pipeline system takes $50$ns to process a task. The same task can be processed in six-segment pipeline with a clockcycle of $10$ns. Determine approximately the speedup ratio of the pipeline for $500$ tasks. $6$ $4.95$ $5.7$ $5.5$
A non-pipeline system takes $50$ns to process a task. The same task can be processed in six-segment pipeline with a clockcycle of $10$ns. Determine approximately the speedup ratio of the pipeline for $500$ tasks. $6$ $4.95$ $5.7$ $5.5$
asked Nov 20 in CO and Architecture jothee 27 views
0 votes
1 answer
8
UGCNET-Oct2020-II: 8
What is the radix of the numbers if the solution to the quadratic equation $x^2-10x+26=0$ is $x=4$ and $x=7$? $8$ $9$ $10$ $11$
What is the radix of the numbers if the solution to the quadratic equation $x^2-10x+26=0$ is $x=4$ and $x=7$? $8$ $9$ $10$ $11$
asked Nov 20 in Numerical Ability jothee 34 views
0 votes
1 answer
9
UGCNET-Oct2020-II: 9
Consider the following pseudo-code fragment, where $a$ and $b$ are integer variables that have been initialized: /* Pre-conditions : $(a > 1 \wedge a < b)$ */ /* Assume that overflow never occurs */ int $x=0$; int $p=1$; while $(p<b) \{$ $p=p*a$ ... $\lfloor \: \: \rfloor$ means floor */ $\lfloor \log_a^b \rfloor$ /* $\lceil \: \: \rceil$ means ceil */
Consider the following pseudo-code fragment, where $a$ and $b$ are integer variables that have been initialized: /* Pre-conditions : $(a > 1 \wedge a < b)$ */ /* Assume that overflow never occurs */ int $x=0$; int $p=1$; while $(p<b) \{$ $p=p*a$; $x=x+1$; $\}$ ... $\lfloor \: \: \rfloor$ means floor */ $\lfloor \log_a^b \rfloor$ /* $\lceil \: \: \rceil$ means ceil */
asked Nov 20 in Programming and DS jothee 33 views
0 votes
0 answers
10
UGCNET-Oct2020-II: 10
In HTML, $<\text{map}>$ tag is used for defining a path between two nodes in an image defining clickable region in an image highlighting an area in an image defining the site-map of a web-site
In HTML, $<\text{map}>$ tag is used for defining a path between two nodes in an image defining clickable region in an image highlighting an area in an image defining the site-map of a web-site
asked Nov 20 in Web Technologies jothee 18 views
1 vote
0 answers
11
UGCNET-Oct2020-II: 11
Suppose you are compiling on a machine with $1$-byte chars, $2$-byte shorts, $4$-byte ints, and $8$-byte doubles, and with alignment rules that require the address of every primitive data element to be an integer multiple of the element's size. Suppose further that the ... r; int i; } A[10]; /*10 element array of structs */ $150$ bytes $320$ bytes $240$ bytes $200$ bytes
Suppose you are compiling on a machine with $1$-byte chars, $2$-byte shorts, $4$-byte ints, and $8$-byte doubles, and with alignment rules that require the address of every primitive data element to be an integer multiple of the element's size. Suppose further that the compiler is not ... ; double r; int i; } A[10]; /*10 element array of structs */ $150$ bytes $320$ bytes $240$ bytes $200$ bytes
asked Nov 20 in Programming and DS jothee 25 views
0 votes
0 answers
12
UGCNET-Oct2020-II: 12
Consider the following recursive Java function $f$ that takes two long arguments and returns a float value: public static float f (long m, long n) { float result = (float)m / (float)n; if (m < 0 ¦ n<0 return 0.0f; else result -=f(m*2, n*3); return result; } Which of the following real values best approximates the value of $f(1,3)$? $0.2$ $0.4$ $0.6$ $0.8$
Consider the following recursive Java function $f$ that takes two long arguments and returns a float value: public static float f (long m, long n) { float result = (float)m / (float)n; if (m < 0 ¦ n<0 return 0.0f; else result -=f(m*2, n*3); return result; } Which of the following real values best approximates the value of $f(1,3)$? $0.2$ $0.4$ $0.6$ $0.8$
asked Nov 20 in Object Oriented Programming jothee 14 views
0 votes
0 answers
13
UGCNET-Oct2020-II: 13
The data node and name node in HADOOP are Worker Node and Master Node respectively Master Node and Worker Node respectively Both Worker Nodes Both Master Nodes
The data node and name node in HADOOP are Worker Node and Master Node respectively Master Node and Worker Node respectively Both Worker Nodes Both Master Nodes
asked Nov 20 in Big Data Systems jothee 15 views
0 votes
1 answer
14
UGCNET-Oct2020-II: 14
Consider a relational schema $S=(U,V,W,X,Y,Z)$ on which the following functional dependencies hold: $(U \rightarrow V, VW \rightarrow X, Y \rightarrow W, X \rightarrow U)$ Which are the candidate keys among following options? $UY, VY$ $UY, VY, XY$ $UYZ, VYZ, VWZ$ $UYZ, VYZ, XYZ$
Consider a relational schema $S=(U,V,W,X,Y,Z)$ on which the following functional dependencies hold: $(U \rightarrow V, VW \rightarrow X, Y \rightarrow W, X \rightarrow U)$ Which are the candidate keys among following options? $UY, VY$ $UY, VY, XY$ $UYZ, VYZ, VWZ$ $UYZ, VYZ, XYZ$
asked Nov 20 in Databases jothee 27 views
0 votes
1 answer
15
UGCNET-Oct2020-II: 15
Consider a hypothetical machine with $3$ pages of physical memory, $5$ pages of virtual memory, and $<A, B, C, D, A, B, E, A, B, C, D, E, B, A, B>$ as the stream of page reference by an application. If $P$ and $Q$ are the number of page faults that ... , then $(P,Q)=$ _______(Assuming enough space for storing $3$ page frames) $(11,10)$ $(12,11)$ $(10,11)$ $(11,12)$
Consider a hypothetical machine with $3$ pages of physical memory, $5$ pages of virtual memory, and $<A, B, C, D, A, B, E, A, B, C, D, E, B, A, B>$ as the stream of page reference by an application. If $P$ and $Q$ are the number of page faults that the application ... respectively, then $(P,Q)=$ _______(Assuming enough space for storing $3$ page frames) $(11,10)$ $(12,11)$ $(10,11)$ $(11,12)$
asked Nov 20 in Operating System jothee 26 views
0 votes
1 answer
16
UGCNET-Oct2020-II: 16
Consider a disk system having $60$ cylinders. Disk requests are received by a disk drive for cylinders $10,22,20,2,40,6$ and $38$, in that order. Assuming the disk head is currently at cylinder $20$, what is the time taken to ... adjacent one and Shortest Seek Time First (SSTF) algorithm is used? $240$ milliseconds $96$ milliseconds $120$ milliseconds $112$ milliseconds
Consider a disk system having $60$ cylinders. Disk requests are received by a disk drive for cylinders $10,22,20,2,40,6$ and $38$, in that order. Assuming the disk head is currently at cylinder $20$, what is the time taken to satisfy all the ... cylinder to adjacent one and Shortest Seek Time First (SSTF) algorithm is used? $240$ milliseconds $96$ milliseconds $120$ milliseconds $112$ milliseconds
asked Nov 20 in Operating System jothee 16 views
0 votes
0 answers
17
UGCNET-Oct2020-II: 17
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
asked Nov 20 in Operating System jothee 15 views
0 votes
1 answer
18
UGCNET-Oct2020-II: 18
Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is $80\%$, and it takes $15$ nanoseconds to search the $TLB$, and $150$ nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds? $185$ $195$ $205$ $175$
Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is $80\%$, and it takes $15$ nanoseconds to search the $TLB$, and $150$ nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds? $185$ $195$ $205$ $175$
asked Nov 20 in Operating System jothee 18 views
0 votes
0 answers
19
UGCNET-Oct2020-II: 19
Which of the following $UML$ diagrams has a static view? Collaboration diagram Use-Case diagram State chart diagram Activity diagram
Which of the following $UML$ diagrams has a static view? Collaboration diagram Use-Case diagram State chart diagram Activity diagram
asked Nov 20 in IS&Software Engineering jothee 14 views
0 votes
0 answers
20
UGCNET-Oct2020-II: 20
Modifying the software by restructuring is called Adaptive maintenance Corrective maintenance Perfective maintenance Preventive maintenance
Modifying the software by restructuring is called Adaptive maintenance Corrective maintenance Perfective maintenance Preventive maintenance
asked Nov 20 in IS&Software Engineering jothee 23 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...