Question Paper Name: 890 Computer and Systems Sciences 890 29th May Shift2 Set1
Subject Name: Computer & Systems Sciences 890
Creation Date: 2019-05-29 19:31:02
--- Content provided by FirstRanker.com ---
Duration: 180
Total Marks: 100
Display Marks: Yes
Share Answer Key With Delivery Engine: Yes
Actual Answer Key: Yes
--- Content provided by FirstRanker.com ---
Computer & Systems Sciences 890
Group Number: 1
Group Id: 128206177
Group Maximum Duration: 0
Group Minimum Duration: 120
--- Content provided by FirstRanker.com ---
Revisit allowed for view?: No
Revisit allowed for edit?: No
Break time: 0
Group Marks: 100
PART A
--- Content provided by FirstRanker.com ---
Section Id: 128206-09
Section Number: 1
Section type: Online
Mandatory or Optional: Mandatory
Number of Questions: 50
--- Content provided by FirstRanker.com ---
Number of Questions to be attempted: 50
Section Marks: 100
Display Number Panel: Yes
Group All Questions: No
Sub-Section Number: 1
--- Content provided by FirstRanker.com ---
Sub-Section Id: 128206468
Question Shuffling Allowed: Yes
Question Number : 1 Question Id : 12820610265 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
In a monitored container, each of which has an 80 percent chance of arriving undamaged. If the monitor control is done with a data link protocol, how many times must a message be sent on average to get the entire thing through (in transmissions)?
--- Content provided by FirstRanker.com ---
(a) 18.6
(b) 27.9
(c) 9.3
(d) None of the above
Options:
--- Content provided by FirstRanker.com ---
12820640579. A
12820640580. B
12820640581. C
12820640582. D
Question Number : 2 Question Id : 12820610266 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
--- Content provided by FirstRanker.com ---
Correct Marks : 2 Wrong Marks : 0
Consider building a CSMA/CD network running at 1 Gbps over a 1-km cable with no repeaters. The signal speed in the cable is 200,000 km/sec. What is the minimum frame size?
(a) 10000 bytes
(b) 100000 bits
(c) 1250 bits
--- Content provided by FirstRanker.com ---
(d) None of the above
Options:
12820640583. A
12820640584. B
12820640585. C
--- Content provided by FirstRanker.com ---
12820640586. D
Question Number : 3 Question Id : 12820610267 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
If two communicating stations X and Y are linked through two intermediate routers, r1 and r2; then determine the number of times each packet visits Network Layer (NL) and Data Link Layer (DLL) for single transmission from X to Y.
(a) NL-4, DLL - 4
--- Content provided by FirstRanker.com ---
(b) NL-4, DLL - 3
(c) NL-4, DLL - 6
(d) NL - 2, DLL - 6
Options:
12820640587. A
--- Content provided by FirstRanker.com ---
12820640588. B
12820640589. C
12820640590. D
Question Number : 4 Question Id : 12820610268 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
--- Content provided by FirstRanker.com ---
To deliver a message to the correct application program running on a host, the address must be consulted is
(a) port
(b) physical
(c) IP
(d) None
--- Content provided by FirstRanker.com ---
Options:
12820640591. A
12820640592. B
12820640593. C
12820640594. D
--- Content provided by FirstRanker.com ---
Question Number : 5 Question Id : 12820610269 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
Manchester encoding is principally designed to
(a) ensure that the line remains unbalanced.
(b) have more than one symbol per bit period.
--- Content provided by FirstRanker.com ---
(c) increase the bandwidth of a signal transmitted on the medium
(d) ensure that a transition occurs in the center of each bit period.
Options:
12820640595. A
12820640596. B
--- Content provided by FirstRanker.com ---
12820640597. C
12820640598. D
Question Number : 6 Question Id : 12820610270 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
The concept of pipelining is most effective in improving performance if the tasks being performed in different stages:
--- Content provided by FirstRanker.com ---
(a) require different amount of time
(b) require about the same amount of time
(c) require different amount of time with time difference between any two tasks being same
(d) require different amount of time with time difference between any two tasks being different
Options:
--- Content provided by FirstRanker.com ---
12820640599. A
12820640600. B
12820640601. C
12820640602. D
Question Number : 7 Question Id : 12820610271 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
--- Content provided by FirstRanker.com ---
Correct Marks : 2 Wrong Marks : 0
In some number system x. The base x of that number system is
(a) 2
(b) 8
(c) 10
--- Content provided by FirstRanker.com ---
(d) None of the above
Options:
12820640603. A
12820640604. B
12820640605. C
--- Content provided by FirstRanker.com ---
12820640606. D
Question Number : 8 Question Id : 12820610272 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
Which of the following is not functionally a complete set?
(a) AND, OR
--- Content provided by FirstRanker.com ---
(b) NOR
(c) NAND
(d) AND, OR, NOT
Options:
12820640607. A
--- Content provided by FirstRanker.com ---
12820640608. B
12820640609. C
12820640610. D
Question Number : 9 Question Id : 12820610273 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
--- Content provided by FirstRanker.com ---
Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that 70% of the processor's read requests result in a cache hit. The average read access time in nanoseconds is
(a) 10
(b) 12
(c) 13
(d) 18.5
--- Content provided by FirstRanker.com ---
Options:
12820640611. A
12820640612. B
12820640613. C
12820640614. D
--- Content provided by FirstRanker.com ---
Question Number : 10 Question Id : 12820610274 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
The simplified form of the following Boolean expression is [D'+ AB' + A'C' + AC'D']
(a) 1
(b) 46
--- Content provided by FirstRanker.com ---
(c) 56
(d) 76
Options:
12820640615. A
12820640616. B
--- Content provided by FirstRanker.com ---
12820640617. C
12820640618. D
Question Number : 11 Question Id : 12820610275 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ratio:
--- Content provided by FirstRanker.com ---
(a) S = n Tn/(k + n - 1) Tp
(b) S = n Tn/(k + n + 1) Tp
(c) S = n Tn/(k- n + 1) Tp
(d) S = (k + n - 1) Tp/n Tn
where n? no. Of tasks, Tn time of completion of each task, k? no. Of segments of pipeline, Tp? clock cycle time, S? speed up ratio.
--- Content provided by FirstRanker.com ---
Options:
12820640619. A
12820640620. B
12820640621. C
12820640622. D
--- Content provided by FirstRanker.com ---
Question Number : 12 Question Id : 12820610276 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
Consider a system running ten I/O -bound tasks and one CPU -bound task. Assume that the I/O -bound tasks issue an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also assume that the context switching overhead is 0.1 millisecond and that all processes are long-running tasks. The CPU utilization for a round-robin scheduler when the time quantum is 1 millisecond?
(a) 78%
(b) 91%
--- Content provided by FirstRanker.com ---
(c) 98%
(d) 80%
Options:
12820640623. A
Question Number : 13 Question Id : 12820610277 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
--- Content provided by FirstRanker.com ---
Correct Marks : 2 Wrong Marks : 0
Assume we have a demand-paged memory. The page table is held in registers. It takes 8 milliseconds to service a page fault if an empty page is available or the replaced page is not modified, and 20 milliseconds if the replaced page is modified. Memory access time is 100 nanoseconds. Assume that the page to be replaced is modified 70 percent of the time. What is the maximum acceptable page-fault rate for an effective access time of no more than 200 nanoseconds?
(a) 0.0006
(b) 0.00006
(c) 0.006
--- Content provided by FirstRanker.com ---
(d) None of the above
Options:
12820640627. A
12820640628. B
12820640629. C
--- Content provided by FirstRanker.com ---
12820640630. D
Question Number : 14 Question Id : 12820610278 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
Which of the following scheduling algorithms could result in starvation?
(i) First-come, first-served
--- Content provided by FirstRanker.com ---
(ii) Shortest job first
(iii) Round robin
(iv) Priority
(a) ii and iv
(b) i and iii
--- Content provided by FirstRanker.com ---
(c) iv Only
(d) None of the above
Options:
12820640631. A
12820640632. B
--- Content provided by FirstRanker.com ---
12820640633. C
12820640634. D
Question Number : 15 Question Id : 12820610279 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
(a) A part of an operating system
--- Content provided by FirstRanker.com ---
(b) A specific memory location
(c) A single contiguous memory that was used in the olden days for running large program by swapping
(d) Overloading the system with many user files.
Options:
12820640635. A
--- Content provided by FirstRanker.com ---
12820640636. B
12820640637. C
12820640638. D
Question Number : 16 Question Id : 12820610280 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks: 2 Wrong Marks : 0
--- Content provided by FirstRanker.com ---
In which of the following directory system, it is possible to have multiple complete paths for a file, the starting from the root directory?
(a) Single level directory
(b) Two level directory
(c) Tree structured directory
(d) Acyclic graph directory
--- Content provided by FirstRanker.com ---
Options:
12820640639. A
12820640640. B
12820640641. C
12820640642. D
--- Content provided by FirstRanker.com ---
Question Number : 17 Question Id : 12820610281 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
A transparent DBMS
(a) Cannot hide sensitive information from users
(b) Keep its logical structure hidden from users
--- Content provided by FirstRanker.com ---
(c) Keeps its physical structure hidden from users
(d) Both (b) and (c)
Options:
12820640643. A
12820640644. B
--- Content provided by FirstRanker.com ---
12820640645. C
12820640646. D
Question Number : 18 Question Id : 12820610282 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
(a) Accessed by only one user
--- Content provided by FirstRanker.com ---
(b) Modified by users with the correct password
(c) Is used to hide sensitive information
(d) Both (b) and (c)
Options:
12820640647. A
--- Content provided by FirstRanker.com ---
12820640648. B
12820640649. C
12820640650. D
Question Number : 19 Question Id : 12820610283 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
--- Content provided by FirstRanker.com ---
Let F = {D ? AC, A?DB, B ? E, E ? D} that hold on the attribute set {A, B. C, D,E), then the highest normal form that hold is
(a) BCNF
(b) 3NF
(c) 2NF
(d) None of the above
--- Content provided by FirstRanker.com ---
Options:
12820640651. A
12820640652. B
12820640653. C
12820640654. D
--- Content provided by FirstRanker.com ---
Question Number : 20 Question Id : 12820610284 Question Type : MCQ Option Shuffling: No Display Question Number: Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
Which of the following statements are correct about an array?
1. The array int num[26]; can store 26 elements.
2. The expression num[1] designates the very first element in the array.
--- Content provided by FirstRanker.com ---
3. It is necessary to initialize the array at the time of declaration.
4. The declaration num[SIZE] is allowed if SIZE is a macro.
(a) 1
(b) 2,4
(c) 2,3
--- Content provided by FirstRanker.com ---
(d) 1,4
Options:
12820640655. A
12820640656. B
12820640657. C
--- Content provided by FirstRanker.com ---
12820640658. D
Question Number : 21 Question Id : 12820610285 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
int i=3;
i = i++;
--- Content provided by FirstRanker.com ---
printf("%d %d",i,i++);
(a) 34
(b) 43
(c) 44
(d) 33
--- Content provided by FirstRanker.com ---
Options:
12820640659. A
12820640660. B
12820640661. C
12820640662. D
--- Content provided by FirstRanker.com ---
Question Number : 22 Question Id : 12820610286 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks: 2 Wrong Marks : 0
The following program fragment
int a = 4, b = 6;
print ("%d", a == b);
--- Content provided by FirstRanker.com ---
(a) outputs an error message
(b) prints 0
(c) prints 1
(d) none of the above
Options:
--- Content provided by FirstRanker.com ---
12820640663. A
12820640664. B
12820640665. C
12820640666. D
Question Number : 23 Question Id : 12820610287 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
--- Content provided by FirstRanker.com ---
Correct Marks : 2 Wrong Marks : 0
float myFunc(float *array, int size)
{
float x =0;
if (size! = 0)
--- Content provided by FirstRanker.com ---
X = *array + myFunc(array+1, size-1);
return x;
}
void main ()
{
--- Content provided by FirstRanker.com ---
float array [5] = {0, 0.5, 1.0, 1.5, 2};
printf("%f\n",myFunc(array, 5));
}
What is the output of the program and how many times that the function "myFunc" is called?
(a) 3 and 6
--- Content provided by FirstRanker.com ---
(b) 5 and 5
(c) 5 and 6
(d) None of the above
Options:
12820640667. A
--- Content provided by FirstRanker.com ---
12820640668. B
12820640669. C
12820640670. D
Question Number : 24 Question Id : 12820610288 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
--- Content provided by FirstRanker.com ---
How many RAM chips of size (256K x 1 bit) are required to build 1 M byte memory?
(a) 8
(b) 10
(c) 32
(d) 24
--- Content provided by FirstRanker.com ---
Options:
12820640671. A
12820640672. B
12820640673. C
12820640674. D
--- Content provided by FirstRanker.com ---
Question Number : 25 Question Id : 12820610289 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
If a program has
(a) Many conditional jumps
(b) many unconditional jumps
--- Content provided by FirstRanker.com ---
(c) many operands
(d) all of these
Options:
12820640675. A
12820640676. B
--- Content provided by FirstRanker.com ---
12820640677. C
12820640678. D
Question Number : 26 Question Id : 12820610290 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks: 2 Wrong Marks : 0
The strategy by which algorithms are expressed in terms of general ideas, each of which can be further developed in general terms is called:
--- Content provided by FirstRanker.com ---
(a) Top-Down design
(b) Pseudo-coding
(c) Software engineering
(d) Bottom-Up design
Options:
--- Content provided by FirstRanker.com ---
12820640679. A
12820640680. B
12820640681. C
12820640682. D
Question Number : 27 Question Id : 12820610291 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
--- Content provided by FirstRanker.com ---
Correct Marks : 2 Wrong Marks : 0
What is the output of the following arithmetic expression?
5+3*2%10-8*6
(a) -37
(b) -42
--- Content provided by FirstRanker.com ---
(c) -32
(d) -28
Options:
12820640683. A
12820640684. B
--- Content provided by FirstRanker.com ---
12820640685. C
12820640686. D
Question Number : 28 Question Id : 12820610292 Question Type : MCQ Option Shuffling : No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
Correct Marks : 2 Wrong Marks : 0
The expected number of operations needed to examine all the edges terminated at a particular vertex given an adjacency matrix representation of a graph? (assume that the graph is a name graph and m edges terminate at the desired node.)
--- Content provided by FirstRanker.com ---
(a) O(m)
(b) O(n)
(c) O(m²)
(d) O(n²)
Options:
--- Content provided by FirstRanker.com ---
12820640687. A
12820640688. B
12820640689. C
12820640690. D
Question Number : 29 Question Id : 12820610293 Question Type : MCQ Option Shuffling: No Display Question Number : Yes Single Line Question Option : No Option Orientation : Vertical
--- Content provided by FirstRanker.com ---
Correct Marks : 2 Wrong Marks : 0
Which of the following circuit can be used as parallel to serial converter?
<This download link is referred from the post: JNU Last 10 Years 2011-2021 Previous Question Papers with Answers
--- Content provided by FirstRanker.com ---