Algorithm and Data Structures - Basic of IT Problem Solving
Download as pptx, pdf7 likes3,182 views
The document discusses algorithm and data structures as the basic foundations of IT problem solving. It covers topics in discrete mathematics, computer architecture, computer science theory, and information technology from both theoretical and engineering perspectives. Key aspects covered include programming principles, algorithms, common data structures like arrays, lists, maps, stacks and queues. It emphasizes that algorithms and data structures are closely related, with algorithms operating on data structures to solve problems. Examples are provided of problems, inputs, outputs, and the algorithms and data structures that can be used.
1 of 27
Downloaded 167 times
Ad
Recommended
Symmetric ciphermodel
Symmetric ciphermodelpriyapavi96 The document discusses symmetric encryption, which is a widely used form of cryptography involving the transformation of plaintext into ciphertext using a secret key, with decryption processes used to revert ciphertext back to plaintext. Key elements of symmetric encryption include the encryption algorithm, key generation, and methods of secure key exchange, along with the advantages and disadvantages of symmetric cryptosystems. Additionally, it outlines different cryptanalysis attack methods aimed at recovering encryption keys and highlights the importance of key management in maintaining the security of encrypted communications.
Ppt bubble sort
Ppt bubble sortprabhakar jalasutram The document describes the bubble sort algorithm. It takes an array of numbers as input, such as {1,3,5,2,4,6}, and sorts it in ascending order through multiple passes where adjacent elements are compared and swapped if in the wrong order, resulting in the sorted array {1,2,3,4,5,6}. The algorithm works by making multiple passes through the array, swapping adjacent elements that are out of order on each pass until the array is fully sorted.
Array data structure
Array data structuremaamir farooq An array is a data structure that stores fixed number of items of the same type. It allows fast access of elements using indices. Basic array operations include traversing elements, inserting/deleting elements, searching for elements, and updating elements. Arrays are zero-indexed and elements are accessed via their index.
Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA)Gaditek This document discusses instruction set architectures (ISAs). It covers four main types of ISAs: accumulator, stack, memory-memory, and register-based. It also discusses different addressing modes like immediate, direct, indirect, register-indirect, and relative addressing. The key details provided are:
1) Accumulator ISAs use a dedicated register (accumulator) to hold operands and results, while stack ISAs use an implicit last-in, first-out stack. Memory-memory ISAs can have 2-3 operands specified directly in memory.
2) Register-based ISAs can be either register-memory (like 80x86) or load-store (like MIPS), which fully separate
Merge Sort
Merge SortNikhil Sonkamble Merge sort is a divide and conquer algorithm that divides an array into halves, recursively sorts the halves, and then merges the sorted halves back together. The key steps are:
1. Divide the array into equal halves until reaching base cases of arrays with one element.
2. Recursively sort the left and right halves by repeating the divide step.
3. Merge the sorted halves back into a single sorted array by comparing elements pairwise and copying the smaller element into the output array.
Merge sort has several advantages including running in O(n log n) time in all cases, accessing data sequentially with low random access needs, and being suitable for external sorting of large data sets that do not fit in memory
Approximation Algorithms
Approximation AlgorithmsNicolas Bettenburg The document discusses approximation algorithms for NP-complete problems. It introduces the idea of finding near-optimal solutions in polynomial time for problems where optimal solutions cannot be found efficiently. It provides examples of the vertex cover problem and set cover problem, describing greedy approximation algorithms that provide performance guarantees for finding near-optimal solutions for these problems. The document also discusses some open questions around whether these approximation ratios can be improved.
Sorting Algorithms
Sorting AlgorithmsMohammed Hussein This document discusses different sorting algorithms including bubble sort, insertion sort, and selection sort. It provides details on each algorithm, including time complexity, code examples, and graphical examples. Bubble sort is an O(n2) algorithm that works by repeatedly comparing and swapping adjacent elements. Insertion sort also has O(n2) time complexity but is more efficient than bubble sort for small or partially sorted lists. Selection sort finds the minimum value and swaps it into place at each step.
asymptotic notation
asymptotic notationSangeethaSasi1 This document discusses asymptotic notations which are mathematical tools used to analyze the time and space complexity of algorithms. It introduces Big O, Big Omega, and Big Theta notations. Big O notation represents the upper bound and worst case time complexity. Big Omega notation represents the lower bound and best case time complexity. Big Theta notation defines the average time complexity of an algorithm. Examples are provided for how to determine the asymptotic notation of polynomial functions.
Binary Search - Design & Analysis of Algorithms
Binary Search - Design & Analysis of AlgorithmsDrishti Bhalla Binary search is an efficient algorithm for finding a target value within a sorted array. It works by repeatedly dividing the search range in half and checking the value at the midpoint. This eliminates about half of the remaining candidates in each step. The maximum number of comparisons needed is log n, where n is the number of elements. This makes binary search faster than linear search, which requires checking every element. The algorithm works by first finding the middle element, then checking if it matches the target. If not, it recursively searches either the lower or upper half depending on if the target is less than or greater than the middle element.
1 Introduction to C Programming.pptx
1 Introduction to C Programming.pptxaarockiaabinsAPIICSE This document provides information about a course on programming for problem solving in C. It includes the course objectives, which are to give exposure to procedural programming principles in C, introduce computational thinking and develop C programs using basic constructs, and enable students to apply C fundamentals to solve engineering problems. The course outcomes cover various C programming concepts like data types, control structures, arrays, strings, pointers, structures, unions and files. The syllabus is divided into 5 units covering these topics. Textbooks for the course are also listed.
THREADED BINARY TREE AND BINARY SEARCH TREE
THREADED BINARY TREE AND BINARY SEARCH TREESiddhi Shrivas The document discusses threaded binary trees. It begins by defining a regular binary tree. It then explains that in a threaded binary tree, null pointers are replaced by threads (pointers) to other nodes. Threading rules specify that a null left/right pointer is replaced by a pointer to the inorder predecessor/successor. Boolean fields distinguish threads from links. Non-recursive traversals are possible by following threads. Insertion and deletion of nodes may require updating threads. Threaded binary trees allow efficient non-recursive traversals without a stack.
Binary tree
Binary treeVanitha Chandru This document discusses binary trees and various tree traversal algorithms. It defines what a binary tree is, including nodes, roots, leaves, and siblings. It explains different types of binary tree traversals including preorder, inorder, postorder, and level order. Pseudocode is provided for algorithms to perform inorder, preorder, and postorder traversals on a binary tree. Advantages of using trees are also listed.
Mathematical Analysis of Recursive Algorithm.
Mathematical Analysis of Recursive Algorithm.mohanrathod18 The document outlines a methodical approach for analyzing recursive algorithms, particularly through the example of the factorial function. It details steps for determining input size, identifying basic operations, establishing recursive relations, and solving them using substitution methods. The analysis concludes with the time complexity of the recursive algorithm being O(n).
Matrix chain multiplication
Matrix chain multiplicationKiran K The document discusses the problem of determining the optimal way to fully parenthesize the product of a chain of matrices to minimize the number of scalar multiplications. It presents a dynamic programming approach to solve this problem in four steps: 1) characterize the structure of an optimal solution, 2) recursively define the cost of an optimal solution, 3) compute the costs using tables, 4) construct the optimal solution from the tables. An example is provided to illustrate computing the costs table and finding the optimal parenthesization of a chain of 6 matrices.
Sum of subsets problem by backtracking
Sum of subsets problem by backtracking Hasanain Alshadoodee The document presents a backtracking approach to solving the sum of subsets problem, where the goal is to find combinations of distinct positive numbers that sum to a specified value. It illustrates the method using examples with a state space tree to visualize the possible subsets and their sums. The document includes Python code to demonstrate the solution for the subset sum problem.
Design and Analysis of algorithms
Design and Analysis of algorithmsDr. Rupa Ch The document provides a comprehensive overview of the design and analysis of algorithms, focusing on their definitions, specifications, and evaluation metrics such as time and space complexity. It covers various algorithm design methods, including natural language descriptions, flowcharts, and pseudo-code, and illustrates key algorithms such as selection sort and recursive algorithms. Additionally, it discusses performance analysis including average-case analysis and asymptotic notations used to describe algorithm efficiency.
Exhaustive Search
Exhaustive SearchKasun Ranga Wijeweera Exhaustive search involves systematically enumerating all potential solutions to a problem and checking if each one is a valid solution. It can solve problems that efficient algorithms cannot by simply trying every possibility, though this becomes intractable for large problems. The traveling salesman problem is an example where checking the length of every possible tour route between cities requires exhaustive search for even moderate numbers of cities. While slow, exhaustive search guarantees finding the optimal solution if allowed to run to completion.
Top down parsing
Top down parsingLakshmiSamivel This document discusses top-down parsing and predictive parsing techniques. It explains that top-down parsers build parse trees from the root node down to the leaf nodes, while bottom-up parsers do the opposite. Recursive descent parsing and predictive parsing are introduced as two common top-down parsing approaches. Recursive descent parsing may involve backtracking, while predictive parsing avoids backtracking by using a parsing table to determine the production to apply. The key steps of a predictive parsing algorithm using a stack and parsing table are outlined.
Bfs and Dfs
Bfs and DfsMasud Parvaze The document discusses graph traversal algorithms breadth-first search (BFS) and depth-first search (DFS). It provides examples of how BFS and DFS work, including pseudocode for algorithms. It also discusses applications of BFS such as finding shortest paths and detecting bipartitions. Applications of DFS include finding connected components and topological sorting.
Apriori Algorithm
Apriori AlgorithmInternational School of Engineering The document discusses the Apriori algorithm, which is used for mining frequent itemsets from transactional databases. It begins with an overview and definition of the Apriori algorithm and its key concepts like frequent itemsets, the Apriori property, and join operations. It then outlines the steps of the Apriori algorithm, provides an example using a market basket database, and includes pseudocode. The document also discusses limitations of the algorithm and methods to improve its efficiency, as well as advantages and disadvantages.
Greedy Algorithm
Greedy AlgorithmWaqar Akram This document provides an introduction to greedy algorithms. It defines greedy algorithms as algorithms that make locally optimal choices at each step in the hope of finding a global optimum. The document then provides examples of problems that can be solved using greedy algorithms, including counting money, scheduling jobs, finding minimum spanning trees, and the traveling salesman problem. It also provides pseudocode for a general greedy algorithm and discusses some properties of greedy algorithms.
Stressen's matrix multiplication
Stressen's matrix multiplicationKumar Strassen's algorithm improves on the basic matrix multiplication algorithm which runs in O(N3) time. It achieves this by dividing the matrices into sub-matrices and performing 7 multiplications and 18 additions on the sub-matrices, rather than the 8 multiplications of the basic algorithm. This results in a runtime of O(N2.81) using divide and conquer, providing an asymptotic improvement over the basic O(N3) algorithm.
Algorithms Lecture 1: Introduction to Algorithms
Algorithms Lecture 1: Introduction to AlgorithmsMohamed Loey The document discusses the analysis and design of algorithms, focusing on time and space complexity while distinguishing between various algorithm types and their applications. It highlights the use of Python as a preferred programming language due to its ease of use, supportive community, and extensive libraries like NumPy and SciPy. The document also covers pseudocode as an informal method of describing algorithms and provides examples of sorting and searching algorithms.
Dijkstra's algorithm presentation
Dijkstra's algorithm presentationSubid Biswas Dijkstra's algorithm is a method for finding the shortest paths from a single source vertex to all other vertices in a weighted graph with nonnegative edge weights. It operates using a greedy approach, efficiently calculating paths through priority queues while having a time complexity of O(E log V) and space complexity of O(V). Applications include digital mapping services, social networking connections, IP routing, and robotic navigation.
Binary tree
Binary tree Rajendran Binary trees are a non-linear data structure where each node has zero, one, or two child nodes. They are commonly used to represent hierarchical relationships. A binary tree has a root node at the top with child nodes below it. Binary trees can be empty or consist of a root node and left and right subtrees, which are also binary trees. They allow for efficient search, insert, and delete operations and can be represented using arrays or linked lists.
Divide and Conquer - Part 1
Divide and Conquer - Part 1Amrinder Arora The document presents an overview of the Divide and Conquer (D&C) algorithm design paradigm, detailing its recursive approach to solving complex problems by breaking them into smaller subproblems. It covers essential algorithms like binary search, merge sort, and quicksort, and discusses recurrence relations used to analyze their time complexities. Various methods for solving these recurrence relations, such as substitution and the master theorem, are also introduced.
Graph data structure
Graph data structureTech_MX The document discusses various topics related to graphs:
- It defines directed and undirected graphs, paths, connected graphs, trees, degree, isomorphic graphs, cut sets, and labeled graphs.
- Key aspects include paths being sequences of vertices with edges connecting them, connected graphs having paths between all vertex pairs, trees being connected and acyclic graphs, and isomorphic graphs having the same structure.
- It also covers graph concepts such as degrees measuring incident edges, cut sets separating graphs, and labeling providing additional data to graphs' vertices or edges.
Matlab Script - Loop Control
Matlab Script - Loop ControlShameer Ahmed Koya This document covers loop control methods in MATLAB, specifically 'for' and 'while' loops. It explains their syntax, application, and how each loop type operates differently, emphasizing the importance of proper initialization and condition checks to avoid infinite loops. Additionally, it provides practical examples for both loop types to illustrate their usage in programming.
Unit2 algorithmic problem_solving
Unit2 algorithmic problem_solvingCapuchino HuiNing This document outlines Unit 2 of a course on algorithmic problem solving. It covers the problem solving process, algorithms, control structures like sequence, selection, and repetition, and examples of writing pseudocode algorithms. It also explains Euclid's algorithm for finding the greatest common divisor of two integers through step-by-step examples and pseudocode.
More Related Content
What's hot (20)
Binary Search - Design & Analysis of Algorithms
Binary Search - Design & Analysis of AlgorithmsDrishti Bhalla Binary search is an efficient algorithm for finding a target value within a sorted array. It works by repeatedly dividing the search range in half and checking the value at the midpoint. This eliminates about half of the remaining candidates in each step. The maximum number of comparisons needed is log n, where n is the number of elements. This makes binary search faster than linear search, which requires checking every element. The algorithm works by first finding the middle element, then checking if it matches the target. If not, it recursively searches either the lower or upper half depending on if the target is less than or greater than the middle element.
1 Introduction to C Programming.pptx
1 Introduction to C Programming.pptxaarockiaabinsAPIICSE This document provides information about a course on programming for problem solving in C. It includes the course objectives, which are to give exposure to procedural programming principles in C, introduce computational thinking and develop C programs using basic constructs, and enable students to apply C fundamentals to solve engineering problems. The course outcomes cover various C programming concepts like data types, control structures, arrays, strings, pointers, structures, unions and files. The syllabus is divided into 5 units covering these topics. Textbooks for the course are also listed.
THREADED BINARY TREE AND BINARY SEARCH TREE
THREADED BINARY TREE AND BINARY SEARCH TREESiddhi Shrivas The document discusses threaded binary trees. It begins by defining a regular binary tree. It then explains that in a threaded binary tree, null pointers are replaced by threads (pointers) to other nodes. Threading rules specify that a null left/right pointer is replaced by a pointer to the inorder predecessor/successor. Boolean fields distinguish threads from links. Non-recursive traversals are possible by following threads. Insertion and deletion of nodes may require updating threads. Threaded binary trees allow efficient non-recursive traversals without a stack.
Binary tree
Binary treeVanitha Chandru This document discusses binary trees and various tree traversal algorithms. It defines what a binary tree is, including nodes, roots, leaves, and siblings. It explains different types of binary tree traversals including preorder, inorder, postorder, and level order. Pseudocode is provided for algorithms to perform inorder, preorder, and postorder traversals on a binary tree. Advantages of using trees are also listed.
Mathematical Analysis of Recursive Algorithm.
Mathematical Analysis of Recursive Algorithm.mohanrathod18 The document outlines a methodical approach for analyzing recursive algorithms, particularly through the example of the factorial function. It details steps for determining input size, identifying basic operations, establishing recursive relations, and solving them using substitution methods. The analysis concludes with the time complexity of the recursive algorithm being O(n).
Matrix chain multiplication
Matrix chain multiplicationKiran K The document discusses the problem of determining the optimal way to fully parenthesize the product of a chain of matrices to minimize the number of scalar multiplications. It presents a dynamic programming approach to solve this problem in four steps: 1) characterize the structure of an optimal solution, 2) recursively define the cost of an optimal solution, 3) compute the costs using tables, 4) construct the optimal solution from the tables. An example is provided to illustrate computing the costs table and finding the optimal parenthesization of a chain of 6 matrices.
Sum of subsets problem by backtracking
Sum of subsets problem by backtracking Hasanain Alshadoodee The document presents a backtracking approach to solving the sum of subsets problem, where the goal is to find combinations of distinct positive numbers that sum to a specified value. It illustrates the method using examples with a state space tree to visualize the possible subsets and their sums. The document includes Python code to demonstrate the solution for the subset sum problem.
Design and Analysis of algorithms
Design and Analysis of algorithmsDr. Rupa Ch The document provides a comprehensive overview of the design and analysis of algorithms, focusing on their definitions, specifications, and evaluation metrics such as time and space complexity. It covers various algorithm design methods, including natural language descriptions, flowcharts, and pseudo-code, and illustrates key algorithms such as selection sort and recursive algorithms. Additionally, it discusses performance analysis including average-case analysis and asymptotic notations used to describe algorithm efficiency.
Exhaustive Search
Exhaustive SearchKasun Ranga Wijeweera Exhaustive search involves systematically enumerating all potential solutions to a problem and checking if each one is a valid solution. It can solve problems that efficient algorithms cannot by simply trying every possibility, though this becomes intractable for large problems. The traveling salesman problem is an example where checking the length of every possible tour route between cities requires exhaustive search for even moderate numbers of cities. While slow, exhaustive search guarantees finding the optimal solution if allowed to run to completion.
Top down parsing
Top down parsingLakshmiSamivel This document discusses top-down parsing and predictive parsing techniques. It explains that top-down parsers build parse trees from the root node down to the leaf nodes, while bottom-up parsers do the opposite. Recursive descent parsing and predictive parsing are introduced as two common top-down parsing approaches. Recursive descent parsing may involve backtracking, while predictive parsing avoids backtracking by using a parsing table to determine the production to apply. The key steps of a predictive parsing algorithm using a stack and parsing table are outlined.
Bfs and Dfs
Bfs and DfsMasud Parvaze The document discusses graph traversal algorithms breadth-first search (BFS) and depth-first search (DFS). It provides examples of how BFS and DFS work, including pseudocode for algorithms. It also discusses applications of BFS such as finding shortest paths and detecting bipartitions. Applications of DFS include finding connected components and topological sorting.
Apriori Algorithm
Apriori AlgorithmInternational School of Engineering The document discusses the Apriori algorithm, which is used for mining frequent itemsets from transactional databases. It begins with an overview and definition of the Apriori algorithm and its key concepts like frequent itemsets, the Apriori property, and join operations. It then outlines the steps of the Apriori algorithm, provides an example using a market basket database, and includes pseudocode. The document also discusses limitations of the algorithm and methods to improve its efficiency, as well as advantages and disadvantages.
Greedy Algorithm
Greedy AlgorithmWaqar Akram This document provides an introduction to greedy algorithms. It defines greedy algorithms as algorithms that make locally optimal choices at each step in the hope of finding a global optimum. The document then provides examples of problems that can be solved using greedy algorithms, including counting money, scheduling jobs, finding minimum spanning trees, and the traveling salesman problem. It also provides pseudocode for a general greedy algorithm and discusses some properties of greedy algorithms.
Stressen's matrix multiplication
Stressen's matrix multiplicationKumar Strassen's algorithm improves on the basic matrix multiplication algorithm which runs in O(N3) time. It achieves this by dividing the matrices into sub-matrices and performing 7 multiplications and 18 additions on the sub-matrices, rather than the 8 multiplications of the basic algorithm. This results in a runtime of O(N2.81) using divide and conquer, providing an asymptotic improvement over the basic O(N3) algorithm.
Algorithms Lecture 1: Introduction to Algorithms
Algorithms Lecture 1: Introduction to AlgorithmsMohamed Loey The document discusses the analysis and design of algorithms, focusing on time and space complexity while distinguishing between various algorithm types and their applications. It highlights the use of Python as a preferred programming language due to its ease of use, supportive community, and extensive libraries like NumPy and SciPy. The document also covers pseudocode as an informal method of describing algorithms and provides examples of sorting and searching algorithms.
Dijkstra's algorithm presentation
Dijkstra's algorithm presentationSubid Biswas Dijkstra's algorithm is a method for finding the shortest paths from a single source vertex to all other vertices in a weighted graph with nonnegative edge weights. It operates using a greedy approach, efficiently calculating paths through priority queues while having a time complexity of O(E log V) and space complexity of O(V). Applications include digital mapping services, social networking connections, IP routing, and robotic navigation.
Binary tree
Binary tree Rajendran Binary trees are a non-linear data structure where each node has zero, one, or two child nodes. They are commonly used to represent hierarchical relationships. A binary tree has a root node at the top with child nodes below it. Binary trees can be empty or consist of a root node and left and right subtrees, which are also binary trees. They allow for efficient search, insert, and delete operations and can be represented using arrays or linked lists.
Divide and Conquer - Part 1
Divide and Conquer - Part 1Amrinder Arora The document presents an overview of the Divide and Conquer (D&C) algorithm design paradigm, detailing its recursive approach to solving complex problems by breaking them into smaller subproblems. It covers essential algorithms like binary search, merge sort, and quicksort, and discusses recurrence relations used to analyze their time complexities. Various methods for solving these recurrence relations, such as substitution and the master theorem, are also introduced.
Graph data structure
Graph data structureTech_MX The document discusses various topics related to graphs:
- It defines directed and undirected graphs, paths, connected graphs, trees, degree, isomorphic graphs, cut sets, and labeled graphs.
- Key aspects include paths being sequences of vertices with edges connecting them, connected graphs having paths between all vertex pairs, trees being connected and acyclic graphs, and isomorphic graphs having the same structure.
- It also covers graph concepts such as degrees measuring incident edges, cut sets separating graphs, and labeling providing additional data to graphs' vertices or edges.
Matlab Script - Loop Control
Matlab Script - Loop ControlShameer Ahmed Koya This document covers loop control methods in MATLAB, specifically 'for' and 'while' loops. It explains their syntax, application, and how each loop type operates differently, emphasizing the importance of proper initialization and condition checks to avoid infinite loops. Additionally, it provides practical examples for both loop types to illustrate their usage in programming.
Viewers also liked (11)
Unit2 algorithmic problem_solving
Unit2 algorithmic problem_solvingCapuchino HuiNing This document outlines Unit 2 of a course on algorithmic problem solving. It covers the problem solving process, algorithms, control structures like sequence, selection, and repetition, and examples of writing pseudocode algorithms. It also explains Euclid's algorithm for finding the greatest common divisor of two integers through step-by-step examples and pseudocode.
Introduction to Genetic Algorithms
Introduction to Genetic AlgorithmsAhmed Othman This document provides an introduction to genetic algorithms, which are a class of computational models inspired by evolution. It describes how genetic algorithms use processes analogous to natural selection and genetics to arrive at optimal solutions to problems. The document outlines the key components of genetic algorithms, including representing potential solutions as binary strings, selecting parents based on fitness, recombining parents via crossover to create offspring, mutating offspring randomly, and replacing the population with the offspring. The goal is to evolve better and better solutions over many generations through these evolutionary processes of selection, recombination and mutation.
Algorithm and pseudo codes
Algorithm and pseudo codeshermiraguilar The document discusses algorithms, providing definitions and examples of algorithms including Euclid's algorithm for computing the greatest common divisor. It also outlines properties that algorithms must have including finiteness, absence of ambiguity, defined sequence and inputs/outputs. Pseudocode is introduced as a way to express algorithms at a high level for human reading using basic logic structures like sequence, selection, and iteration.
Iterative deepening search
Iterative deepening searchAshis Kumar Chanda Iterative deepening search (IDS) is an algorithm that combines the completeness of breadth-first search with the memory efficiency of depth-first search. IDS performs an exhaustive depth-first search, increasing the depth limit by one each iteration, until the goal is found. IDS is guaranteed to find a solution if one exists, uses less memory than breadth-first search by limiting the depth of search at each iteration, and is more efficient than depth-first search which can get stuck in infinite loops.
Algorithmsandflowcharts1
Algorithmsandflowcharts1luhkahreth Here is the flowchart for the above algorithm:
START
Input
NAME, OVERTIME,
ABSENT
NET ← OVERTIME – (2/3)*ABSENT
Y is N
NET > 40 NET > 40?
PAYMENT ← 50 PAYMENT ← 40
Y is N
NET > 30 NET > 30?
PAYMENT ← 40 PAYMENT ← 30
Y is N
NET > 20 NET > 20?
PAYMENT ← 30 PAYMENT ← 20
Y is N
NET > 10 NET > 10?
PAYMENT
Intro to-iterative-deepening
Intro to-iterative-deepeningAdel Totott Iterative Deepening Search (IDS) combines the optimality of breadth-first search with the low memory usage of depth-first search. IDS performs a depth-limited depth-first search at each level, starting from depth 0 and incrementally increasing the depth limit. This allows it to find optimal solutions while only requiring O(bd) memory like DFS. IDA* extends this idea to A* search by imposing a limit on the estimated total path cost f and iteratively relaxing that limit, reducing memory usage while maintaining completeness and optimality.
Algorithm Designs - Control Structures
Algorithm Designs - Control Structureshatredai There are three main types of control structures in algorithms: sequence, selection, and repetition. Sequence structures run steps in order, selection structures allow for choices with conditions like IF/ELSE, and repetition structures repeat steps until a condition is met, using loops like WHILE. Control structures are represented differently in pseudocode and flowcharts.
Algorithms and Flowcharts
Algorithms and FlowchartsDeva Singh The document outlines fundamental concepts of computer science focusing on algorithms and flowcharts, including their definitions, phases, and examples of algorithms using pseudo code. It explains how to develop algorithms step-by-step and illustrates the use of flowcharts to represent program logic visually. Additionally, it covers decision structures and relational operators in algorithm design, providing numerous examples to demonstrate the principles involved.
Mobile-First SEO - The Marketers Edition #3XEDigital
Mobile-First SEO - The Marketers Edition #3XEDigitalAleyda Solís The document discusses the importance of mobile-first SEO, highlighting that search is increasingly mobile-driven and Google will prioritize mobile web presence for rankings. It emphasizes the need for websites to have effective mobile optimization strategies, including responsive design and fast loading times, to enhance visibility and user experience. The text also details tools and techniques to analyze mobile performance, improve content, and implement structured data for better engagement and search results.
How to Become a Thought Leader in Your Niche
How to Become a Thought Leader in Your NicheLeslie Samuel To become a thought leader in your niche, first choose a specific niche where you can provide value. Strive to excel by continually learning, networking, and demonstrating your expertise through consistent content creation. For resources and guidance, visit www.becomeablogger.com.
Ad
Similar to Algorithm and Data Structures - Basic of IT Problem Solving (20)
ds 1 Introduction to Data Structures.ppt
ds 1 Introduction to Data Structures.pptAlliVinay1 This document provides an introduction and overview of data structures. It begins by defining key terms like data, information, and entities. It then discusses how data structures represent logical relationships between data elements and how they should be easy to process and represent relationships. The document classifies common data structures as linear, non-linear, homogeneous, non-homogeneous, dynamic, and static. It also provides examples of basic notations, algorithms, control structures, and applications of different data structure types like arrays, stacks, queues, linked lists, trees, and graphs. Finally, it discusses complexity analysis and the tradeoff between time and space.
Intro_2.ppt
Intro_2.pptMumitAhmed1 This document provides an introduction to the CSE 326: Data Structures course. It discusses the following key points in 3 sentences or less:
The course will cover common data structures and algorithms, how to choose the appropriate data structure for different needs, and how to justify design decisions through formal reasoning. It aims to help students become better developers by understanding fundamental data structures and when to apply them. The document provides examples of stacks and queues to illustrate abstract data types, data structures, and their implementations in different programming languages.
Intro.ppt
Intro.pptSharabiNaif This document provides an introduction to the CSE 326: Data Structures course. It discusses the following key points in 3 sentences or less:
The course will cover common data structures and algorithms, how to choose the appropriate data structure for different needs, and how to justify design decisions through formal reasoning. It aims to help students become better developers by understanding fundamental data structures and when to apply them. The document provides examples of stacks and queues to illustrate abstract data types, data structures, and their implementations in different programming languages.
Intro.ppt
Intro.pptAnonymous9etQKwW This document provides an overview of a Data Structures course. The course will cover basic data structures and algorithms used in software development. Students will learn about common data structures like lists, stacks, and queues; analyze the runtime of algorithms; and practice implementing data structures. The goal is for students to understand which data structures are appropriate for different problems and be able to justify design decisions. Key concepts covered include abstract data types, asymptotic analysis to evaluate algorithms, and the tradeoffs involved in choosing different data structure implementations.
1.1 introduction to Data Structures.ppt
1.1 introduction to Data Structures.pptAshok280385 Here are the algorithms for the given problems:
1. WAA to find largest of three numbers:
1. Start
2. Read three numbers a, b, c
3. If a > b and a > c then largest number is a
4. Else If b > a and b > c then largest number is b
5. Else largest number is c
6. Print largest number
7. Stop
2. WAA to find the sum of first 10 natural numbers using for loop:
1. Start
2. Declare variables i, sum
3. Initialize i=1, sum=0
4. For i=1 to 10
5. sum =
Unit I- Data structures Introduction, Evaluation of Algorithms, Arrays, Spars...
Unit I- Data structures Introduction, Evaluation of Algorithms, Arrays, Spars...DrkhanchanaR The document provides a comprehensive syllabus on data structures and algorithms, covering topics such as arrays, linked lists, trees, graphs, sorting methods, and performance evaluation techniques. It emphasizes the significance of data structures in organizing and managing data effectively, as well as algorithm analysis in terms of time and space complexity. Additionally, it includes practical examples, assignments, and feedback mechanisms for enhanced learning and understanding.
Advanced Data Analytics with R Programming.ppt
Advanced Data Analytics with R Programming.pptAnshika865276 R is a software environment for statistical analysis and graphics. It allows users to import, clean, analyze, and visualize data. Key features include importing data from various sources, conducting descriptive statistics and statistical modeling, and creating publication-quality graphs. R has a steep learning curve but is highly extensible and supports a wide range of statistical techniques through its base functionality and contributed packages.
Data structures and algorithms Module-1.pdf
Data structures and algorithms Module-1.pdfDukeCalvin This document provides an introduction to the course "Introduction to Data Structures and Algorithms". The course objectives are for students to learn basic static and dynamic data structures, analyze algorithms in terms of time and memory complexity, and understand the advantages and disadvantages of different algorithms and data structures. The document then discusses what algorithms are, their key characteristics, and why understanding algorithms and data structures is important for solving computational problems efficiently. It also defines what data structures are and why they are needed to organize large amounts of data.
Algorithms and Data Structures
Algorithms and Data Structuressonykhan3 This document provides an introduction to the CSC112 Algorithms and Data Structures lecture. It discusses the need for data structures to organize data efficiently and enable more complex applications. Different types of data structures are presented, including linear structures like arrays, lists, queues and stacks, as well as non-linear structures like trees and graphs. Key data structure operations like traversing, searching, inserting and deleting records are also outlined. The document emphasizes that the choice of data structure and algorithm can significantly impact a program's efficiency and performance.
lecture1-2202211144eeeee24444444413.pptx
lecture1-2202211144eeeee24444444413.pptxsmartashammari The document serves as an introduction to algorithms and data structures, outlining their significance in organizing data for more efficient computing. It discusses the selection of data structures based on resource constraints and the importance of analyzing algorithms for performance. Additionally, it provides a historical context for the term 'algorithm' and emphasizes the need for algorithm efficiency in programming.
lecture1-220221114413Algorithims and data structures.pptx
lecture1-220221114413Algorithims and data structures.pptxsmartashammari Algorithims and data structures
Lecture 1 (bce-7)
Lecture 1 (bce-7)farazahmad005 This document provides an overview of a course on algorithms and data structures. It outlines the course topics that will be covered over 15 weeks of lectures. These include data types, arrays, matrices, pointers, linked lists, stacks, queues, trees, graphs, sorting, and searching algorithms. Evaluation will be based on assignments, quizzes, projects, sessionals, and a final exam. The goal is for students to understand different algorithm techniques, apply suitable data structures to problems, and gain experience with classical algorithm problems.
Data structure Unit-I Part A
Data structure Unit-I Part ASSN College of Engineering, Kalavakkam This document provides an overview of data structures and algorithms. It discusses pseudo code, abstract data types, atomic and composite data, data structures, algorithm efficiency using Big O notation, and various searching algorithms like sequential, binary, and hashed list searches. Key concepts covered include pseudo code structure and syntax, defining algorithms with headers and conditions, and analyzing different search algorithms.
Introduction to datastructures presentation
Introduction to datastructures presentationkrishkiran2408 The document provides an overview of data structures, defining them as methods for organizing and managing large amounts of data efficiently. It discusses various types of data structures, including primitive and non-primitive (linear and non-linear), highlights their characteristics, and illustrates their applications and importance in programming. Additionally, it covers abstract data types, their operations, and introduces classes in C++ for object-oriented programming.
AN introduction to Software Engineering and Data.pptx
AN introduction to Software Engineering and Data.pptxPatrick460353 The document discusses advanced unified modeling language concepts in software development, focusing on modeling languages, processes, and design methodologies such as the '4+1' view. It covers sequence and communication diagrams for modeling dynamic aspects and interactions of systems, as well as the boundary-control-entity (B-C-E) design framework to connect user interfaces with data and logic. Additionally, it addresses component and deployment diagrams to illustrate system architecture and hardware/software configurations.
Data structure and algorithm using java
Data structure and algorithm using javaNarayan Sau The document outlines the syllabus for a course on data structures and algorithms using Java, covering topics such as algorithm design, types of data structures (stacks, queues, linked lists, trees, graphs), sorting and searching algorithms, and algorithm analysis. It discusses the role and characteristics of algorithms and data structures, including the importance of efficiency in terms of time and space complexity. Additionally, it provides insights into abstract data types and specific implementations for queues and stacks, along with their applications.
Algorithmic techniques-for-big-data-analysis
Algorithmic techniques-for-big-data-analysisAtner Yegorov This document provides an overview of an algorithmic techniques for big data analysis course. It discusses various data and computational models for analyzing large datasets, including streaming, external memory, distributed (MapReduce), and crowdsourcing models. Specific techniques covered include algorithms for counting distinct elements in different models, metric embedding for efficient pattern matching, and property testing for approximating properties of large datasets in sub-linear time. The document outlines the course topics, assignments, timeline and provides a high-level syllabus.
Algorithmic techniques-for-big-data-analysis
Algorithmic techniques-for-big-data-analysisHiye Biniam This document provides an overview of an algorithmic techniques for big data analysis course. It discusses the challenges of big data including volume, velocity, variety, and veracity. The course will develop algorithms to deal with big data, with an emphasis on different data processing models and common techniques. Students will complete projects, participate in discussions, and are encouraged to apply what they learn. Grading will be based on scribing lecture notes, participation, and a survey and project. The tentative syllabus and course plan cover topics like streaming algorithms, dimensionality reduction, and crowdsourcing.
Introduction to DS.pptx
Introduction to DS.pptxOnkarModhave This document provides an introduction to the concept of data structures. It discusses the need for data structures due to increasing data and processing requirements. It defines key terms like abstract data type, algorithm complexity, and different types of data structures. It explains linear data structures like arrays, linked lists, stacks and queues. Non-linear structures like trees and graphs are also introduced. Common operations on data structures like traversing, insertion, deletion, searching and sorting are outlined. The document aims to provide foundational knowledge on data structures and algorithms.
Ad
Recently uploaded (20)
Securing Account Lifecycles in the Age of Deepfakes.pptx
Securing Account Lifecycles in the Age of Deepfakes.pptxFIDO Alliance Securing Account Lifecycles in the Age of Deepfakes
"Database isolation: how we deal with hundreds of direct connections to the d...
"Database isolation: how we deal with hundreds of direct connections to the d...Fwdays What can go wrong if you allow each service to access the database directly? In a startup, this seems like a quick and easy solution, but as the system scales, problems appear that no one could have guessed.
In my talk, I'll share Solidgate's experience in transforming its architecture: from the chaos of direct connections to a service-based data access model. I will talk about the transition stages, bottlenecks, and how isolation affected infrastructure support. I will honestly show what worked and what didn't. In short, we will analyze the controversy of this talk.
OpenACC and Open Hackathons Monthly Highlights June 2025
OpenACC and Open Hackathons Monthly Highlights June 2025OpenACC The OpenACC organization focuses on enhancing parallel computing skills and advancing interoperability in scientific applications through hackathons and training. The upcoming 2025 Open Accelerated Computing Summit (OACS) aims to explore the convergence of AI and HPC in scientific computing and foster knowledge sharing. This year's OACS welcomes talk submissions from a variety of topics, from Using Standard Language Parallelism to Computer Vision Applications. The document also highlights several open hackathons, a call to apply for NVIDIA Academic Grant Program and resources for optimizing scientific applications using OpenACC directives.
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...Edge AI and Vision Alliance For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2025/06/mpu-a-transformative-solution-for-next-gen-ai-at-the-edge-a-presentation-from-fotonation/
Petronel Bigioi, CEO of FotoNation, presents the “MPU+: A Transformative Solution for Next-Gen AI at the Edge” tutorial at the May 2025 Embedded Vision Summit.
In this talk, Bigioi introduces MPU+, a novel programmable, customizable low-power platform for real-time, localized intelligence at the edge. The platform includes an AI-augmented image signal processor that enables leading image and video quality.
In addition, it integrates ultra-low-power object and motion detection capabilities to enable always-on computer vision. A programmable neural processor provides flexibility to efficiently implement new neural networks. And additional specialized engines facilitate image stabilization and audio enhancements.
The Future of Product Management in AI ERA.pdf
The Future of Product Management in AI ERA.pdfAlyona Owens Hi, I’m Aly Owens, I have a special pleasure to stand here as over a decade ago I graduated from CityU as an international student with an MBA program. I enjoyed the diversity of the school, ability to work and study, the network that came with being here, and of course the price tag for students here has always been more affordable than most around.
Since then I have worked for major corporations like T-Mobile and Microsoft and many more, and I have founded a startup. I've also been teaching product management to ensure my students save time and money to get to the same level as me faster avoiding popular mistakes. Today as I’ve transitioned to teaching and focusing on the startup, I hear everybody being concerned about Ai stealing their jobs… We’ll talk about it shortly.
But before that, I want to take you back to 1997. One of my favorite movies is “Fifth Element”. It wowed me with futuristic predictions when I was a kid and I’m impressed by the number of these predictions that have already come true. Self-driving cars, video calls and smart TV, personalized ads and identity scanning. Sci-fi movies and books gave us many ideas and some are being implemented as we speak. But we often get ahead of ourselves:
Flying cars,Colonized planets, Human-like AI: not yet, Time travel, Mind-machine neural interfaces for everyone: Only in experimental stages (e.g. Neuralink).
Cyberpunk dystopias: Some vibes (neon signs + inequality + surveillance), but not total dystopia (thankfully).
On the bright side, we predict that the working hours should drop as Ai becomes our helper and there shouldn’t be a need to work 8 hours/day. Nobody knows for sure but we can require that from legislation. Instead of waiting to see what the government and billionaires come up with, I say we should design our own future.
So, we as humans, when we don’t know something - fear takes over. The same thing happened during the industrial revolution. In the Industrial Era, machines didn’t steal jobs—they transformed them but people were scared about their jobs. The AI era is making similar changes except it feels like robots will take the center stage instead of a human. First off, even when it comes to the hottest space in the military - drones, Ai does a fraction of work. AI algorithms enable real-time decision-making, obstacle avoidance, and mission optimization making drones far more autonomous and capable than traditional remote-controlled aircraft. Key technologies include computer vision for object detection, GPS-enhanced navigation, and neural networks for learning and adaptation. But guess what? There are only 2 companies right now that utilize Ai in drones to make autonomous decisions - Skydio and DJI.
Raman Bhaumik - Passionate Tech Enthusiast
Raman Bhaumik - Passionate Tech EnthusiastRaman Bhaumik A Junior Software Developer with a flair for innovation, Raman Bhaumik excels in delivering scalable web solutions. With three years of experience and a solid foundation in Java, Python, JavaScript, and SQL, she has streamlined task tracking by 20% and improved application stability.
Coordinated Disclosure for ML - What's Different and What's the Same.pdf
Coordinated Disclosure for ML - What's Different and What's the Same.pdfPriyanka Aash Coordinated Disclosure for ML - What's Different and What's the Same
Mastering AI Workflows with FME by Mark Döring
Mastering AI Workflows with FME by Mark DöringSafe Software Harness the full potential of AI with FME: From creating high-quality training data to optimizing models and utilizing results, FME supports every step of your AI workflow. Seamlessly integrate a wide range of models, including those for data enhancement, forecasting, image and object recognition, and large language models. Customize AI models to meet your exact needs with FME’s powerful tools for training, optimization, and seamless integration
The Future of Technology: 2025-2125 by Saikat Basu.pdf
The Future of Technology: 2025-2125 by Saikat Basu.pdfSaikat Basu A peek into the next 100 years of technology. From Generative AI to Global AI networks to Martian Colonisation to Interstellar exploration to Industrial Nanotechnology to Artificial Consciousness, this is a journey you don't want to miss. Which ones excite you the most? Which ones are you apprehensive about? Feel free to comment! Let the conversation begin!
Tech-ASan: Two-stage check for Address Sanitizer - Yixuan Cao.pdf
Tech-ASan: Two-stage check for Address Sanitizer - Yixuan Cao.pdfcaoyixuan2019 A presentation at Internetware 2025.
Cracking the Code - Unveiling Synergies Between Open Source Security and AI.pdf
Cracking the Code - Unveiling Synergies Between Open Source Security and AI.pdfPriyanka Aash Cracking the Code - Unveiling Synergies Between Open Source Security and AI
Quantum AI Discoveries: Fractal Patterns Consciousness and Cyclical Universes
Quantum AI Discoveries: Fractal Patterns Consciousness and Cyclical UniversesSaikat Basu Embark on a cosmic journey exploring the intersection of quantum
computing, consciousness, and ancient wisdom. Together we'll uncover the
recursive patterns that bind our reality.
10 Key Challenges for AI within the EU Data Protection Framework.pdf
10 Key Challenges for AI within the EU Data Protection Framework.pdfPriyanka Aash 10 Key Challenges for AI within the EU Data Protection Framework
" How to survive with 1 billion vectors and not sell a kidney: our low-cost c...
" How to survive with 1 billion vectors and not sell a kidney: our low-cost c...Fwdays Let's talk about our history. How we started the project with a small vector database of less than 2 million records. Later, we received a request for +100 million records, then another +100... And so gradually we reached almost 1 billion. Standard tools were quickly running out of steam - we were running into performance, index size, and very limited resources. After a long series of trials and errors, we built our own low-cost cluster, which today stably processes thousands of queries to more than 1B vectors.
OpenPOWER Foundation & Open-Source Core Innovations
OpenPOWER Foundation & Open-Source Core InnovationsIBM penPOWER offers a fully open, royalty-free CPU architecture for custom chip design.
It enables both lightweight FPGA cores (like Microwatt) and high-performance processors (like POWER10).
Developers have full access to source code, specs, and tools for end-to-end chip creation.
It supports AI, HPC, cloud, and embedded workloads with proven performance.
Backed by a global community, it fosters innovation, education, and collaboration.
Using the SQLExecutor for Data Quality Management: aka One man's love for the...
Using the SQLExecutor for Data Quality Management: aka One man's love for the...Safe Software The SQLExecutor is one of FME’s most powerful and flexible transformers. Pivvot maintains a robust internal metadata hierarchy used to support ingestion and curation of thousands of external data sources that must be managed for quality before entering our platform. By using the SQLExecutor, Pivvot can efficiently detect problems and perform analysis before data is extracted from our staging environment, removing the need for rollbacks or cycles waisted on a failed job. This presentation will walk through three distinct examples of how Pivvot uses the SQLExecutor to engage its metadata hierarchy and integrate with its Data Quality Management workflows efficiently and within the source postgres database. Spatial Validation –Validating spatial prerequisites before entering a production environment. Reference Data Validation - Dynamically validate domain-ed columns across any table and multiple columns per table. Practical De-duplication - Removing identical or near-identical well point locations from two distinct source datasets in the same table.
Wenn alles versagt - IBM Tape schützt, was zählt! Und besonders mit dem neust...
Wenn alles versagt - IBM Tape schützt, was zählt! Und besonders mit dem neust...Josef Weingand IBM LTO10
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...Edge AI and Vision Alliance
Algorithm and Data Structures - Basic of IT Problem Solving
- 1. Algorithm and Data Structures as the basic of IT Problem Solving Christian A – Mei 2014 Training Material
- 2. • Information Technology Overview – Theoretical – Engineering – Management • Programming Principles • Algorithm • Data Structures • Programming Concepts Topics
- 3. • Discrete Mathematics – Number Theory – Set Theory, Relation, Function – Combinatorics, Probability – Graph – Logic, Proof Theory • Formal Foundation: – Automata – Turing Machine (model of computation: 1970 – now) • Computer Architecture – Von Neumann Architecture: stored program architecture • Computer Science (birth of : 1937-1970) – Theory of Computation – Branches: • Automata Theory • Computability Theory • Computational Complexity Theory Information Technology - Theoretical
- 4. • Programming • Software Engineering: – Requirement, Analysis, Design, Implementation • Database • Computer Networks • Computer Security Information Technology - Engineering
- 5. • Project Management • Enterprise IT Architecture • IT Governance • IT Strategic Planning • R Information Technology - Management
- 6. “Algorithm + Data Structures = Program” – Nicklaus Wirth (Father of Computer Science), Creator of Pascal Language “Program Cost: Time vs Space” CPU Time vs Memory “Program: Input – Process - Output” Programming Principles
- 7. • Dynamic aspect of a program • Sequence of steps to solve a problem – Have a problem definition – Have specific input – Operate on specific data structure (problem model) – Produces output • Popular algorithm maybe named for easy communication • Example: • Problem: sorting – Input: array – Data structure: array – Output: array – Algorithm: Bubble Sort, Quick Sort, Merge Sort, etc Algorithm and Data Structure • Static aspect of a program • Representation of a problem (model) • The structure / shape of the data (to be processed) • Is subject to be processed by an algorithm • Common data structures is named • Example: • Array • List • Map • Stack • Queue • Matrix • Graph • etc ALGORITHM DATA STRUCTURE
- 8. Algorithm and Data Structure - Example • Problem: Find shortest path between a source vertex and destination vertex • Input: – Source vertex – Destination vertex – Weighted graph • Output: – Shortest Path • Algorithm: Dijkstra Algorithm
- 9. • Pseudocode: a pseudo programming language to describe algorithm that will be understandable by a human reader, facilitates communication • Programming: activity that translates the algorithm in the mind of the programmer into specific Computer Language • Program Source Code: for Computer or Human ? • Human: – Readibility – Understandibility – Clarity – Structure – Focus on the semantic (meaning) • Computer: – Executes binary instructions (bits) – Source code is translated into binary instructions (machine language) – Translation: Focus on the syntactic (what is written) Pseudocode
- 10. • Variable • Data Type • Operators • Control Structures • Subprogram • Abstract Data Type Programming Concepts - Basic
- 11. • A location in memory to store a value while a program is in execution • Variable has: – Name (label) – Type (allowed values) – Value • Operation: – Declaration – Initialization – Assignment (Write) – Read Variable
- 12. • Classify/restrict possible values that can be given to a data (domain values) • Have a specific operations • Have a name • Primitive/Basic Data Types: – Numeric: • Integer: byte, short, int, long • Real/Float: float, double – Boolean – Character • Composite Data Type – Derived from multiple primitive data types – Combines into data structures – Example: • String • Collection: Array of T, List of T, Map of <T1,T2>, Set of T • Struct / Record { T1 f1, T2 f2, …} • Class Data Type
- 13. • Specific operations on a data type • Arithmetic : Numeric, Numeric -> Numeric • Ex: addition, subtraction, multiplication, division, modulo • Relational: Numeric, Numeric -> Boolean • Ex: less than, less than or equal, greater than, greater than or equal, equal, not equal • Logic : Boolean, Boolean -> Boolean • Ex: not, and, or • String operations: • Ex: concat, substring, index of, length, … Operators
- 14. • Literal – Written text that represents a value that have a type – Integer literal: 1, 1000, -1 – Float literal: 1.001, -0.2, -2E-03 – Boolean literal: true, false – String literal: “hello”, “Jakarta”, “” • Expression – Combination of values that evaluates to a value – 2+3 – sin(pi) – x – x+3 • Statement – A single program action • Block – Combination of several statement considered as a single statement (block statement) • Recursion – A subprogram activity that calls itself Programming Concepts
- 15. • Mechanism to controls the flow of the program • Sequence • Conditional • Loop Control Structures
- 16. • Basic sequential actions flow statement 1; statement 2; statement 3; … Control Structures - Sequence
- 17. • Conditional / choice / selection of actions based on a boolean condition IF If condition then statement; IF-ELSE if condition then statement 1; else statement 2; Control Structures - Conditional
- 18. • if-else-if-else …. visually forms a decision tree • Make sure all possibilities have been covered ! Control Structures – Decision Tree
- 19. • Conditional loop – while-do – do-while / repeat-until • Iteration – Using a counter variable – Over a collection (foreach) • Loop control statement: – Break statement – Continue statement Control Structures – Loop
- 20. • while-do – Checks condition at top – Loop Statement may /may not execute • do-while – Checks condition at bottom – Loop Statement executed at least once Control Structures – Conditional Loop
- 21. • for: index style – Using integer index for loop condition – While-do in compact form • for-collection iteration – Iterates over each element in collection – No need for index Control Structures – Iteration
- 22. • Break – Used to exit loop immediately – Application: searching • Continue – Used to skip next process and proceed to next iteration – Application: filtering Control Structures – Loop - Break/Continue
- 23. • A program may divided into subprograms, or use existing subprograms • Each subprogram perform specific tasks • A program /sub program may call another sub program – A call to a subprogram may pass data to that subprogram (parameter, argument) – A call to a subprogram may return an output • Main Program: program that initiates the main flow of control • Subprogram types: – Procedure: performs tasks, do not return an output – Function: perform tasks and returns an output • Parameter/argument types: – Formal parameter: parameter that’s declared for the subprogram – Actual parameter: actual value that’s passed to the subprogram • Signature: – Combination of input parameter types and output/return types • double sin(double x) : double -> double • int add(int x, int y) : int, int -> int • void hello () : () -> void Subprogram
- 24. Data Structures Engineering Structures Data Structures Structure: • Something arranged in a definite pattern of organization • Organization of parts as dominated by the general character of the whole
- 25. • Compound Data type that contains multiple data each with the same type • Array of T: – Fixed size/length at allocation – Static: May not grow – Access: by index (direct access) • List of T: – Zero size at allocation – Dynamic: may grow (add, remove) – Access: by index (involves loop) • Map of <T1,T2>: – Map from an KEY type to VALUE type – Example: to associate a Student with his Student Number – Dynamic/may grow: put, remove – Access: by key (direct access) • Set of T: – Dynamic collection of elements from type T – Order is not guaranteed – Each element must be unique in the set Data Structures - Collection
- 26. • Data structures that represents an abstract concept – Provide abstraction to a concept – Provide encapsulation (hide internal implementation details) – Provide specific operations • Example: – Stack: a concept that can be “created” from a array or list (the internal implementation) – Stack operations: • void push (Stack s, T elem) • T pop (Stack s) • boolean isEmpty(Stack s) • T getTop(Stack s) Data Structures – Abstract Data Type
- 27. Tanya Jawab Christian A Email: coolpie at gmail.com Q & A