Blog | Crookshanks Academy

Express the following concepts as an associative network structure with interconnected nodes and labelled arcs.

Dhruv Badaya

May 24, 20241 min read

Express the following concepts as an associative network structure with interconnected nodes and labelled arcs.

Describe the water-jug problem. Also, give a suitable state space representation for this problem.

Dhruv Badaya

May 24, 20242 min read

Describe the water-jug problem. Also, give a suitable state space representation for this problem.

Dhruv Badaya

May 24, 20241 min read

Give the properties of Type 1 and Type 2 grammars from the Chomsky Hierarchy of grammars.

Compare and contrast Depth-first search and Breadth-first search

Dhruv Badaya

May 24, 20241 min read

Compare and contrast Depth-first search and Breadth-first search

Write the joint distribution of x1, x2, x3, x4, x5 and x6 as a product of chain conditional probabilities for the following network.

Dhruv Badaya

May 24, 20241 min read

Write the joint distribution of x1, x2, x3, x4, x5 and x6 as a product of chain conditional probabilities for the following network.

Dhruv Badaya

May 24, 20241 min read

What would be the output of the following statement in Prolog, and why?

Dhruv Badaya

May 24, 20241 min read

What do you understand by the term "Rational Agent"?

Dhruv Badaya

May 24, 20241 min read

Transform the following into Conjunctive Normal Form (CNF)

When do we say that the search is admissible? You can take the example of A*.

Dhruv Badaya

May 24, 20243 min read

When do we say that the search is admissible? You can take the example of A*.

Develop a parse tree for the sentence "Raja slept on the sofa".

Dhruv Badaya

May 24, 20241 min read

Develop a parse tree for the sentence "Raja slept on the sofa".

Dhruv Badaya

May 24, 20241 min read

Construct the truth table for the expression (A&(A∨B)). What single term is this expression equal to?

Find the probability of event A when it is known that some event B occurred. From experiments, it has been determined that P(B|A) = 0.84, P(A) = 0.2, and P(B) = 0.34.

Dhruv Badaya

May 23, 20241 min read

Find the probability of event A when it is known that some event B occurred. From experiments, it has been determined that P(B|A) = 0.84, P(A) = 0.2, and P(B) = 0.34.

Based on the context-free grammar represented by the following parse tree, draw the corresponding Recursive Transition Network (RTN).

Dhruv Badaya

May 23, 20241 min read

Based on the context-free grammar represented by the following parse tree, draw the corresponding Recursive Transition Network (RTN).

Dhruv Badaya

May 23, 20241 min read

What is the smallest possible depth of a leaf in a decision tree for a comparison sort? Name a sorting technique to which this smallest depth would correspond.

Dhruv Badaya

May 23, 20242 min read

Write a pseudocode for the memoized recursive algorithm to compute the nth Fibonacci number. What would be its time complexity?

Dhruv Badaya

May 23, 20241 min read

The BFS algorithm has been used to produce the shortest paths from a node s to all other nodes in a graph G. Can the Dijkstra's algorithm be used in place of BFS? In a different scenario, the Djik...

Given two keyframes for an object transformation, first keyframe contains a triangle and the second keyframe contains a quadrilateral. Convert the triangle into the quadrilateral by equalizing ver...

Dhruv Badaya

May 22, 20241 min read

Given two keyframes for an object transformation, first keyframe contains a triangle and the second keyframe contains a quadrilateral. Convert the triangle into the quadrilateral by equalizing ver...

Dhruv Badaya

May 18, 20241 min read

University of Delhi - B.Sc. (Hons.) Computer Science Past Year Question Papers

Dijkstra’s Algorithm - A Complete Tutorial for Beginners

Dhruv Badaya

May 8, 20243 min read

Dijkstra’s Algorithm - A Complete Tutorial for Beginners

Breadth First Search - A Complete Tutorial for Beginners

Dhruv Badaya

May 7, 20243 min read

Express the following concepts as an associative network structure with interconnected nodes and labelled arcs.

Describe the water-jug problem. Also, give a suitable state space representation for this problem.

Give the properties of Type 1 and Type 2 grammars from the Chomsky Hierarchy of grammars.

Compare and contrast Depth-first search and Breadth-first search

Write the joint distribution of x1, x2, x3, x4, x5 and x6 as a product of chain conditional probabilities for the following network.

What would be the output of the following statement in Prolog, and why?

What do you understand by the term "Rational Agent"?

Transform the following into Conjunctive Normal Form (CNF)

When do we say that the search is admissible? You can take the example of A*.

Develop a parse tree for the sentence "Raja slept on the sofa".

Construct the truth table for the expression (A&(A∨B)). What single term is this expression equal to?

Find the probability of event A when it is known that some event B occurred. From experiments, it has been determined that P(B|A) = 0.84, P(A) = 0.2, and P(B) = 0.34.

Based on the context-free grammar represented by the following parse tree, draw the corresponding Recursive Transition Network (RTN).

What is the smallest possible depth of a leaf in a decision tree for a comparison sort? Name a sorting technique to which this smallest depth would correspond.

Write a pseudocode for the memoized recursive algorithm to compute the nth Fibonacci number. What would be its time complexity?

The BFS algorithm has been used to produce the shortest paths from a node s to all other nodes in a graph G. Can the Dijkstra's algorithm be used in place of BFS? In a different scenario, the Djik...

Given two keyframes for an object transformation, first keyframe contains a triangle and the second keyframe contains a quadrilateral. Convert the triangle into the quadrilateral by equalizing ver...

University of Delhi - B.Sc. (Hons.) Computer Science Past Year Question Papers

Dijkstra’s Algorithm - A Complete Tutorial for Beginners

Breadth First Search - A Complete Tutorial for Beginners

Crookshanks Academy is an online learning platform with free netflix styled courses.

Privacy Policy →
Ads Policy →
Contact Us →
FAQs →
Careers →

Crookshanks Academy 2023 ©️ All Rights Reserved