Algorithm and Programming (Sequential Structure)

Oct 18, 20168 likes1,214 views

This file contains explanation about sequential structure in programming. This file was used in my Algorithm and Programming Class.

Adam Mukharil Bachtiar
English Class
Informatics Engineering 2011
Algorithms and Programming
Sequential Structure

Steps of the Day
Let’s Start
Definition Characteristic Exercises

DefinitionofSequential
Structure
• The simplest and basic structure in algorithm.
• Instruction was processed in sequential way
(top down approach).

Characteristics of
Sequential Structure
All about Sequential Structure

Characteristics
• Each instruction was processed one by one.
• No repeateance in each instruction.
• The last instruction is the end of algorithm.
• Sequence of instructions is same with
sequence of instructions in Algorithm

Algorithm and Programming (Sequential Structure)

Case of Employee’s Salary
UNIKOM has n employees with salary asumptions such as:
• Salary of each employee was equal each other.
• Salary was counted by basic salary + allowance - tax .
• The tax is 10 % from basic salary before added by
allowance.
• Allowance is 20% from basic salary.
• Basic salary can be changed.
Calculate salary that UNIKOM must be pay to all employees,
detail of tax, and detail of allowance for each employee

$Algorithm of Employee’s Salary 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Algoritma Gaji_Karyawan {I.S: Jumlah karyawan dan Gaji pokok diinput oleh user} {F.S: Menampilkan gaji, pajak, dan tunjangan karyawan} Deklarasi: gaji_pokok,gaji,jml_gaji:real pajak:real tunjangan:real jml_karyawan:integer Algoritma: input(jml_karyawan,gaji_pokok) pajak0.1*gaji_pokok tunjangan0.2*gaji_pokok gajigaji_pokok+tunjangan-pajak jml_gajigaji*jml_karyawan output(‘Pajak perorang= Rp. ‘,pajak) output(‘Tunjangan perorang= Rp. ‘,tunjangan) output(Gaji ‘,jml_karyawan,’ orang karyawan= Rp. ‘,jml_gaji)$

$Pascal Code of Employee’s Salary 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 program Gaji_Karyawan; uses crt; var gaji_pokok,gaji,jml_gaji:real; pajak:real; tunjangan:real; jml_karyawan:integer; begin write('Masukan jumlah karyawan: ');readln(jml_karyawan); write('Masukan gaji pokok : ');readln(gaji_pokok); pajak:=0.1*gaji_pokok; tunjangan:=0.2*gaji_pokok; gaji:=gaji_pokok+tunjangan-pajak; jml_gaji:=gaji*jml_karyawan; clrscr();{untuk membersihkan layar} writeln('Pajak perorang = Rp. ',pajak:0:2); writeln('Tunjangan perorang = Rp. ',tunjangan:0:2); writeln('Gaji ',jml_karyawan,' orang = Rp. ',jml_gaji:0:2); writeln(); write('Tekan sembarang tombol untuk menutup...'); readkey(); end.$

Collection of Exercises
Exercises of Sequential Search

Exercise 1
Create the algorithm and pascal code to:
• Around and area for 4 2-dimensional space
• Around and area for 3 3-dimensional space.

Exercise 2
Create the algorithm and pascal code to show
curriculum vitae in paragraph style.

Contact Person:
Adam Mukharil Bachtiar
Informatics Engineering UNIKOM
Jalan Dipati Ukur Nomor. 112-114 Bandung 40132
Email: adfbipotter@gmail.com
Blog: http://adfbipotter.wordpress.com
Copyright © Adam Mukharil Bachtiar 2011

1) The document describes the divide-and-conquer algorithm design paradigm. It can be applied to problems where the input can be divided into smaller subproblems, the subproblems can be solved independently, and the solutions combined to solve the original problem. 2) Binary search is provided as an example divide-and-conquer algorithm. It works by recursively dividing the search space in half and only searching the subspace containing the target value. 3) Finding the maximum and minimum elements in an array is also solved using divide-and-conquer. The array is divided into two halves, the max/min found for each subarray, and the overall max/min determined by comparing the subsolutions.

instruction cycle pptsheetal singh

The document discusses the instruction cycle in a computer system. The instruction cycle retrieves program instructions from memory, decodes what actions they specify, and carries out those actions. It has four main steps: 1) fetching the next instruction from memory and storing it in the instruction register, 2) decoding the encoded instruction, 3) reading the effective address for direct or indirect memory instructions, and 4) executing the instruction by passing control signals to relevant components like the ALU to perform the specified actions. The instruction cycle is the basic operational process in which a computer executes instructions.

Chomsky Hierarchy.pptAayushSingh233965

