JKBOSE Class 12th Computer Science Notes | Study Materials
JKBOSE Class 12th Computer Science Notes
JKBOSE Class 12th Computer Science Notes PDF Download. If you are the students of Jammu and Kashmir and are looking for important questions and Notes of Computer Science Subject then you are at right place. Get JKBOSE important Study Materials Notes of all the subjects for Class 12th in this site but in this article we will provide you Computer Science Notes for Class 12th. So keep visiting and get the free and best notes.
Download Unitwise Notes Wise Notes foe Class 12th Computer Science
JKBOSE Class 12th All Subject Notes
Class 12th English Notes
Class 12th History Notes
Class 12th Economics Notes
Class 12th Geography Notes
Class 12th Poltical Science Notes
Class 12th Education Notes
Class 12th Education Notes
Class 12th Sociology Notes
Class 12th Mathamatics Notes
Class 12th Statistics Notes
Class 12th Islamic Stadies Notes
Class 12th Computer Notes
Class 12th Information Practice Notes
Class 12th English Literature Notes
Class 12th Environmental Science Notes
Class 12th Physics Notes
Class 12th Chemistry Notes
Class 12th Biology Notes
Class 12th Business Stadies Notes
Class 12th Accountancy Notes
Class 12th Entrepreneurship Notes
Class 12th Physical Education Notes
Class 12th Urdu Notes
Important Terms related to JKBOSE Class 12th Computer Science
Object Oriented Programming: Object Oriented Programming (OOP) in C++ is a programming paradigm that allows the creation and manipulation of objects.
Concept of Inheritance: In the context of computer programming and object-oriented programming (OOP) the concept of inheritance refers to the ability of a class to inherit properties and behaviors from another class. It is a fundamental principle that enables code reuse and promotes modular and efficient design.
Concept of Pointer: In computer programming a pointer is a variable that stores the memory address of another variable or object. It essentially "points" to the location in memory where the data is stored. Pointers are commonly used in low-level programming languages like C and C++ to efficiently manipulate and access data.
One Dimensional Array: A one-dimensional array also known as a linear array is a data structure that stores elements of the same data type in a contiguous block of memory. It is called "one-dimensional" because it represents a single row or a single line of data. Each element in the array is accessed using an index which represents its position within the array.
Database: A database is a structured collection of data that is organized and stored in a way that allows efficient retrieval management and manipulation of information.
Laws of Boolean Algebra: Boolean algebra is a mathematical system that deals with binary variables and logical operations. It was developed by mathematician George Boole in the mid-19th century and forms the foundation of digital logic and computer science. The laws of Boolean algebra are a set of fundamental rules that govern the manipulation and simplification of Boolean expressions.
PAN (Personal Area Network): A PAN is a network that covers a small area typically within a person's personal space such as a home or office. It enables communication between personal devices like smartphones laptops and tablets. Bluetooth and Wi-Fi are commonly used technologies for PANs.
Identity Laws: These laws state that the result is unchanged when a variable is combined with its complement or with the Boolean value "1" or "0". For example A + 0 = A or A • 1 = A.
Null Laws: These laws state that the result is always "0" when a variable is combined with its complement or with the Boolean value "0". For example A + A' = 1 or A • A' = 0.
Domination Laws: These laws state that the result is always equal to the variable itself or to "1" when a variable is combined with the Boolean value "1". For example A + 1 = 1 or A • 1 = A.
Concept of Inheritance: In the context of computer programming and object-oriented programming (OOP) the concept of inheritance refers to the ability of a class to inherit properties and behaviors from another class. It is a fundamental principle that enables code reuse and promotes modular and efficient design.
Concept of Pointer: In computer programming a pointer is a variable that stores the memory address of another variable or object. It essentially "points" to the location in memory where the data is stored. Pointers are commonly used in low-level programming languages like C and C++ to efficiently manipulate and access data.
One Dimensional Array: A one-dimensional array also known as a linear array is a data structure that stores elements of the same data type in a contiguous block of memory. It is called "one-dimensional" because it represents a single row or a single line of data. Each element in the array is accessed using an index which represents its position within the array.
Database: A database is a structured collection of data that is organized and stored in a way that allows efficient retrieval management and manipulation of information.
Laws of Boolean Algebra: Boolean algebra is a mathematical system that deals with binary variables and logical operations. It was developed by mathematician George Boole in the mid-19th century and forms the foundation of digital logic and computer science. The laws of Boolean algebra are a set of fundamental rules that govern the manipulation and simplification of Boolean expressions.
PAN (Personal Area Network): A PAN is a network that covers a small area typically within a person's personal space such as a home or office. It enables communication between personal devices like smartphones laptops and tablets. Bluetooth and Wi-Fi are commonly used technologies for PANs.
Identity Laws: These laws state that the result is unchanged when a variable is combined with its complement or with the Boolean value "1" or "0". For example A + 0 = A or A • 1 = A.
Null Laws: These laws state that the result is always "0" when a variable is combined with its complement or with the Boolean value "0". For example A + A' = 1 or A • A' = 0.
Domination Laws: These laws state that the result is always equal to the variable itself or to "1" when a variable is combined with the Boolean value "1". For example A + 1 = 1 or A • 1 = A.
