Back to the 2022 paper
Similar questions
Formal Language & Automata TheoryState and prove pumping lemma for regular sets.20217mDesign and Analysis of Algorithms Given the flow network below with capacities: | EDGE | CAPACITY | |---|---| | S -> A | 10 | | S -> C | 10 | | A -> B | 4 | | A -> C | 2 | | C -> D | 9 | | B -> T | 10 | | D -> B | 6 | | D -> T | 10 | Answer the following: (i) Use the Ford-Fulkerson algorithm to find the maximum flow from source (S) to sink (T). (ii) Show the augmenting paths selected, the bottleneck capacities on each path, and the updated residual capacities after each augmentation. (iii) Calculate the final maximum flow value.20247mFORMAL LANGUAGE & AUTOMATA THEORYLet w = xyz, y is the middle portion and |y| > 0. Repeating y zero or more times before checking membership in L is known as: (i) Generating (ii) Pumping (iii) Producing (iv) None of the above20222mDesign & Analysis of AlgorithmsThe fractional Knapsack problem can be solved by using: - (i) Greedy method - (ii) Divide and conquer method - (iii) Dynamic programming - (iv) None of these20232m
PreviousWrite a Prolog program that verified whether an input list is a palindrome. Hint: Goal : Palindrome ([r, a, c, e, c, a, r]) Output : Yes Goal : Palindrome ([a, b, c]) Output : NoNextExplain the basic component of an expert system.
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.