This document discusses the Chomsky hierarchy and different types of automata and grammars. It begins by describing applications of different automata like Turing machines, linear bounded automata, pushdown automata, and finite automata. It then discusses recursive and enumerable sets and linear bounded automata. It provides examples of languages accepted by LBAs and notes that LBAs have more power than PDAs but less than TMs. It also discusses unrestricted grammars, context-sensitive grammars, and places language classes in the Chomsky hierarchy. It concludes by asking questions about left linear versus right linear grammars.

Compiler unit 2&3BBDITM LUCKNOW

A parser is a program component that breaks input data into smaller elements according to the rules of a formal grammar. It builds a parse tree representing the syntactic structure of the input based on these grammar rules. There are two main types of parsers: top-down parsers start at the root of the parse tree and work downward, while bottom-up parsers start at the leaves and work upward. Parser generators use attributes like First and Follow to build parsing tables for predictive parsers like LL(1) parsers, which parse input from left to right based on a single lookahead token.

Cache coherence pptArendraSingh2

This document discusses cache coherence in single and multiprocessor systems. It provides techniques to avoid inconsistencies between cache and main memory including write-through, write-back, and instruction caching. For multiprocessors, it discusses issues with sharing writable data, process migration, and I/O activity. Software solutions involve compiler and OS management while hardware uses coherence protocols like snoopy and directory protocols.

Lecture 05 syntax analysis 2Iffat Anjum

How to execute a C program Leela Koneru

Passes of compilersVairavel C

There are two types of compiler passes: multi-pass compilers perform multiple traversals of the source code to perform different stages of compilation like scanning, parsing, semantic analysis, etc. One-pass compilers only traverse the source code once, performing all compilation stages on each line before moving to the next. Bootstrapping is the process of using a compiler written in a language to compile itself, allowing the creation of a self-hosting compiler for that language. It involves first creating a simple bootstrap compiler for a language subset, then using that to compile a full compiler for the language which can then compile future versions.

C and its errorsJunaid Raja

C-Language & Its Errors discusses the four main types of errors in C programs: 1. Syntax errors occur when the rules of the C syntax are not followed and are detected by the compiler. 2. Logical errors involve flaws in a program's logic and cannot be detected by the compiler. 3. Runtime errors happen during program execution and can involve things like division by zero. 4. Linker errors happen when function calls cannot be resolved during linking, such as due to misspelling functions or missing header files.

Phases of compilerAkhil Kaushik

The document discusses the phases of compilation: 1. The front-end performs lexical, syntax and semantic analysis to generate an intermediate representation and includes error handling. 2. The back-end performs code optimization and generation to produce efficient machine-specific code from the intermediate representation. 3. Key phases include lexical and syntax analysis, semantic analysis, intermediate code generation, code optimization, and code generation.

Bootstrapping in CompilerAkhil Kaushik

The document discusses tombstone diagrams, which use puzzle pieces to represent language processors and programs. It then explains bootstrapping, which refers to using a compiler to compile itself. This allows obtaining a compiler for a new target machine by first writing a compiler in a high-level language, compiling it on the original machine, and then using the output compiler to compile itself on the new target machine. The document provides examples of using bootstrapping to generate cross-compilers that run on one machine but produce code for another.

Operator precedance parsingsanchi29

The document discusses operator precedence parsing, which is a bottom-up parsing technique for operator grammars. It describes operator precedence grammars as grammars where no RHS has a non-terminal and no two non-terminals are adjacent. An operator precedence parser uses a parsing table to shift or reduce based on the precedence relations between terminals. It provides an example of constructing a precedence parsing table and parsing a string using the operator precedence parsing algorithm.

Intermediate code- generationrawan_z

The document discusses intermediate code generation in compilers. It describes how compilers generate an intermediate representation from the abstract syntax tree that is machine independent and allows for optimizations. One popular intermediate representation is three-address code, where each statement contains at most three operands. This code is then represented using structures like quadruples and triples to store the operator and operands for code generation and rearranging during optimizations. Static single assignment form is also covered, which assigns unique names to variables to facilitate optimizations.

Chomsky classification of LanguageDipankar Boruah

This document discusses Noam Chomsky's hierarchy of formal languages. It introduces Chomsky's classification of formal languages from Type-0 to Type-3 based on the type of grammar that generates them. Type-0 languages are the most powerful, being generated by unrestricted grammars and equivalent to Turing machines. Type-3 languages are the simplest, being generated by regular grammars and equivalent to finite state automata. Examples are provided for each language type along with the computing models that recognize them, such as pushdown automata for context-free Type-2 languages.

Bus structure in Computer Organization.pdfmvpk14486

Buses connect components in a computer system and allow for the transfer of data and control signals. There are three main types of buses: the address bus carries memory and I/O addresses, the data bus carries data and instructions, and the control bus carries signals that determine read, write, I/O, and synchronization operations. A system bus combines the functions of these three buses to connect major computer components like the processor, memory, and I/O devices.

