Although you are talking in a Mix of Indian language and English, and I don't understand Indian language, but you are very cleaver teacher and trying to understand your Indian words into my mind really helped me to understand the topic 100%. You are great, thanks a lot.

Cyclomatic Complexity is a software metric used to measure the complexity of a program. It is also known as structural complexity as it provides an internal view of the code. The metric was developed by Thomas J. McCabe in 1976. There are multiple ways to calculate cyclomatic complexity, and it is often based on the control flow graph of the program. The control flow graph represents the flow of control between different statements and decision points in the code. Here are the three formulas commonly used: V(G) = e - n + 2P: V(G) represents the cyclomatic complexity. e is the number of edges (transitions) in the control flow graph. n is the number of nodes (statements) in the control flow graph. P represents the number of connected components or regions (bounded areas) in the graph. For a single program, P is typically 1 or for subroutines. V(G) = pi + 1: V(G) represents the cyclomatic complexity. pi represents the number of predicated nodes, which are decision points with multiple possible outcomes. Predicated nodes are often associated with conditional statements, such as if-else or switch-case statements. The formula adds 1 to the count of predicated nodes. Calculation based on regions: Regions refer to the bounded areas or sections within the control flow graph. A region is created when there is a single entry point and a single exit point in a portion of the control flow graph. The cyclomatic complexity can be calculated by counting the number of regions and adding 1 to the count. By calculating the cyclomatic complexity of a program using these formulas, developers can assess its complexity, maintainability, and testability. A higher cyclomatic complexity value suggests a more complex program structure, which may indicate areas that are more error-prone, harder to test, or difficult to maintain. It's important to note that cyclomatic complexity is just one aspect of code quality and should be used in conjunction with other metrics and best practices for a comprehensive evaluation of software systems.

Thanks for your support❤

Even though I don't understand This language but I manage to understand what is she saying. Thanks for the explanation

Awesome explanation ....Thank you so much ma'am. Please don't call closed space as a cycle as it is creating confusion.

Thanks A Lot Helpul Videos. I Am Watching This Day Before My Exam And Got It Very Clear❤

Very well explained!! Thank you ma'am

really maam you made my day :) you make my concept clear thanks a lot Allah paak aapko khoob taarqqi de

Amazing Explanation, Thanks

thank you for such an easy way you just taught

Best Explanation so far!!!

Easiest explanation ever!

Dam, nice teaching . I haven't learnt like this ever.

very easy and clear explanation. Thanks ma'am.

Excellent explanation 🔥

Excellent vide!!

Thank you mam very good explanation

Superb explanation thank you

Awesome explanation Ma'am

These teachers need to be in college , not that professors who are boring.

Well explained 🔥🙏

Thnks Samya, very helpful.

thanks a lot easily understand!!

Tqq soo much it's very helpful ❤️❤️

Thanks it helped me..bcz tomorrow I have exam...

thnk u , so in pi formula we only see node with 2 outgoing edge, what about node with 3 outgoing edge?

nice. easy explanation.

Well explained Didi 🔥🔥

Thank you ma'am ❤️

Very well expalined

NICE SUPER EXCELLENT MOTIVATED

Thank you.

Thanks😍

Well explained mam✨

Ma’am thank you so much you saved my time …..tomorrow’s my exam

Thankyou

Thank you

Thanks a lot 💖

Super explanation mam Thank you mam and try to speak english !!! It will help full to all !!

thank you

Well explained sis ❤

thank you so much

Thank you mam 😊💖

Do more vdos on different subjects... Like rbdms, os... Are d difficult one

13-10+2=1❤

Thanks

simple the best

Wow, amazing. Mein 3 din say idhar udhar say notes parhi jar rha tha kuch smajh nhe aa rhe thi. Jazak Allah

thanks

Do we need to have websarvar for it?

Good Job.....

Nice explanation

thnkx

Thank you aunti ji

Ty ☺️

Thank you so much You explained nicely

Thanku Samiya for this

thanks :)

👌👌

please madam give more examples of cyclomatic complxity

Good

what is use of cyclomatic complexity ?.Can anyone tell me.

Thanks ma'am 😍 from J M I

Should connect end node and starting node... Thank you ✌

Mam p is always 1???? 3:00 In our book formula is e-n+2 And p+1 But ans is difference

👍

Who dislike the video I think no one can teach them

filmigo ,very good

U are best 👍, I like you

❤

what is the ans for this Determine the cyclomatic complexity for the following code: Accept year if(year mod 4=0 and year mod 100!=0) or(year mod 400 =0) print year is leap else print year is not leap end if.

CC= E - N + P

why do you change languages? :))

We solve the equation by bodmas method, so why you subtract first instead of adding?

i love u mam!!

1:08 😕 why you changed your language

I m liking this video

13-10+2=5 lol

13-10+2=5? or it should be (13-10)+2=5?

42k views

Jo main cheez hai us pr vhe english ki line boldi jo har jaga likhi hai, WHAT IS P EXPLAIN

complaaaaaaaaaaaaaaxity used to meeeeezar complaaaaxity

should speak in hindi it would be much better

Accent 🙃🤧🤧

annti panka cooler band karo awaj ari

Please correct your pronunciation for complexity

please use english beacuse worldwide student flow you

Don't bother if you don't know hindi. Look for another channel

Thanks

Thank you

thank you