McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Information Technology Engineering (IT) .
| 1. |
Data that has been generated with no connection to the Internet, and then registered into a system, which may be accessed via the Internet later called |
| A. | offline originated data |
| B. | online originated data |
| C. | both a & b |
| D. | none of the above |
| Answer» A. offline originated data | |
| 2. |
What is one of the big differences between traditional media and social media? |
| A. | participatory production. |
| B. | social media reaches only a few people at a time. |
| C. | the management structure of the companies. |
| D. | traditional media offers no way for audiences to communicate with media producers. |
| Answer» A. participatory production. | |
| 3. |
Estimated metrics include …………. which provide the number of times a user has potentially seen a certain piece of content or advertising. |
| A. | views |
| B. | impressions |
| C. | reach |
| D. | all of the above |
| Answer» D. all of the above | |
| 4. |
____________is a very fragile and unstable way of gathering data, because when anything changes on the web site, the source code is changed, |
| A. | data mining |
| B. | web crawling/scraping |
| C. | both a & b |
| D. | none of the above |
| Answer» B. web crawling/scraping | |
| 5. |
It allows a programmer to see a clear structure of the information that is stored in the application Called |
| A. | api |
| B. | program |
| C. | data |
| D. | none of the above |
| Answer» A. api | |
| 6. |
In terms of Facebook's ranking algorithm, what does "weight" refer to? |
| A. | the amount of comments, likes, etc. a content post receives |
| B. | how often a profile produces content |
| C. | how many highly ranked content posts a profile has in a given week |
| D. | how many followers/friends a company has |
| Answer» A. the amount of comments, likes, etc. a content post receives | |
| 7. |
What is the name of Facebook's Analytics tool? |
| A. | facebook analytics |
| B. | edge rank |
| C. | page rank |
| D. | insights |
| Answer» D. insights | |
| 8. |
What is CTR? |
| A. | cost through rate |
| B. | click table rate |
| C. | click through rate |
| D. | clicks through rate |
| Answer» C. click through rate | |
| 9. |
Which of the following clustering requires merging approach? |
| A. | Partitional |
| B. | Hierarchical |
| C. | Naive Bayes |
| D. | None of the mentioned |
| Answer» B. Hierarchical | |
| 10. |
Which of the following function is used for k-means clustering? |
| A. | k-means |
| B. | k-mean |
| C. | heatmap |
| D. | None of the mentioned |
| Answer» A. k-means | |
| 11. |
Hierarchical clustering should be primarily used for exploration. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 12. |
Following are applications of text mining |
| A. | Classification |
| B. | clustering |
| C. | keyword search |
| D. | All Above |
| Answer» D. All Above | |
| 13. |
Point out the wrong statement. |
| A. | k-means clustering is a method of vector quantization |
| B. | k-means clustering aims to partition n observations into k clusters |
| C. | k-nearest neighbor is same as k-means |
| D. | none of the mentioned |
| Answer» C. k-nearest neighbor is same as k-means | |
| 14. |
In ___________problems nodes in Social n/w associated with labels |
| A. | keyword search |
| B. | clustering |
| C. | Classification |
| D. | mining |
| Answer» C. Classification | |
| 15. |
Most well-known keyword search algorithm for relational data is _______ |
| A. | DISCOVER |
| B. | DBX-plorer |
| C. | None of the above |
| D. | Both A & B |
| Answer» D. Both A & B | |
| 16. |
_____________applies authority-based ranking to keyword search on labeled graphs, |
| A. | ObjectRank Algorithm |
| B. | Indexbased map |
| C. | nodekeyword map |
| D. | DISCOVER |
| Answer» A. ObjectRank Algorithm | |
| 17. |
Which is not classification algorithm? |
| A. | Naive Bayes |
| B. | TFIDF |
| C. | Probabilistic Indexing |
| D. | Indexbased |
| Answer» D. Indexbased | |
| 18. |
Data mining is also known as___________ |
| A. | FDD |
| B. | KDD |
| C. | MDD |
| D. | NDD |
| Answer» B. KDD | |
| 19. |
Clustering is a common____________ data mining technique |
| A. | Supervised |
| B. | Unsupervised |
| C. | both A & B |
| D. | None |
| Answer» B. Unsupervised | |
| 20. |
___________ 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» B. Data mining | |
| 21. |
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» D. Classification | |
| 22. |
_____________ 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» B. Multimedia Mining | |
| 23. |
_______________refers to the process of deriving high-quality information from text. |
| A. | Text Mining. |
| B. | Image Mining |
| C. | Database Mining |
| D. | Multimedia Mining. |
| Answer» A. Text Mining. | |
| 24. |
What are the different measures of centrality? |
| A. | Degree centrality |
| B. | Closeness centrality |
| C. | Eigen vector centrality |
| D. | All of the above |
| Answer» D. All of the above | |
| 25. |
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» A. The ratio of number of neighbors of the vertex with total number of possible neighbors | |
| 26. |
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» A. An Important nodes has usually important friends | |
| 27. |
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» D. All of the above | |
| 28. |
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» D. All of the above | |
| 29. |
The most popular social networking website twitter makes use of HITS algorithm in suggesting user account to follow |
| A. | true |
| B. | false |
| Answer» A. true | |
| 30. |
PageRank is based on the ‘random suffer’ idea and the web is seen as a markov chain |
| A. | true |
| B. | false |
| Answer» A. true | |
| 31. |
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» B. Betweeness centrality | |
| 32. |
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» C. Degree centrality of the group | |
| 33. |
Transitivity is the tendency for friend of friends to be friend and enemy of enemy to be enemy |
| A. | true |
| B. | false |
| Answer» A. true | |
| 34. |
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» C. 2 | |
| 35. |
Reciprocity can be computed using |
| A. | Simple Matrix |
| B. | Adjacency Matrix |
| C. | Eigen Vector |
| D. | None of the above |
| Answer» B. Adjacency Matrix | |
| 36. |
Social Status theory measures how inconsistent individuals are in assigning status to their neighbors. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 37. |
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» D. All of the above | |
| 38. |
In case the documents do not share any attributes or words, the cosine similarity results in………. |
| A. | High |
| B. | Intermediate |
| C. | 0 |
| D. | All of the above |
| Answer» C. 0 | |
| 39. |
Which social network is considered the most popular for business to business marketing? |
| A. | |
| B. | Orkut |
| C. | Ryze |
| D. | |
| Answer» D. LinkedIn | |
| 40. |
The first step when marketing with social networks is to identify the goals and strategies. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 41. |
What is the term adopted for updates by Twitter users? |
| A. | Tweets |
| B. | Twoots |
| C. | Twinks |
| D. | Post |
| Answer» A. Tweets | |
| 42. |
Web Crawler is also called as |
| A. | Link Directory |
| B. | Search Optimizer |
| C. | Web Spider |
| D. | Web Manager |
| Answer» C. Web Spider | |
| 43. |
The ‘Sociogram’ technique is used to study |
| A. | Human Relations |
| B. | Vocational Interest |
| C. | Achievement |
| D. | Professional |
| Answer» A. Human Relations | |
| 44. |
Can decision trees be used for performing clustering? |
| A. | true |
| B. | false |
| Answer» A. true | |
| 45. |
What is the minimum no. of variables/ features required to perform clustering? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» B. 1 | |
| 46. |
For two runs of K-Mean clustering is it expected to get same clustering results? |
| A. | Yes |
| B. | No |
| Answer» B. No | |
| 47. |
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» A. Yes | |
| 48. |
Which of the following algorithm is most sensitive to outliers? |
| A. | K-means |
| B. | K-medians |
| C. | K-modes |
| D. | K-medoids |
| Answer» A. K-means | |
| 49. |
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» A. [0,1] | |
| 50. |
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» A. Elbow method | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.