Compiler Design BasicsAkhil Kaushik

This document provides an overview of compiler design, including: - The history and importance of compilers in translating high-level code to machine-level code. - The main components of a compiler including the front-end (analysis), back-end (synthesis), and tools used in compiler construction. - Key phases of compilation like lexical analysis, syntax analysis, semantic analysis, code optimization, and code generation. - Types of translators like interpreters, assemblers, cross-compilers and their functions. - Compiler construction tools that help generate scanners, parsers, translation engines, code generators, and data flow analysis.

Lecture 01 introduction to compilerIffat Anjum

This document provides an introduction to compilers, including: - What compilers are and their role in translating programs to machine code - The main phases of compilation: lexical analysis, syntax analysis, semantic analysis, code generation, and optimization - Key concepts like tokens, parsing, symbol tables, and intermediate representations - Related software tools like preprocessors, assemblers, loaders, and linkers

Intermediate code generatorsanchi29

The document discusses different representations of intermediate code in compilers, including high-level and low-level intermediate languages. High-level representations like syntax trees and DAGs depict the structure of the source program, while low-level representations like three-address code are closer to the target machine. Common intermediate code representations discussed are postfix notation, three-address code using quadruples/triples, and syntax trees.

Assembler design optionsMohd Arif

The document discusses different options for assembler design, including one-pass, two-pass, and multi-pass assemblers. A one-pass assembler generates object code directly without a second pass over the source code. It handles forward references by omitting operand addresses until symbols are defined and linking instructions to symbols. A multi-pass assembler allows forward references to be resolved over multiple passes by tracking symbol dependencies.

Performance analysis and randamized agorithamlilyMalar1

The document discusses performance analysis of algorithms in terms of space and time complexity. It provides examples to show how to calculate the space and time complexity of algorithms. Specifically, it analyzes the space and time complexity of a sum algorithm. For space complexity, it identifies the fixed and variable components, showing the space complexity is O(n). For time complexity, it analyzes the number of steps and their frequency to determine the time complexity is O(2n+3). The document also discusses other algorithm analysis topics like asymptotic notations, amortized analysis, and randomized algorithms.

Programming Languages / TranslatorsProject Student

Cost estimation for Query OptimizationRavinder Kamboj

The document discusses cost estimation in query optimization. It explains that the query optimizer should estimate the cost of different execution strategies and choose the strategy with the minimum estimated cost. The cost functions used are estimates and depend on factors like selectivity. The main cost components include access cost to storage, storage cost, computation cost, memory use cost, and communication cost. For different types and sizes of databases, the emphasis may be on minimizing different cost components, such as access cost for large databases. The document provides examples of cost functions for select and join operations that consider factors like index levels, block sizes, and selectivity.

Input output organizationabdulugc

The document discusses various aspects of I/O organization in a computer system. It describes the input-output interface that provides a method for transferring information between internal storage and external I/O devices. It discusses asynchronous data transfer techniques like strobe control and handshaking. It also covers asynchronous serial transmission, different modes of data transfer like programmed I/O, interrupt-initiated I/O, and direct memory access (DMA).

Computer architecture addressing modes and formatsMazin Alwaaly

Introduction to Compiler design Dr. C.V. Suresh Babu

The document discusses compilers and their role in translating high-level programming languages into machine-readable code. It notes that compilers perform several key functions: lexical analysis, syntax analysis, generation of an intermediate representation, optimization of the intermediate code, and finally generation of assembly or machine code. The compiler allows programmers to write code in a high-level language that is easier for humans while still producing efficient low-level code that computers can execute.

Algorithm and Programming (Branching Structure)Adam Mukharil Bachtiar

Algorithm and Programming (Searching)Adam Mukharil Bachtiar

More Related Content

What's hot (20)

How to execute a C program Leela Koneru

Passes of compilersVairavel C

C and its errorsJunaid Raja

Phases of compilerAkhil Kaushik

Bootstrapping in CompilerAkhil Kaushik

Operator precedance parsingsanchi29

Intermediate code- generationrawan_z

Chomsky classification of LanguageDipankar Boruah

Bus structure in Computer Organization.pdfmvpk14486

Compiler Design BasicsAkhil Kaushik

Lecture 01 introduction to compilerIffat Anjum

Intermediate code generatorsanchi29

Assembler design optionsMohd Arif

Performance analysis and randamized agorithamlilyMalar1

Programming Languages / TranslatorsProject Student

Cost estimation for Query OptimizationRavinder Kamboj

Input output organizationabdulugc

Computer architecture addressing modes and formatsMazin Alwaaly

Introduction to Compiler design Dr. C.V. Suresh Babu

How to execute a C program Leela Koneru

