Sample
Sample
(3)
4. List any three algorithms used for analyzing graph structures on the web. (3)
5. Explain the limitations of the current web and how the Semantic Web (3)
addresses them.
6. Describe the difference between OWL (Web Ontology Language) and UML (3)
(Unified Modeling Language).
7. How does the concept of "equality" play a role in representing identity (3)
within social networks?
9. Illustrate how the PageRank algorithm contributes to link analysis within (3)
search engines.
10. Discuss the significance of social network analysis (SNA) in understanding (3)
the macro-structure of networks.
11. Describe the limitations of the current Web and explain how the Semantic (6)
Web aims to address these issues.
12. What is the Semantic Web, and how does it differ from the traditional Web? (6)
13. Compare RDF Schema and OWL in terms of their roles and functionalities (6)
in the Semantic Web.
14. Explain the role of ontologies in the Semantic Web and how they contribute (6)
to knowledge representation.
15. Explain the concept of "smushing" in the context of aggregating social (6)
network data, and discuss its importance in determining equality of
instances.
16. Describe the concept of "identity representation" in social networks and (6)
explain its significance in social data analysis.
17. Discuss the use of the Hyper ANF Algorithm in analyzing the graph (6)
structure of Facebook, and outline its advantages over traditional BFS for
this purpose
18. Compare the Strongly Connected Components (SCC) and Weakly (6)
Connected Components (WCC) algorithms in the context of web graph
analysis.
19. Describe the PageRank algorithm and compare it with the HITS algorithm in (6)
terms of ranking web pages for search engines.
20. How does the HITS algorithm identify hubs and authorities on the Web, and
what is the significance of this distinction in web page ranking?
Module 2
3 marks
6 marks
Module 3
Three-Mark Questions:
1. Define the concept of network data representation and explain its importance in social
network analysis.
2. What is RDF, and how is it used in knowledge representation on the Semantic Web?
3. Explain the role of ontologies in the Semantic Web and provide an example of its
application.
4. List and explain two differences between OWL (Web Ontology Language) and UML (Unified
Modeling Language).
5. Describe the concept of "social relationships" in an ontology and how they can be
represented in a network.
Six-Mark Questions:
1. Discuss the significance of electronic discussion networks and blogs in the context of
network analysis and knowledge sharing.
2. Explain how reasoning with social network data, including identity and equality, enhances
social network analysis and decision-making.
3. Compare RDF, RDF Schema, and OWL, focusing on their roles in knowledge representation
and their application in the Semantic Web.
4. Analyze the differences between social network data representation using traditional
databases (e.g., relational models) and using ontology-based approaches.
5. Evaluate the challenges and benefits of aggregating and reasoning with social network data
in terms of data quality and computational complexity.
Module 4
Three-Mark Questions:
1. Define the concept of "Connected Components" (SCC) in graph theory and explain its
significance in network analysis.
2. What is the difference between Weakly Connected Components (WCC) and Strongly
Connected Components (SCC)?
3. Explain the meaning and significance of the Rank Exponent (R) in network analysis.
4. Describe the Hop Plot Exponent (H) and how it relates to the connectivity of a network.
5. What is the degree distribution in a graph, and why is it important in the study of social
networks like Facebook?
Six-Mark Questions:
1. Discuss the working of the SCC algorithm in identifying strongly connected components in
directed graphs. Explain its applications in social networks.
2. Explain the Hyper ANF Algorithm and its significance in graph-based network analysis,
particularly for social networks like Facebook.
3. Compare and contrast the Iterative Fringe Upper Bound (iFUB) algorithm and the Hyper ANF
algorithm in terms of their applications in network analysis.
4. Analyze the role of the clustering coefficient and degree assortativity in understanding the
structure and dynamics of social networks like Facebook.
5. Evaluate how factors like age, gender, and country of origin influence the structure and
connectivity of social networks, particularly with respect to the concept of login correlation.
MODULE 5
Three-Mark Questions:
1. Define the HITS algorithm and explain its significance in link analysis.
2. What is the role of crawling in a search engine, and how does it contribute to indexing?
3. Describe the concept of a "random walk" in the context of link analysis and its application in
algorithms like PageRank.
4. What is web spam, and how do search engines like Google handle it?
5. Explain the basic architecture of Google’s search engine and how it differs from other search
engines.
Six-Mark Questions:
1. Discuss the PageRank algorithm in detail, including its working mechanism and its
application in ranking web pages.
2. Explain the architecture of a search engine, describing each key component: crawling,
storage, indexing, and ranking.
3. Compare and contrast the HITS algorithm with the PageRank algorithm, focusing on their
methods for determining the relevance of web pages.
4. Describe the SALSA algorithm and how it differs from other link analysis algorithms like HITS
and PageRank in terms of performance and outcomes.
5. Analyze the impact of web spam on search engine results, and explain the techniques used
by Google to detect and prevent spam pages from ranking high.