BCA 101 Course Plan
- Programme Code 020
- Course Code BCA-101
- Course TypeCore
- Programme Bachelor's in Computer Application
- Course Name Understand the basics conceptual math and relations.
- L - T/P - Credits 3 - 1 - 4
- Course Outcome
- CO1 Understand the basics conceptual math and relations.
- CO2 Compare and design, sorting and hashing techniques.
- CO3 Compare and design, sorting and hashing techniques.
- CO4 Appraise and determine the correct logic and solutions for any given real world problem.
- Tecniatv Playlist linkhttps://www.youtube.com/
| Unit No. | Lecture No. | Topic | Sessional Outcome | Mapping with CO | ICT Tools / Class Material (PPT ) | First Shift | Second Shift | Guest Lecture | Expert Lecture |
|---|---|---|---|---|---|---|---|---|---|
| 1 | L1 | Set Theory | Students will learn about Sets, Subsets, Equal Sets, Universal Sets, Finite and Infinite Sets |  |
 |
|
|
|
|
| 1 | L2 | Set Theory | Students will learn about operations on Sets | |
|
|
|
|
|
| 1 | L3 | Set Theory | Students will learn about Algebra of sets, Cartesian product. | |
|
|
|
|
|
| 1 | L4 | Revision | |
|
|
|
|
||
| 1 | L5 | Equivalence Relation | Students will learn about of euivalance Relations | |
|
|
|
|
|
| 1 | L6 | Partial Order | Students will learn about Partial Order | |
|
|
|
|
|
| 1 | L7 | Composition of relations, and Representation of relations using digraph and Matrix | Students will learn about representation of relation or composition of relation | |
|
|
|
|
|
| 1 | L8 | Function: Domain and Range, onto, into and One to One Functions, Composite and Inverse | Students will learn about the properties of function | |
|
|
|
|
|
| 1 | L9 | Hashing functions, Recursive function | Students will learn about the use of hashing and recurssive function | |
|
|
|
|
|
| 1 | L10 | Revision | |
|
|
|
|
||
| 1 | L11 | Introduction, Proposition, First order logic, Basic logical | Students will learn about proposition | |
|
|
|
|
|
| 1 | L12 | Truth tables, tautologies, contradictions | Students will learn about types of truth table | |
|
|
|
|
|
| 1 | L13 | Algebra of Propositions | Students will learn, How we can use Algebra in proposition | |
|
|
|
|
|
| 1 | L14 | logical implications, logical equivalence | Students will learn about of logical equivalance proposition | |
|
|
|
|
|
| 1 | L15 | Predicates, Universal and existential quantifiers | Students will learn about the predicates, quatifiers | |
|
|
|
|
|
| 1 | L16 | Revision | |
|
|
|
|
||
| 2 | L17 | Partial Order Sets | Students will learn about of POSET | |
|
|
|
|
|
| 2 | L18 | Totally ordered set, Representation of POSETS using Hasse diagram | Students will learn about Hasse Diagram | |
|
|
|
|
|
| 2 | L19 | Chains, Maximal and Minimal elements, Greatest lower bound, least upper bound | Students will learn, How fill find the chain, maximal ,minimal etc elements Lattice? | |
|
|
|
|
|
| 2 | L20 | Chains, Maximal and Minimal elements, Greatest lower bound, least upper bound | Students will learn, How fill find the chain, maximal ,minimal etc elements Lattice? | |
|
|
|
|
|
| 2 | L21 | Revision | |
|
|
|
|
||
| 2 | L22 | Lattices and Algebraic Structure, Principle of Duality | Students will learn about principle of dulatity | |
|
|
|
|
|
| 2 | L23 | Lattices and Algebraic Structure, Principle of Duality | Students will learn about principle of dulity | |
|
|
|
|
|
| 2 | L24 | Elementary Properties of Lattices, Atoms | Students will learn about the properties of llatice | |
|
|
|
|
|
| 2 | L25 | Sub lattices, Bounded lattice | Students will learn about type of lattice | |
|
|
|
|
|
| 2 | L26 | Sub lattices, Bounded lattice | Students will learn about type of lattice | |
|
|
|
|
|
| 2 | L27 | Distributed & Complemented Lattices | Students will learn about DCL | |
|
|
|
|
|
| 2 | L28 | Distributed & Complemented Lattices | Students will learn about DCL | |
|
|
|
|
|
| 2 | L29 | Isomorphic lattices. Boolean lattice. | Students will learn about Isomorphic and bolean llatice | |
|
|
|
|
|
| 2 | L30 | Isomorphic lattices. Boolean lattice. | Students will learn about Isomorphic and bolean llatice | |
|
|
|
|
|
| 3 | L31 | Revision | |
|
|
|
|
||
| 3 | L32 | Basic Counting Principles, Permutations | Students will learn about basic counting priciple and permutation | |
|
|
|
|
|
| 3 | L33 | Permutations of things not all different, Circular Permutations | Students will learn about type of permutation | |
|
|
|
|
|
| 3 | L34 | Permutations of things not all different, Circular Permutations, | Students will learn about type of permutation | |
|
|
|
|
|
| 3 | L35 | Revision | |
|
|
|
|
||
| 3 | L36 | Combinations, Restricted Permutations and Combinations | Students will learn about combination and types of combination | |
|
|
|
|
|
| 3 | L37 | Combinations, Restricted Permutations and Combinations | Students will learn about combination and types of combination | |
|
|
|
|
|
| 3 | L38 | Revision | |
|
|
|
|
||
| 3 | L39 | Derangement, Pascal‟s Triangle | Students will learn about Pascal's triangle. | |
|
|
|
|
|
| 3 | L40 | Binomial Theorem | Students will learn about Binomial theoram | |
|
|
|
|
|
| 3 | L41 | Binomial Theorem | Students will learn about Binomial theoram | |
|
|
|
|
|
| 3 | L42 | Revision | |
|
|
|
|
||
| 3 | L43 | Introduction, Order of Recurrence Relations | Students will learn about of recurrence relations | |
|
|
|
|
|
| 3 | L44 | Degree of Recurrence Relations, Linear Homogeneous Recurrence Relations | Students will learn about homogenous RR | |
|
|
|
|
|
| 3 | L45 | Non Homogeneous Recurrence Relations | Students will learn about non homogenous RR | |
|
|
|
|
|
| 3 | L46 | Non Homogeneous Recurrence Relations | Students will learn about non homogenous RR | |
|
|
|
|
|
| 3 | L47 | Solution of linear homogeneous and non-non homogeneous recurrence | Students will learn about LH and NLH RR | |
|
|
|
|
|
| 3 | L48 | Solution of linear homogeneous and non-non homogeneous recurrence | Students will learn about LH and NLH RR | |
|
|
|
|
|
| 3 | L49 | Revision | |
|
|
|
|
||
| 4 | L50 | Introduction, Degree of a vertex of a graph, Handshaking Theorem | Students will learn about graph theory | |
|
|
|
|
|
| 4 | L51 | Types of Graphs | Students will learn about graph theory | |
|
|
|
|
|
| 4 | L52 | Types of Graphs | Students will learn about graph theory | |
|
|
|
|
|
| 4 | L53 | Matrix representation of a graph: adjacent and incidence matrices | Students will learn about of representation of graph | |
|
|
|
|
|
| 4 | L54 | Matrix representation of a graph: adjacent and incidence matrices | Students will learn about graph theory | |
|
|
|
|
|
| 4 | L55 | Isomorphic graphs, path and circuit | Students will learn about of Isomorphic graphs, path and circuit | |
|
|
|
|
|
| 4 | L56 | Floyd‟s and Warshall algorithms | Students will learn, How implement to Floyd warshall alg | |
|
|
|
|
|
| 4 | L57 | Connected graph, Hamiltonian graph | Students will learn about of hamiltonian graph | |
|
|
|
|
|
| 4 | L58 | Euler graph | Students will learn about of Euler graph | |
|
|
|
|
|
| 4 | L59 | Revision | |
|
|
|
|
||
| 4 | L60 | Graph coloring (Vertex, Edges and Map) | |
|
|
|
|
# As per Scheme & Syllabus Of Guru Gobind Singh Indraprastha University, New Delhi 2022-23 Onwards.