Passes of compilersVairavel C

C and its errorsJunaid Raja

Phases of compilerAkhil Kaushik

Bootstrapping in CompilerAkhil Kaushik

Operator precedance parsingsanchi29

Intermediate code- generationrawan_z

Chomsky classification of LanguageDipankar Boruah

Bus structure in Computer Organization.pdfmvpk14486

Compiler Design BasicsAkhil Kaushik

Lecture 01 introduction to compilerIffat Anjum

Intermediate code generatorsanchi29

Assembler design optionsMohd Arif

Performance analysis and randamized agorithamlilyMalar1

Programming Languages / TranslatorsProject Student

Cost estimation for Query OptimizationRavinder Kamboj

Input output organizationabdulugc

Computer architecture addressing modes and formatsMazin Alwaaly

Introduction to Compiler design Dr. C.V. Suresh Babu

Viewers also liked (20)

Algorithm and Programming (Branching Structure)Adam Mukharil Bachtiar

Algorithm and Programming (Searching)Adam Mukharil Bachtiar

Ibm quantum computingFrancisco J. Gálvez Ramírez

The document provides an overview of quantum computing concepts and the IBM Quantum Experience platform. It begins with a short history of quantum computing developments from the 1930s to present. It then explains basic quantum concepts like qubits, superposition, entanglement, and quantum gates. The document outlines requirements for building a quantum computer, including well-defined qubits, initialization, gates, coherence times, and measurement. It describes the IBM Quantum Experience as a platform that provides access to an actual quantum processor via the cloud, along with simulation and tutorial capabilities. Users can design circuits using a graphical Quantum Composer interface and run algorithms on real quantum hardware or simulation.

Algorithm and Programming (Looping Structure)Adam Mukharil Bachtiar

This document discusses looping structures in algorithms and programming. It defines looping as repeating statements to fulfill a looping condition. The main types of looping structures are for, while, and repeat loops. Examples are given in pseudocode and Pascal to illustrate for loops that count ascending and descending, while loops, and repeat loops. Exercises are provided to practice different types of loops.

