Study guides, Class notes & Summaries

This Document will help you doing mastery in C coding language at College Coding level as well as Competitive coding level also. These Docs will help in better grasping of the knowledge and its applications in real world.

Today we will study Bit manipulation, Bit magic and Bitwise operators. Bits are actually very important from Competitive programming point of view. If your submission differs by just a few microseconds, then it affects your rank as well. If you would be using BITWISE concepts, then your submission will be very fast. We will learn such tips and tricks in bits.

Time complexity means an algorithm. Just as you increase its length of input then how does that algorithm perform ? How does that algorithms behave ? How do you use their constraints and tell which algorithm is to be used here ? Time complexity has been invented and it basically tells us that which is the better algorithm among the two ? And there comes in use - The Big O Notation. This Big O notation works to quantify the time complexity of an algorithm. It tells that the this algorithm will ta...

BITS Pilani material for the course Discrete Mathematics.

BITS Pilani material for the course Discrete Mathematics.

BITS Pilani material for the course Discrete Mathematics.

BITS Pilani material for the course Discrete Mathematics.

Introduction to Strategic Management with topics covered as follows. Benefits of strategic Management Challenges Theories of organizational adaptations Basic model of strategic Management Elements of strategic formulation Crafting strategy 4Ps in detail Types of strategy Environment scanning Environmental variables

Detail about Cold War

About Indian Political System