Cohesion

Duration: 7 min

This video lesson is available to enrolled students.

Inside: a video lesson and guided study material.

Module outline

English Comprehension/Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Vocabulary, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Conjunction, Pronoun, Noun, Adjectives, Adverb, Modals, Cloze Test (Cloze Passage), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
Logical Ability: Coding Decoding, Directions (Direction Test), Analogy, Inequality, Data Sufficiency, Series (Number and Letter Series) (Numerical Relations and Reasoning), Syllogisms, Seating Arrangements, Puzzle Solving (Puzzles), Blood Relations, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Data Arrangement, Venn Diagram, Calendar, Clock
Quantitative Ability: Logarithm, Permutation and Combination, Probability, Profit and Loss, Speed Time and Distance, Mixture and Alligation, Partnership, Simple Interest and Compound Interest, Percentage, Ratio and Proportion (Ratios), Average, Time and Work, Pipe and Cistern, Number System, Divisibility Rules, HCF LCM, Algebra, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Age Problems, Data Interpretation, Sequence and Series (Series)
Basic Analytical Ability: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Selection Decision Table (Decision Making)
Computer Programming: Pseudo Codes, Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
DBMS (Computer Science): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Concurrency Control, Database Security & Authorization
SQL (Computer Science): SQL
OS (Computer Science): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Process Synchronization, Threads & Process Creation, Memory Management, Virtual Memory, File Management
Computer Networks (Computer Science): Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
Data Structures (Computer Science): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
OOPs (Computer Science): Object Oriented Programming (OOPS)
Software Engineering (Computer Science): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
SVAR Conversational - Spoken English: Communication Assessment
HR Interview: MR & HR Interview Preparation

AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on the concept of cohesion in software engineering, presented by an instructor from Knowledge Gate Eduventures. The lecture begins by defining cohesion as a measure of the strength of the relationship between the functions within a software module. A central visual aid is a green, upward-pointing arrow diagram that ranks six types of cohesion from lowest to highest, with 'Coincidental' at the bottom and 'Functional' at the top. The instructor then systematically explains each type of cohesion, starting with the weakest, Coincidental Cohesion, which is defined as a module where functions have no meaningful relationship. The lecture progresses through Logical Cohesion (functions perform similar operations), Temporal Cohesion (functions are executed in the same time span), Procedural Cohesion (functions are part of a single algorithm), Communicational Cohesion (functions operate on the same data structure), and concludes with the strongest form, Functional Cohesion, where functions cooperate to perform a single, well-defined task. The video uses clear definitions and practical examples for each type, such as a module for mouse control, to illustrate the concepts. The presentation concludes with a 'Thanks for Watching' screen.

Chapters

0:00 – 2:00 00:00-02:00
The video opens with a title card for 'SOFTWARE ENGINEERING' and '#knowledgegate'. The main lecture begins, introducing the topic of 'Cohesion' with the definition: 'We mean the measure of functions strength of the module.' A green, arrow-shaped diagram is displayed, ranking six types of cohesion from 'Low' at the bottom to 'High' at the top. The types listed are, from bottom to top: Coincidental, Logical, Temporal, Procedural, Communicational, and Function. The instructor, Sanchit Jain, is visible in a small window, and the 'Knowledge Gate Educator' logo is present. The slide is static, and the instructor begins to explain the concept of cohesion.
2:00 – 5:00 02:00-05:00
The lecture continues with a detailed explanation of the different types of cohesion, starting with 'Coincidental Cohesion'. The on-screen text defines it as 'the worst kind of cohesion where the only relationship between the functions which are present in a module is random or coincidental.' The instructor elaborates on this, emphasizing its poor quality. The visual remains the same, with the arrow diagram and the instructor's video feed. The instructor then moves on to the next type, 'Logical Cohesion', which is defined as 'All the elements of a module perform similar or slightly similar operations, for e.g. if mouse, printer, scanner functions are written in the same module.' The instructor provides a clear example to illustrate this concept.
5:00 – 7:27 05:00-07:27
The instructor proceeds to explain the remaining types of cohesion. 'Temporal Cohesion' is defined as functions related by the fact that they must be executed in the same time span, with an example of two functions: one to catch an exception and another to flash an error message. Next, 'Procedural Cohesion' is described as functions related through a flow control, being part of an algorithm, with an example of checking file access permission and then opening the file. 'Communicational Cohesion' is explained as functions operating on the same data structure, using 'push' and 'pop' as an example. Finally, 'Sequential Cohesion' is defined as functions being part of a sequence with data dependency, such as a function providing data and another processing it. The lecture concludes with 'Functional Cohesion', where functions cooperate to perform a single function, using a mouse control module as an example. The video ends with a 'Thanks for Watching' screen.

The video presents a structured and progressive lesson on software cohesion, a fundamental concept in software design. It begins with a clear definition and a visual hierarchy that establishes the relative strength of different cohesion types. The instructor systematically deconstructs each type, starting from the weakest (Coincidental) and building up to the strongest (Functional), using a consistent format of definition and a practical example for each. This methodical approach, combined with the clear visual aid of the arrow diagram, effectively teaches the student to understand and differentiate between the various forms of cohesion, ultimately emphasizing that high cohesion, particularly functional cohesion, is a desirable goal in software engineering.