Saturday, 15 October 2016

Computer Programmer - Engineering Colleges - Solved Paper 18.04.2015 - Part 3

41.       The ................. method provides a one-time session key for two parties.
(A) Diffie-Hellman       (B) Public key
(C) RSA                         (D) DES
Answer: A
42.       How many root element an XML document can have?
(A) Any number as required
(B) One
(C) Two
(D) Only limited by available memory
Answer: B
43.       Which of the following is a goal of data mining?
(A) To extract some observed event or condition
(B) To analyze data for expected relationships
(C) To create new database
(D) None of the above
Answer: A
44.       Critical path of the PERT chart is:
(A) Path which takes the longest time to complete the project
(B) Path which takes the shortest time to complete the project
(C) Path which takes the most appropriate time to complete the project
(D) None of the above
Answer: A
45.       The language used by end users and programmers to manipulate data in a database is:
(A) HTML           (B) DML
(C) XML             (D) GML
Answer: B
46.       Secret key encryption is also known as:
(A) Asymmetric encryption     (B) Symmetric key cryptography
(C) RSA                                     (D) USA
Answer: B
47.       What is a firewall?
(A) Boundary of a network
(B) A routing software
(C) Software to prevent unauthorized access
(D) A web browsing software
Answer: C
48.       Which normal form is based on multi-valued dependency?
(A) First              (B) Second
(C) Third            (D) Fourth
Answer: D
49.       mov ax, bx. Which addressing mode does this instruction use?
(A) Immediate               (B) Indirect
(C) Register                  (D) Direct
Answer: C
50.    An RTP packet is encapsulated in:
(A) a TCP segment                  (B) a UDP datagram
(C) an IP datagram                  (D) a SMTP packet
Answer: B

51.    To prevent .............., we can timestamp the packets.
(A) Error             (B) Jitter
(C) Loss             (D) None of these
Answer: B
52.    The complexity of Binary search algorithm is:
(A) O(n)                         (B) O(log n)
(C) O(n/2)          (D) O(n log n)
Answer: B
53.    If every node u in G is adjacent to every other node v in G, a graph is said to be:
(A) Isolated       (B) Complete
(C) Finite           (D) Strongly connected
Answer: B
54.    To extend the connectivity of the processor bus we use:
(A) PCI bus                   (B) SCSI bus
(C) Controllers                         (D) Multiple bus
Answer: A
55.    If 110011002 is divided by 1102 the quotient is:
(A) 11011          (B) 1111
(C) 100010        (D) 100001
Answer: C
56.    Which data structure allows deleting data elements from front and inserting at rear?
(A) Stacks         (B) Queues
(C) Deques       (D) Binary search tree
Answer: B
57.    Which of the following data structure is linear type?
(A) Strings         (B) Lists
(C) Queues       (D) All of above
Answer: D
58.    Speed of a microprocessor is determined by:
(A) Address bus width            (B) Data bus width
(C) Clock                                   (D) None of the above
Answer: C
59.    How many gates would be required to implement the following Boolean expression after simplification?
XY+X(X+Z)+Y(X+Z)
(A) 1       (B) 2
(C) 3       (D) 4
Answer: B
60.    With a 200 kHz clock frequency, 16 bits can be serially entered into a shift register in .............. time.
(A) 4 μs              (B) 80 μs
(C) 80 ms          (D) 8 ms
Answer: B

Pages   2   3   4   5 

0 comments:

Post a Comment