● Introduction to Control Structures
Branching structures
● If statement, If-else statement, Nested if-else, else-if Ladder
● Switch statement
Looping Structures
● For loop, While loop, Do while loop
● break and continue
Introduction to control structure in C Programming Language include decision making (if statement, if..else statement, if...else if...else statement, nested if...else statement, switch...case statement), Loop(for loop, while loop, do while loop, nested loop) and using keyword(break, continue and goto)
The document discusses C programming functions. It provides examples of defining, calling, and using functions to calculate factorials, Fibonacci sequences, HCF and LCM recursively and iteratively. Functions allow breaking programs into smaller, reusable blocks of code. They take in parameters, can return values, and have local scope. Function prototypes declare their interface so they can be called from other code locations.
The document discusses different types of control statements in C programming including sequential, selective, and iterative statements. It provides examples and explanations of common control statements like if, if-else, if-else ladder, switch case, for, while, do-while, and goto statements. Control statements are used to control the flow and logic of a program by allowing conditional execution, repetition, and branching in code. They help structure programs, improve clarity, and facilitate debugging.
It tells about functions in C++,Types,Use,prototype,declaration,Arguments etc
function with
A function with no parameter and no return value
A function with parameter and no return value
A function with parameter and return value
A function without parameter and return value
Call by value and address
The document discusses loops and their logic in programming. It describes the different types of loops - for, while, and do-while loops. It provides examples of how each loop works, including their basic structure and flow. It also discusses nested loops, the break and continue statements, and provides examples of programs to write using loops.
This document discusses different types of decision making and branching statements in C programming, including if, switch, conditional operator, and goto statements. It focuses on explaining the if statement in more detail. The if statement allows for conditional execution of code blocks depending on the evaluation of a test expression. There are several types of if statements including simple if, if-else, nested if-else, and else-if ladder statements. Flowcharts and examples are provided to illustrate the syntax and logic flow for each type of if statement.
1) C structures allow the grouping of related data items and treat the structure as a single scalar unit that can be passed to functions or assigned to variables.
2) Structures can contain other structures as members through pointers, allowing recursive definitions. However, one structure must be declared in incomplete form before the other refers to it.
3) Unions allow different types of data to occupy the same memory location, with the type indicated through an accompanying enum variable. The size of a union is that of its largest member.
The document discusses different types of decision making or control statements in programming including if, if-else, nested if-else, else-if ladder, and switch statements. It provides syntax and examples for each type of statement. The if statement executes code if a condition is true, if-else adds an else block for when the condition is false, nested if-else allows multiple levels of conditions, else-if ladder provides multiple else if conditions in a chain, and switch allows executing different code for different cases.
The document provides source code for generating and manipulating computer graphics using various algorithms. It includes algorithms for drawing lines, circles and curves, as well as algorithms for translating, rotating, and scaling two-dimensional and three-dimensional objects. The source code is written in C/C++ and uses graphics libraries to output the results. Various input parameters are taken from the user and output is displayed to demonstrate the algorithms.
The document discusses three types of jumping statements in C language: break, continue, and goto.
1) The break statement terminates the nearest enclosing loop or switch statement and transfers execution to the statement following the terminated statement.
2) The continue statement skips the rest of the current loop iteration and transfers control to the loop check.
3) The goto statement unconditionally transfers control to the labeled statement. It is useful for branching within nested loops when a break statement cannot exit properly.
The document discusses various control structures used in programming, including sequence, repetition (loops), and selection (branching). It covers common loop and conditional statements like while, for, if/else, switch/case. Control structures allow programs to execute instructions in different orders depending on conditions or to repeat steps multiple times. Keywords like break and continue change the normal flow of loops.
The document discusses various control flow statements in C programming such as decision control statements (if, if-else, switch-case), looping statements (for, while, do-while loops), break, continue, goto, and functions. It provides examples of using each statement type and explains their syntax and usage. Key aspects like scope of variables, parameter passing methods (call by value, call by reference), and storage classes (auto, static, extern) related to functions are also covered in the document.
Functions in C can be defined by the user or come from standard libraries. User-defined functions must be declared with a name, return type, and parameters. Functions are called by passing actual arguments which are assigned to formal parameters. Arguments can be passed by value, where copies are used, or by reference, where the function accesses the original variables. Recursion is when a function calls itself, reducing the problem size each time until a base case is reached.
This document discusses syntax-directed translation and type checking in programming languages. It explains that in syntax-directed translation, attributes are attached to grammar symbols and semantic rules compute attribute values. There are two ways to represent semantic rules: syntax-directed definitions and translation schemes. The document also discusses synthesized and inherited attributes, dependency graphs, and the purpose and components of type checking, including type synthesis, inference, conversions, and static versus dynamic checking.
This document discusses nested loops, which are loop statements inside other looping statements. It provides examples of nested for loops, while loops, and do-while loops. The nested for loop runs the inner loop as many times as the limit of the outer loop condition. The nested while loop executes the inner code block as long as the inner condition is true, and the outer block as long as the outer condition is true. The nested do-while similarly runs the inner block first and checks the inner condition, and the outer block first and checks the outer condition. Examples are given to print a diamond pattern using nested loops.
Python programming language provides the following types of loops to handle looping requirements:
1. While
2. Do While
3. For loop
Python provides three ways for executing the loops. While all the ways provide similar basic functionality, they differ in their syntax and condition-checking time.
The document describes three methods for minimizing a deterministic finite automaton (DFA): the partitioning method, the equivalence theorem, and Myhill-Nerode theorem. The partitioning method iteratively partitions the states into equivalences classes until no further partitions can be made. The equivalence theorem removes unreachable and equivalent states by comparing the transitions of each state pair. The Myhill-Nerode theorem marks state pairs where one is final and one is not, then iteratively marks additional pairs based on their transitions until no more can be marked, with unmarked pairs becoming equivalent states.
Input refers to accepting data while output refers to presenting data. Normally the data is accepted from keyboard and is outputted onto the screen.
C language has a series of standard input-output (I/O) functions. Such I/O functions together form a library named stdio.h. Irrespective of the version of C language, user will have access to all such library functions. These library functions are classified into three broad categories.
a) Console I/O functions : Functions which accept input from keyboard and produce output on the screen.
b) Disk I/O functions : Functions which perform I/O operations on secondary storage devices like floppy disks or hard disks.
c) Port I/O functions : Functions which perform I/O operations on various ports like printer port, mouse port, etc.
Console I/
This document discusses string handling functions in C programming. It defines a string as an array of characters and introduces the string.h header file, which contains functions for manipulating strings like strlen(), strcmp(), strcmpi(), strcpy(), and strcat(). It explains what each function does, including getting the length of a string, comparing strings, copying one string to another, and concatenating two strings.
The document discusses different types of selection statements in C programming including if statements, else if statements, nested if statements, switch statements, and nested switch statements. It provides the syntax and examples of how to use each type of statement to control program flow based on logical expressions that evaluate to true or false. The if statement and switch statement allow executing different blocks of code conditionally based on the result of logical expressions or comparisons.
The document discusses nested loops in programming. It defines a loop as a sequence of instructions repeated until a condition is reached. A nested loop is a loop inside another loop. It provides examples of nested while, do-while, and for loops to print series of numbers. The nested loops examples ensure the inner loop completes before moving to the next iteration of the outer loop.
This document discusses control flow statements in C programming language. It describes if, switch, while, do-while, for statements that allow conditional execution and looping. Specific examples are provided to illustrate if/else, while, for loops. Additional features of for loops like initializing multiple variables, omitting sections, and nesting loops are covered. The break and continue statements are also explained for jumping out or skipping parts of a loop.
1. A string is a one-dimensional array of characters terminated by a null character. Strings can be initialized during compilation or at runtime.
2. Common string functions like scanf(), gets(), getchar() are used to input strings while printf(), puts(), putchar() are used to output strings.
3. Library functions like strcpy(), strcat(), strcmp(), strlen() allow manipulation of strings like copying, concatenation, comparison and finding length.
The document discusses Strings in Java. Some key points:
- A String represents a sequence of characters. The String class is used to create string objects which can exist in the string pool or heap.
- Char arrays are preferable over Strings for passwords due to security reasons. Strings can be manipulated more easily.
- The String class has many useful methods like length(), charAt(), indexOf(), replace(), toLowerCase(), substring() etc to work with and manipulate string values.
- StringBuffer is used to create mutable string objects that can be modified after creation using methods like append(), insert(), delete() etc. It is preferable over String for performance reasons while manipulating strings.
This document discusses repetition (looping) control structures in C++, including while, for, do-while loops, and the break and continue statements. The while loop repeats as long as an expression is true. The for loop simplifies counter-controlled loops by initializing/updating a variable. The do-while loop always executes at least once even if the expression is false. break exits the current loop, while continue skips to the next iteration. Nested loops can be used to create complex output patterns.
C Programming - Decision making, LoopingMURALIDHAR R
Execution of a statement or set of statement repeatedly is called as looping.
The loop may be executed a specified number of times and this depends on the satisfaction of a test condition.
A program loop is made up of two parts one part is known as body of the loop and the other is known as control condition.
Depending on the control condition statement the statements within the loop may be executed repeatedly.
Depending on the position of the control statement in the loop, a control structure may be classified either as an entry controlled loop or as an exit controlled loop.
Entry Controlled Loop:
When the control statement is placed before the body of the loop then such loops are called as entry controlled loops.
If the test condition in the control statement is true then only the body of the loop is executed.
If the test condition in the control statement is not true then the body of the loop will not be executed. If the test condition fails in the first checking itself the body of the loop will never be executed.
The document discusses different types of decision making or control statements in programming including if, if-else, nested if-else, else-if ladder, and switch statements. It provides syntax and examples for each type of statement. The if statement executes code if a condition is true, if-else adds an else block for when the condition is false, nested if-else allows multiple levels of conditions, else-if ladder provides multiple else if conditions in a chain, and switch allows executing different code for different cases.
The document provides source code for generating and manipulating computer graphics using various algorithms. It includes algorithms for drawing lines, circles and curves, as well as algorithms for translating, rotating, and scaling two-dimensional and three-dimensional objects. The source code is written in C/C++ and uses graphics libraries to output the results. Various input parameters are taken from the user and output is displayed to demonstrate the algorithms.
The document discusses three types of jumping statements in C language: break, continue, and goto.
1) The break statement terminates the nearest enclosing loop or switch statement and transfers execution to the statement following the terminated statement.
2) The continue statement skips the rest of the current loop iteration and transfers control to the loop check.
3) The goto statement unconditionally transfers control to the labeled statement. It is useful for branching within nested loops when a break statement cannot exit properly.
The document discusses various control structures used in programming, including sequence, repetition (loops), and selection (branching). It covers common loop and conditional statements like while, for, if/else, switch/case. Control structures allow programs to execute instructions in different orders depending on conditions or to repeat steps multiple times. Keywords like break and continue change the normal flow of loops.
The document discusses various control flow statements in C programming such as decision control statements (if, if-else, switch-case), looping statements (for, while, do-while loops), break, continue, goto, and functions. It provides examples of using each statement type and explains their syntax and usage. Key aspects like scope of variables, parameter passing methods (call by value, call by reference), and storage classes (auto, static, extern) related to functions are also covered in the document.
Functions in C can be defined by the user or come from standard libraries. User-defined functions must be declared with a name, return type, and parameters. Functions are called by passing actual arguments which are assigned to formal parameters. Arguments can be passed by value, where copies are used, or by reference, where the function accesses the original variables. Recursion is when a function calls itself, reducing the problem size each time until a base case is reached.
This document discusses syntax-directed translation and type checking in programming languages. It explains that in syntax-directed translation, attributes are attached to grammar symbols and semantic rules compute attribute values. There are two ways to represent semantic rules: syntax-directed definitions and translation schemes. The document also discusses synthesized and inherited attributes, dependency graphs, and the purpose and components of type checking, including type synthesis, inference, conversions, and static versus dynamic checking.
This document discusses nested loops, which are loop statements inside other looping statements. It provides examples of nested for loops, while loops, and do-while loops. The nested for loop runs the inner loop as many times as the limit of the outer loop condition. The nested while loop executes the inner code block as long as the inner condition is true, and the outer block as long as the outer condition is true. The nested do-while similarly runs the inner block first and checks the inner condition, and the outer block first and checks the outer condition. Examples are given to print a diamond pattern using nested loops.
Python programming language provides the following types of loops to handle looping requirements:
1. While
2. Do While
3. For loop
Python provides three ways for executing the loops. While all the ways provide similar basic functionality, they differ in their syntax and condition-checking time.
The document describes three methods for minimizing a deterministic finite automaton (DFA): the partitioning method, the equivalence theorem, and Myhill-Nerode theorem. The partitioning method iteratively partitions the states into equivalences classes until no further partitions can be made. The equivalence theorem removes unreachable and equivalent states by comparing the transitions of each state pair. The Myhill-Nerode theorem marks state pairs where one is final and one is not, then iteratively marks additional pairs based on their transitions until no more can be marked, with unmarked pairs becoming equivalent states.
Input refers to accepting data while output refers to presenting data. Normally the data is accepted from keyboard and is outputted onto the screen.
C language has a series of standard input-output (I/O) functions. Such I/O functions together form a library named stdio.h. Irrespective of the version of C language, user will have access to all such library functions. These library functions are classified into three broad categories.
a) Console I/O functions : Functions which accept input from keyboard and produce output on the screen.
b) Disk I/O functions : Functions which perform I/O operations on secondary storage devices like floppy disks or hard disks.
c) Port I/O functions : Functions which perform I/O operations on various ports like printer port, mouse port, etc.
Console I/
This document discusses string handling functions in C programming. It defines a string as an array of characters and introduces the string.h header file, which contains functions for manipulating strings like strlen(), strcmp(), strcmpi(), strcpy(), and strcat(). It explains what each function does, including getting the length of a string, comparing strings, copying one string to another, and concatenating two strings.
The document discusses different types of selection statements in C programming including if statements, else if statements, nested if statements, switch statements, and nested switch statements. It provides the syntax and examples of how to use each type of statement to control program flow based on logical expressions that evaluate to true or false. The if statement and switch statement allow executing different blocks of code conditionally based on the result of logical expressions or comparisons.
The document discusses nested loops in programming. It defines a loop as a sequence of instructions repeated until a condition is reached. A nested loop is a loop inside another loop. It provides examples of nested while, do-while, and for loops to print series of numbers. The nested loops examples ensure the inner loop completes before moving to the next iteration of the outer loop.
This document discusses control flow statements in C programming language. It describes if, switch, while, do-while, for statements that allow conditional execution and looping. Specific examples are provided to illustrate if/else, while, for loops. Additional features of for loops like initializing multiple variables, omitting sections, and nesting loops are covered. The break and continue statements are also explained for jumping out or skipping parts of a loop.
1. A string is a one-dimensional array of characters terminated by a null character. Strings can be initialized during compilation or at runtime.
2. Common string functions like scanf(), gets(), getchar() are used to input strings while printf(), puts(), putchar() are used to output strings.
3. Library functions like strcpy(), strcat(), strcmp(), strlen() allow manipulation of strings like copying, concatenation, comparison and finding length.
The document discusses Strings in Java. Some key points:
- A String represents a sequence of characters. The String class is used to create string objects which can exist in the string pool or heap.
- Char arrays are preferable over Strings for passwords due to security reasons. Strings can be manipulated more easily.
- The String class has many useful methods like length(), charAt(), indexOf(), replace(), toLowerCase(), substring() etc to work with and manipulate string values.
- StringBuffer is used to create mutable string objects that can be modified after creation using methods like append(), insert(), delete() etc. It is preferable over String for performance reasons while manipulating strings.
This document discusses repetition (looping) control structures in C++, including while, for, do-while loops, and the break and continue statements. The while loop repeats as long as an expression is true. The for loop simplifies counter-controlled loops by initializing/updating a variable. The do-while loop always executes at least once even if the expression is false. break exits the current loop, while continue skips to the next iteration. Nested loops can be used to create complex output patterns.
C Programming - Decision making, LoopingMURALIDHAR R
Execution of a statement or set of statement repeatedly is called as looping.
The loop may be executed a specified number of times and this depends on the satisfaction of a test condition.
A program loop is made up of two parts one part is known as body of the loop and the other is known as control condition.
Depending on the control condition statement the statements within the loop may be executed repeatedly.
Depending on the position of the control statement in the loop, a control structure may be classified either as an entry controlled loop or as an exit controlled loop.
Entry Controlled Loop:
When the control statement is placed before the body of the loop then such loops are called as entry controlled loops.
If the test condition in the control statement is true then only the body of the loop is executed.
If the test condition in the control statement is not true then the body of the loop will not be executed. If the test condition fails in the first checking itself the body of the loop will never be executed.
This document discusses control statements in C language including if-else statements, switch statements, loops (while, do-while, for), and jump statements (break, continue, goto). It provides examples of each statement type and explains their usage and flow. Key control statements covered are if-else statements for simple and nested conditional logic, switch statements for multiple alternatives, loops for repetitive execution, and jump statements for early exits or skipping parts of loops.
This document summarizes different types of loops in C programming: for loops, while loops, and do-while loops. It explains the basic structure of each loop type, including where the initialization, test condition, and updating of the loop variable occurs. It also distinguishes between entry controlled loops (for and while) and exit controlled loops (do-while). Additional loop concepts covered include break and continue statements, and sentinel controlled loops. Examples are provided to illustrate usage of each loop type.
Diploma ii cfpc u-3 handling input output and control statementsRai University
This document discusses control statements and looping in the C programming language. It covers if-else statements, switch statements, the ternary operator, goto statements, while loops, do-while loops, for loops, and nested loops. It provides examples of each construct and describes how they control program flow. Jump statements like break and continue are also covered, allowing programs to exit or skip parts of loops.
Bsc cs pic u-3 handling input output and control statementsRai University
The document discusses various control statements in C programming language including if-else statements, switch statements, loops (while, do-while, for loops), and jump statements like break, continue, and goto. It provides examples of each statement type and explains their usage and flow. Key control statements covered are if-else, switch, while, do-while, for loops, and how to exit or continue within loops using break, continue and goto statements.
Mca i pic u-3 handling input output and control statementsRai University
The document discusses various control statements in C programming language including if-else statements, switch statements, loops (while, do-while, for loops), and jump statements like break, continue, goto. It provides examples of each statement type and explains their usage and flow. Key control statements covered are if-else, switch, while, do-while, for loops, and how to exit or continue within loops using break, continue and goto statements.
Btech i pic u-3 handling input output and control statementsRai University
The document discusses various control statements in C programming language including if-else statements, switch statements, loops (while, do-while, for loops), and jump statements like break, continue, goto. It provides examples of each statement and explains their usage and flow. Key control statements covered are if-else, switch, while, do-while, for loops, break, continue. Nested control structures and their flow is also explained with examples.
handling input output and control statementsRai University
The document discusses various control statements in C programming language including if-else statements, switch statements, loops (while, do-while, for loops), and jump statements like break, continue, goto. It provides examples of each statement and explains their usage and flow. Key control statements covered are if-else, switch, while, do-while, for loops, break, continue. Nested control structures and their flow is also explained with examples.
This document discusses control flow statements in C programming. It defines control flow statements as blocks of code that control the flow of a program. There are three main types: branching/decision making statements, iterative/looping statements, and jumping statements. Branching statements include if, else if, switch case, and conditional operators. Looping statements include while, for, and do while loops. Jumping statements are break, continue, and goto. Examples are provided for each statement type to illustrate their syntax and usage.
The document discusses various control statements in C programming including selection statements like if, if-else, switch and iteration statements like for, while, do-while. It explains how to use these statements to control program flow through conditional execution and selection. Some key concepts covered include nested if statements, the dangling else problem, switch vs if-else statements, testing equality in loops, and using break, continue and goto statements. The document also provides examples of using control statements to find the largest of three numbers and calculate a factorial.
The document discusses various control statements in C programming including selection statements like if, if-else, switch and iteration statements like for, while, do-while. It explains how to use these statements to control program flow through conditional execution and selection. Some key concepts covered include nested if statements, the dangling else problem, switch vs if-else statements, testing floating point equality in loops, and using break and continue statements. The document also provides examples of various control structures like if-else ladder, nested loops and using goto statements.
The document discusses various control structures and functions used in Arduino programming including decision making structures like if, else if, else statements and switch case statements. It also covers different types of loops like while, do-while and for loops that allow repeating blocks of code. Functions are described as reusable blocks of code that perform tasks and help organize a program. Strings can be implemented as character arrays or using the String class, and various string functions are provided to manipulate and work with strings.
The document provides information on C programming concepts including data types, operators, control structures, and loops. It includes code examples to demonstrate printf() and scanf() functions, if/else conditional statements, while and for loops. It also defines relational, logical, and ternary operators and explains the three basic control structures: sequence, selection, and iteration. Key concepts around while, do-while, for loops and switch/case statements are described.
This document provides an overview of different types of statements and flow control constructs in C++ programming. It discusses sequential, selection, and iteration statements. Selection statements covered include if, if-else, switch, and ternary operator. Iteration statements discussed are for, while, do-while, and nested loops. Jump statements like break, continue, goto, and exit function are also summarized. Examples are provided for most constructs to illustrate their usage.
The document discusses input and output functions in C programming. It describes the printf() and scanf() functions for output and input. printf() displays output and can print variables and messages. scanf() reads input from the keyboard and stores it in variables. It also discusses control flow statements like if-else, switch case, loops (while, do-while, for), and statements like break, continue, and goto.
The document discusses different types of conditional and looping statements in C programming. It describes if, if-else, nested if-else, switch statements for conditional logic. It also covers while, do-while and for loops for iterative logic. Control statements like break, continue and goto are also discussed which can be used to control the flow inside loops. Various syntax examples are provided for each statement type to illustrate their usage.
Module 2_ Divide and Conquer Approach.pptxnikshaikh786
The document describes the divide and conquer approach and analyzes the complexity of several divide and conquer algorithms, including binary search, merge sort, quicksort, and finding minimum and maximum values. It explains the general divide and conquer method involves three steps: 1) divide the problem into subproblems, 2) solve the subproblems, and 3) combine the solutions to solve the original problem. It then provides detailed explanations and complexity analyses of specific divide and conquer algorithms.
The document provides an introduction to analyzing the performance of algorithms. It discusses time complexity and space complexity, which measure the running time and memory usage of algorithms. Common asymptotic notations like Big-O, Big-Omega, and Big-Theta are introduced to concisely represent the growth rates of algorithms. Specific algorithms like selection sort and insertion sort are analyzed using these metrics. Recursion and recurrence relations are also covered as methods to analyze algorithm efficiency.
Module 1_ Introduction to Mobile Computing.pptxnikshaikh786
Module 1 provides an introduction to mobile computing. The key concepts covered include mobile communication, mobile hardware, and mobile software. Mobile communication allows devices to communicate wirelessly and consists of infrastructure like protocols and services. Mobile hardware includes devices like smartphones and laptops that can access wireless networks. Mobile software provides the operating systems that allow mobile devices to operate portably and wirelessly. The module also discusses the electromagnetic spectrum, signal propagation effects, digital modulation techniques, and multiplexing methods like frequency division multiplexing and time division multiplexing.
This document provides an overview of module 2 which focuses on GSM mobile services and cellular architecture. It discusses the basic concepts and principles of computing and cellular infrastructure including system architecture, radio interface, protocols, localization, calling, handover and security. It provides details on the GSM system infrastructure, components, protocols and interfaces. It also discusses GPRS system and protocol architecture, UTRAN, UMTS core network and improvements to the core network.
Clustering is an unsupervised learning technique used to group unlabeled data points into clusters based on similarity. It is widely used in data mining applications. The k-means algorithm is one of the simplest clustering algorithms that partitions data into k predefined clusters, where each data point belongs to the cluster with the nearest mean. It works by assigning data points to their closest cluster centroid and recalculating the centroids until clusters stabilize. The k-medoids algorithm is similar but uses actual data points as centroids instead of means, making it more robust to outliers.
MODULE 5 _ Mining frequent patterns and associations.pptxnikshaikh786
1. The FP-Growth algorithm constructs an FP-tree to store transaction data, with frequent items listed in descending order of frequency.
2. It then uses a divide-and-conquer strategy to mine the conditional pattern base of each frequent item prefix, extracting combinations of frequent items.
3. This recursively mines the frequent patterns from the conditional FP-tree for each prefix path, without generating a large number of candidate itemsets.
This document discusses web mining and divides it into three categories: web content mining, web structure mining, and web usage mining. Web content mining examines the actual content of web pages and can utilize techniques like keyword searching, classification, clustering, and natural language processing. Web structure mining analyzes the hyperlink structure between pages. Web usage mining examines log files that record how users interact with and move between websites. The document provides examples of how these different types of web mining can be applied, such as for targeted advertising.
This document discusses various classification and regression techniques for data mining, including decision trees, naive Bayesian classification, and linear regression. It covers evaluating classifier performance using measures like accuracy, precision, recall, and the confusion matrix. Cross-validation and bootstrap techniques for evaluating accuracy are introduced, along with the ROC curve and area under the curve for comprehensive evaluation. Holdout method and random subsampling for accuracy estimation are also summarized.
Module 2_ Introduction to Data Mining, Data Exploration and Data Pre-processi...nikshaikh786
The document discusses data mining architecture, tasks, and data exploration and preprocessing techniques. It describes the KDD process and issues in data mining. It also covers data types, attributes, statistical descriptions of data, and various data visualization techniques like histograms, boxplots, scatter plots and quantile plots to explore patterns in data. Data preprocessing steps discussed are data cleaning, integration, transformation, reduction and discretization.
The document provides information about data warehousing fundamentals. It discusses key concepts such as data warehouse architectures, dimensional modeling, fact and dimension tables, and metadata. The three common data warehouse architectures described are the basic architecture, architecture with a staging area, and architecture with staging area and data marts. Dimensional modeling is optimized for data retrieval and uses facts, dimensions, and attributes. Metadata provides information about the data in the warehouse.
This document discusses various cybercrimes and security issues related to mobile and wireless devices. It describes how criminals plan cyber attacks using techniques like social engineering, malware distribution, and exploiting vulnerabilities. Specific cybercrimes addressed include phishing, cyber stalking, crimes at cyber cafes, and the use of botnets. The document also covers attack vectors, the proliferation of mobile devices, and security challenges they pose like data leakage and malware. Recommendations are provided for protecting devices and networks from these threats.
Module 1- Introduction to Cybercrime.pptxnikshaikh786
Cybercrime involves illegal activities carried out using digital technology, often with criminal intent. Information security focuses on protecting systems and data from cyber threats. The Indian IT Act defines cybercrimes like hacking, data theft, and cyberbullying and prescribes penalties. It has undergone amendments to address new technologies. Other countries also have their own laws regulating electronic transactions, data protection, and cybersecurity.
The document discusses exploratory data analysis using R. It describes useful R functions for exploring and summarizing data frames, including dim(), nrow(), ncol(), head(), tail(), names(), str(), levels(), summary(), and fivenum(). These functions are demonstrated on the built-in InsectSprays data set to explore the categorical and continuous variables. The document also discusses measures of central tendency, dispersion, quantiles, and the three basic indexing operators in R.
This document provides an overview of text analysis and mining. It discusses key concepts like text pre-processing, representation, shallow parsing, stop words, stemming and lemmatization. Specific techniques covered include tokenization, part-of-speech tagging, Porter stemming algorithm. Applications mentioned are sentiment analysis, document similarity, cluster analysis. The document also provides a multi-step example of text analysis involving collecting raw text, representing text, computing TF-IDF, categorizing documents by topics, determining sentiments and gaining insights.
This document provides an overview of time series analysis and the Box-Jenkins methodology. Time series analysis attempts to model observations over time and identify patterns. The goals are to identify the structure of the time series and forecast future values. The Box-Jenkins methodology involves conditioning the data, selecting a model, estimating parameters, and assessing the model. Autocorrelation (ACF) and partial autocorrelation (PACF) plots are used to identify autoregressive (AR), moving average (MA), and autoregressive integrated moving average (ARIMA) models.
This document provides an overview of regression models and analysis techniques. It introduces simple and multiple linear regression, as well as logistic regression. It discusses assessing regression models, cross-validation, model selection, and using regression models for prediction. Additionally, it covers the similarities and differences between linear and logistic regression, and assessing correlation without inferring causation. Scatter plots, correlation coefficients, and computing regression equations are also summarized.
MODULE 1_Introduction to Data analytics and life cycle..pptxnikshaikh786
The document provides an overview of the data analytics lifecycle and its key phases. It discusses the 6 phases: discovery, data preparation, model planning, model building, communicating results, and operationalizing. For each phase, it describes the main activities and considerations. It also discusses roles, tools, and best practices for ensuring a successful analytics project.
This document provides an overview of various data analytics tools and frameworks for IoT, including Apache Hadoop, Apache Spark, Apache Storm, and NETCONF-YANG. It discusses using Hadoop MapReduce for batch data analysis, Apache Oozie for workflow scheduling, Apache Spark for fast processing, and Apache Storm for real-time streaming data analysis. Tools for deploying IoT systems like Chef and Puppet are also mentioned. Case studies and structural health monitoring are provided as examples of applying these technologies.
This document contains questions about Flutter, Dart, Progressive Web Apps (PWA), Firebase, and data types in Dart. Some of the topics covered include:
1. What Flutter is and its advantages
2. The Flutter architecture and important features
3. Build modes, widgets, and their importance in Flutter
4. What Dart is and its importance
5. The difference between runApp() and main()
6. Packages, plugins, and editors used for Flutter development
7. How Firebase works and its features for building web and mobile applications.
Construction Materials (Paints) in Civil EngineeringLavish Kashyap
This file will provide you information about various types of Paints in Civil Engineering field under Construction Materials.
It will be very useful for all Civil Engineering students who wants to search about various Construction Materials used in Civil Engineering field.
Paint is a vital construction material used for protecting surfaces and enhancing the aesthetic appeal of buildings and structures. It consists of several components, including pigments (for color), binders (to hold the pigment together), solvents or thinners (to adjust viscosity), and additives (to improve properties like durability and drying time).
Paint is one of the material used in Civil Engineering field. It is especially used in final stages of construction project.
Paint plays a dual role in construction: it protects building materials and contributes to the overall appearance and ambiance of a space.
The main purpose of the current study was to formulate an empirical expression for predicting the axial compression capacity and axial strain of concrete-filled plastic tubular specimens (CFPT) using the artificial neural network (ANN). A total of seventy-two experimental test data of CFPT and unconfined concrete were used for training, testing, and validating the ANN models. The ANN axial strength and strain predictions were compared with the experimental data and predictions from several existing strength models for fiber-reinforced polymer (FRP)-confined concrete. Five statistical indices were used to determine the performance of all models considered in the present study. The statistical evaluation showed that the ANN model was more effective and precise than the other models in predicting the compressive strength, with 2.8% AA error, and strain at peak stress, with 6.58% AA error, of concrete-filled plastic tube tested under axial compression load. Similar lower values were obtained for the NRMSE index.
Optimization techniques can be divided to two groups: Traditional or numerical methods and methods based on stochastic. The essential problem of the traditional methods, that by searching the ideal variables are found for the point that differential reaches zero, is staying in local optimum points, can not solving the non-linear non-convex problems with lots of constraints and variables, and needs other complex mathematical operations such as derivative. In order to satisfy the aforementioned problems, the scientists become interested on meta-heuristic optimization techniques, those are classified into two essential kinds, which are single and population-based solutions. The method does not require unique knowledge to the problem. By general knowledge the optimal solution can be achieved. The optimization methods based on population can be divided into 4 classes from inspiration point of view and physical based optimization methods is one of them. Physical based optimization algorithm: that the physical rules are used for updating the solutions are:, Lighting Attachment Procedure Optimization (LAPO), Gravitational Search Algorithm (GSA) Water Evaporation Optimization Algorithm, Multi-Verse Optimizer (MVO), Galaxy-based Search Algorithm (GbSA), Small-World Optimization Algorithm (SWOA), Black Hole (BH) algorithm, Ray Optimization (RO) algorithm, Artificial Chemical Reaction Optimization Algorithm (ACROA), Central Force Optimization (CFO) and Charged System Search (CSS) are some of physical methods. In this paper physical and physic-chemical phenomena based optimization methods are discuss and compare with other optimization methods. Some examples of these methods are shown and results compared with other well known methods. The physical phenomena based methods are shown reasonable results.
[PyCon US 2025] Scaling the Mountain_ A Framework for Tackling Large-Scale Te...Jimmy Lai
Managing tech debt in large legacy codebases isn’t just a challenge—it’s an ongoing battle that can drain developer productivity and morale. In this talk, I’ll introduce a Python-powered Tech Debt Framework bar-raiser designed to help teams tackle even the most daunting tech debt problems with 100,000+ violations. This open-source framework empowers developers and engineering leaders by: - Tracking Progress: Measure and visualize the state of tech debt and trends over time. - Recognizing Contributions: Celebrate developer efforts and foster accountability with contribution leaderboards and automated shoutouts. - Automating Fixes: Save countless hours with codemods that address repetitive debt patterns, allowing developers to focus on higher-priority work.
Through real-world case studies, I’ll showcase how we: - Reduced 70,000+ pyright-ignore annotations to boost type-checking coverage from 60% to 99.5%. - Converted a monolithic sync codebase to async, addressing blocking IO issues and adopting asyncio effectively.
Attendees will gain actionable strategies for scaling Python automation, fostering team buy-in, and systematically reducing tech debt across massive codebases. Whether you’re dealing with type errors, legacy dependencies, or async transitions, this talk provides a roadmap for creating cleaner, more maintainable code at scale.
Newly poured concrete opposing hot and windy conditions is considerably susceptible to plastic shrinkage cracking. Crack-free concrete structures are essential in ensuring high level of durability and functionality as cracks allow harmful instances or water to penetrate in the concrete resulting in structural damages, e.g. reinforcement corrosion or pressure application on the crack sides due to water freezing effect. Among other factors influencing plastic shrinkage, an important one is the concrete surface humidity evaporation rate. The evaporation rate is currently calculated in practice by using a quite complex Nomograph, a process rather tedious, time consuming and prone to inaccuracies. In response to such limitations, three analytical models for estimating the evaporation rate are developed and evaluated in this paper on the basis of the ACI 305R-10 Nomograph for “Hot Weather Concreting”. In this direction, several methods and techniques are employed including curve fitting via Genetic Algorithm optimization and Artificial Neural Networks techniques. The models are developed and tested upon datasets from two different countries and compared to the results of a previous similar study. The outcomes of this study indicate that such models can effectively re-develop the Nomograph output and estimate the concrete evaporation rate with high accuracy compared to typical curve-fitting statistical models or models from the literature. Among the proposed methods, the optimization via Genetic Algorithms, individually applied at each estimation process step, provides the best fitting result.
Introduction to ANN, McCulloch Pitts Neuron, Perceptron and its Learning
Algorithm, Sigmoid Neuron, Activation Functions: Tanh, ReLu Multi- layer Perceptron
Model – Introduction, learning parameters: Weight and Bias, Loss function: Mean
Square Error, Back Propagation Learning Convolutional Neural Network, Building
blocks of CNN, Transfer Learning, R-CNN,Auto encoders, LSTM Networks, Recent
Trends in Deep Learning.
Jacob Murphy Australia - Excels In Optimizing Software ApplicationsJacob Murphy Australia
In the world of technology, Jacob Murphy Australia stands out as a Junior Software Engineer with a passion for innovation. Holding a Bachelor of Science in Computer Science from Columbia University, Jacob's forte lies in software engineering and object-oriented programming. As a Freelance Software Engineer, he excels in optimizing software applications to deliver exceptional user experiences and operational efficiency. Jacob thrives in collaborative environments, actively engaging in design and code reviews to ensure top-notch solutions. With a diverse skill set encompassing Java, C++, Python, and Agile methodologies, Jacob is poised to be a valuable asset to any software development team.
AI-Powered Data Management and Governance in RetailIJDKP
Artificial intelligence (AI) is transforming the retail industry’s approach to data management and decisionmaking. This journal explores how AI-powered techniques enhance data governance in retail, ensuring data quality, security, and compliance in an era of big data and real-time analytics. We review the current landscape of AI adoption in retail, underscoring the need for robust data governance frameworks to handle the influx of data and support AI initiatives. Drawing on literature and industry examples, we examine established data governance frameworks and how AI technologies (such as machine learning and automation) are augmenting traditional data management practices. Key applications are identified, including AI-driven data quality improvement, automated metadata management, and intelligent data lineage tracking, illustrating how these innovations streamline operations and maintain data integrity. Ethical considerations including customer privacy, bias mitigation, transparency, and regulatory compliance are discussed to address the challenges of deploying AI in data governance responsibly.
2. TOPIC TO BE COVERED
Control Structures
● Introduction to Control Structures
Branching structures
● If statement, If-else statement, Nested if-else, else-if Ladder
● Switch statement
Looping structures
● For loop, While loop, Do while loop
● break and continue
3. INTRODUCTION TO CONTROL
STRUCTURES
The statement in the program executed in order in which they appear
is called sequential execution. But sometimes we,
1) Need to select set of statement from several alternatives
2) Skip statement depending on condition
3) Repeat statement for known time.
So we need to use the control of the statement to be executed
4. INTRODUCTION TO CONTROL
STRUCTURES
Control Structures are just a way to specify flow of
control in programs.
Any algorithm or program can be more clear and
understood if they use self-contained modules called
as logic or control structures.
It analyzes and chooses the direction in which a
program flows based on certain parameters or
conditions.
There are three basic types of logic, or flow of control,
known as:
Sequence logic, or sequential flow
Selection logic, or conditional flow
5. INTRODUCTION TO CONTROL
STRUCTURES
A statement that is used to control the flow of execution in a program
is called control structure. It combines instruction into logical unit.
Logical unit has one entry point and one exit point.
Types of control structures
1. Sequence
2. Selection
3. Repetition
4. Function call (will be discussed in next module)
Sequence: Statements are executed in a specified order. No statement
is skipped and no statement is executed more than once.
7. INTRODUCTION TO CONTROL
STRUCTURES
Selection:
It selects a statement to execute on the basis of condition. Statement
is executed when the condition is true and ignored when it is false
e.g if, if else, switch structures.
10. INTRODUCTION TO CONTROL
STRUCTURES
For Example:
#include<stdio.h>
void main()
{
int a=1; //initialization of looping variable
while(a<=5) // checking condition
{
printf(“I am Indiann”);
a++; //updating the looping variable
} //end of while
} //end of main
11. SELECTION STRUCTURE
Selection structures allow the computer to make decisions in your
programs. It selects a statement or set of statements to execute on
the basis of a condition.
Types: ·
If-else structure ·
Switch structure
If-else structure:
The if-else statement is an extension of the simple if statement. It
executes one statement if it is true and other one if condition is false.
Switch structure:
It is used when there are many choices and only one statement is to
be executed.
12. SELECTION STRUCTURE - SIMPLE
IF
If Statement
The simplest if structure involves a single executable statement.
Execution of the statement occurs only if the condition is true.
Syntax:
if (condition)
statement;
13. SELECTION STRUCTURE - SIMPLE
IF
Example:
#include<stdio.h>
void main ()
{
int marks;
printf("Enter your marks:");
scanf("%d",&marks);
if(marks >=50)
printf("CONGRATULATIONS...!!! you have passed");
}
14. SELECTION STRUCTURE - SIMPLE
IF
Limitation of If
The statement(s) are executed if the condition is true; if the condition
is false nothing happens in other words we may say it is not the
effective one. Instead of it we use if-else statements etc.
15. SELECTION STRUCTURE – IF ELSE
If-else statement
In if-else statement if the condition is true, then the true
statement(s), immediately following the if-statement are executed
otherwise the false statement(s) are executed. The use of else
basically allows an alternative set of statements to be executed if the
condition is false.
Syntax:
If (condition)
{
Statement(s);
}
else
{
statement(s);
}
17. SELECTION STRUCTURE – IF ELSE
Example:
#include<stdio.h>
void main ()
{
int y;
printf("Enter a year:");
scanf("%d",&y);
if (y % 4==0)
printf("%d is a leap year",y);
else
printf("%d is not a leap year",y);
}
18. SELECTION STRUCTURE – IF ELSE
IF
IF -else if statement
It can be used to choose one block of statements from many blocks of
statements. The condition which is true only its block of statements is
executed and remaining are skipped.
Syntax:
if (condition)
{
statement(s);
}
else if (condition)
{
statement(s);
}
else
{
(statement);
}
20. SELECTION STRUCTURE – IF ELSE
IF
Example:
#include<stdio.h>
void main ()
{
int n;
printf("Enter a number:");
scanf("%d",&n);
if(n>0)
printf("The number is positive");
else if (n<0)
printf("The number is negative");
else
printf("The number is zero");
}
21. SELECTION STRUCTURE – NESTED
IF
Nested if
In nested-if statement if the first if condition is true the control
will enter inner if. If this is true the statement will execute
otherwise control will come out of the inner if and the else
statement will be executed.
Syntax:
If (condition)
if(condition)
{
statement(s);
}
else
{
statement(s);
}
else
{
statement(s);
}
23. SELECTION STRUCTURE – NESTED IF
Example:
#include <stdio.h>
int main() {
double n1, n2, n3;
printf("Enter three numbers: ");
scanf("%lf %lf %lf", &n1, &n2, &n3);
if (n1 >= n2) {
if (n1 >= n3)
printf("%.2lf is the largest number.", n1);
else
printf("%.2lf is the largest number.", n3);
} else {
if (n2 >= n3)
printf("%.2lf is the largest number.", n2);
else
printf("%.2lf is the largest number.", n3);
}
return 0; }
24. SELECTION STRUCTURE – SWITCH
CASE
Switch Statement
Switch statement is alternative of nested if-else.it is executed when there are
many choices and only one is to be executed.
Syntax:
switch(expression)
{
case 1:
statement;
break;
case 2:
statement;
break;
.
.
.
.
case N:
statement;
break;
default:
statement;
}
27. REPETITION STRUCTURE - LOOPS
Loops
loop is used to repeatedly execute set of statement. Structure that
repeats a statement is known as iterative, repetitive or looping
construct.
Purpose: Execute statements for a specified number of times.
To use a sequence of values.
Types
While loop
Do while loop
For loop
28. REPETITION STRUCTURE - LOOPS
Depending upon the position of a control statement in a program,
looping in C is classified into two types:
1. Entry controlled loop
2. Exit controlled loop
In an entry control loop in C, a condition is checked before executing
the body of a loop. It is also called as a pre-checking loop.
In an exit controlled loop, a condition is checked after executing the
body of a loop. It is also called as a post-checking loop.
29. REPETITION STRUCTURE - LOOPS
The control conditions must be well defined and specified otherwise
the loop will execute an infinite number of times. The loop that does
not stop executing and processes the statements number of times is
called as an infinite loop. An infinite loop is also called as an "Endless
loop." Following are some characteristics of an infinite loop:
1. No termination condition is specified.
2. The specified conditions never meet.
31. REPETITION STRUCTURE - WHILE
LOOP
It executes one or more statements while the given condition remains
true. It is useful when number of iterations is unknown.
Syntax
initialization
while (condition)
{
statement;
increment/decrement;
}
33. REPETITION STRUCTURE - WHILE
LOOP
It is an entry-controlled loop. In while loop, a condition is evaluated
before processing a body of the loop. If a condition is true then and
only then the body of a loop is executed. After the body of a loop is
executed then control again goes back at the beginning, and the
condition is checked if it is true, the same process is executed until
the condition becomes false. Once the condition becomes false, the
control goes out of the loop.
After exiting the loop, the control goes to the statements which are
immediately after the loop. The body of a loop can contain more than
one statement. If it contains only one statement, then the curly braces
are not compulsory. It is a good practice though to use the curly
braces even we have a single statement in the body.
In while loop, if the condition is not true, then the body of a loop will
not be executed, not even once.
34. REPETITION STRUCTURE - WHILE
LOOP
Example
#include<stdio.h>
void main (void)
{
int n; //declaration
n=1; //Initialization
while (n<=5) // Condition
{
printf("n %d",n);
n++; //Increment(Updation)
}
}
35. REPETITION STRUCTURE - DO
WHILE LOOP
Do while loops are useful where loop is to be executed at least once.
In do while loop condition comes after the body of loop. This loop
executes one or more statements while the given condition is true.
Syntax
initialization
do
{
statement(s);
increment/decrement;
}
while (condition);
37. REPETITION STRUCTURE - DO
WHILE LOOP
Example
#include<stdio.h>
void main (void)
{
int a;
a=1;
do
{
printf("n %d",a);
a++;
}
while (a<=5);
}
38. REPETITION STRUCTURE - FOR
LOOP
For loops are used when the number of iterations is known before
entering the loop. It is also known as counter-controlled loop.
Syntax
for (initialization;condition;increment/decrement)
{
statement()s;
}
40. REPETITION STRUCTURE - FOR
LOOP
#include<stdio.h>
#include<conio.h>
void main (void)
{
int n;
for(n=1;n<=5;n++)
{
printf("n %d",n);
}
getch();
}
Output:
1
2
3
4
5
41. REPETITION STRUCTURE - NESTED
LOOP
Nested loop
A loop within a loop is called nested loop. In this the outer loop is used for
counting rows and the internal loop is used for counting columns.
Any loop can be used as inner loop of another loop.
Syntax
for (initialization;condition;increment/decrement)
{
for(initialization;condition,increment/decrement)
{
statements(s);
}
}
43. REPETITION STRUCTURE - NESTED
LOOP
Example
#include<stdio.h>
#include<conio.h>
void main (void)
{
clrscr();
for(int a=1;a<=3;a++) //count rows
{
for(int s=1;s<=3;s++) // count column
{
printf("*");
} //end of internal loop
printf("n");
} //end of external loop
getch();
} //end of main
44. REPETITION STRUCTURE-
CONTINUE
Continue statement transfer the control to the start of block.
It is used in the body of loop.
The continue statement skips the current iteration of the loop
and continues with the next iteration.
Its syntax is:
continue;
46. REPETITION STRUCTURE-
CONTINUE
// Program to calculate the sum of numbers (10 numbers max)
// If the user enters a negative number, it's not added to the result
#include <stdio.h>
int main()
{
int i;
double number, sum = 0.0;
for (i = 1; i <= 10; ++i)
{
printf("Enter a n%d: ", i);
scanf("%lf", &number);
if (number < 0.0)
{
continue;
}
sum += number; // sum = sum + number;
}
printf("Sum = %.2lf", sum);
return 0;
}
47. REPETITION STRUCTURE-
CONTINUE
When the user enters a negative number, the continue
statement is executed and it skips the negative number from
the calculation.
48. REPETITION STRUCTURE-
CONTINUE
// Program to calculate the sum of marks (Out of 20) in 5 subjects. The user has
to enter marks one by one, if the marks exceed 20 it's not added to the result
#include <stdio.h>
int main()
{
int i;
double marks, sum = 0.0;
for (i = 1; i <=5; ++i)
{
printf("Enter marks %d: ", i);
scanf("%lf", &marks);
if (marks>20||marks<0)
{
continue;
}
sum += marks; // sum = sum + marks;
}
printf("Sum = %.2lf", sum);
return 0;
}
49. REPETITION STRUCTURE-BREAK
STATEMENT
It is a tool to take the control out of the loop or block.
It transfers control to end of block.
It is used in body of loop and switch statements.
51. REPETITION STRUCTURE-GOTO
STATEMENT
It is an unconditional transfer of control.
It transfers the control to the specific point.
The goto statement is marked by label
statement.Label statement can be used anywhere in
the function above or below the goto statement.
It is written as goto label;
where label is an identifeir
label: statement
54. PROBLEMS
#include <stdio.h>
int main()
{
int i, j, rows;
printf("Enter the number of rows: ");
scanf("%d", &rows);
for (i = 1; i <= rows; ++i)
{
for (j = 1; j <= i; ++j)
{
printf("* ");
}
printf("n");
}
return 0;
}
56. PROBLEMS
#include <stdio.h>
int main() {
int i, j, rows;
printf("Enter the number of rows: ");
scanf("%d", &rows);
for (i = 1; i <= rows; ++i) {
for (j = 1; j <= i; ++j) {
printf("%d ", j);
}
printf("n");
}
return 0;
}
58. PROBLEMS
#include <stdio.h>
int main() {
int i, j;
char input, alphabet = 'A';
printf("Enter an uppercase character you want to print in the last row: ");
scanf("%c", &input);
for (i = 1; i <= (input - 'A' + 1); ++i) {
for (j = 1; j <= i; ++j) {
printf("%c ", alphabet);
}
++alphabet;
printf("n");
}
return 0;
}
60. PROBLEMS
#include <stdio.h>
int main() {
int i, j, rows;
printf("Enter the number of rows: ");
scanf("%d", &rows);
for (i = rows; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("n");
}
return 0;
}
62. PROBLEMS
#include <stdio.h>
int main() {
int i, j, rows;
printf("Enter the number of rows: ");
scanf("%d", &rows);
for (i = rows; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("%d ", j);
}
printf("n");
}
return 0;
}
64. PROBLEMS
#include <stdio.h>
int main() {
int i, space, rows, k = 0;
printf("Enter the number of rows: ");
scanf("%d", &rows);
for (i = 1; i <= rows; ++i, k = 0) {
for (space = 1; space <= rows - i; ++space) {
printf(" ");
}
while (k != 2 * i - 1) {
printf("* ");
++k;
}
printf("n");
}
return 0;
}