All questions

• Why is three-way handshake needed? What is the problem if we send only two packets Problem regarding 2-way handshake The only real problem with a 2-way handshake is that duplicate packets from a previous connection( which h... 1 answer
• 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 answer
• Web development to do list no answer
• Find the i) average & ii) R.M.S value of the A.C voltage waveform shown below where point A=0.866Vm no answer
• For the given below AC waveform , determine the following i) Average Value , ii) R.M.S value no answer
• How is Datta Meghe College of Engineering, Airoli for AI-DS engineering? no answer
• Viva Questions For Engineering Mechanics Semester 1 Mumbai University Module 1 - Engineering Mechanics Topic What Is Engineering Mechanics What Is Statics What Is Dynamics Differentiate Between Kinematics And K... 1 answer
• A rectangular plate is supported by brackets to the wall at A and B by wire CD as shown in the figure. https://youtu.be/anR2ETawWT8 1 answer
• Find the least force P that will just start the system of blocks moving to the right , Take u=0.3 , Assume smooth Pulley Find the least force P that will just start the system of blocks moving to the right , Take u=0.3 , Assume smooth Pulley 1 answer
• A weightless ladder of length 8 m is resting against a smooth vertical wall and rough horizontal ground The maximum distance the man can climb without slipping is 6.4 m. This is calculated using the equation: Friction force = μ × Normal force W... 1 answer
• What is the Syllabus of Engineering Physics 1 in MU First Year Engineering ? Images can take some time to load please wait . 1 answer
• What is mini project Logbook & Report in Engineering ?? Logbook & Report are two most important Documents submitted in order to get Your Mini Project Submitted ! 1) Logbook is a simple document ab... 1 answer
• Write a C program for calendar application mini Project ? #include<stdio.h> #include<stdlib.h> #include<string.h> #include <time.h> #define SIZE 200 struct node *create_node(int day,int month,int ye... 1 answer
• Create a Node Js Web Scraping Project for Web Computing Practical First, make sure you have Node.js installed on your computer. Create a new directory for your project and navigate to it in your terminal. I... 1 answer
• 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 answer
• 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 answer
• 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 answer
• 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 answer
• 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 answer
• 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 answer
• 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 answer
• Compare Bfs ,Dfs and Dls with diagrammatic example BFS explores level by level, DFS goes as deep as possible along one branch before backtracking, and DLS is DFS that stops at a fixed depth l... 1 answer
• Compare informed and uninformed search. Parameters Informed Search Uninformed Search Known as It is also known as Heuristic Search. It is also known as Blind Search. Using Knowledg... 1 answer
• Describe different types of Environment. 1. Deterministic Environment: Characteristics: The next state of the environment is entirely determined by the current state and the actions... 1 answer