@

Dark Mode

Profile
Edit my Profile
Messages
My favorites

Register

Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams

Dark Mode

made easy work book

Chetan28kumar asked in Algorithms Oct 17, 2018

265 views

0 votes

0 votes

Chetan28kumar asked in Algorithms Oct 17, 2018

by Chetan28kumar

265 views

4 Comments

Show 2 previous comments

commented Oct 17, 2018

Yes it should be 2.

1

1

by Chetan28kumar

commented Oct 17, 2018

Yes u are right..bt how this 2 will come?? May yu explain

0

0

by Shaik Masthan

commented Oct 17, 2018

read this https://www.geeksforgeeks.org/strongly-connected-components/

after that check this for practicing https://gateoverflow.in/238313/connected-components

1

1

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 votes

3 answers

1

Priyanka Agarwal asked in Algorithms Jun 22, 2018

340 views

Made easy work book
How to solve T (n)=T (sqrt n)+ n

Priyanka Agarwal asked in Algorithms Jun 22, 2018

by Priyanka Agarwal

340 views

master-theorem
recurrence-relation
made-easy-booklet

0 votes

0 votes

0 answers

2

abhinowKatore asked in Theory of Computation Mar 7, 2022

106 views

MADE EASY 2022 Work book -Theory of Computation
Which of the following pairs of string belonging to Σ* are distinguishable by the following dfa?

abhinowKatore asked in Theory of Computation Mar 7, 2022

by abhinowKatore

106 views

theory-of-computation
finite-automata

0 votes

0 votes

1 answer

3

abhinowKatore asked in Theory of Computation Mar 7, 2022

145 views

MADE EASY 2022 Work book -Theory of Computation series
Let L be a regular language on alphabet Σ. The union of the myhill-nerode equivalence classes is always _____, and the pairwise intersection of the myhill-nerode equivalence classes is always Fill up the blanks

abhinowKatore asked in Theory of Computation Mar 7, 2022

by abhinowKatore

145 views

theory-of-computation
regular-languages
finite-automata
minimal-state-automata
decidability

0 votes

0 votes

0 answers

4

abhinowKatore asked in Theory of Computation Mar 7, 2022

107 views

MADE EASY 2022 Work book

abhinowKatore asked in Theory of Computation Mar 7, 2022

by abhinowKatore

107 views

theory-of-computation
finite-automata

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Quick search syntax

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent Posts

From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork

Subjects

All categories
General Aptitude (2.5k)
Engineering Mathematics (9.3k)
Digital Logic (3.3k)
Programming and DS (5.8k)
Algorithms (4.6k)
Theory of Computation (6.7k)
Compiler Design (2.3k)
Operating System (5.0k)
Databases (4.6k)
CO and Architecture (3.8k)
Computer Networks (4.6k)
Non GATE (1.3k)
Others (2.4k)
Admissions (649)
Exam Queries (842)
Tier 1 Placement Questions (17)
Job Queries (74)
Projects (9)
Unknown Category (853)

Recent Blog Comments

Twist at every point Man
Diagonalization of a MatrixIf there is an...
"i applied to amazon for 6 times,flipkart 2...
The Memes were inserted perfectly😁😁
Epic tha bhai

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!