Option A. Bus network Option B. Star network Option C. Ring network Option D. None of the above True Answer B
Match the following according to input (from the left column) to the complier phase (in the right column) that processes it.
Option A. P-(ii), Q-(iii), R-(iv), S-(i) Option B. P-(ii), Q-(i), R-(iii), S-(iv) Option C. P-(iii), Q-(iv), R-(i), S-(ii) Option D. P-(i), Q-(iv), R-(ii), S-(iii) True Answer C
Option A. TRUE Option B. FALSE Option C. Option D. True Answer B
Option A. Information handling Option B. Data sharing Option C. Data distribution Option D. Data processing True Answer D
Data processing is, generally, "the collection and manipulation of items of data to produce meaningful information."
Option A. Correct Option B. Always Correct Option C. Add to Dictionary Option D. Correct All True Answer D
Option A. Ctrl + 1 Option B. Ctrl + 2 Option C. Ctrl + 3 Option D. None True Answer B
Option A. TRUE Option B. FALSE Option C. Option D. True Answer A
Option A. 20th January, 1950 Option B. 24th January, 1950 Option C. 21st May, 1949 Option D. 13th November, 1949 True Answer B
Option A. DVU Option B. VDU Option C. UVD Option D. CCTV True Answer B
VDU stand for Visual Display Unit which is nick name of Monitor
Option A. 5+(int)(Math.random()*6) Option B. 5+(int)(Math.random()*10) Option C. 5+Math.random()*6 Option D. 5+Math.random()*10 True Answer A
What will be the output of the following Python code snippet?
test = {1:'A', 2:'B', 3:'C'} del test[1] test[1] = 'D' del test[2] print(len(test))
Option A. 0 Option B. 2 Option C. Error as the key-value pair of 1:’A’ is already deleted Option D. 1 True Answer B
Option A. Quick Response code Option B. Quick Result code Option C. Quick Restore Option D. None of above True Answer A
Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size (r(R)) < size (s(S)), the join will have fewer number of disk block accesses if
Option A. relation r(R) is in the outer loop. Option B. relation s(S) is in the outer loop. Option C. join selection factor between r(R) and s(S) is more than 0.5 Option D. join selection factor between r(R) and s(S) is less than 0.5 True Answer A
A join between r(R) and s (S) using nested loop method will be as follows. For each tuple r in R do For each tuple s in S do If r and s satisfy the join condition then output the tuple <r,s> This algorithm will involve block transfers and seeks, where and are number of blocks in relations R and S respectively and nr is number of tuple in relation R. Now to have less block accesses, should be less and it is already given that |R|<|S|. Relation r(R) should be in the outer loop to have fewer number of disk block accesses.
Option A. MIME to attach EDI forms to e-mail messages Option B. FTP to send business forms Option C. HTTP to send business forms Option D. SGML to send business forms True Answer A
Option A. Not be cancelled Option B. Be cancelled Option C. Not be changed Option D. None of above True Answer B
Option A. Range Option B. Scenario Option C. rend line Option D. What-if analysis True Answer B
Option A. Class Option B. Object Option C. Method Option D. None of these True Answer A