#1
8th November 2014, 04:22 PM
| |||
| |||
DRDO STA B ECE Solved paper
I need DRDO STA B ECE Solved model question paper, will you please provide here???
|
#2
10th November 2014, 09:45 AM
| |||
| |||
Re: DRDO STA B ECE Solved paper
You are looking for DRDO STA B (Electronics and Communication Engineering) question paper I am giving here: If a graph requires k different colours for its proper colouring, then the chromatic number of the graph is a) 1 b) k c) k-1 d) k/2 Ans. A read bit can be read a) and written by CPU b) and written by peripheral c) by pheripheral and written by CPU d) by CPU and written by the peripheral Ans. The term “aging” refers to a) booting up the priority of a process in multi-level of queue without feedback. b) gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking. c) keeping track of the following a page has been in memory for the purpose of LRU replacement d) letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately. Consider a set of n tasks with known runtimes r1, r2 ....... r to be run on a unlprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? a) Round Robin b) Shortest job first c) Highest response ratio next d) first cum first served The principal of locality of reference justifies the use of a) virtual memory b) interrupts c) main memory d) cache memory What is the value of I at the end of the pseudocode? a) 4 b) 5 c) 6 d) 7 The five items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element Is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is (a) A (b) B (c) C (d) D Round Robin scheduling is essentially the pre-emptive version of a) FIFO b) Shortest Job First c) shortest remaining time d) Longest remaining time The number of digit I present in the binary representation of 3 x 512 +7 x 64 + 5 x 8 +3 is (a) 8 (b) 9 (c) 1O (d) 12 Assume that each character code consists of 8 bits. The number of characters that can be transmitted per second through an synchronous serial line at 2400 baud rate, and with two stop bits is (a)109 (b)216 (c) 218 (d)219 If the bandwidth of a signal is 5 kHz and the lowest frequency is 52 kHz, what is the highest frequency? (a) 5 kHz (b) 10 kHz (C) 47 kHz (d) 57 kHz An Ethernet hub (a) functions as a repeater (b) connects to a digital PBX (c) connects to a token-ring network (d) functions as a gateway Phase transition for each bit are used in (a) Amplitude modulation (b) Carrier modulation (C) Manchester encoding (d) NRZ encoding Which of the following is printed as a result of the call demo (1234)? a) 1441 b) 3443 C) 12344321 d) 43211234 Bit stuffing refers to (a) inserting a ‘0’ in user stream to differentiate it with a flag (b) inserting a ‘0’ in flag stream to avoid ambiguity (C) appending a nibble to the flag sequence (d ) appending a nibble to the use data stream What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them? (a) Partitioning (b) Multi tasking (C) Windowing (d) Paging If there are five routers and six networks in an intranet using link state routing, how many routing tables are there? (a) 1 (b) 5 (c) 6 (d) 11 Virtual memory is a) Part of Main Memory only used for swapping b) A technique to allow a program, of size more than the size of the main memory, town C) Part of secondary storage used in program execution d) None of these The level of aggregation of information required for operational control is (a) Detailed (b) Aggregate (C) Qualitative (d) None of the above 0.75 in decimal system is equivalent to _______ in octal system a) 0.60 b) 0.52 C) 0.54 d) 0.50 In an SR latch made by cross coupling two NAND gates, if both S and R inputs are set to 0, then it will result in a) Q= 0, QO = 1 b) Q= 1,Q0 = 0 c) Q= 1,Q0 = 1 d) Indeterminate states Company X shipped 5 computer chips, I of which was defective, and Company Y shipped 4 computer chips, 2 of which were defective. One computer chip is to be chosen uniformly at random from the 9 chips shipped by the companies. If the chosen chip is found to be defective, what is the probability that the chip came from Company Y? a) 2/9 b) 4/9 c) 2/3 d) 1/2 Ring counter is analogous to (a) Toggle Switch (b) Latch (C) Stepping Switch (d) S-R flip flop The output 0 and I level for TTL Logic family is approximately a) 0.1 and5 V b) 0.6 and 3.5 V C) 0.9 and 1.75 V d) —i.75 and O.9 V In comparison with static RAM memory, the dynamic RAM memory has a) lower bit density and higher power consumption b) higher bit density and higher power consumption C) lower bit density and lower power consumption d) higher bit density and lower power consumption. The Hexadecimal equivalent of 01111100110111100011 is (a) CD73E (b) ABD3F (c) 7CDE3 (d) FA4CD Disk requests are received by a disk drive for cylinder 5, 25, 18, 3, 39, 8 and 35 in that order. A seek takes 5 msec per cylinder moved. How much seek time is needed to serve these requests for a Shortest Seek First (SSF) algorithm? Assume that the arm is at cylinder ?,0 when the last of these requests is made with none of the requests yet served a) 125 msec b) 295 msec c) 575 msec d) 750 msec Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A,B,C which have peak time demands of 3,4,6 respectively. The minimum value of ‘m’ that ensures that deadlock will never occur is (a) 11 (b) 12 (c) 13 (d) 14 |
#3
7th January 2015, 10:32 AM
| |||
| |||
Re: DRDO STA B ECE Solved paper
I need DRDO STA B ECE Solved model question paper, will you please provide here??
|