Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Hi, I need special Help. So my professor gave me some PP's to study from and i provided to screenshots with specific slides in them. So could someone explain to me in simplest detail what Orthogonality and Abstraction are in Priciples of Programming

Hi, I need special Help. So my professor gave me some PP's to study from and i provided to screenshots with specific slides in them. So could someone explain to me in simplest detail what Orthogonality and Abstraction are in Priciples of Programming

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Hi, I need special Help. So my professor gave me some PP's to study from and i provided to screenshots with specific slides in them. So could someone explain to me in simplest detail what Orthogonality and Abstraction are in Priciples of Programming?

9↑ 12 of 42 ● Evaluation Criteria: Readability (II) ● Orthogonality Orthogonality means that operations change just one thing without affecting others A relatively small set of primitive constructs can be combined in a relatively small number of ways ● ● - ● + Automatic Zoom Every possible combination is legal ex: int *count; Here pointer and integer is combined. An example of orthogonality in C++ is that a template type parameter can be any type. Comparison operators: python vs bash A lack of orthogonality shows up in the form of exceptions (irregularity, anomaly) to the rules of a language. For example in C++, a function can return a structure (record, object), but not an array. Another example: you can declare an object of any fundamental type except void ● ● »
Transcribed Image Text:9↑ 12 of 42 ● Evaluation Criteria: Readability (II) ● Orthogonality Orthogonality means that operations change just one thing without affecting others A relatively small set of primitive constructs can be combined in a relatively small number of ways ● ● - ● + Automatic Zoom Every possible combination is legal ex: int *count; Here pointer and integer is combined. An example of orthogonality in C++ is that a template type parameter can be any type. Comparison operators: python vs bash A lack of orthogonality shows up in the form of exceptions (irregularity, anomaly) to the rules of a language. For example in C++, a function can return a structure (record, object), but not an array. Another example: you can declare an object of any fundamental type except void ● ● »
Lecture Notes Q个 15 of 42 Abstraction - + Automatic Zoom пх Programming languages can support two distinct categories of abstraction process data An example of process abstraction is the use of a subprogram (function) to implement a sort algorithm that is required several times in a program. KY RX Without the subprogram, the sort code would need to be replicated in all places where it was needed, which would make the program much longer and more tedious to write. if the subprogram were not used, the code that used the sort subprogram would be cluttered with the sort algorithm details, greatly obscuring the flow and overall intent of that code. An example of data abstraction is the creation of a binary tree. In C++ and Java, these trees can be implemented by using an abstraction of a tree node in the form of a simple class with two pointers (or references) and an integer. ● • In a programming language that doesn't support class or dynamic variables, it would have to use three integer arrays to accomplish it, which is cumbersome and error-prone. < >
Transcribed Image Text:Lecture Notes Q个 15 of 42 Abstraction - + Automatic Zoom пх Programming languages can support two distinct categories of abstraction process data An example of process abstraction is the use of a subprogram (function) to implement a sort algorithm that is required several times in a program. KY RX Without the subprogram, the sort code would need to be replicated in all places where it was needed, which would make the program much longer and more tedious to write. if the subprogram were not used, the code that used the sort subprogram would be cluttered with the sort algorithm details, greatly obscuring the flow and overall intent of that code. An example of data abstraction is the creation of a binary tree. In C++ and Java, these trees can be implemented by using an abstraction of a tree node in the form of a simple class with two pointers (or references) and an integer. ● • In a programming language that doesn't support class or dynamic variables, it would have to use three integer arrays to accomplish it, which is cumbersome and error-prone. < >
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Structured English
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS