The document discusses various control structures used in programming, including selection structures like if/else and repetition structures like while and for loops. It provides examples of pseudocode and C++ code to illustrate counter-controlled and sentinel-controlled repetition. Key control structures like if/else and while are explained, along with flowcharts to visualize program logic. Top-down and stepwise refinement techniques are covered for developing algorithms.
This document outlines the key control structures in programming, including sequence, selection (if/else), and repetition (while, for). It provides examples of algorithms and pseudocode for calculating a class average using counter-controlled and sentinel-controlled repetition. The document also includes the C++ code for a program that calculates the class average based on grades entered by the user, with the option to terminate input by entering a sentinel value.
This document outlines an introductory chapter on control structures in programming. It discusses various programming concepts like algorithms, pseudocode, control structures including sequence, selection, and repetition structures. Specific control structures covered include if, if/else, while, for, switch, do/while, break and continue. Logical operators and the difference between equality and assignment operators are also mentioned. The chapter provides examples and case studies to explain counter-controlled and sentinel-controlled repetition with while loops. It introduces various C++ keywords and shows how pseudocode can be translated to C++ code. Flowcharts are used to visualize program flow and control structures.
This document discusses control structures in programming, including sequence, selection, and repetition structures. It provides examples of if/else selection structures and while repetition structures in pseudocode and C++ code. It also covers nested control structures, flowcharts, and different types of repetition structures like counter-controlled and sentinel-controlled loops. Examples are provided to calculate a class average based on grades input by the user using these different looping techniques.
This document outlines control structures in programming, including selection structures like if/else and repetition structures like while and for loops. It provides examples of algorithms using pseudocode and C++ code that employ counter-controlled and sentinel-controlled repetition. Key concepts covered include flowcharts, logical operators, and avoiding logic errors. Nested control structures and the switch statement are also discussed.
Control structures allow programs to execute code conditionally or repeatedly. There are three basic structures: sequence, selection, and repetition. Selection structures like if/else are used to choose between alternatives. Repetition structures like while loops repeat an action as long as a condition is true. Programs can be represented graphically with flowcharts to show how the structures are combined.
The document discusses loops and repetition structures in C++. It explains while loops, their syntax, and how they work. A while loop repeats actions while a condition is true. Each iteration, the condition is evaluated. If true, the loop body executes and control returns to the condition. If false, execution continues after the loop. Pseudocode and C++ code examples are provided to illustrate how a while loop can be used to repeatedly purchase items from a shopping list until it is empty. Flowcharts further demonstrate the flow of control in a while loop.
Control structures in C++ include loops like while, do/while and for to repeat actions. Switch, break and continue statements are also covered. The document discusses counter-controlled and sentinel-controlled repetition, and provides examples of calculating a class average using different loop structures. Nested control structures are demonstrated with an example analyzing exam results from 10 students.
Complete C++ programming Language CourseVivek chan
This document provides an overview of topics covered in a C++ programming course, including:
- Introduction to C++ language fundamentals like data types, variables, operators, control structures, functions, and classes
- Memory concepts, arithmetic, decision making, and algorithms
- Structured and object-oriented programming principles
- The basics of the C++ environment like compilers, linkers, and input/output streams
- Common library functions and concepts like headers, prototypes, and enumerations
The document serves as an introductory reference for anyone learning C++ or wanting to understand the basic building blocks of the language.
This document outlines the key control structures in programming, including sequence, selection (if/else), and repetition (while, for). It provides examples of algorithms and pseudocode for calculating a class average using counter-controlled and sentinel-controlled repetition. The document also includes the C++ code for a program that calculates the class average based on grades entered by the user, with the option to terminate input by entering a sentinel value.
This document outlines an introductory chapter on control structures in programming. It discusses various programming concepts like algorithms, pseudocode, control structures including sequence, selection, and repetition structures. Specific control structures covered include if, if/else, while, for, switch, do/while, break and continue. Logical operators and the difference between equality and assignment operators are also mentioned. The chapter provides examples and case studies to explain counter-controlled and sentinel-controlled repetition with while loops. It introduces various C++ keywords and shows how pseudocode can be translated to C++ code. Flowcharts are used to visualize program flow and control structures.
This document discusses control structures in programming, including sequence, selection, and repetition structures. It provides examples of if/else selection structures and while repetition structures in pseudocode and C++ code. It also covers nested control structures, flowcharts, and different types of repetition structures like counter-controlled and sentinel-controlled loops. Examples are provided to calculate a class average based on grades input by the user using these different looping techniques.
This document outlines control structures in programming, including selection structures like if/else and repetition structures like while and for loops. It provides examples of algorithms using pseudocode and C++ code that employ counter-controlled and sentinel-controlled repetition. Key concepts covered include flowcharts, logical operators, and avoiding logic errors. Nested control structures and the switch statement are also discussed.
Control structures allow programs to execute code conditionally or repeatedly. There are three basic structures: sequence, selection, and repetition. Selection structures like if/else are used to choose between alternatives. Repetition structures like while loops repeat an action as long as a condition is true. Programs can be represented graphically with flowcharts to show how the structures are combined.
The document discusses loops and repetition structures in C++. It explains while loops, their syntax, and how they work. A while loop repeats actions while a condition is true. Each iteration, the condition is evaluated. If true, the loop body executes and control returns to the condition. If false, execution continues after the loop. Pseudocode and C++ code examples are provided to illustrate how a while loop can be used to repeatedly purchase items from a shopping list until it is empty. Flowcharts further demonstrate the flow of control in a while loop.
Control structures in C++ include loops like while, do/while and for to repeat actions. Switch, break and continue statements are also covered. The document discusses counter-controlled and sentinel-controlled repetition, and provides examples of calculating a class average using different loop structures. Nested control structures are demonstrated with an example analyzing exam results from 10 students.
Complete C++ programming Language CourseVivek chan
This document provides an overview of topics covered in a C++ programming course, including:
- Introduction to C++ language fundamentals like data types, variables, operators, control structures, functions, and classes
- Memory concepts, arithmetic, decision making, and algorithms
- Structured and object-oriented programming principles
- The basics of the C++ environment like compilers, linkers, and input/output streams
- Common library functions and concepts like headers, prototypes, and enumerations
The document serves as an introductory reference for anyone learning C++ or wanting to understand the basic building blocks of the language.
The document provides an introduction and overview of problem solving techniques for programming. It discusses identifying skills needed for problem solving, applying standard problem solving methods, and generating potential solutions. Specific techniques covered include problem solving steps, strategies, algorithm design, flowcharts, and the C language. Problems are classified as having algorithmic or heuristic solutions. The document then demonstrates applying problem solving techniques to sample problems through defining the problem, analyzing it, designing a solution, implementing it, and evaluating it.
The document discusses different control flow patterns in algorithms such as sequential, selectional, and iterational structures. It provides examples of if and else if statements in pseudocode and Python to evaluate conditions. Examples include finding the largest of three numbers, determining if a number is odd or even, and checking for leap years. The document also covers nested if statements and multiple conditions using logical operators.
The document discusses assignment operators and control structures in C#. It defines various assignment operators like +=, -=, etc. and explains their precedence and associativity. It then discusses sequential programming and introduces selection and repetition control structures like if, if/else, switch statements for selection and while, do/while, for statements for repetition. It provides examples of if, if/else and nested if/else statements. It also discusses logical operators, conditional operators and switch statements.
The Three Basic Selection Structures in C++ Programming ConceptsTech
Now check the powerpoint presentation about selection structures in programming. For more visit www.techora.net
Three types of selection structures are available like :
1 - Sequence Structure
2 - Selection Strcuture
3 - Repetition Structure
In this PPT slide, we discuss about the selection structure
1 - if statements
2 - if else statement
3 - switch statement
The document outlines control structures in programming including algorithms, pseudocode, selection structures like if/else, repetition structures like while loops, and case studies applying these concepts. Key topics are counter-controlled and sentinel-controlled repetition for loops, and nesting control structures with if statements inside loops. Examples in C# demonstrate accumulating values in loops and nested if/else statements.
The document discusses control structures in programming, specifically selection structures using if, if/else, and switch statements. It provides examples of pseudocode and flowcharts to illustrate basic selection statements. Key concepts covered include:
- Using if, if/else, and switch statements to choose between alternative actions.
- Examples of pseudocode for if/else statements and switch structures.
- Flowcharts as a graphical representation of algorithms using basic shapes.
- Examples of if, if/else, and switch statements in C++ code.
This presentation is a part of the COP2272C college level course taught at the Florida Polytechnic University located in Lakeland Florida. The purpose of this course is to introduce students to the C++ language and the fundamentals of object orientated programming..
The course is one semester in length and meets for 2 hours twice a week. The Instructor is Dr. Jim Anderson.
C programming control structures include sequential, selection, and repetition structures. Selection structures like if/else and switch statements are used for decisions and branching based on evaluating conditions as true or false. Repetition structures like while, do/while, and for loops are used to repeat a block of code. Functions also affect program flow. Any C expression that evaluates to a non-zero value is interpreted as true.
more loops lecture by Professor Evan korth hammad ali
The document summarizes an upcoming lecture on loops. It provides the schedule, outlines topics to be covered including sentinels, sentinel-controlled loops, and nested control structures. Examples of using sentinels to end a loop based on user input and a case study on analyzing test results are discussed. Key terms like sentinel, initialization, processing, and termination are also introduced.
The document discusses control structures in C++ programming. It describes flow charts and their symbols used to represent algorithms. It then explains different types of control structures like selection structures (if, if/else) and repetition structures (while, for). Key points include:
- Flow charts use shapes like rectangles, diamonds, and arrows to visually depict a program's flow of execution.
- Selection structures like if and if/else allow a program to choose between alternative paths based on a conditional expression being true or false.
- Repetition structures like while and for allow certain operations to be repeated if a condition is met.
The document discusses Java's primitive data types and for loops. It introduces Java's primitive types like int, double, char, and boolean. It covers expressions, operators, and precedence. It then introduces variables, declaring and initializing variables, and using variables in expressions. Finally, it covers the for loop structure with initialization, test, and update sections to allow repetition of code.
The document discusses Java's primitive data types and for loops. It introduces Java's primitive types like int, double, char, and boolean. It covers expressions, operators, and precedence. It then introduces variables, declaring and initializing variables, and using variables in expressions. Finally, it covers the for loop structure with initialization, test, and update sections to allow repetition of code.
This document discusses problem solving and the software development method. It introduces problem solving as transforming a problem description into a solution using knowledge and strategies. The software development method includes specification of needs, problem analysis, design, implementation, testing, and documentation. Pseudocode and flowcharts are presented as ways to design algorithms using control structures like sequence, selection, and repetition. Examples are provided to illustrate these concepts. Homework problems are listed at the end involving calculations, sums, and determining prime numbers.
The document provides an overview of computational thinking and problem solving. It discusses key concepts like algorithms, the building blocks of algorithms including statements, state, control flow, functions. It also covers different notations for representing algorithms - pseudocode, flowcharts, programming languages. Some key aspects covered include the definition of an algorithm, properties and qualities of a good algorithm. Examples are provided for different algorithm concepts like finding the minimum/maximum value, sorting cards etc.
1. The document discusses various control structures in C++ including while, do/while, for, switch, break, and continue. It provides examples of how each structure is used.
2. One example calculates the class average of test grades by prompting the user to input 10 grades, summing them, and dividing by 10.
3. Another example analyzes exam results by inputting 10 results, counting passes and failures, and printing a message to raise tuition if passes exceed 8. It uses nested control structures including while, if/else, and if statements.
CMIS 102 HANDS-ON LAB WEEK 6 OVERVIEW THIS HANDS-ON LAB ALLOWS YOU TO FOLLOW ...JanuMorandy
This document provides an overview of a hands-on lab to develop a program in C that calculates the average of 3 exams for 5 students. It includes the program description, analysis, pseudocode, C code implementation, and learning exercises. The program uses sequential and nested repetition statements to loop through student names and exam values to calculate each student's average.
The document discusses structured program development in C. It covers algorithms, pseudocode, and various control structures in C like selection statements (if, if-else), repetition statements (while), and nested control structures. It also discusses concepts like assignment operators, increment and decrement operators, and preincrementing and postincrementing. Examples of algorithms and C code are provided to demonstrate counter-controlled and sentinel-controlled repetition, if-else statements, and nested control structures.
The document provides examples of different variable types in C programming such as character, integer, floating point, and double precision variables. It also demonstrates how to take user input using scanf and print output using printf. Decision making and selection statements like if, if-else, and switch statements are explained. Operators for equality and relational comparisons are covered. Finally, the while loop construct is introduced as a method of repetition or iteration in C programs.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
The document provides an introduction and overview of problem solving techniques for programming. It discusses identifying skills needed for problem solving, applying standard problem solving methods, and generating potential solutions. Specific techniques covered include problem solving steps, strategies, algorithm design, flowcharts, and the C language. Problems are classified as having algorithmic or heuristic solutions. The document then demonstrates applying problem solving techniques to sample problems through defining the problem, analyzing it, designing a solution, implementing it, and evaluating it.
The document discusses different control flow patterns in algorithms such as sequential, selectional, and iterational structures. It provides examples of if and else if statements in pseudocode and Python to evaluate conditions. Examples include finding the largest of three numbers, determining if a number is odd or even, and checking for leap years. The document also covers nested if statements and multiple conditions using logical operators.
The document discusses assignment operators and control structures in C#. It defines various assignment operators like +=, -=, etc. and explains their precedence and associativity. It then discusses sequential programming and introduces selection and repetition control structures like if, if/else, switch statements for selection and while, do/while, for statements for repetition. It provides examples of if, if/else and nested if/else statements. It also discusses logical operators, conditional operators and switch statements.
The Three Basic Selection Structures in C++ Programming ConceptsTech
Now check the powerpoint presentation about selection structures in programming. For more visit www.techora.net
Three types of selection structures are available like :
1 - Sequence Structure
2 - Selection Strcuture
3 - Repetition Structure
In this PPT slide, we discuss about the selection structure
1 - if statements
2 - if else statement
3 - switch statement
The document outlines control structures in programming including algorithms, pseudocode, selection structures like if/else, repetition structures like while loops, and case studies applying these concepts. Key topics are counter-controlled and sentinel-controlled repetition for loops, and nesting control structures with if statements inside loops. Examples in C# demonstrate accumulating values in loops and nested if/else statements.
The document discusses control structures in programming, specifically selection structures using if, if/else, and switch statements. It provides examples of pseudocode and flowcharts to illustrate basic selection statements. Key concepts covered include:
- Using if, if/else, and switch statements to choose between alternative actions.
- Examples of pseudocode for if/else statements and switch structures.
- Flowcharts as a graphical representation of algorithms using basic shapes.
- Examples of if, if/else, and switch statements in C++ code.
This presentation is a part of the COP2272C college level course taught at the Florida Polytechnic University located in Lakeland Florida. The purpose of this course is to introduce students to the C++ language and the fundamentals of object orientated programming..
The course is one semester in length and meets for 2 hours twice a week. The Instructor is Dr. Jim Anderson.
C programming control structures include sequential, selection, and repetition structures. Selection structures like if/else and switch statements are used for decisions and branching based on evaluating conditions as true or false. Repetition structures like while, do/while, and for loops are used to repeat a block of code. Functions also affect program flow. Any C expression that evaluates to a non-zero value is interpreted as true.
more loops lecture by Professor Evan korth hammad ali
The document summarizes an upcoming lecture on loops. It provides the schedule, outlines topics to be covered including sentinels, sentinel-controlled loops, and nested control structures. Examples of using sentinels to end a loop based on user input and a case study on analyzing test results are discussed. Key terms like sentinel, initialization, processing, and termination are also introduced.
The document discusses control structures in C++ programming. It describes flow charts and their symbols used to represent algorithms. It then explains different types of control structures like selection structures (if, if/else) and repetition structures (while, for). Key points include:
- Flow charts use shapes like rectangles, diamonds, and arrows to visually depict a program's flow of execution.
- Selection structures like if and if/else allow a program to choose between alternative paths based on a conditional expression being true or false.
- Repetition structures like while and for allow certain operations to be repeated if a condition is met.
The document discusses Java's primitive data types and for loops. It introduces Java's primitive types like int, double, char, and boolean. It covers expressions, operators, and precedence. It then introduces variables, declaring and initializing variables, and using variables in expressions. Finally, it covers the for loop structure with initialization, test, and update sections to allow repetition of code.
The document discusses Java's primitive data types and for loops. It introduces Java's primitive types like int, double, char, and boolean. It covers expressions, operators, and precedence. It then introduces variables, declaring and initializing variables, and using variables in expressions. Finally, it covers the for loop structure with initialization, test, and update sections to allow repetition of code.
This document discusses problem solving and the software development method. It introduces problem solving as transforming a problem description into a solution using knowledge and strategies. The software development method includes specification of needs, problem analysis, design, implementation, testing, and documentation. Pseudocode and flowcharts are presented as ways to design algorithms using control structures like sequence, selection, and repetition. Examples are provided to illustrate these concepts. Homework problems are listed at the end involving calculations, sums, and determining prime numbers.
The document provides an overview of computational thinking and problem solving. It discusses key concepts like algorithms, the building blocks of algorithms including statements, state, control flow, functions. It also covers different notations for representing algorithms - pseudocode, flowcharts, programming languages. Some key aspects covered include the definition of an algorithm, properties and qualities of a good algorithm. Examples are provided for different algorithm concepts like finding the minimum/maximum value, sorting cards etc.
1. The document discusses various control structures in C++ including while, do/while, for, switch, break, and continue. It provides examples of how each structure is used.
2. One example calculates the class average of test grades by prompting the user to input 10 grades, summing them, and dividing by 10.
3. Another example analyzes exam results by inputting 10 results, counting passes and failures, and printing a message to raise tuition if passes exceed 8. It uses nested control structures including while, if/else, and if statements.
CMIS 102 HANDS-ON LAB WEEK 6 OVERVIEW THIS HANDS-ON LAB ALLOWS YOU TO FOLLOW ...JanuMorandy
This document provides an overview of a hands-on lab to develop a program in C that calculates the average of 3 exams for 5 students. It includes the program description, analysis, pseudocode, C code implementation, and learning exercises. The program uses sequential and nested repetition statements to loop through student names and exam values to calculate each student's average.
The document discusses structured program development in C. It covers algorithms, pseudocode, and various control structures in C like selection statements (if, if-else), repetition statements (while), and nested control structures. It also discusses concepts like assignment operators, increment and decrement operators, and preincrementing and postincrementing. Examples of algorithms and C code are provided to demonstrate counter-controlled and sentinel-controlled repetition, if-else statements, and nested control structures.
The document provides examples of different variable types in C programming such as character, integer, floating point, and double precision variables. It also demonstrates how to take user input using scanf and print output using printf. Decision making and selection statements like if, if-else, and switch statements are explained. Operators for equality and relational comparisons are covered. Finally, the while loop construct is introduced as a method of repetition or iteration in C programs.
Similar to Metode Perancangan Program #2 Selection and Repetition Control Structure-ITSB-GDR-1023.pptx (20)
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Skybuffer AI: Advanced Conversational and Generative AI Solution on SAP Busin...Tatiana Kojar
Skybuffer AI, built on the robust SAP Business Technology Platform (SAP BTP), is the latest and most advanced version of our AI development, reaffirming our commitment to delivering top-tier AI solutions. Skybuffer AI harnesses all the innovative capabilities of the SAP BTP in the AI domain, from Conversational AI to cutting-edge Generative AI and Retrieval-Augmented Generation (RAG). It also helps SAP customers safeguard their investments into SAP Conversational AI and ensure a seamless, one-click transition to SAP Business AI.
With Skybuffer AI, various AI models can be integrated into a single communication channel such as Microsoft Teams. This integration empowers business users with insights drawn from SAP backend systems, enterprise documents, and the expansive knowledge of Generative AI. And the best part of it is that it is all managed through our intuitive no-code Action Server interface, requiring no extensive coding knowledge and making the advanced AI accessible to more users.
In the realm of cybersecurity, offensive security practices act as a critical shield. By simulating real-world attacks in a controlled environment, these techniques expose vulnerabilities before malicious actors can exploit them. This proactive approach allows manufacturers to identify and fix weaknesses, significantly enhancing system security.
This presentation delves into the development of a system designed to mimic Galileo's Open Service signal using software-defined radio (SDR) technology. We'll begin with a foundational overview of both Global Navigation Satellite Systems (GNSS) and the intricacies of digital signal processing.
The presentation culminates in a live demonstration. We'll showcase the manipulation of Galileo's Open Service pilot signal, simulating an attack on various software and hardware systems. This practical demonstration serves to highlight the potential consequences of unaddressed vulnerabilities, emphasizing the importance of offensive security practices in safeguarding critical infrastructure.
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
Digital Banking in the Cloud: How Citizens Bank Unlocked Their MainframePrecisely
Inconsistent user experience and siloed data, high costs, and changing customer expectations – Citizens Bank was experiencing these challenges while it was attempting to deliver a superior digital banking experience for its clients. Its core banking applications run on the mainframe and Citizens was using legacy utilities to get the critical mainframe data to feed customer-facing channels, like call centers, web, and mobile. Ultimately, this led to higher operating costs (MIPS), delayed response times, and longer time to market.
Ever-changing customer expectations demand more modern digital experiences, and the bank needed to find a solution that could provide real-time data to its customer channels with low latency and operating costs. Join this session to learn how Citizens is leveraging Precisely to replicate mainframe data to its customer channels and deliver on their “modern digital bank” experiences.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
zkStudyClub - LatticeFold: A Lattice-based Folding Scheme and its Application...Alex Pruden
Folding is a recent technique for building efficient recursive SNARKs. Several elegant folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and others. However, all of them rely on an additively homomorphic commitment scheme based on discrete log, and are therefore not post-quantum secure. In this work we present LatticeFold, the first lattice-based folding protocol based on the Module SIS problem. This folding protocol naturally leads to an efficient recursive lattice-based SNARK and an efficient PCD scheme. LatticeFold supports folding low-degree relations, such as R1CS, as well as high-degree relations, such as CCS. The key challenge is to construct a secure folding protocol that works with the Ajtai commitment scheme. The difficulty, is ensuring that extracted witnesses are low norm through many rounds of folding. We present a novel technique using the sumcheck protocol to ensure that extracted witnesses are always low norm no matter how many rounds of folding are used. Our evaluation of the final proof system suggests that it is as performant as Hypernova, while providing post-quantum security.
Paper Link: https://eprint.iacr.org/2024/257
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
leewayhertz.com-AI in predictive maintenance Use cases technologies benefits ...alexjohnson7307
Predictive maintenance is a proactive approach that anticipates equipment failures before they happen. At the forefront of this innovative strategy is Artificial Intelligence (AI), which brings unprecedented precision and efficiency. AI in predictive maintenance is transforming industries by reducing downtime, minimizing costs, and enhancing productivity.
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
Monitoring and Managing Anomaly Detection on OpenShift.pdf
Metode Perancangan Program #2 Selection and Repetition Control Structure-ITSB-GDR-1023.pptx
1. Click to edit Master title style
1
Program Design Methods
Selection and Repetition Control Structure
2. Click to edit Master title style
2
Control Structures
2
Outline
12. Increment and Decrement Operators
13. Essentials of Counter-Controlled Repetition
14. for Repetition Structure
15. Examples Using for Structure
16. switch Multiple-Selection Structure
17. do/while Repetition Structure
18. break and continue Statements
19. Logical Operators
20. Confusing Equality (==) and Assignment (=) Operators
21. Structured-Programming Summary
1. Introduction
2. Algorithms
3. Pseudocode
4. Control Structures
5. if Selection Structure
6. if/else Selection Structure
7. while Repetition Structure
8. Formulating Algorithms: Case Study 1 (Counter-Controlled Repetition)
9. Formulating Algorithms with Top-Down, Stepwise Refinement: Case
Study 2 (Sentinel-Controlled Repetition)
10. Formulating Algorithms with Top-Down, Stepwise Refinement: Case
Study 3 (Nested Control Structures)
11. Assignment Operators
3. Click to edit Master title style
3
1. Introduction
3
• Before writing a program
Have a thorough understanding of the problem
Carefully plan your approach to solving it
• While writing a program
Know what “building blocks” are available
Use good programming principles
4. Click to edit Master title style
4
2. Algorithms
4
• Computing problems
Solved by executing a series of actions in a specific order
• Algorithm a procedure determining
Actions to be executed
Order to be executed
Example: recipe
• Program control
Specifies the order in which statements are executed
5. Click to edit Master title style
5
3. Pseudocode
5
• Pseudocode
Artificial, informal language used to develop algorithms
Similar to everyday English
• Not executed on computers
Used to think out programs before coding
• Easy to convert into a C++ program
Only executable statements
• No need to declare variables
6. Click to edit Master title style
6
4. Control Structures
6
• Sequential execution
– Statements executed in order
• Transfer of control
– Next statement executed not next one in sequence
• 3 control structures (Bohm and Jacopini)
– Sequence structure
• Programs executed sequentially by default
– Selection structures
• if, if/else, switch
– Repetition structures
• while, do/while, for
7. Click to edit Master title style
7
4. Control Structures
7
• C++ keywords
– Cannot be used as identifiers or variable names
C++ Keywords
Keywords common to the
C and C++ programming
languages
auto break case char const
continue default do double else
enum extern float for goto
if int long register return
short signed sizeof static struct
switch typedef union unsigned void
volatile while
C++ only keywords
asm bool catch class const_cast
delete dynamic_cast explicit false friend
inline mutable namespace new operator
private protected public reinterpret_cast
static_cast template this throw true
try typeid typename using virtual
wchar_t
8. Click to edit Master title style
8
4. Control Structures
8
• Flowchart
– Graphical representation of an algorithm
– Special-purpose symbols connected by arrows (flowlines)
– Rectangle symbol (action symbol)
• Any type of action
– Oval symbol
• Beginning or end of a program, or a section of code (circles)
• Single-entry/single-exit control structures
– Connect exit point of one to entry point of the next
– Control structure stacking
9. Click to edit Master title style
9
5. if Selection Structure
9
• Selection structure
– Choose among alternative courses of action
– Pseudocode example:
If a student’s grade is greater than or equal to 60
Print “Passed”
– If the condition is true
• Print statement executed, program continues to next statement
– If the condition is false
• Print statement ignored, program continues
– Indenting makes programs easier to read
• C++ ignores whitespace characters (tabs, spaces, etc.)
10. Click to edit Master title style
10
5. if Selection Structure
10
• Translation into C++
If a student’s grade is greater than or equal to 60
Print “Passed”
if ( grade >= 60 )
cout << "Passed";
• Diamond symbol (decision symbol)
– Indicates decision is to be made
– Contains an expression that can be true or false
• Test condition, follow path
• if structure
– Single-entry/single-exit
11. Click to edit Master title style
11
5. if Selection Structure
11
• Flowchart of pseudocode statement
true
false
grade >= 60 print “Passed”
A decision can be made on
any expression.
zero - false
nonzero - true
Example:
3 - 4 is true
12. Click to edit Master title style
12
6. if/else Selection Structure
12
• if
– Performs action if condition true
• if/else
– Different actions if conditions true or false
• Pseudocode
if a student’s grade is greater than or equal to 60
print “Passed”
else
print “Failed”
• C++ code
if ( grade >= 60 )
cout << "Passed";
else
cout << "Failed";
13. Click to edit Master title style
13
6. if/else Selection Structure
13
• Ternary conditional operator (?:)
– Three arguments (condition, value if true, value if false)
• Code could be written:
cout << ( grade >= 60 ? “Passed”: “Failed” );
Condition Value if true Value if false
true
false
print “Failed” print “Passed”
grade >= 60
14. Click to edit Master title style
14
6. if/else Selection Structure
14
• Nested if/else structures
– One inside another, test for multiple cases
– Once condition met, other statements skipped
if a student’s grade is greater than or equal to 90
Print “A”
else
if a student’s grade is greater than or equal to 80
Print “B”
else
if a student’s grade is greater than or equal to 70
Print “C”
else
if a student’s grade is greater than or equal to 60
Print “D”
else
Print “F”
15. Click to edit Master title style
15
6. if/else Selection Structure
15
• Example
if ( grade >= 90 ) // 90 and above
cout << "A";
else if ( grade >= 80 ) // 80-89
cout << "B";
else if ( grade >= 70 ) // 70-79
cout << "C";
else if ( grade >= 60 ) // 60-69
cout << "D";
else // less than 60
cout << "F";
16. Click to edit Master title style
16
6. if/else Selection Structure
16
• Compound statement
– Set of statements within a pair of braces
if ( grade >= 60 )
cout << "Passed.n";
else {
cout << "Failed.n";
cout << "You must take this course again.n";
}
– Without braces,
cout << "You must take this course again.n";
always executed
• Block
– Set of statements within braces
17. Click to edit Master title style
17
7. The while Repetition Structure
17
• Repetition structure
– Action repeated while some condition remains true
– Psuedocode
while there are more items on my shopping list
Purchase next item and cross it off my list
– while loop repeated until condition becomes false
• Example
int product = 2;
while ( product <= 1000 )
product = 2 * product;
18. Click to edit Master title style
18
7. The while Repetition Structure
18
• Flowchart of while loop
product <= 1000 product = 2 * product
true
false
19. Click to edit Master title style
19
8. Formulating Algorithms
(Counter-Controlled Repetition)
19
• Counter-controlled repetition
– Loop repeated until counter reaches certain value
• Definite repetition
– Number of repetitions known
• Example
A class of ten students took a quiz. The grades (integers in the
range 0 to 100) for this quiz are available to you. Determine
the class average on the quiz.
20. Click to edit Master title style
20
8. Formulating Algorithms
(Counter-Controlled Repetition)
20
• Pseudocode for example:
Set total to zero
Set grade counter to one
While grade counter is less than or equal to ten
Input the next grade
Add the grade into the total
Add one to the grade counter
Set the class average to the total divided by ten
Print the class average
• Next: C++ code for this example
21. Click to edit Master title style
21
8. Formulating Algorithms
(Counter-Controlled Repetition)
21
1 // Fig. 8: ccr1.cpp
2 // Class average program with counter-controlled repetition.
3 #include <iostream>
4
5 using std::cout;
6 using std::cin;
7 using std::endl;
8
9 // function main begins program execution
10 int main()
11 {
12 int total; // sum of grades input by user
13 int gradeCounter; // number of grade to be entered next
14 int grade; // grade value
15 int average; // average of grades
16
17 // initialization phase
18 total = 0; // initialize total
19 gradeCounter = 1; // initialize loop counter
20
22. Click to edit Master title style
22
8. Formulating Algorithms
(Counter-Controlled Repetition)
22
21 // processing phase
22 while ( gradeCounter <= 10 ) { // loop 10 times
23 cout << "Enter grade: "; // prompt for input
24 cin >> grade; // read grade from user
25 total = total + grade; // add grade to total
26 gradeCounter = gradeCounter + 1; // increment counter
27 }
28
29 // termination phase
30 average = total / 10; // integer division
31
32 // display result
33 cout << "Class average is " << average << endl;
34
35 return 0; // indicate program ended successfully
36
37 } // end function main
Output:
Enter grade: 98
Enter grade: 76
Enter grade: 71
Enter grade: 87
Enter grade: 83
Enter grade: 90
Enter grade: 57
Enter grade: 79
Enter grade: 82
Enter grade: 94
Class average is 81
The counter gets incremented
each time the loop executes.
Eventually, the counter causes
the loop to end.
23. Click to edit Master title style
23
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
23
• Suppose problem becomes:
Develop a class-averaging program that will process an
arbitrary number of grades each time the program is run
– Unknown number of students
– How will program know when to end?
• Sentinel value
– Indicates “end of data entry”
– Loop ends when sentinel input
– Sentinel chosen so it cannot be confused with regular input
• -1 in this case
24. Click to edit Master title style
24
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
24
• Top-down, stepwise refinement
– Begin with pseudocode representation of top
Determine the class average for the quiz
– Divide top into smaller tasks, list in order
Initialize variables
Input, sum and count the quiz grades
Calculate and print the class average
25. Click to edit Master title style
25
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
25
• Many programs have three phases
– Initialization
• Initializes the program variables
– Processing
• Input data, adjusts program variables
– Termination
• Calculate and print the final results
– Helps break up programs for top-down refinement
26. Click to edit Master title style
26
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
26
• Refine the initialization phase
Initialize variables
goes to
Initialize total to zero
Initialize counter to zero
• Processing
Input, sum and count the quiz grades
goes to
Input the first grade (possibly the sentinel)
While the user has not as yet entered the sentinel
Add this grade into the running total
Add one to the grade counter
Input the next grade (possibly the sentinel)
27. Click to edit Master title style
27
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
27
• Termination
Calculate and print the class average
goes to
If the counter is not equal to zero
Set the average to the total divided by the counter
Print the average
Else
Print “No grades were entered”
• Next: C++ program
28. Click to edit Master title style
28
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
28
1 // Fig. 9: scr02.cpp
2 // Class average program with sentinel-controlled repetition.
3 #include <iostream>
4
5 using std::cout;
6 using std::cin;
7 using std::endl;
8 using std::fixed;
9
10 #include <iomanip> // parameterized stream manipulators
11
12 using std::setprecision; // sets numeric output precision
13
14 // function main begins program execution
15 int main()
16 {
17 int total; // sum of grades
18 int gradeCounter; // number of grades entered
19 int grade; // grade value
20
21 double average; // number with decimal point for average
22
23 // initialization phase
24 total = 0; // initialize total
25 gradeCounter = 0; // initialize loop counter
Data type double used to represent
decimal numbers.
29. Click to edit Master title style
29
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
29
1 // Fig. 9: scr02.cpp
2 // Class average program with sentinel-controlled repetition.
3 #include <iostream>
4
5 using std::cout;
6 using std::cin;
7 using std::endl;
8 using std::fixed;
9
10 #include <iomanip> // parameterized stream manipulators
11
12 using std::setprecision; // sets numeric output precision
13
14 // function main begins program execution
15 int main()
16 {
17 int total; // sum of grades
18 int gradeCounter; // number of grades entered
19 int grade; // grade value
20
21 double average; // number with decimal point for average
22
23 // initialization phase
24 total = 0; // initialize total
25 gradeCounter = 0; // initialize loop counter
Data type double used to represent
decimal numbers.
30. Click to edit Master title style
30
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
30
26
27 // processing phase
28 // get first grade from user
29 cout << "Enter grade, -1 to end: "; // prompt for input
30 cin >> grade; // read grade from user
31
32 // loop until sentinel value read from user
33 while ( grade != -1 ) {
34 total = total + grade; // add grade to total
35 gradeCounter = gradeCounter + 1; // increment counter
36
37 cout << "Enter grade, -1 to end: "; // prompt for input
38 cin >> grade; // read next grade
39
40 } // end while
41
42 // termination phase
43 // if user entered at least one grade ...
44 if ( gradeCounter != 0 ) {
45
46 // calculate average of all grades entered
47 average = static_cast< double >( total ) / gradeCounter;
static_cast<double>() treats total as a
double temporarily (casting).
Required because dividing two integers truncates the
remainder.
gradeCounter is an int, but it gets promoted to
double.
31. Click to edit Master title style
31
9. Formulating Algorithms
(Sentinel-Controlled Repetition)
31
49 // display average with two digits of precision
50 cout << "Class average is " << setprecision( 2 )
51 << fixed << average << endl;
52
53 } // end if part of if/else
54
55 else // if no grades were entered, output appropriate message
56 cout << "No grades were entered" << endl;
57
58 return 0; // indicate program ended successfully
59
60 } // end function main
setprecision(2)prints two digits past
decimal point (rounded to fit precision).
Programs that use this must include <iomanip>
fixed forces output to print in fixed point
format (not scientific notation). Also, forces
trailing zeros and decimal point to print.
Include <iostream>
Output:
Enter grade, -1 to end: 75
Enter grade, -1 to end: 94
Enter grade, -1 to end: 97
Enter grade, -1 to end: 88
Enter grade, -1 to end: 70
Enter grade, -1 to end: 64
Enter grade, -1 to end: 83
Enter grade, -1 to end: 89
Enter grade, -1 to end: -1
Class average is 82.50
32. Click to edit Master title style
32
10. Nested Control Structures
32
• Problem statement
A college has a list of test results (1 = pass, 2 = fail) for 10
students. Write a program that analyzes the results. If more
than 8 students pass, print "Raise Tuition".
• Notice that
– Program processes 10 results
• Fixed number, use counter-controlled loop
– Two counters can be used
• One counts number that passed
• Another counts number that fail
– Each test result is 1 or 2
• If not 1, assume 2
33. Click to edit Master title style
33
10. Nested Control Structures
33
• Top level outline
Analyze exam results and decide if tuition should be raised
• First refinement
Initialize variables
Input the ten quiz grades and count passes and failures
Print a summary of the exam results and decide if tuition should
be raised
• Refine
Initialize variables
to
Initialize passes to zero
Initialize failures to zero
Initialize student counter to one
34. Click to edit Master title style
34
10. Nested Control Structures
34
• Refine
Input the ten quiz grades and count passes and failures
to
While student counter is less than or equal to ten
Input the next exam result
If the student passed
Add one to passes
Else
Add one to failures
Add one to student counter
35. Click to edit Master title style
35
10. Nested Control Structures
35
• Refine
Print a summary of the exam results and decide if tuition should
be raised
to
Print the number of passes
Print the number of failures
If more than eight students passed
Print “Raise tuition”
• Program next
36. Click to edit Master title style
36
10. Nested Control Structures
36
1 // Fig. 10: NCS.cpp
2 // Analysis of examination results.
3 #include <iostream>
4
5 using std::cout;
6 using std::cin;
7 using std::endl;
8
9 // function main begins program execution
10 int main()
11 {
12 // initialize variables in declarations
13 int passes = 0; // number of passes
14 int failures = 0; // number of failures
15 int studentCounter = 1; // student counter
16 int result; // one exam result
17
18 // process 10 students using counter-controlled loop
19 while ( studentCounter <= 10 ) {
20
21 // prompt user for input and obtain value from user
22 cout << "Enter result (1 = pass, 2 = fail): ";
23 cin >> result;
24
25 // if result 1, increment passes; if/else nested in while
26 if ( result == 1 ) // if/else nested in while
27 passes = passes + 1;
28
29 else // if result not 1, increment failures
30 failures = failures + 1;
31
32 // increment studentCounter so loop eventually terminates
33 studentCounter = studentCounter + 1;
34
35 } // end while
36
37 // termination phase; display number of passes and failures
38 cout << "Passed " << passes << endl;
39 cout << "Failed " << failures << endl;
40
41 // if more than eight students passed, print "raise tuition"
42 if ( passes > 8 )
43 cout << "Raise tuition " << endl;
44
45 return 0; // successful termination
46
47 } // end function main
37. Click to edit Master title style
37
10. Nested Control Structures
37
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 2
Enter result (1 = pass, 2 = fail): 2
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 2
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 2
Passed 6
Failed 4
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 2
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Passed 9
Failed 1
Raise tuition
38. Click to edit Master title style
38
11. Assignment Operators
38
• Assignment expression abbreviations
– Addition assignment operator
c = c + 3; abbreviated to
c += 3;
• Statements of the form
variable = variable operator expression;
can be rewritten as
variable operator= expression;
• Other assignment operators
d -= 4 (d = d - 4)
e *= 5 (e = e * 5)
f /= 3 (f = f / 3)
g %= 9 (g = g % 9)
39. Click to edit Master title style
39
12. Increment and Decrement Operators
39
• Increment operator (++) - can be used instead of c
+= 1
• Decrement operator (--) - can be used instead of c
-= 1
– Preincrement
• When the operator is used before the variable (++c or –c)
• Variable is changed, then the expression it is in is evaluated.
– Posincrement
• When the operator is used after the variable (c++ or c--)
• Expression the variable is in executes, then the variable is
changed.
40. Click to edit Master title style
40
12. Increment and Decrement Operators
40
• Increment operator (++)
– Increment variable by one
– c++
• Same as c += 1
• Decrement operator (--) similar
– Decrement variable by one
– c--
• Preincrement
– Variable changed before used in expression
• Operator before variable (++c or --c)
• Postincrement
– Incremented changed after expression
• Operator after variable (c++, c--)
41. Click to edit Master title style
41
12. Increment and Decrement Operators
41
• If c = 5, then
– cout << ++c;
• c is changed to 6, then printed out
– cout << c++;
• Prints out 5 (cout is executed before the increment.
• c then becomes 6 • When variable not in expression
– Preincrementing and postincrementing have
same effect
++c;
cout << c;
and
c++;
cout << c;
are the same
42. Click to edit Master title style
42
12. Increment and Decrement Operators
42
1 // Fig. 12: IDO12.cpp
2 // Preincrementing and postincrementing.
3 #include <iostream>
4
5 using std::cout;
6 using std::endl;
7
8 // function main begins program execution
9 int main()
10 {
11 int c; // declare variable
12
13 // demonstrate postincrement
14 c = 5; // assign 5 to c
15 cout << c << endl; // print 5
16 cout << c++ << endl; // print 5 then postincrement
17 cout << c << endl << endl; // print 6
18
19 // demonstrate preincrement
20 c = 5; // assign 5 to c
21 cout << c << endl; // print 5
22 cout << ++c << endl; // preincrement then print 6
23 cout << c << endl; // print 6
24
25 return 0; // indicate successful termination
26
27 } // end function main
5
5
6
5
6
6
43. Click to edit Master title style
43
13. Essentials of Counter-Controlled
Repetition
43
• The declaration
int counter = 1;
– Names counter
– Declares counter to be an integer
– Reserves space for counter in memory
– Sets counter to an initial value of 1
44. Click to edit Master title style
44
14. for Repetition Structure
44
• General format when using for loops
for ( initialization; LoopContinuationTest;
increment )
statement
• Example
for( int counter = 1; counter <= 10; counter++)
cout << counter << endl;
– Prints integers from one to ten
No semicolon after last
statement
45. Click to edit Master title style
45
14. for Repetition Structure
45
• for loops can usually be rewritten as while
loops
initialization;
while ( loopContinuationTest){
statement
increment;
}
• Initialization and increment
– For multiple variables, use comma-separated lists
for (int i = 0, j = 0; j + i <= 10; j++,
i++)
cout << j + i << endl;
46. Click to edit Master title style
46
15. Examples Using the for Structure
46
• Program to calculate compound interest
• A person invests $1000.00 in a savings account yielding 5 percent
interest. Assuming that all interest is left on deposit in the account,
calculate and print the amount of money in the account at the end of
each year for 10 years. Use the following formula for determining these
amounts:
a = p(1+r)
• p is the original amount invested (i.e., the principal),
r is the annual interest rate,
n is the number of years and
a is the amount on deposit at the end of the nth year
47. Click to edit Master title style
47
16. switch Multiple-Selection Structure
47
• switch
– Test variable for multiple values
– Series of case labels and optional default case
switch ( variable ) {
case value1: // taken if variable == value1
statements
break; // necessary to exit switch
case value2:
case value3: // taken if variable == value2 or ==
value3
statements
break;
default: // taken if variable matches no other
cases
statements
break;
}
48. Click to edit Master title style
48
16. switch Multiple-Selection Structure
48
• Example upcoming
– Program to read grades (A-F)
– Display number of each grade entered
• Details about characters
– Single characters typically stored in a char data type
• char a 1-byte integer, so chars can be stored as ints
– Can treat character as int or char
• 97 is the numerical representation of lowercase ‘a’ (ASCII)
• Use single quotes to get numerical representation of character
cout << "The character (" << 'a' << ") has the value "
<< static_cast< int > ( 'a' ) << endl;
Prints
The character (a) has the value 97
49. Click to edit Master title style
49
17. do/while Repetition Structure
49
• Similar to while structure
– Makes loop continuation test at end, not beginning
– Loop body executes at least once
• Format
do {
statement
} while ( condition );
50. Click to edit Master title style
50
18. break and continue Statements
50
• break statement
– Immediate exit from while, for, do/while, switch
– Program continues with first statement after structure
• Common uses
– Escape early from a loop
– Skip the remainder of switch
• continue statement
– Used in while, for, do/while
– Skips remainder of loop body
– Proceeds with next iteration of loop
• while and do/while structure
– Loop-continuation test evaluated immediately
after the continue statement
• for structure
– Increment expression executed
– Next, loop-continuation test evaluated
51. Click to edit Master title style
51
19. Logical Operators
51
• Used as conditions in loops, if statements
• && (logical AND)
– true if both conditions are true
if ( gender == 1 && age >= 65 )
++seniorFemales;
• || (logical OR)
– true if either of condition is true
if ( semesterAverage >= 90 || finalExam >= 90 )
cout << "Student grade is A" << endl;
• ! (logical NOT, logical negation)
– Returns true when its condition is false, & vice versa
if ( !( grade == sentinelValue ) )
cout << "The next grade is " << grade << endl;
Alternative:
if ( grade != sentinelValue )
cout << "The next grade is " << grade << endl;
52. Click to edit Master title style
52
20. Confusing Equality (==) and
Assignment (=) Operators
52
• Common error
– Does not typically cause syntax errors
• Aspects of problem
– Expressions that have a value can be used for decision
• Zero = false, nonzero = true
– Assignment statements produce a value (the value to be
assigned)
53. Click to edit Master title style
53
20. Confusing Equality (==) and
Assignment (=) Operators
53
• Example
if ( payCode == 4 )
cout << "You get a bonus!" << endl;
– If paycode is 4, bonus given
• If == was replaced with =
if ( payCode = 4 )
cout << "You get a bonus!" << endl;
– Paycode set to 4 (no matter what it was before)
– Statement is true (since 4 is non-zero)
– Bonus given in every case
54. Click to edit Master title style
54
20. Confusing Equality (==) and
Assignment (=) Operators
54
• Lvalues
– Expressions that can appear on left side of equation
– Can be changed (I.e., variables)
• x = 4;
• Rvalues
– Only appear on right side of equation
– Constants, such as numbers (i.e. cannot write 4 = x;)
• Lvalues can be used as rvalues, but not vice versa
55. Click to edit Master title style
55
21. Structured-Programming Summary
55
• Structured programming
– Programs easier to understand, test, debug and modify
• Rules for structured programming
– Only use single-entry/single-exit control structures
– Rules
1) Begin with the “simplest flowchart”
2) Any rectangle (action) can be replaced by two rectangles
(actions) in sequence
3) Any rectangle (action) can be replaced by any control structure
(sequence, if, if/else, switch, while, do/while or for)
4) Rules 2 and 3 can be applied in any order and multiple
56. Click to edit Master title style
56
21. Structured-Programming Summary
56
• All programs broken down into
– Sequence
– Selection
• if, if/else, or switch
• Any selection can be rewritten as an if statement
– Repetition
• while, do/while or for
• Any repetition structure can be rewritten as a while statement