top of page

Courses
Blog
Search
Ask & Answer
Forum

All Posts
Basics of Linux
Algorithms
Past Year Papers
Ask & Answer
DPPs
RCs
Delhi University - Past Year Papers

Search

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

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

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

May 24, 20243 min read

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

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

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

May 24, 20241 min read

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

May 24, 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.

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.

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.

May 23, 20241 min read

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

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

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

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.

May 23, 20241 min read

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

May 23, 20242 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...

May 23, 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...

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...

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...

May 22, 20241 min read

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

This content is protected from right clicks.

bottom of page