Ques # :100 Match List I with List II and select the correct answer using the codes given below the list : List I A. Television B. Radio C. Radar D. Data communication List II 1. Either AM or FM used 2. Both AM and FM are used 3. PCM is used 4. Digital system 1) A(2) B(1) C (1) D (2) 2) A(2) B(1) C (3) D (4) 3) A(4) B(1) C (3) D (2) 4) A(2) B(3) C (1) D (4)
Asked in RPSC Vice Principal/Superintendent ITI Screening Test 2012 VPITI-Electronic-and-Communications
Show answer
Answer: B. A(2) B(1) C (3) D (4)
More RPSC Prelims previous year questions questions
- Full adder can be implemented by using :-
- In the following truth table, V = 1 if and only if the input is valid. | Inputs | | | | Outputs | | | |---|---|---|---|---|---|---| | D0 | D1 | D2 | D3 | X0 | X1 | V | | 0 | 0 | 0 | 0 | x | x | 0 | | 1 | 0 | 0 | 0 | 0 | 0 | 1 | | x | 1 | 0 | 0 | 0 | 1 | 1 | | x | x | 1 | 0 | 1 | 0 | 1 | | x | x | x | 1 | 1 | 1 | 1 | What function does the truth table represent?
- Consider the following combinational function block involving four Boolean variables x, y, a, b, where x, a, b are inputs and y is the output. f (x, y, a, b) { if (x is 1) y = a; else y = b; } Which one of the following digital logic blocks is the most suitable for implementing this function?
- The decoded instruction is stored in ______ .
- (A’ + C) (A’ + C’) (A’ + B + C’D) is independent of
- Consider a 4-way set associative cache consisting of 128 lines with a line size of 64 words. The CPU generates a 20-bit address of a word in main memory. The number of bits in the TAG, LINE and WORD fields are respectively :-
- Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively:
- A CPU has a five-stage pipeline and runs at 1 GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the target address and evaluates the condition in the third stage of the pipeline. The processor stops fetching new instructions following a conditional branch until the branch outcome is known. A program executes 10^9 instructions out of which 20% are conditional branches. If each instruction takes one cycle to complete on average, the total execution time of the program is: