Mapping Object Orieted Concept using Non-Object Oriented Language
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
- CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
- CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
- CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
- CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
- CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
- CS | 08 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
- CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
- CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
- CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
- CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
- GS Paper | 01 | Indian and World Geography: Geography
- GS Paper | 02 | History: History
- GS Paper | 03 | Indian Economy & Social Development: Indian Economy
- GS Paper | 04 | General Science: Biology, Chemistry, Physics
- GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
- GS Paper | 06 | Indian Polity and Governance: Polity
- GS Paper | 07 | Current Events: GK- Current Affairs
- UPLT Live Classes Notes: UPLT Live Classes
- UPLT Full Mock Tests Tier 1:
- UPLT Full Mock Tests Tier 2:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture covers the process of mapping object-oriented concepts into non-object-oriented languages. Key topics include translating classes into data structures, passing arguments to methods, allocating storage for objects, implementing inheritance, and handling method resolution. The instructor uses slides and handwritten annotations to explain how OOP features like state, identity, and polymorphism can be adapted for procedural programming.
Chapters
0:00 – 2:00 00:00-02:00
The lecture begins with the topic 'Mapping object oriented concepts using non-object oriented language'. The first major step presented on the slide is 'Translate classes into data structures'. The instructor explains that in a non-object-oriented language, a class is implemented as a single contiguous block of attributes. She highlights that each attribute contains a variable, giving the object state and identity. She writes 'class student' and 'struct student' on the screen to demonstrate how a class definition maps to a structure definition. The slide notes that a variable identifying an object must be implemented as a sharable reference. The instructor underlines 'single contiguous block of attributes' and 'variable' to emphasize these structural requirements. She explains that this mapping allows the object to have state and identity, which are subject to side effects. This foundational step sets the stage for understanding how object-oriented principles are adapted for procedural languages. The slide also mentions that an object has state and identity and is subject to side effects, which is a key characteristic of objects in OOP.
2:00 – 5:00 02:00-05:00
The second step discussed is 'Pass arguments to methods'. The slide states that every method has at least one argument. In a non-object-oriented language, this argument must be made explicit. The instructor writes 'methods + argument' to illustrate that the object itself is passed as an argument. She explains that if a method contains additional objects as arguments, a reference must be passed if the value needs to be updated. The third step is 'Allocate storage for objects'. The slide lists options: statically, dynamically, or on a stack. The instructor writes 'memory allocation' and 'static' and 'dynamic' on the screen. She notes that temporary and intermediate objects are often stack-based, while dynamically allocated objects are used when the number is unknown at compile time. She mentions that a general object can be implemented as a data structure allocated on request from a heap. This section clarifies how memory management differs in non-OOP contexts compared to automatic garbage collection in OOP languages. The slide specifically mentions that objects can be allocated statically, dynamically, or on a stack, providing flexibility in implementation.
5:00 – 9:32 05:00-09:32
The lecture progresses to 'Implement inheritance in data structures'. The slide lists three ways to handle this: avoid it, flatten the class hierarchy, or break out separate objects. The instructor draws a diagram showing a 'Parent' and 'Student' relationship to explain hierarchy. She writes 'polymorphism' and 'overloading' on the screen. The next section is 'Implement method resolutions'. The slide lists avoiding it, resolving at compile time, or resolving at run time. The instructor writes 'static binding' and 'dynamic binding' to explain these concepts. She mentions that method resolution is a main feature lacking in non-object-oriented languages. Finally, she briefly touches on 'Implement associations' and 'Deal with concurrency'. She writes 'Java | python -> synchronization' to note that concurrency is usually needed only when more than one external event occurs. This part of the lecture provides practical strategies for adapting OOP features like inheritance and polymorphism into procedural code structures. The slide also mentions that method resolution is one main feature of an object-oriented language that is lacking in a non-object-oriented language.
The video provides a comprehensive guide on bridging the gap between object-oriented design and non-object-oriented implementation. It systematically breaks down the process into translating classes to data structures, managing method arguments, and handling memory allocation. The instructor uses handwritten annotations and diagrams to clarify abstract concepts like inheritance flattening and method resolution. By covering storage allocation strategies and concurrency handling, the lecture offers a practical approach to implementing OOP concepts in languages like C or older procedural languages. The emphasis on explicit references and memory management highlights the fundamental differences in how these paradigms handle object identity and state. The lecture concludes by addressing associations and concurrency, showing how even complex OOP features can be mapped to procedural constructs.