Back to the 2023 paper
Similar questions
Design and Analysis of Algorithms Write short notes on any two of the following: (i) Asymptotic Notations (ii) Clique decision problem (iii) Max-flow-min-cut theorem (iv) Union-Find Algorithm202214mDatabase Management SystemConsider R (A, B, C, D, E) with following FDs:- A → B, A → C, CD → E, B → D, E → A which of the following FDs is not implied by above set? (i) CD → AC (ii) BD → CD (iii) BC → CD (iv) AC → BC20222mFORMAL LANGUAGE & AUTOMATA THEORYWrite short notes on: 1. Post Correspondence Problem (PCP) 2. NP-hard problem20247mComputer NetworksDraw the flow diagram for the CSMA/CD and explain. Also compare CSMA/CD with ALOHA.201514m
PreviousDiscuss diagrammatically the relation among P class, NP class, NP hard and NP complete.NextExplain the max-flow min-cut theorem with an example.
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.