MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 313 Mcqs, each offering curated multiple-choice questions to sharpen your Information Technology Engineering (IT) knowledge and support exam preparation. Choose a topic below to get started.
| 251. |
__________defines a normalized version of Katz centrality. |
| A. | PageRank centrality |
| B. | eigenvector centrality |
| C. | Betweenness centrality |
| D. | None of these |
| Answer» B. eigenvector centrality | |
| 252. |
In directed graphs_____________variants of degree centrality. |
| A. | prestige |
| B. | gregariousness |
| C. | both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 253. |
To compute structural equivalence, we look at the________ shared by two nodes |
| A. | nighborhood |
| B. | adjcent |
| C. | same |
| D. | None of these |
| Answer» B. adjcent | |
| 254. |
When using network information, the similarity between two nodes can be computed by measuring their ________ |
| A. | structural equivalence |
| B. | their regular equivalence. |
| C. | both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 255. |
______ theory measures how consistent individuals are in assigning status to their neighbors. |
| A. | Social status |
| B. | clustering coefficient |
| C. | Closeness |
| D. | clustering coefficient |
| Answer» B. clustering coefficient | |
| 256. |
__________considers closed loops of length 2 |
| A. | Transitivity |
| B. | Centrality |
| C. | Reciprocity |
| D. | None of these |
| Answer» D. None of these | |
| 257. |
________is a simplified version of transitivity |
| A. | clustering coefficient |
| B. | Reciprocity |
| C. | Centrality |
| D. | Transitivity |
| Answer» C. Centrality | |
| 258. |
transitive behavior needs at least ________edges. |
| A. | Three |
| B. | two |
| C. | one |
| D. | four |
| Answer» B. two | |
| 259. |
_______determines how links (edges) are formed in a social graph. |
| A. | Transitivity |
| B. | Reciprocity |
| C. | Centrality |
| D. | Linking behavior |
| Answer» E. | |
| 260. |
The________ analyzes transitivity in an undirected graph. |
| A. | Reciprocity |
| B. | clustering coefficient |
| C. | Centrality |
| D. | Closeness |
| Answer» C. Centrality | |
| 261. |
_____centrality is defined as the number of nodes from outside the group that are connected to group members. |
| A. | Group degree |
| B. | Closeness |
| C. | Betweenness |
| D. | None of these |
| Answer» B. Closeness | |
| 262. |
______________ centrality takes its maximum value |
| A. | Closeness |
| B. | Betweenness |
| C. | Group |
| D. | None of these |
| Answer» C. Group | |
| 263. |
___________for a node is simply its degree. |
| A. | Degree |
| B. | Eigenvector |
| C. | Katz |
| D. | Closeness |
| Answer» B. Eigenvector | |
| 264. |
__________algorithm will compute shortest paths from a single node to all other nodes. |
| A. | Betweenness |
| B. | Brandes’ |
| C. | Dijkstra’s |
| D. | None of these |
| Answer» D. None of these | |
| 265. |
Which of the following method is used for finding optimal of cluster in K-Mean algorithm? |
| A. | Elbow method |
| B. | Manhattan method |
| C. | All of the above |
| D. | None of these |
| Answer» B. Manhattan method | |
| 266. |
Which of the following algorithm is most sensitive to outliers? |
| A. | K-means |
| B. | K-medians |
| C. | K-modes |
| D. | K-medoids |
| Answer» B. K-medians | |
| 267. |
Which of the following are the high and low bounds for the existence of F-Score? |
| A. | [0,1] |
| B. | (0,1) |
| C. | [-1,1] |
| D. | Â None of the above |
| Answer» B. (0,1) | |
| 268. |
__________defines how important a node is within a network. |
| A. | Centrality |
| B. | Degree |
| C. | prominence |
| D. | None of these |
| Answer» B. Degree | |
| 269. |
Is it possible that Assignment of observations to clusters does not change between successive iterations in K-Means |
| A. | Yes |
| B. | No |
| C. | Can’t say |
| D. | None of these |
| Answer» B. No | |
| 270. |
For two runs of K-Mean clustering is it expected to get same clustering results? |
| A. | Yes |
| B. | No |
| Answer» C. | |
| 271. |
What is the minimum no. of variables/ features required to perform clustering? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» C. 2 | |
| 272. |
Can decision trees be used for performing clustering? |
| A. | true |
| B. | false |
| Answer» B. false | |
| 273. |
The ‘Sociogram’ technique is used to study |
| A. | Human Relations |
| B. | Vocational Interest |
| C. | Achievement |
| D. | Professional |
| Answer» B. Vocational Interest | |
| 274. |
Web Crawler is also called as |
| A. | Link Directory |
| B. | Search Optimizer |
| C. | Web Spider |
| D. | Web Manager |
| Answer» D. Web Manager | |
| 275. |
What is the term adopted for updates by Twitter users? |
| A. | Tweets |
| B. | Twoots |
| C. | Twinks |
| D. | Post |
| Answer» B. Twoots | |
| 276. |
The first step when marketing with social networks is to identify the goals and strategies. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 277. |
Which social network is considered the most popular for business to business marketing? |
| A. | |
| B. | Orkut |
| C. | Ryze |
| D. | |
| Answer» E. | |
| 278. |
In case the documents do not share any attributes or words, the cosine similarity results in………. |
| A. | High |
| B. | Intermediate |
| C. | All of the above |
| Answer» D. | |
| 279. |
A pair of nodes said to be structurally equivalent to the extent that |
| A. | They occupy identical locations in a network |
| B. | They are connected to exactly the same others |
| C. | They have the identical relations to all outside actors. |
| D. | All of the above |
| Answer» E. | |
| 280. |
Social Status theory measures how inconsistent individuals are in assigning status to their neighbors. |
| A. | true |
| B. | false |
| Answer» C. | |
| 281. |
Reciprocity can be computed using |
| A. | Simple Matrix |
| B. | Adjacency Matrix |
| C. | Eigen Vector |
| D. | None of the above |
| Answer» C. Eigen Vector | |
| 282. |
In any directed graph if all edges are reciprocal, can have maximum of |E|= |
| A. | 1 |
| B. | 0 |
| C. | 2 |
| D. | None of the above |
| Answer» D. None of the above | |
| 283. |
The number of actors outside the group that are connected to the member of that group is |
| A. | Eigenvector centrality |
| B. | Betweeness centrality |
| C. | Degree centrality of the group |
| D. | None of the above |
| Answer» D. None of the above | |
| 284. |
vertices that have a high probability of occurring on a randomly chosen shortest path between two nodes are said to have high |
| A. | Centrality |
| B. | Betweeness centrality |
| C. | Eigenvector centrality |
| D. | None of the above |
| Answer» C. Eigenvector centrality | |
| 285. |
The most popular social networking website twitter makes use of HITS algorithm in suggesting user account to follow |
| A. | true |
| B. | false |
| Answer» B. false | |
| 286. |
Transitivity is the tendency for friend of friends to be friend and enemy of enemy to be enemy |
| A. | true |
| B. | false |
| Answer» B. false | |
| 287. |
Page rank is the method |
| A. | For rating the importance of web pages objectively and mechanically. |
| B. | Used in google search engine |
| C. | A simple way to count the number of times a web page is citated |
| D. | All of the above |
| Answer» E. | |
| 288. |
PageRank is based on the ‘random suffer’ idea and the web is seen as a markov chain |
| A. | true |
| B. | false |
| Answer» B. false | |
| 289. |
Katz centrality can be |
| A. | Used to compute centrality in directed networks |
| B. | Suitable in the analysis of directed acyclic graphs |
| C. | Also used in estimating relative status of actor |
| D. | All of the above |
| Answer» E. | |
| 290. |
Degree centrality is defined as |
| A. | The ratio of number of neighbors of the vertex with total number of possible neighbors |
| B. | Central nodes of all the given nodes in networks |
| C. | Total number of nodes in the given network |
| D. | None of the above |
| Answer» B. Central nodes of all the given nodes in networks | |
| 291. |
Eigenvector centrality is an |
| A. | An Important nodes has usually important friends |
| B. | Centrality of the given central nodes |
| C. | None of the above |
| D. | All of the above |
| Answer» B. Centrality of the given central nodes | |
| 292. |
_______________refers to the process of deriving high-quality information from text. |
| A. | Text Mining. |
| B. | Image Mining |
| C. | Database Mining |
| D. | Multimedia Mining. |
| Answer» B. Image Mining | |
| 293. |
What are the different measures of centrality? |
| A. | Degree centrality |
| B. | Closeness centrality |
| C. | Eigen vector centrality |
| D. | All of the above |
| Answer» E. | |
| 294. |
Data ................... is the process of finding a model that describes and distinguishes data classes or concepts. |
| A. | Characterization |
| B. | Mining |
| C. | clustering |
| D. | Classification |
| Answer» E. | |
| 295. |
_____________ is the application of data mining techniques to discover patterns from the Web |
| A. | Text Mining |
| B. | Multimedia Mining |
| C. | Web Mining |
| D. | Link Mining |
| Answer» C. Web Mining | |
| 296. |
___________ is an essential process where intelligent methods are applied to extract data patterns. |
| A. | Data warehousing |
| B. | Data mining |
| C. | Text mining |
| D. | Data selection |
| Answer» C. Text mining | |
| 297. |
Clustering is a common____________ data mining technique |
| A. | Supervised |
| B. | Unsupervised |
| C. | both A & B |
| D. | None |
| Answer» C. both A & B | |
| 298. |
Data mining is also known as___________ |
| A. | FDD |
| B. | KDD |
| C. | MDD |
| D. | NDD |
| Answer» C. MDD | |
| 299. |
Which is not classification algorithm? |
| A. | Naive Bayes |
| B. | TFIDF |
| C. | Probabilistic Indexing |
| D. | Indexbased |
| Answer» E. | |
| 300. |
_____________applies authority-based ranking to keyword search on labeled graphs, |
| A. | ObjectRank Algorithm |
| B. | Indexbased map |
| C. | nodekeyword map |
| D. | DISCOVER |
| Answer» B. Indexbased map | |