Lec 01 proposition (Discrete Mathematics)
•Download as PPT, PDF•
8 likes•1,725 views
The document summarizes key topics to be covered in Lecture 01 on discrete mathematics including: propositions which are statements that are either true or false; truth tables; logical operators like conjunction, disjunction, exclusive OR, and implication; bi-conditional statements; compound propositions; precedence of logical operators; translating sentences; and Boolean searches and bit operations. Examples of propositions and non-propositions are provided.
Report
Share
Report
Share
Recommended
Discrete Mathematics Lecture
The document discusses key concepts in discrete mathematics and logic. It defines propositions as basic building blocks represented by letters, and connectives as operators used to combine propositions like conjunction, disjunction, negation, and conditional statements. It provides truth tables showing the truth values of propositions under different connectives and examples of applying these logic rules.
Disrete mathematics and_its application_by_rosen _7th edition_lecture_1
This document provides an overview of propositional logic and logical operators. It defines basic concepts like propositions, logical connectives, and truth tables. Compound propositions are formed by combining one or more propositions using logical operators like conjunction, disjunction, negation, implication, equivalence, exclusive or, and others. Computer representations of logic using bits are also discussed, where true and false map to 1 and 0, and bitwise logic operators correspond directly to the logical connectives. Precedence rules for logical operators are defined.
Discrete math Truth Table
The document discusses truth tables and their use in determining the validity of arguments. It defines truth tables as listings of all possible combinations of true and false statements and the resulting truth values. It then explains conjunction, disjunction, negation, and logical equivalence through truth tables. Conjunction uses AND and is true only when both statements are true. Disjunction uses OR and is true if either statement is true. Negation reverses the truth value of a statement. Logical equivalence means statements have identical truth tables.
Discrete mathematics
Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics and computer science. It is a very good tool for improving reasoning and problem-solving capabilities.
Lec 02 logical eq (Discrete Mathematics)
This lecture covers propositional equivalences like tautology and contradiction, logical equivalences that have the same truth values, De Morgan's law, and predicates and quantifiers. Predicates assign properties to variables, and quantifiers like the universal and existential quantifier specify whether a property holds for all or some variables. The lecture also discusses binding variables and nested quantified expressions.
Discrete Math Presentation(Rules of Inference)
This document presents an introduction to rules of inference. It defines an argument and valid argument. It then explains several common rules of inference like modus ponens, modus tollens, addition, and simplification. Modus ponens and modus tollens are based on tautologies that make the conclusions logically follow from the premises. It also discusses two common fallacies - affirming the conclusion and denying the hypothesis - which are not valid rules of inference because they are not based on tautologies. Examples are provided to illustrate each rule of inference and fallacy.
CMSC 56 | Lecture 16: Equivalence of Relations & Partial Ordering
Equivalence of Relations & Partial Ordering
CMSC 56 | Discrete Mathematical Structure for Computer Science
November 21, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
Master theorem
This document provides an introduction to the Master Theorem, which can be used to determine the asymptotic runtime of recursive algorithms. It presents the three main conditions of the Master Theorem and examples of applying it to solve recurrence relations. It also notes some pitfalls in using the Master Theorem and briefly introduces a fourth condition for cases where the non-recursive term is polylogarithmic rather than polynomial.
Recommended
Discrete Mathematics Lecture
The document discusses key concepts in discrete mathematics and logic. It defines propositions as basic building blocks represented by letters, and connectives as operators used to combine propositions like conjunction, disjunction, negation, and conditional statements. It provides truth tables showing the truth values of propositions under different connectives and examples of applying these logic rules.
Disrete mathematics and_its application_by_rosen _7th edition_lecture_1
This document provides an overview of propositional logic and logical operators. It defines basic concepts like propositions, logical connectives, and truth tables. Compound propositions are formed by combining one or more propositions using logical operators like conjunction, disjunction, negation, implication, equivalence, exclusive or, and others. Computer representations of logic using bits are also discussed, where true and false map to 1 and 0, and bitwise logic operators correspond directly to the logical connectives. Precedence rules for logical operators are defined.
Discrete math Truth Table
The document discusses truth tables and their use in determining the validity of arguments. It defines truth tables as listings of all possible combinations of true and false statements and the resulting truth values. It then explains conjunction, disjunction, negation, and logical equivalence through truth tables. Conjunction uses AND and is true only when both statements are true. Disjunction uses OR and is true if either statement is true. Negation reverses the truth value of a statement. Logical equivalence means statements have identical truth tables.
Discrete mathematics
Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics and computer science. It is a very good tool for improving reasoning and problem-solving capabilities.
Lec 02 logical eq (Discrete Mathematics)
This lecture covers propositional equivalences like tautology and contradiction, logical equivalences that have the same truth values, De Morgan's law, and predicates and quantifiers. Predicates assign properties to variables, and quantifiers like the universal and existential quantifier specify whether a property holds for all or some variables. The lecture also discusses binding variables and nested quantified expressions.
Discrete Math Presentation(Rules of Inference)
This document presents an introduction to rules of inference. It defines an argument and valid argument. It then explains several common rules of inference like modus ponens, modus tollens, addition, and simplification. Modus ponens and modus tollens are based on tautologies that make the conclusions logically follow from the premises. It also discusses two common fallacies - affirming the conclusion and denying the hypothesis - which are not valid rules of inference because they are not based on tautologies. Examples are provided to illustrate each rule of inference and fallacy.
CMSC 56 | Lecture 16: Equivalence of Relations & Partial Ordering
Equivalence of Relations & Partial Ordering
CMSC 56 | Discrete Mathematical Structure for Computer Science
November 21, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
Master theorem
This document provides an introduction to the Master Theorem, which can be used to determine the asymptotic runtime of recursive algorithms. It presents the three main conditions of the Master Theorem and examples of applying it to solve recurrence relations. It also notes some pitfalls in using the Master Theorem and briefly introduces a fourth condition for cases where the non-recursive term is polylogarithmic rather than polynomial.
Discrete mathematics presentation
Basic Concept of discrete math. I discuss a few topic of basic discrete math. I think you get a clear concept. Topics are definition,story of discrete math, Importance of discrete math, and many other basic topic.
Discrete Mathematics
1. The document outlines discrete mathematics competencies covered at different levels in the undergraduate curriculum at Saint-Petersburg Electrotechnical University.
2. Many competencies are covered in the discrete mathematics course in the first year, while others are covered in courses like mathematical logic and algorithm theory in later years.
3. LETI aims to develop additional competencies beyond the SEFI levels, such as skills in mathematical logic, graphs, algorithms, and finite state machines.
mathematical induction
This document contains lecture notes on the principle of mathematical induction. It includes examples, exercises, and solutions working through proofs using induction for equations numbered 23-2 through 23-25. Each section is labeled with the relevant equation and includes steps to prove or solve problems related to that equation inductively.
Mathematical Logic
The document provides definitions and explanations of key concepts in propositional logic, including:
- Propositions, truth tables, and logical connectives like negation, conjunction, disjunction, implication, biconditional, and exclusive or.
- Well-formed formulas and logical properties like tautology, contradiction, substitution instance, and valid consequence.
- Logical equivalences between expressions using different connectives, such as showing an implication is equivalent to its contrapositive using truth tables.
Logic (slides)
This document defines logical propositions, statements, and logical operations such as negation, conjunction, disjunction, implication, equivalence, and quantification. Propositions can be combined using logical operations to form compound statements. Truth tables are used to evaluate compound statements based on the truth values of the component propositions. Logical properties such as commutativity, associativity, distributivity, idempotence and negation are also discussed.
CMSC 56 | Lecture 2: Propositional Equivalences
Propositional Equivalences
CMSC 56 | Discrete Mathematical Structure for Computer Science
August 23, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
Poset in Relations(Discrete Mathematics)
The document discusses partial ordered sets (POSETs). It begins by defining a POSET as a set A together with a partial order R, which is a relation on A that is reflexive, antisymmetric, and transitive. An example is given of the set of integers under the relation "greater than or equal to". It is shown that this relation satisfies the three properties of a partial order. The document emphasizes that a relation must satisfy all three properties - reflexive, antisymmetric, and transitive - to be considered a partial order. Some example relations on a set are provided and it is discussed which of these are partial orders.
Propositional logic
The document provides an overview of propositional logic including:
1. It defines statements, logical connectives, and truth tables. Logical connectives like negation, conjunction, disjunction and others are explained.
2. It discusses various logical concepts like tautology, contradiction, contingency, logical equivalence, and logical implications.
3. It outlines propositional logic rules and properties including commutative, associative, distributive, De Morgan's laws, identity law, idempotent law, and transitive rule.
4. It provides an example of using truth tables to test the validity of an argument about bachelors dying young.
Predicates and quantifiers
This document introduces predicates and quantifiers in predicate logic. It defines predicates as functions that take objects and return propositions. Predicates allow reasoning about whole classes of entities. Quantifiers like "for all" (universal quantifier ∀) and "there exists" (existential quantifier ∃) are used to make general statements about predicates over a universe of discourse. Examples demonstrate how predicates and quantifiers can represent concepts like "all parking spaces are full" or "some parking space is full." Laws of quantifier equivalence and negation rules with quantifiers are also presented.
Combinatorics
This document provides an introduction to combinatorics including the sum rule, product rule, permutations, and combinations. The sum rule states that if tasks are independent, the number of ways to do either task is the sum of the number of ways to do each individually. The product rule states that if tasks are independent, the number of ways to do both tasks is the product of the number of ways to do each. Permutations refer to ordered arrangements and combinations refer to unordered arrangements. The document includes examples of applying these concepts.
Valid & invalid arguments
The document discusses valid and invalid arguments in propositional logic. It defines arguments and their forms, and validity. It explains how to test an argument form for validity using a truth table. It then discusses several rules of inference for propositional logic including modus ponens, modus tollens, generalization, simplification, disjunctive syllogism, hypothetical syllogism, and provides examples of applying these rules. Finally, it discusses arguments with quantified statements and the rules of universal instantiation, universal modus ponens, and universal modus tollens.
Unit 1 quantifiers
The document defines logical quantifiers such as existence and uniqueness quantifiers. It discusses how quantifiers can be used to restrict domains and bind variables. It provides examples of translating English statements to logical expressions using quantifiers and discusses precedence, logical equivalences, and negating quantifier expressions.
Intro to Discrete Mathematics
This document provides an overview of the topics covered in a discrete structures course, including logic, sets, relations, functions, sequences, recurrence relations, combinatorics, probability, and graphs. It defines discrete mathematics as the study of mathematical structures that have distinct, separated values rather than varying continuously. Some examples given are problems involving a fixed number of islands/bridges or connecting a set number of cities with telephone lines. Logic is introduced as the study of valid vs. invalid arguments, and basic logical concepts like statements, truth values, compound statements, logical connectives, negation, and truth tables are outlined.
Discrete Mathematics Lecture Notes
Unit I of the syllabus covers propositional logic and counting theory. It introduces concepts such as propositions, logical connectives like conjunction, disjunction, negation, implication and biconditional. It discusses how to represent compound statements using these connectives and their truth tables. The unit also covers topics like predicate logic, methods of proof, mathematical induction and fundamental counting principles like permutations and combinations. It aims to provide the logical foundations for discrete mathematics concepts that will be useful in computer science and information technology.
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Discrete Mathematics chapter 2 covers propositional logic. A proposition is a statement that is either true or false. Propositional logic uses propositional variables and logical operators like negation, conjunction, disjunction, implication and biconditional. Truth tables are used to determine the truth value of compound propositions formed using these operators. Logical equivalences between compound propositions can be shown using truth tables or by applying equivalence rules.
Lecture 2 predicates quantifiers and rules of inference
1) Predicates become propositions when variables are quantified by assigning values or using quantifiers. Quantifiers like ∀ and ∃ are used to make statements true or false for all or some values.
2) ∀ (universal quantifier) means "for all" and makes a statement true for all values of a variable. ∃ (existential quantifier) means "there exists" and makes a statement true if it is true for at least one value.
3) Predicates with unbound variables are neither true nor false. Binding variables by assigning values or using quantifiers turns predicates into propositions that can be evaluated as true or false.
Chapter 2: Relations
Mathematics; Product sets; Relations; Inverse Relation; Representing Relations Using Matrices; Composition of Relations; Types of Relations; Reflexive and Irreflexive Relations; Symmetric and Antisymmetric Relations; Transitive Relations
Equivalence Relations
Partial Ordering Relations
Closure Properties
Predicate Logic
The document discusses various concepts in predicate logic including:
1. Universal and existential quantification allow representing statements like "for all" or "there exists".
2. Syntax of first-order logic includes constants, variables, functions, predicates, and quantifiers.
3. A predicate is satisfiable if true for some values, valid if true for all values, and unsatisfiable if false for all values.
4. Negating quantifiers flips the quantifier and negates the predicate. Free variables can be substituted while bound variables cannot. Restrictions filter domains.
Householder transformation | Householder Reflection with QR Decomposition
Householder Reflection or Transformation is one the methods of decomposing a matrix into an Orthogonal Matrix (Q) and Right Upper Triangular Matrix (R). It helps to solve systems of equation using backward substitution.
Discrete Mathematics - Propositional Logic
This document introduces some basic concepts in propositional logic. It defines propositional logic as the study of how simple propositions combine to form more complex propositions. It discusses statements as descriptions that can be true or false, and provides examples. It also introduces logical connectives like negation, conjunction, disjunction, implication and biconditional, and shows how they combine atomic propositions into compound propositions. Truth tables are provided to illustrate the truth values of compound propositions formed with different connectives.
Main Java[All of the Base Concepts}.docx
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
More Related Content
What's hot
Discrete mathematics presentation
Basic Concept of discrete math. I discuss a few topic of basic discrete math. I think you get a clear concept. Topics are definition,story of discrete math, Importance of discrete math, and many other basic topic.
Discrete Mathematics
1. The document outlines discrete mathematics competencies covered at different levels in the undergraduate curriculum at Saint-Petersburg Electrotechnical University.
2. Many competencies are covered in the discrete mathematics course in the first year, while others are covered in courses like mathematical logic and algorithm theory in later years.
3. LETI aims to develop additional competencies beyond the SEFI levels, such as skills in mathematical logic, graphs, algorithms, and finite state machines.
mathematical induction
This document contains lecture notes on the principle of mathematical induction. It includes examples, exercises, and solutions working through proofs using induction for equations numbered 23-2 through 23-25. Each section is labeled with the relevant equation and includes steps to prove or solve problems related to that equation inductively.
Mathematical Logic
The document provides definitions and explanations of key concepts in propositional logic, including:
- Propositions, truth tables, and logical connectives like negation, conjunction, disjunction, implication, biconditional, and exclusive or.
- Well-formed formulas and logical properties like tautology, contradiction, substitution instance, and valid consequence.
- Logical equivalences between expressions using different connectives, such as showing an implication is equivalent to its contrapositive using truth tables.
Logic (slides)
This document defines logical propositions, statements, and logical operations such as negation, conjunction, disjunction, implication, equivalence, and quantification. Propositions can be combined using logical operations to form compound statements. Truth tables are used to evaluate compound statements based on the truth values of the component propositions. Logical properties such as commutativity, associativity, distributivity, idempotence and negation are also discussed.
CMSC 56 | Lecture 2: Propositional Equivalences
Propositional Equivalences
CMSC 56 | Discrete Mathematical Structure for Computer Science
August 23, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
Poset in Relations(Discrete Mathematics)
The document discusses partial ordered sets (POSETs). It begins by defining a POSET as a set A together with a partial order R, which is a relation on A that is reflexive, antisymmetric, and transitive. An example is given of the set of integers under the relation "greater than or equal to". It is shown that this relation satisfies the three properties of a partial order. The document emphasizes that a relation must satisfy all three properties - reflexive, antisymmetric, and transitive - to be considered a partial order. Some example relations on a set are provided and it is discussed which of these are partial orders.
Propositional logic
The document provides an overview of propositional logic including:
1. It defines statements, logical connectives, and truth tables. Logical connectives like negation, conjunction, disjunction and others are explained.
2. It discusses various logical concepts like tautology, contradiction, contingency, logical equivalence, and logical implications.
3. It outlines propositional logic rules and properties including commutative, associative, distributive, De Morgan's laws, identity law, idempotent law, and transitive rule.
4. It provides an example of using truth tables to test the validity of an argument about bachelors dying young.
Predicates and quantifiers
This document introduces predicates and quantifiers in predicate logic. It defines predicates as functions that take objects and return propositions. Predicates allow reasoning about whole classes of entities. Quantifiers like "for all" (universal quantifier ∀) and "there exists" (existential quantifier ∃) are used to make general statements about predicates over a universe of discourse. Examples demonstrate how predicates and quantifiers can represent concepts like "all parking spaces are full" or "some parking space is full." Laws of quantifier equivalence and negation rules with quantifiers are also presented.
Combinatorics
This document provides an introduction to combinatorics including the sum rule, product rule, permutations, and combinations. The sum rule states that if tasks are independent, the number of ways to do either task is the sum of the number of ways to do each individually. The product rule states that if tasks are independent, the number of ways to do both tasks is the product of the number of ways to do each. Permutations refer to ordered arrangements and combinations refer to unordered arrangements. The document includes examples of applying these concepts.
Valid & invalid arguments
The document discusses valid and invalid arguments in propositional logic. It defines arguments and their forms, and validity. It explains how to test an argument form for validity using a truth table. It then discusses several rules of inference for propositional logic including modus ponens, modus tollens, generalization, simplification, disjunctive syllogism, hypothetical syllogism, and provides examples of applying these rules. Finally, it discusses arguments with quantified statements and the rules of universal instantiation, universal modus ponens, and universal modus tollens.
Unit 1 quantifiers
The document defines logical quantifiers such as existence and uniqueness quantifiers. It discusses how quantifiers can be used to restrict domains and bind variables. It provides examples of translating English statements to logical expressions using quantifiers and discusses precedence, logical equivalences, and negating quantifier expressions.
Intro to Discrete Mathematics
This document provides an overview of the topics covered in a discrete structures course, including logic, sets, relations, functions, sequences, recurrence relations, combinatorics, probability, and graphs. It defines discrete mathematics as the study of mathematical structures that have distinct, separated values rather than varying continuously. Some examples given are problems involving a fixed number of islands/bridges or connecting a set number of cities with telephone lines. Logic is introduced as the study of valid vs. invalid arguments, and basic logical concepts like statements, truth values, compound statements, logical connectives, negation, and truth tables are outlined.
Discrete Mathematics Lecture Notes
Unit I of the syllabus covers propositional logic and counting theory. It introduces concepts such as propositions, logical connectives like conjunction, disjunction, negation, implication and biconditional. It discusses how to represent compound statements using these connectives and their truth tables. The unit also covers topics like predicate logic, methods of proof, mathematical induction and fundamental counting principles like permutations and combinations. It aims to provide the logical foundations for discrete mathematics concepts that will be useful in computer science and information technology.
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Discrete Mathematics chapter 2 covers propositional logic. A proposition is a statement that is either true or false. Propositional logic uses propositional variables and logical operators like negation, conjunction, disjunction, implication and biconditional. Truth tables are used to determine the truth value of compound propositions formed using these operators. Logical equivalences between compound propositions can be shown using truth tables or by applying equivalence rules.
Lecture 2 predicates quantifiers and rules of inference
1) Predicates become propositions when variables are quantified by assigning values or using quantifiers. Quantifiers like ∀ and ∃ are used to make statements true or false for all or some values.
2) ∀ (universal quantifier) means "for all" and makes a statement true for all values of a variable. ∃ (existential quantifier) means "there exists" and makes a statement true if it is true for at least one value.
3) Predicates with unbound variables are neither true nor false. Binding variables by assigning values or using quantifiers turns predicates into propositions that can be evaluated as true or false.
Chapter 2: Relations
Mathematics; Product sets; Relations; Inverse Relation; Representing Relations Using Matrices; Composition of Relations; Types of Relations; Reflexive and Irreflexive Relations; Symmetric and Antisymmetric Relations; Transitive Relations
Equivalence Relations
Partial Ordering Relations
Closure Properties
Predicate Logic
The document discusses various concepts in predicate logic including:
1. Universal and existential quantification allow representing statements like "for all" or "there exists".
2. Syntax of first-order logic includes constants, variables, functions, predicates, and quantifiers.
3. A predicate is satisfiable if true for some values, valid if true for all values, and unsatisfiable if false for all values.
4. Negating quantifiers flips the quantifier and negates the predicate. Free variables can be substituted while bound variables cannot. Restrictions filter domains.
Householder transformation | Householder Reflection with QR Decomposition
Householder Reflection or Transformation is one the methods of decomposing a matrix into an Orthogonal Matrix (Q) and Right Upper Triangular Matrix (R). It helps to solve systems of equation using backward substitution.
Discrete Mathematics - Propositional Logic
This document introduces some basic concepts in propositional logic. It defines propositional logic as the study of how simple propositions combine to form more complex propositions. It discusses statements as descriptions that can be true or false, and provides examples. It also introduces logical connectives like negation, conjunction, disjunction, implication and biconditional, and shows how they combine atomic propositions into compound propositions. Truth tables are provided to illustrate the truth values of compound propositions formed with different connectives.
What's hot (20)
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Lecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inference
Householder transformation | Householder Reflection with QR Decomposition
Householder transformation | Householder Reflection with QR Decomposition
Recently uploaded
Main Java[All of the Base Concepts}.docx
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
BBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...Nguyen Thanh Tu Collection
https://app.box.com/s/y977uz6bpd3af4qsebv7r9b7s21935vdSouth African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
PCOS corelations and management through Ayurveda.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Librarians are leading the way in creating future-ready citizens – now we need to update our spaces to match. In this session, attendees will get inspiration for transforming their library spaces. You’ll learn how to survey students and patrons, create a focus group, and use design thinking to brainstorm ideas for your space. We’ll discuss budget friendly ways to change your space as well as how to find funding. No matter where you’re at, you’ll find ideas for reimagining your space in this session.
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcThe History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...National Information Standards Organization (NISO)
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
Recently uploaded (20)
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
Lec 01 proposition (Discrete Mathematics)
- 1. LECTURE 01
- 2. Textbook Discrete Mathematics & Its Applications - Kenneth H. Rosen
- 3. Topics to be covered today Proposition Truth Table Conjunction & Disjunction Exclusive OR & Implication Bi-conditional Statement Compound Propositions Logical Operator Precedence Translating Sentences Boolean Searches Bit Operation
- 4. Proposition A Proposition is a Statement that is Either True or False For Example: 1. Washington, D.C., is the capital of the United States of America 2. Toronto is the capital of Canada 3. 1 + 1 = 2 4. 2 + 2 = 3
- 5. Proposition Sentences that are NOT Propositions 1 & 2 are Not Propositions Because they Don’t conclude anything 3 & 4 are Not Propositions Because ‘x’ can be Anything
- 6. Truth Table Here ‘ ¬ ’ is Negation Operator
- 8. Exclusive OR & Implication
- 14. Boolean Searches
- 15. Bit Operations