Algorithm and Programming (Introduction of dev pascal, data type, value, and ...Adam Mukharil Bachtiar

Introduction to Quantum Computing & Quantum Information TheoryRahul Mee

This document provides an introduction to quantum computing and quantum information theory. It discusses how technological limitations of conventional computing motivate the development of quantum computing. The key laws of quantum mechanics that enable quantum computing are introduced, including superposition, entanglement, and the Heisenberg uncertainty principle. The document explains how quantum bits (qubits) can represent more than the two states of classical bits, and how quantum gates operate on qubits. It provides examples of one-qubit gates like the Hadamard gate. The potential for quantum computers to massively scale parallelism through quantum effects like entanglement is also summarized.

04.01 file organizationBishal Ghimire

This document discusses file organization and storage hierarchy in conventional database management systems (DBMS). It describes the different levels of storage including primary storage (CPU registers, cache, memory), secondary storage (hard disks, removable media), tertiary storage (backup devices), and offline storage (tape, optical discs). The document also covers disk subsystem components like controllers, interfaces, RAID configurations, and performance optimization techniques for disk access.

Algorithm and Programming (Procedure and Function)Adam Mukharil Bachtiar

FILE STRUCTURE IN DBMSAbhishek Dutta

This document discusses physical storage media and file organization. It describes different types of storage media like magnetic disks, flash memory, and tape storage in terms of their speed, capacity, reliability and other characteristics. It also discusses the storage hierarchy from fastest volatile cache/memory to slower non-volatile secondary storage like disks to slowest tertiary storage like tapes. The document further explains techniques like RAID and file organization to optimize storage access and reliability in the presence of disk failures.

Chapter 11 - File System ImplementationWayne Jones Jnr

Data Management (Data Mining Klasifikasi)Adam Mukharil Bachtiar

Chapter 06 Google

Quantum ComputersDeepti.B

Quantum computers have the potential to solve certain problems much faster than classical computers by exploiting principles of quantum mechanics, such as superposition and entanglement. However, building large-scale, reliable quantum computers faces challenges related to decoherence and controlling quantum systems. Current research aims to develop quantum algorithms and overcome issues in scaling up quantum hardware to perform more complex computations than today's most powerful supercomputers.

File system.elyza12

The document provides an overview of file systems, including their purpose of organizing and storing information on storage devices. It discusses key aspects of file systems such as how they separate information into individual files and directories, use metadata to store attributes about files, allocate storage space in a granular manner (which can result in unused space), become fragmented over time, and use various utilities and structures to implement these functions while maintaining integrity of data and restricting access. File systems are a critical component of operating systems that allow for efficient organization, retrieval and updating of user data on different types of storage media and devices.

Algorithm and Programming (Record)Adam Mukharil Bachtiar

Algorithm and Programming (Sorting)Adam Mukharil Bachtiar

Algorithm and Programming (Array)Adam Mukharil Bachtiar

Algorithm and Programming (Introduction of Algorithms)Adam Mukharil Bachtiar

File managementVishal Singh

This document discusses various aspects of file systems including: 1. It defines what a file is and lists some common file attributes like name, size, and timestamps. 2. It describes different file operations like create, read, write, delete and different methods to access and store files like sequential, random, and index access. 3. It discusses file system implementation techniques like contiguous allocation, linked lists, and i-nodes and how free space is managed through approaches like bitmaps and linked lists.

Introduccion algoritmoscuanticosFrancisco J. Gálvez Ramírez

Este documento presenta una introducción a los algoritmos cuánticos más representativos, incluyendo los algoritmos de Deutsch, Deutsch-Josza, Simon, Shor y Grover. Explica conceptos básicos de computación cuántica como qubits y puertas lógicas. También describe la caminata cuántica y cómo puede usarse como herramienta para crear algoritmos cuánticos para búsquedas y verificación de productos de matrices. El autor concluye destacando el potencial de los algoritmos cuánticos y la caminata cuántica para

Algorithm and Programming (Branching Structure)Adam Mukharil Bachtiar

Algorithm and Programming (Searching)Adam Mukharil Bachtiar

Ibm quantum computingFrancisco J. Gálvez Ramírez

Algorithm and Programming (Looping Structure)Adam Mukharil Bachtiar

Algorithm and Programming (Introduction of dev pascal, data type, value, and ...Adam Mukharil Bachtiar

Introduction to Quantum Computing & Quantum Information TheoryRahul Mee

04.01 file organizationBishal Ghimire

Algorithm and Programming (Procedure and Function)Adam Mukharil Bachtiar

FILE STRUCTURE IN DBMSAbhishek Dutta

Chapter 11 - File System ImplementationWayne Jones Jnr

Data Management (Data Mining Klasifikasi)Adam Mukharil Bachtiar

Chapter 06 Google

Quantum ComputersDeepti.B

File system.elyza12

Algorithm and Programming (Record)Adam Mukharil Bachtiar

Algorithm and Programming (Sorting)Adam Mukharil Bachtiar

Algorithm and Programming (Array)Adam Mukharil Bachtiar

Algorithm and Programming (Introduction of Algorithms)Adam Mukharil Bachtiar

File managementVishal Singh

Introduccion algoritmoscuanticosFrancisco J. Gálvez Ramírez

More from Adam Mukharil Bachtiar (20)

Materi 8 - Data Mining Association Rule.pdfAdam Mukharil Bachtiar

Clean Code - Formatting CodeAdam Mukharil Bachtiar

Dokumen tersebut memberikan tips untuk membuat formatting kode program yang baik agar mudah dibaca dan dipahami. Terdapat dua jenis formatting, yaitu vertical dan horizontal formatting. Secara vertical, kode perlu diatur dengan memperhatikan konsep-konsep, jarak antar konsep, kerapatan kode yang berkaitan, dan letak deklarasi dan pemanggilan fungsi. Secara horizontal, perlu memperhatikan pemberian jarak, penyamaan baris, dan pengindentasian untuk membedakan struktur program.

Clean Code - Clean CommentsAdam Mukharil Bachtiar

Clean MethodAdam Mukharil Bachtiar

Clean Code and Design Pattern - Meaningful NamesAdam Mukharil Bachtiar

Model Driven Software DevelopmentAdam Mukharil Bachtiar

Scrum: How to ImplementAdam Mukharil Bachtiar

Pengujian Perangkat LunakAdam Mukharil Bachtiar

Data Mining ClusteringAdam Mukharil Bachtiar

Data Mining Klasifikasi (Updated 30 Desember 2020)Adam Mukharil Bachtiar

Analisis Algoritma - Strategi Algoritma Dynamic ProgrammingAdam Mukharil Bachtiar

Analisis Algoritma - Strategi Algoritma Divide and ConquerAdam Mukharil Bachtiar

Teks tersebut membahas strategi algoritma Divide and Conquer untuk memecahkan masalah. Strategi ini membagi masalah menjadi submasalah kecil, memecahkan submasalah tersebut secara rekursif, lalu menggabungkan hasilnya untuk mendapatkan solusi masalah awal. Dua contoh masalah yang dijelaskan adalah mencari nilai maksimum dan minimum dalam tabel, serta mencari pasangan titik terdekat dalam himpunan titik.

Analisis Algoritma - Strategi Algoritma GreedyAdam Mukharil Bachtiar

Analisis Algoritma - Penerapan Strategi Algoritma Brute ForceAdam Mukharil Bachtiar

Analisis Algoritma - Strategi Algoritma Brute ForceAdam Mukharil Bachtiar

Analisis Algoritma - Kelas-kelas Dasar Efisiensi AlgoritmaAdam Mukharil Bachtiar

Analisis Algoritma - Teorema Notasi AsimptotikAdam Mukharil Bachtiar

Analisis Algoritma - Notasi AsimptotikAdam Mukharil Bachtiar

Activity DiagramAdam Mukharil Bachtiar

UML dan Use Case ViewAdam Mukharil Bachtiar

Materi 8 - Data Mining Association Rule.pdfAdam Mukharil Bachtiar

Clean Code - Formatting CodeAdam Mukharil Bachtiar

Clean Code - Clean CommentsAdam Mukharil Bachtiar

Clean MethodAdam Mukharil Bachtiar

Clean Code and Design Pattern - Meaningful NamesAdam Mukharil Bachtiar

Model Driven Software DevelopmentAdam Mukharil Bachtiar

Scrum: How to ImplementAdam Mukharil Bachtiar

Pengujian Perangkat LunakAdam Mukharil Bachtiar

Data Mining ClusteringAdam Mukharil Bachtiar

Data Mining Klasifikasi (Updated 30 Desember 2020)Adam Mukharil Bachtiar

Analisis Algoritma - Strategi Algoritma Dynamic ProgrammingAdam Mukharil Bachtiar

Analisis Algoritma - Strategi Algoritma Divide and ConquerAdam Mukharil Bachtiar

Analisis Algoritma - Strategi Algoritma GreedyAdam Mukharil Bachtiar

Analisis Algoritma - Penerapan Strategi Algoritma Brute ForceAdam Mukharil Bachtiar

Analisis Algoritma - Strategi Algoritma Brute ForceAdam Mukharil Bachtiar

Analisis Algoritma - Kelas-kelas Dasar Efisiensi AlgoritmaAdam Mukharil Bachtiar

Analisis Algoritma - Teorema Notasi AsimptotikAdam Mukharil Bachtiar

Analisis Algoritma - Notasi AsimptotikAdam Mukharil Bachtiar

Activity DiagramAdam Mukharil Bachtiar

UML dan Use Case ViewAdam Mukharil Bachtiar

Recently uploaded (20)

Code and No-Code Journeys: The Coverage OverlookApplitools

Porting Qt 5 QML Modules to Qt 6 WebinarICS

Have you upgraded your application from Qt 5 to Qt 6? If so, your QML modules might still be stuck in the old Qt 5 style—technically compatible, but far from optimal. Qt 6 introduces a modernized approach to QML modules that offers better integration with CMake, enhanced maintainability, and significant productivity gains. In this webinar, we’ll walk you through the benefits of adopting Qt 6 style QML modules and show you how to make the transition. You'll learn how to leverage the new module system to reduce boilerplate, simplify builds, and modernize your application architecture. Whether you're planning a full migration or just exploring what's new, this session will help you get the most out of your move to Qt 6.

Bonk coin airdrop_ Everything You Need to Know.pdfHerond Labs

The Bonk airdrop, one of the largest in Solana’s history, distributed 50% of its total supply to community members, significantly boosting its popularity and Solana’s network activity. Below is everything you need to know about the Bonk coin airdrop, including its history, eligibility, how to claim tokens, risks, and current status. https://blog.herond.org/bonk-coin-airdrop/

dp-700 exam questions sample docume .pdfpravkumarbiz

Shell Skill Tree - LabEx Certification (LabEx)VICTOR MAESTRE RAMIREZ

Top 11 Fleet Management Software Providers in 2025 (2).pdfTrackobit

GDG Douglas - Google AI Agents: Your Next Intern?felipeceotto

Maintaining + Optimizing Database Health: Vendors, Orchestrations, Enrichment...BradBedford3

Join the Denver Marketo User Group, Captello and Integrate as we dive into the best practices, tools, and strategies for maintaining robust, high-performing databases. From managing vendors and automating orchestrations to enriching data for better insights, this session will unpack the key elements that keep your data ecosystem running smoothly—and smartly. We will hear from Steve Armenti, Twelfth, and Aaron Karpaty, Captello, and Frannie Danzinger, Integrate.

Software Testing & it’s types (DevOps)S Pranav (Deepu)

NTRODUCTION TO SOFTWARE TESTING • Definition: • Software testing is the process of evaluating and verifying that a software application or system meets specified requirements and functions correctly. • Purpose: • Identify defects and bugs in the software. • Ensure the software meets quality standards. • Validate that the software performs as intended in various scenarios. • Importance: • Reduces risks associated with software failures. • Improves user satisfaction and trust in the product. • Enhances the overall reliability and performance of the software

IMAGE CLASSIFICATION USING CONVOLUTIONAL NEURAL NETWORK.P.pptxusmanch7829

Build Smarter, Deliver Faster with Choreo - An AI Native Internal Developer P...WSO2

Enterprises must deliver intelligent, cloud native applications quickly—without compromising governance or scalability. This session explores how an internal developer platform increases productivity via AI for code and accelerates AI-native app delivery via code for AI. Learn practical techniques for embedding AI in the software lifecycle, automating governance with AI agents, and applying a cell-based architecture for modularity and scalability. Real-world examples and proven patterns will illustrate how to simplify delivery, enhance developer productivity, and drive measurable outcomes. Learn more: https://wso2.com/choreo

Software Engineering Process, Notation & Tools Introduction - Part 4Gaurav Sharma

COBOL Programming with VSCode - IBM CertificateVICTOR MAESTRE RAMIREZ

DevOps for AI: running LLMs in production with Kubernetes and KubeFlowAarno Aukia

Async-ronizing Success at Wix - Patterns for Seamless Microservices - Devoxx ...Natan Silnitsky

In a world where speed, resilience, and fault tolerance define success, Wix leverages Kafka to power asynchronous programming across 4,000 microservices. This talk explores four key patterns that boost developer velocity while solving common challenges with scalable, efficient, and reliable solutions: 1. Integration Events: Shift from synchronous calls to pre-fetching to reduce query latency and improve user experience. 2. Task Queue: Offload non-critical tasks like notifications to streamline request flows. 3. Task Scheduler: Enable precise, fault-tolerant delayed or recurring workflows with robust scheduling. 4. Iterator for Long-running Jobs: Process extensive workloads via chunked execution, optimizing scalability and resilience. For each pattern, we’ll discuss benefits, challenges, and how we mitigate drawbacks to create practical solutions This session offers actionable insights for developers and architects tackling distributed systems, helping refine microservices and adopting Kafka-driven async excellence.

Integrating Survey123 and R&H Data Using FMESafe Software

West Virginia Department of Transportation (WVDOT) actively engages in several field data collection initiatives using Collector and Survey 123. A critical component for effective asset management and enhanced analytical capabilities is the integration of Geographic Information System (GIS) data with Linear Referencing System (LRS) data. Currently, RouteID and Measures are not captured in Survey 123. However, we can bridge this gap through FME Flow automation. When a survey is submitted through Survey 123 for ArcGIS Portal (10.8.1), it triggers FME Flow automation. This process uses a customized workbench that interacts with a modified version of Esri's Geometry to Measure API. The result is a JSON response that includes RouteID and Measures, which are then applied to the feature service record.

IBM Rational Unified Process For Software Engineering - IntroductionGaurav Sharma

Top 5 Task Management Software to Boost Productivity in 2025Orangescrum

Integration Ignited Redefining Event-Driven Architecture at Wix - EventCentricNatan Silnitsky

At Wix, we revolutionized our platform by making integration events the backbone of our 4,000-microservice ecosystem. By abandoning traditional domain events for standardized Protobuf events through Kafka, we created a universal language powering our entire architecture. We'll share how our "single-aggregate services" approach—where every CUD operation triggers semantic events—transformed scalability and extensibility, driving efficient event choreography, data lake ingestion, and search indexing. We'll address our challenges: balancing consistency with modularity, managing event overhead, and solving consumer lag issues. Learn how event-based data prefetches dramatically improved performance while preserving the decoupling that makes our platform infinitely extensible. Key Takeaways: - How integration events enabled unprecedented scale and extensibility - Practical strategies for event-based data prefetching that supercharge performance - Solutions to common event-driven architecture challenges - When to break conventional architectural rules for specific contexts

Generative Artificial Intelligence and its ApplicationsSandeepKS52

The exploration of generative AI begins with an overview of its fundamental concepts, highlighting how these technologies create new content and ideas by learning from existing data. Following this, the focus shifts to the processes involved in training and fine-tuning models, which are essential for enhancing their performance and ensuring they meet specific needs. Finally, the importance of responsible AI practices is emphasized, addressing ethical considerations and the impact of AI on society, which are crucial for developing systems that are not only effective but also beneficial and fair.

Code and No-Code Journeys: The Coverage OverlookApplitools

Porting Qt 5 QML Modules to Qt 6 WebinarICS

Bonk coin airdrop_ Everything You Need to Know.pdfHerond Labs

dp-700 exam questions sample docume .pdfpravkumarbiz

Shell Skill Tree - LabEx Certification (LabEx)VICTOR MAESTRE RAMIREZ

Top 11 Fleet Management Software Providers in 2025 (2).pdfTrackobit

GDG Douglas - Google AI Agents: Your Next Intern?felipeceotto

Maintaining + Optimizing Database Health: Vendors, Orchestrations, Enrichment...BradBedford3

Software Testing & it’s types (DevOps)S Pranav (Deepu)

IMAGE CLASSIFICATION USING CONVOLUTIONAL NEURAL NETWORK.P.pptxusmanch7829

Build Smarter, Deliver Faster with Choreo - An AI Native Internal Developer P...WSO2

Software Engineering Process, Notation & Tools Introduction - Part 4Gaurav Sharma

COBOL Programming with VSCode - IBM CertificateVICTOR MAESTRE RAMIREZ

DevOps for AI: running LLMs in production with Kubernetes and KubeFlowAarno Aukia

Async-ronizing Success at Wix - Patterns for Seamless Microservices - Devoxx ...Natan Silnitsky

Integrating Survey123 and R&H Data Using FMESafe Software

IBM Rational Unified Process For Software Engineering - IntroductionGaurav Sharma

Top 5 Task Management Software to Boost Productivity in 2025Orangescrum

Integration Ignited Redefining Event-Driven Architecture at Wix - EventCentricNatan Silnitsky

Generative Artificial Intelligence and its ApplicationsSandeepKS52

Algorithm and Programming (Sequential Structure)

1. Adam Mukharil Bachtiar English Class Informatics Engineering 2011 Algorithms and Programming Sequential Structure

2. Steps of the Day Let’s Start Definition Characteristic Exercises

3. Definition Definition

4. DefinitionofSequential Structure • The simplest and basic structure in algorithm. • Instruction was processed in sequential way (top down approach).

5. Characteristics of Sequential Structure All about Sequential Structure

6. Characteristics • Each instruction was processed one by one. • No repeateance in each instruction. • The last instruction is the end of algorithm. • Sequence of instructions is same with sequence of instructions in Algorithm

8. Case of Employee’s Salary UNIKOM has n employees with salary asumptions such as: • Salary of each employee was equal each other. • Salary was counted by basic salary + allowance - tax . • The tax is 10 % from basic salary before added by allowance. • Allowance is 20% from basic salary. • Basic salary can be changed. Calculate salary that UNIKOM must be pay to all employees, detail of tax, and detail of allowance for each employee

9. Algorithm of Employee’s Salary 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Algoritma Gaji_Karyawan {I.S: Jumlah karyawan dan Gaji pokok diinput oleh user} {F.S: Menampilkan gaji, pajak, dan tunjangan karyawan} Deklarasi: gaji_pokok,gaji,jml_gaji:real pajak:real tunjangan:real jml_karyawan:integer Algoritma: input(jml_karyawan,gaji_pokok) pajak0.1*gaji_pokok tunjangan0.2*gaji_pokok gajigaji_pokok+tunjangan-pajak jml_gajigaji*jml_karyawan output(‘Pajak perorang= Rp. ‘,pajak) output(‘Tunjangan perorang= Rp. ‘,tunjangan) output(Gaji ‘,jml_karyawan,’ orang karyawan= Rp. ‘,jml_gaji)

10. Pascal Code of Employee’s Salary 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 program Gaji_Karyawan; uses crt; var gaji_pokok,gaji,jml_gaji:real; pajak:real; tunjangan:real; jml_karyawan:integer; begin write('Masukan jumlah karyawan: ');readln(jml_karyawan); write('Masukan gaji pokok : ');readln(gaji_pokok); pajak:=0.1*gaji_pokok; tunjangan:=0.2*gaji_pokok; gaji:=gaji_pokok+tunjangan-pajak; jml_gaji:=gaji*jml_karyawan; clrscr();{untuk membersihkan layar} writeln('Pajak perorang = Rp. ',pajak:0:2); writeln('Tunjangan perorang = Rp. ',tunjangan:0:2); writeln('Gaji ',jml_karyawan,' orang = Rp. ',jml_gaji:0:2); writeln(); write('Tekan sembarang tombol untuk menutup...'); readkey(); end.

11. Collection of Exercises Exercises of Sequential Search

12. Exercise 1 Create the algorithm and pascal code to: • Around and area for 4 2-dimensional space • Around and area for 3 3-dimensional space.

13. Exercise 2 Create the algorithm and pascal code to show curriculum vitae in paragraph style.

14. Contact Person: Adam Mukharil Bachtiar Informatics Engineering UNIKOM Jalan Dipati Ukur Nomor. 112-114 Bandung 40132 Email: [email protected] Blog: http://adfbipotter.wordpress.com Copyright © Adam Mukharil Bachtiar 2011

Algorithm and Programming (Sequential Structure)

Recommended

More Related Content

What's hot (20)

Viewers also liked (20)

More from Adam Mukharil Bachtiar (20)

Recently uploaded (20)

Algorithm and Programming (Sequential Structure)