Picture3.jpgTo gain hands-on knowledge on important events of cell division; viability and fertility of pollen grain, and solve problems regarding monohybrid cross and dihybrid cross.
- Teacher: Md. Abdur Rahim
Skill Level: Beginner
FREE
Updated
19 Feb 2025
Lessons
20
Enrolled
26
Language
English (en)
Skill Level
Beginner
Course Overview
To gain hands-on knowledge on important events of cell division; viability and fertility of pollen grain, and solve problems regarding monohybrid cross and dihybrid cross.
Course Content
Loading...
Enrolment options
Warning: getimagesize(/datadrive/moodledata/filedir/5e/69/5e6992b7703526f5e218f09d2dde9bd01147bad5): Failed to open stream: No such file or directory in /home/blcclouddb/public_html/lib/filestorage/file_system.php on line 410
Picture3.jpgRelated Courses
21 Lessons
Updated: Feb 2025
AGS Spring 2025
28 Lessons
Updated: Feb 2025
AGS Spring 2025
21 Lessons
Updated: Mar 2025
AGS Spring 2025
This course is designed to provide students with hands-on knowledge and skills related to crop identification, tillage, planting, nutrient management, and yield estimation. Through field visits and practical exercises, students will develop an understanding of essential tools, implements, and agronomic practices used in crop production. By the end of this course, students will be able to: Identify major field crops and understand their agronomic importance. Operate and handle basic tillage and intercultural implements. Demonstrate practical skills in soil preparation, sowing, and fertilizer application. Compute appropriate seed rates and fertilizer doses for different crops. Estimate crop yields effectively and understand the principles behind it.
21 Lessons
Updated: Mar 2025
Latest Courses
21 Lessons
Updated: May 2025
CSE Summer 2025
Discrete mathematics is a branch of mathematics that deals with finite and discrete objects, such as integers, sets, graphs, logic, and algorithms. It is often used as a foundation for computer science, software engineering, cryptography, data science, and other fields that involve computation and information. In this course the following topics will be covered: Logic and proofs: how to use symbols, truth tables, and rules of inference to reason about propositions, predicates, and quantifiers. Sets and functions: how to define, manipulate, and compare sets, relations, functions, and cardinality. Number theory and cryptography: how to use modular arithmetic, divisibility, prime numbers, and congruences to encrypt and decrypt messages, and to test the security of cryptographic schemes. Combinatorics and probability: how to count and enumerate objects, permutations, combinations, binomial coefficients, and apply the principles of inclusion-exclusion, pigeonhole, and induction. Recursion and recurrence relations: how to define and solve problems that involve recursive definitions, such as Fibonacci numbers, factorial, and Tower of Hanoi. Graph theory and algorithms: how to represent, traverse, and analyze graphs, trees, networks, and their properties, such as connectivity, coloring, Eulerian and Hamiltonian paths, and planarity. Computability and complexity: how to classify problems and algorithms according to their decidability, solvability, and efficiency, using concepts such as Turing machines, halting problems, NP-completeness, and big-O notation.
15 Lessons
Updated: May 2025
THM Summer 2025
10 Lessons
Updated: May 2025