0% found this document useful (0 votes)
33 views6 pages

Semester Proficiency Presentation

The document covers various topics in computer science and electrical engineering, including binary relations, Von Neumann architecture, object-oriented programming, binary trees, and Kirchhoff's laws. It explains the fundamental concepts of each topic, such as the definition of binary relations, the structure of classes in OOP, and the principles of KCL and KVL in electrical circuits. This presentation serves as a comprehensive overview of key concepts in discrete structures, computer architecture, data structures, and basic electrical engineering.

Uploaded by

malviyat42
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
33 views6 pages

Semester Proficiency Presentation

The document covers various topics in computer science and electrical engineering, including binary relations, Von Neumann architecture, object-oriented programming, binary trees, and Kirchhoff's laws. It explains the fundamental concepts of each topic, such as the definition of binary relations, the structure of classes in OOP, and the principles of KCL and KVL in electrical circuits. This presentation serves as a comprehensive overview of key concepts in discrete structures, computer architecture, data structures, and basic electrical engineering.

Uploaded by

malviyat42
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Semester proficiency presentation

Submitted by: Submitted to:


Mr KHEMCHAND
Tushar Malviya
SHAKAYAWAR
BTAM24O1067 Ms GEETIKA SHARMA
HAZRA
Discrete structure
Binary relation

A binary relation R from set A to B is a subset of the


Cartesian product A × B.
It defines how elements of one set relate to elements of
another (or the same) set.
If A = B, it's called a relation on A.
Notation:
If (a, b) ∈ R, we write a R b (read as "a is related to b").
Von Neumann Model – Architecture of Stored-Program Computers

Modern computer architecture


Von Neumann Architecture

The Von Neumann Architecture is a computer design model


where:
•Data and instructions are stored together in the same memory.
•Instructions are executed sequentially, one at a time.
It was proposed by John von Neumann in 1945, and forms the
basis of most computers today.
Object oriented programming
Class in Object oriented programming

• A class is a blueprint or user-defined data type that contains data


members and member functions to represent real-world entities.
Which helps in Encapsulation one of the feature of OOPs
• Components of a Class:
• Data Members – Variables to hold data/state of objects
• Member Functions – Functions that operate on data members
• Constructor – Special function that runs automatically when an object
is created
• Object – Instance of a class
Data Structures
Binary Tree

A Binary Tree is a hierarchical data structure in which each node


has at most two children, referred to as the left child and rig
Basic Terminology -
1. Root: Top node of the tree
2. Leaf: Node with no children
3. Parent & Child: Connected nodes (one level apart)
4. Height: Longest path from root to a leaf
5. Depth: Distance of a node from the roo
Basic electrical & electronics engineering:
Kirchhoff’s Current Law (KCL)
KVL – Kirchhoff’s Voltage Law
#Kirchhoff’s Current Law states that:
• The algebraic sum of currents entering a node (or junction) is zero.
• i.e total current entering a junction = total current leaving the
junction
#Mathmatical equation:
• ∑Iin​=∑Iout​
#Kirchhoff’s Voltage Law states that:
• The algebraic sum of all voltages in a closed loop is zero.
#Mathmatical equation:
• ∑V=0(Rise = Drop)

You might also like