Saturday, 28 October 2017

Lecturer in Computer Application Solved Paper 125/2017 - Part 4

61.       What names objects, defines the type of data that can be stored in an object, and encodes data for network transmission?
(A) MIB
(B) SMI
(C) SNMP
(D) ASN.1
Answer: B
62.       Which of the following application protocol is a framework for managing devices in an internet using the TCP/IP protocol suite?
(A) SMTP
(B) SNMP
(C) FTP
(D) TELNET
Answer: B
63.       What is the bit combination used by the SAPI field of ISDN’s data link layer, to control call for end-to-end signaling in LAPD addressing format?
(A) 000000
(B) 000010
(C) 010000
(D) 000001
Answer: D
64.       The values for the position(i), position(j) where i=14 and j=11, are:
(A) 2, 8
(B) 8, 2
(C) 8, 13
(D) 2, 13
Answer: C
65.       What is the value to find the reachability of the problem with which you can say the solution is reachable or not?
(A) 71
(B) 72
(C) 73
(D) 69
Answer: B
66.       The upper bound on the time complexity of the nondeterministic sorting algorithm is:
(A) O(n)
(B) O(n log n)
(C) O(1)
(D) O(log n)
Answer: A
67.       There is a chain of 20 stores; each of the store having 5 departments. Then, which of the following is a correct representation of array size?
(A) 5*20
(B) 6*21
(C) 20*5
(D) 21*6
Answer: C
68.       One from the following is also known as Pre-Order traversal. What that one is?
(A) LNR
(B) LRN
(C) RLN
(D) NLR
Answer: D
69.       From the following, select the valid data structure which reflects hierarchical relationship between the elements:
(A) Graph
(B) Queue
(C) Tree
(D) Stack
Answer: C
70.    Which of the following matrix does have high proportions of zero entries as the elements?
(A) Inverse Matrix
(B) Sparse Matrix
(C) Determinant Matrix
(D) Square Matrix
Answer: B
71.    Recursive algorithms are based on:
(A) Divide and conquer approach
(B) Top-down approach
(C) Bottom-up approach
(D) Hierarchical approach
Answer: B
72.    What do you call the selected keys in the quick sort method?
(A) Outer key
(B) Inner key
(C) Partition key
(D) Pivot key
Answer: D
73.    How many nodes does a complete binary tree of level 5 have?
(A) 16
(B) 15
(C) 32
(D) 31
Answer: D
74.    The Sorting method which is used for external sort is:
(A) Bubble sort
(B) Quick sort
(C) Merge sort
(D) Radix sort
Answer: C
75.    A node of a directed graph G having no out-degree and a positive in-degree is called:
(A) Source node
(B) Sink node
(C) Sibling node
(D) Null node
Answer: A
76.    What would be the depth of tree whose level is 9?
(A) 10
(B) 8
(C) 9
(D) 11
Answer: C
77.    A collection of data designed to be used by different people is called a/an:
(A) Organization
(B) Database
(C) Relationship
(D) Schema
Answer: B
78.    Which of the following is an attribute that can uniquely identify a row in a table?
(A) Secondary key
(B) Candidate key
(C) Foreign key
(D) None of the above
Answer: B
79.    Which of the following is the oldest database model?
(A) Relational
(B) Deductive
(C) Physical
(D) Network
Answer: D
80.    Which of the following terms does refer to the correctness and completeness of the data in a database?
(A) Data integrity
(B) Data constraint
(C) Data independence
(D) Data model
Answer: A

Pages   2   3   4   5 

0 comments:

Post a Comment