#semester 5
- Artificial Intelligence Question paper Solutions (AI-DS/AI-ML/CSE(DS/AIML)) A. What is PEAS descriptor? Give PEAS descriptor for robot maid for cleaning the house. PEAS stands for Performance measure, Environment, Ac... 1
- Data Warehouse Important Questions – (AI-DS /ML /CSE(DS)) Important questions based on previous year papers pf aids and comps 1)Features of Dw 2) ETL 3) OLAP operations and OLAP vs OLTP 4) star and... 1
- Stats sem 5 (Ai&Ds) pyq answers
- Anonymous and Arrow Function Examples in ES6 An anonymous function is a function without a name (usually stored in a variable or passed as a callback); an arrow function is the shorter... 1
- Write a short note on Openflow messages OpenFlow messages are exchanged between an SDN controller and an OpenFlow switch over a (usually TLS-secured) TCP channel, and fall into thr... 1
- Explain the working of DNS with the suitable diagrams. Clearly explain all the steps involved in DNS resolution. DNS (Domain Name System) translates a host name such as www.example.com into its IP address using a distributed hierarchy of servers (root,... 1
- Draw a STAR schema for Video Rental. A star schema for video rental has one central fact table, Rental_Fact, linked to dimension tables Customer, Video (Movie), Store, Time and... 1
- Suppose that a data warehouse consists of the four dimensions, date, spectator, location, and game Suppose that a data warehouse consists of the four dimensions, date, spectator, location, and game, and the two measures, count and charge,... 1
- Explain Multidimensional and multilevel association mining with example. Association mining, a data mining technique, helps identify interesting relationships or associations between items in a dataset. Multidimen... 1
- What is Web Mining? Explain Web Structure mining and Web usage mining in detail? Web mining is the process of discovering useful patterns, information, and knowledge from the vast amount of data available on the World Wid... 1
- Differentiate between Apriori & FP-growth algorithm. Criteria Apriori Algorithm FP-growth Algorithm Purpose Used for frequent itemset mining and association rule generation in data mining. Also... 2
- Differentiate between Page Rank & HITS algorithm. Criteria PageRank HITS (Hyperlink-Induced Topic Search) Purpose Measures the importance of web pages based on link structure. Identifies aut... 2
- Consider the transaction database given below, TID Items Frequent itemsets: {1}, {2}, {3}, {5}, {1,3}, {1,5}, {2,3}, {2,5}, {3,5}, {1,3,5}, {2,3,5}. Strong rules (confidence ≥ 60%) are listed in St... 1
- Elucidate Market Basket Analysis with an example. Market Basket Analysis (MBA) is a data mining technique used in the field of retail and marketing to uncover associations between products t... 1
- Explain K-Means clustering algorithm. Discuss its advantages and limitations. Apply Means algorithm Taking the first three values (2, 3, 6) as initial centroids, K-Means converges to the clusters 2, 3, 6, 8, 9, 12 and 15, 18, 22, with centr... 1
- Explain Page Rank technique in detail. PageRank is an algorithm used by search engines like Google to rank web pages in search results based on their importance and relevance. It... 1
- Explain three ways handshake technique in TCP. The "three-way handshake" is the procedure used to establish a connection. This procedure normally is initiated by one TCP and responded to... 1
- The law says that it is a crime for America to sell weapons to hostile nations. Resolving the negated goal ¬Criminal(West) with the knowledge base gives the empty clause, so West is a criminal. 1. FOPL representation It... 1
- With the help of resolution graph, resolution in FOL, solve the following things: Adding the negation "John does not like peanuts" to the knowledge base and resolving leads to the empty clause, so "John likes peanuts" is p... 1
- Difference between forward and backward chaining Forward Chaining Backward Chaining 1. When based on available data a decision is taken then the process is called as Forward chaining. Backw... 1
- Explain Heuristic function with respect to: - What is a heuristic function? How do we calculate the Heuristic function ? A heuristic function h(n) estimates the cost of the cheapest path from node n to a goal; informed searches such as greedy best-first and A*... 1
- Explain Bidirectional Search with appropriate examples and diagrams. Bidirectional search runs two searches at the same time, one forward from the start and one backward from the goal, and stops when the two f... 1
- Explain Uniform Cost Search with appropriate examples and diagrams. Uniform cost search (UCS) always expands the frontier node with the lowest path cost g(n) from the start, so it finds the cheapest path even... 1
- Explain iterative deepening search with appropriate examples and diagrams. Iterative deepening search (IDS) runs depth-limited DFS repeatedly with limits 0, 1, 2, … until the goal is found, combining the completenes... 1