The document discusses functions in C programming. It defines functions and explains their various parts like declaration, definition, and invocation. It also differentiates between function declaration and definition. Various types of functions are classified based on their inputs and outputs. The key differences between call by value and call by reference are explained with examples. Advantages of pass by reference are also mentioned.
The document discusses functions in C programming. It covers:
- Functions allow dividing programs into reusable blocks of code. They can be called multiple times.
- Advantages include avoiding duplicating code, calling functions from anywhere, and improving readability. However, function calls require overhead.
- There are three aspects of a function: declaration, call, and definition. Declaration specifies the name, parameters, and return type. Definition contains the code.
- Functions can return values or not. They can accept arguments or not. Library functions are predefined, while user-defined functions are created by the programmer.
The document discusses functions in C programming. It defines what a function is and explains the advantages of using functions, such as avoiding duplicate code and improving reusability. It describes the different parts of a function - declaration, definition, and call. It explains user-defined and standard library functions. It also covers parameter passing techniques (call by value and call by reference), recursion, and dynamic memory allocation using functions like malloc(), calloc(), realloc(), and free().
FUNCTION
INTRODUCTION & WRITING FUNCTIONS, SCOPE OF VARIABLES FUNCTIONS (INCLUDING USING BUILT IN LIBRARIES), PARAMETER PASSING IN FUNCTIONS, CALL BY VALUE, PASSING ARRAYS TO FUNCTIONS: IDEA OF CALL BY REFERENCE
There are two ways to initialize a structure:
1. Initialize structure members individually when declaring structure variables:
struct point {
int x;
int y;
} p1 = {1, 2};
2. Initialize an anonymous structure and assign it to a variable:
struct point p2 = {3, 4};
Structures allow grouping of related data types together under one name. They are useful for representing records, objects, and other data aggregates. Structures can contain nested structures as members. Arrays of structures are also possible. Structures provide data abstraction by allowing access to their members using dot operator.
The document discusses functions in C programming. It defines a function as a block of code that performs a specific task. There are two types of functions: predefined standard library functions and user-defined functions. The key aspects of a function are its declaration, definition, and call. Functions can be used to break a large program into smaller, reusable components. Parameters can be passed to functions by value or by reference. Recursion is when a function calls itself, and is used in algorithms like calculating factorials. Dynamic memory allocation allows programs to request memory at runtime using functions like malloc(), calloc(), realloc(), and free().
function in in thi pdf you will learn what is fu...kushwahashivam413
Functions in C can be divided into library functions and user-defined functions. Library functions are predefined in header files while user-defined functions are created by the programmer. There are three aspects of a function - declaration, definition, and call. The function declaration specifies the return type and parameters. The function definition contains the actual body of statements. The function call executes the function. Functions can be passed arguments and return values. Arguments can be passed by value or by reference, affecting whether changes inside the function affect the original variables.
The document discusses the structure and fundamentals of C programming. It describes the typical sections of a C program including documentation, preprocessor directives, global declarations, the main function, and local declarations. It also covers input/output functions like scanf and printf, and data types in C like constants, variables, keywords, and identifiers. Finally, it discusses variable scope and the differences between local and global variables.
This document provides an introduction to the C programming language. It discusses fundamental C elements like data types, variables, constants, operators, and input/output functions. It explains how a basic C program is structured and compiled. Examples are provided to demonstrate simple C statements, arithmetic expressions, and how to write and run a first program that prints text. The key topics covered include basic syntax, program structure, data types, identifiers, operators, and input/output functions like printf() and scanf().
The document discusses functions in C programming. It defines what a function is and explains that functions can be used to break a large program into smaller modular pieces of code that can be reused. The key points covered include: defining functions with return types, parameters, and bodies; declaring functions; calling functions by passing arguments; and passing arguments by value vs reference. Examples are provided to demonstrate creating, calling, and passing arguments to functions. Recursion is also discussed as a special case where a function calls itself.
A large program can be divided into smaller subprograms or functions. Functions make a program easier to write, read, update and debug by dividing it into self-contained tasks. Functions allow code to be reused and are called by the main program. Functions may accept arguments from the main program and return values to the main program. This allows two-way communication between functions and the main program.
This is a presentation on C language. Brief description on C language
Topics Covered
What is C
Header files in C
What is main function in c
Basic Structure of C
Keywords & Identifiers
Data Types & Variable Declaration in C Includes | Format Specifier | Memory Size
Input in C (printf() scanf() function)
Operators in C: Asthmatics,Increment Decrement, Relational, Logical operators
Sample Exercise
LinkedIn: https://www.linkedin.com/in/shamsulhusainansari/
GitHub: https://github.com/shamsulhusainansari
Functions allow programmers to organize code into reusable blocks. There are two types of functions: library functions defined in header files, and user-defined functions created by the programmer. Functions can take arguments and return values, or not. This allows for abstraction so the user of a function does not need to know its implementation. Functions provide reusability and modularity, making large programs possible to write and maintain.
The document discusses functions in C programming. It defines what a function is and describes the key parts of a function like the return type, function name, parameters, and function body. It provides examples of different types of functions like functions with and without arguments and return values. It also explains how parameters can be passed by value or by reference in functions and gives examples. Finally, it briefly mentions function scopes in C.
A function is a block of code that performs a specific task. It takes input, processes it, and returns output. There are two types of functions: library functions provided by the C language, and user-defined functions created by the programmer. Functions allow programmers to divide a large program into smaller, separate, and reusable parts of code. Functions make code more organized and modular.
The document presents information about functions in the C programming language. It discusses what a C function is, the different types of C functions including library functions and user-defined functions. It provides examples of how to declare, define, call and pass arguments to C functions. Key points covered include how functions allow dividing a large program into smaller subprograms, the ability to call functions multiple times, and how functions improve readability, debugging and reusability of code. An example program demonstrates a simple C function that calculates the square of a number.
The document provides an introduction to algorithms and key concepts related to algorithms such as definition, features, examples, flowcharts, pseudocode. It also discusses different types of programming languages from first to fifth generation. Key points of structured programming approach and introduction to C programming language are explained including data types, variables, constants, input/output functions, operators, type conversion etc.
This document discusses C functions. It defines a function as a block of code that performs a specific task. Functions allow for modular programming by subdividing programs into separate, reusable modules. The key elements of a function are its declaration, which informs the compiler about the function name, parameters, and return type; its definition, which contains the function body; and its call, which transfers program control to the function. Parameters act as placeholders for the arguments passed during a function call. Using functions improves code readability, reusability, testability and maintenance. Standard and user-defined functions are described along with examples.
The document discusses functions in C programming. It defines functions as self-contained blocks of code that perform a specific task. Functions make a program modular and easier to debug. There are four main types of functions: functions with no arguments and no return value, functions with no arguments but a return value, functions with arguments but no return value, and functions with both arguments and a return value. Functions are called by their name and can pass data between the calling and called functions using arguments.
C Programming - Basics of c -history of cDHIVYAB17
The document provides an introduction to C programming, covering topics such as what a program is, programming languages, the history of C, and the development stages of a C program. It discusses the key components of a C program including directives, the main function, and program structures. Examples are provided to illustrate C code structure and the use of variables, keywords, operators, input/output functions, and formatting output with printf.
And practice program with some MCQ questions to familiar with the concepts.
This document discusses modular programming and functions in C programming. Modular programming involves separating a program's functionality into independent, interchangeable modules. There are advantages to this approach such as improved manageability, reusability, and collaboration between programmers.
The document then discusses functions in C programming. Functions allow programmers to divide a program into reusable modules. There are two types of functions - standard library functions defined in header files, and user-defined functions. User-defined functions have advantages like making programs easier to understand, maintain, and debug. The key parts of a user-defined function are the declaration, definition, and call. Functions can take arguments, return values, and be used recursively. Arrays and 2D arrays
The document provides an overview of the C programming language development environment and basic concepts:
1. It describes the six phases of converting C code into an executable program: editing, preprocessing, compiling, assembling, linking, and running.
2. It introduces basic C programming concepts like variables, data types, statements, comments, functions, and input/output functions like printf(), scanf(), getchar(), and putchar().
3. It explains the six types of tokens used in C programs - keywords, identifiers, constants, string literals, punctuators, and operators - and provides examples of each.
function in in thi pdf you will learn what is fu...kushwahashivam413
Functions in C can be divided into library functions and user-defined functions. Library functions are predefined in header files while user-defined functions are created by the programmer. There are three aspects of a function - declaration, definition, and call. The function declaration specifies the return type and parameters. The function definition contains the actual body of statements. The function call executes the function. Functions can be passed arguments and return values. Arguments can be passed by value or by reference, affecting whether changes inside the function affect the original variables.
The document discusses the structure and fundamentals of C programming. It describes the typical sections of a C program including documentation, preprocessor directives, global declarations, the main function, and local declarations. It also covers input/output functions like scanf and printf, and data types in C like constants, variables, keywords, and identifiers. Finally, it discusses variable scope and the differences between local and global variables.
This document provides an introduction to the C programming language. It discusses fundamental C elements like data types, variables, constants, operators, and input/output functions. It explains how a basic C program is structured and compiled. Examples are provided to demonstrate simple C statements, arithmetic expressions, and how to write and run a first program that prints text. The key topics covered include basic syntax, program structure, data types, identifiers, operators, and input/output functions like printf() and scanf().
The document discusses functions in C programming. It defines what a function is and explains that functions can be used to break a large program into smaller modular pieces of code that can be reused. The key points covered include: defining functions with return types, parameters, and bodies; declaring functions; calling functions by passing arguments; and passing arguments by value vs reference. Examples are provided to demonstrate creating, calling, and passing arguments to functions. Recursion is also discussed as a special case where a function calls itself.
A large program can be divided into smaller subprograms or functions. Functions make a program easier to write, read, update and debug by dividing it into self-contained tasks. Functions allow code to be reused and are called by the main program. Functions may accept arguments from the main program and return values to the main program. This allows two-way communication between functions and the main program.
This is a presentation on C language. Brief description on C language
Topics Covered
What is C
Header files in C
What is main function in c
Basic Structure of C
Keywords & Identifiers
Data Types & Variable Declaration in C Includes | Format Specifier | Memory Size
Input in C (printf() scanf() function)
Operators in C: Asthmatics,Increment Decrement, Relational, Logical operators
Sample Exercise
LinkedIn: https://www.linkedin.com/in/shamsulhusainansari/
GitHub: https://github.com/shamsulhusainansari
Functions allow programmers to organize code into reusable blocks. There are two types of functions: library functions defined in header files, and user-defined functions created by the programmer. Functions can take arguments and return values, or not. This allows for abstraction so the user of a function does not need to know its implementation. Functions provide reusability and modularity, making large programs possible to write and maintain.
The document discusses functions in C programming. It defines what a function is and describes the key parts of a function like the return type, function name, parameters, and function body. It provides examples of different types of functions like functions with and without arguments and return values. It also explains how parameters can be passed by value or by reference in functions and gives examples. Finally, it briefly mentions function scopes in C.
A function is a block of code that performs a specific task. It takes input, processes it, and returns output. There are two types of functions: library functions provided by the C language, and user-defined functions created by the programmer. Functions allow programmers to divide a large program into smaller, separate, and reusable parts of code. Functions make code more organized and modular.
The document presents information about functions in the C programming language. It discusses what a C function is, the different types of C functions including library functions and user-defined functions. It provides examples of how to declare, define, call and pass arguments to C functions. Key points covered include how functions allow dividing a large program into smaller subprograms, the ability to call functions multiple times, and how functions improve readability, debugging and reusability of code. An example program demonstrates a simple C function that calculates the square of a number.
The document provides an introduction to algorithms and key concepts related to algorithms such as definition, features, examples, flowcharts, pseudocode. It also discusses different types of programming languages from first to fifth generation. Key points of structured programming approach and introduction to C programming language are explained including data types, variables, constants, input/output functions, operators, type conversion etc.
This document discusses C functions. It defines a function as a block of code that performs a specific task. Functions allow for modular programming by subdividing programs into separate, reusable modules. The key elements of a function are its declaration, which informs the compiler about the function name, parameters, and return type; its definition, which contains the function body; and its call, which transfers program control to the function. Parameters act as placeholders for the arguments passed during a function call. Using functions improves code readability, reusability, testability and maintenance. Standard and user-defined functions are described along with examples.
The document discusses functions in C programming. It defines functions as self-contained blocks of code that perform a specific task. Functions make a program modular and easier to debug. There are four main types of functions: functions with no arguments and no return value, functions with no arguments but a return value, functions with arguments but no return value, and functions with both arguments and a return value. Functions are called by their name and can pass data between the calling and called functions using arguments.
C Programming - Basics of c -history of cDHIVYAB17
The document provides an introduction to C programming, covering topics such as what a program is, programming languages, the history of C, and the development stages of a C program. It discusses the key components of a C program including directives, the main function, and program structures. Examples are provided to illustrate C code structure and the use of variables, keywords, operators, input/output functions, and formatting output with printf.
And practice program with some MCQ questions to familiar with the concepts.
This document discusses modular programming and functions in C programming. Modular programming involves separating a program's functionality into independent, interchangeable modules. There are advantages to this approach such as improved manageability, reusability, and collaboration between programmers.
The document then discusses functions in C programming. Functions allow programmers to divide a program into reusable modules. There are two types of functions - standard library functions defined in header files, and user-defined functions. User-defined functions have advantages like making programs easier to understand, maintain, and debug. The key parts of a user-defined function are the declaration, definition, and call. Functions can take arguments, return values, and be used recursively. Arrays and 2D arrays
The document provides an overview of the C programming language development environment and basic concepts:
1. It describes the six phases of converting C code into an executable program: editing, preprocessing, compiling, assembling, linking, and running.
2. It introduces basic C programming concepts like variables, data types, statements, comments, functions, and input/output functions like printf(), scanf(), getchar(), and putchar().
3. It explains the six types of tokens used in C programs - keywords, identifiers, constants, string literals, punctuators, and operators - and provides examples of each.
DOC-20210303-WA0017..pptx,coding stuff in cfloraaluoch3
This document provides an overview of procedural programming and object-oriented programming concepts. It discusses modular programming in C language and compilers used for C/C++. It then covers the software crisis and evolution, procedural programming paradigm, and introduction to object-oriented approach. Key characteristics of OOP like classes, objects, encapsulation, inheritance and polymorphism are explained. Benefits of OOP like code reusability and improved reliability are highlighted. Popular OOP languages like Java, C++, and Python are listed with examples of applications like real-time systems and databases.
The document provides guidance for attending lectures for an Artificial Intelligence course. It states that attendance is mandatory for all lectures, as the lecture notes alone do not provide enough detail and examples to fully understand the material. Students are responsible for attending lectures and taking supplemental notes. They are also expected to do additional reading to further supplement the lecture content. Students should ask questions during or after lectures if anything is unclear or being covered too quickly.
The document discusses the memory hierarchy and cache memories. It begins by describing the main components of the memory system: main memory and secondary memory. The key issues are that microprocessors are much faster than memory, and larger memories are slower. To address this, a memory hierarchy is used that combines fast, small, expensive memory levels with slower, larger, cheaper levels. Caches are discussed as a small, fast memory located between the CPU and main memory. Caches improve performance by exploiting locality of reference in programs. Different cache organizations like direct mapping and set associative mapping are described to determine where blocks are placed in the cache on a miss.
This document discusses parallel computation and computer architectures. It begins by explaining why parallel computation is needed to achieve high performance and meet certain application demands. It then provides an overview of parallel programs and Flynn's classification of computer architectures. The document discusses performance metrics like speedup and efficiency, and models like Amdahl's law that influence the achievable speedup. It also covers other factors limiting speedup and the importance of the interconnection network.
The document discusses computational models and their relationships to programming languages and computer architecture. A computational model defines the basic items of computation, the problem description style (procedural or declarative), and the execution model (interpretation, semantics, and control). Examples are given of the von Neumann model which uses variables, sequential instructions, and state transition semantics. Computational models influence language design and architecture. Granularity and typing are also discussed in relation to both models and languages.
National Fuels Treatments Initiative: Building a Seamless Map of Hazardous Fu...Safe Software
The National Fuels Treatments Initiative (NFT) is transforming wildfire mitigation by creating a standardized map of nationwide fuels treatment locations across all land ownerships in the United States. While existing state and federal systems capture this data in diverse formats, NFT bridges these gaps, delivering the first truly integrated national view. This dataset will be used to measure the implementation of the National Cohesive Wildland Strategy and demonstrate the positive impact of collective investments in hazardous fuels reduction nationwide. In Phase 1, we developed an ETL pipeline template in FME Form, leveraging a schema-agnostic workflow with dynamic feature handling intended for fast roll-out and light maintenance. This was key as the initiative scaled from a few to over fifty contributors nationwide. By directly pulling from agency data stores, oftentimes ArcGIS Feature Services, NFT preserves existing structures, minimizing preparation needs. External mapping tables ensure consistent attribute and domain alignment, while robust change detection processes keep data current and actionable. Now in Phase 2, we’re migrating pipelines to FME Flow to take advantage of advanced scheduling, monitoring dashboards, and automated notifications to streamline operations. Join us to explore how this initiative exemplifies the power of technology, blending FME, ArcGIS Online, and AWS to solve a national business problem with a scalable, automated solution.
Down the Rabbit Hole – Solving 5 Training RoadblocksRustici Software
Feeling stuck in the Matrix of your training technologies? You’re not alone. Managing your training catalog, wrangling LMSs and delivering content across different tools and audiences can feel like dodging digital bullets. At some point, you hit a fork in the road: Keep patching things up as issues pop up… or follow the rabbit hole to the root of the problems.
Good news, we’ve already been down that rabbit hole. Peter Overton and Cameron Gray of Rustici Software are here to share what we found. In this webinar, we’ll break down 5 training roadblocks in delivery and management and show you how they’re easier to fix than you might think.
ELNL2025 - Unlocking the Power of Sensitivity Labels - A Comprehensive Guide....Jasper Oosterveld
Sensitivity labels, powered by Microsoft Purview Information Protection, serve as the foundation for classifying and protecting your sensitive data within Microsoft 365. Their importance extends beyond classification and play a crucial role in enforcing governance policies across your Microsoft 365 environment. Join me, a Data Security Consultant and Microsoft MVP, as I share practical tips and tricks to get the full potential of sensitivity labels. I discuss sensitive information types, automatic labeling, and seamless integration with Data Loss Prevention, Teams Premium, and Microsoft 365 Copilot.
AI Agents in Logistics and Supply Chain Applications Benefits and ImplementationChristine Shepherd
AI agents are reshaping logistics and supply chain operations by enabling automation, predictive insights, and real-time decision-making across key functions such as demand forecasting, inventory management, procurement, transportation, and warehouse operations. Powered by technologies like machine learning, NLP, computer vision, and robotic process automation, these agents deliver significant benefits including cost reduction, improved efficiency, greater visibility, and enhanced adaptability to market changes. While practical use cases show measurable gains in areas like dynamic routing and real-time inventory tracking, successful implementation requires careful integration with existing systems, quality data, and strategic scaling. Despite challenges such as data integration and change management, AI agents offer a strong competitive edge, with widespread industry adoption expected by 2025.
TrustArc Webinar - 2025 Global Privacy SurveyTrustArc
How does your privacy program compare to your peers? What challenges are privacy teams tackling and prioritizing in 2025?
In the sixth annual Global Privacy Benchmarks Survey, we asked global privacy professionals and business executives to share their perspectives on privacy inside and outside their organizations. The annual report provides a 360-degree view of various industries' priorities, attitudes, and trends. See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar features an expert panel discussion and data-driven insights to help you navigate the shifting privacy landscape. Whether you are a privacy officer, legal professional, compliance specialist, or security expert, this session will provide actionable takeaways to strengthen your privacy strategy.
This webinar will review:
- The emerging trends in data protection, compliance, and risk
- The top challenges for privacy leaders, practitioners, and organizations in 2025
- The impact of evolving regulations and the crossroads with new technology, like AI
Predictions for the future of privacy in 2025 and beyond
Jeremy Millul - A Talented Software DeveloperJeremy Millul
Jeremy Millul is a talented software developer based in NYC, known for leading impactful projects such as a Community Engagement Platform and a Hiking Trail Finder. Using React, MongoDB, and geolocation tools, Jeremy delivers intuitive applications that foster engagement and usability. A graduate of NYU’s Computer Science program, he brings creativity and technical expertise to every project, ensuring seamless user experiences and meaningful results in software development.
Interested in leveling up your JavaScript skills? Join us for our Introduction to TypeScript workshop.
Learn how TypeScript can improve your code with dynamic typing, better tooling, and cleaner architecture. Whether you're a beginner or have some experience with JavaScript, this session will give you a solid foundation in TypeScript and how to integrate it into your projects.
Workshop content:
- What is TypeScript?
- What is the problem with JavaScript?
- Why TypeScript is the solution
- Coding demo
DevOps in the Modern Era - Thoughtfully Critical PodcastChris Wahl
https://youtu.be/735hP_01WV0
My journey through the world of DevOps! From the early days of breaking down silos between developers and operations to the current complexities of cloud-native environments. I'll talk about my personal experiences, the challenges we faced, and how the role of a DevOps engineer has evolved.
In this talk, Elliott explores how developers can embrace AI not as a threat, but as a collaborative partner.
We’ll examine the shift from routine coding to creative leadership, highlighting the new developer superpowers of vision, integration, and innovation.
We'll touch on security, legacy code, and the future of democratized development.
Whether you're AI-curious or already a prompt engineering, this session will help you find your rhythm in the new dance of modern development.
Bridging the divide: A conversation on tariffs today in the book industry - T...BookNet Canada
A collaboration-focused conversation on the recently imposed US and Canadian tariffs where speakers shared insights into the current legislative landscape, ongoing advocacy efforts, and recommended next steps. This event was presented in partnership with the Book Industry Study Group.
Link to accompanying resource: https://bnctechforum.ca/sessions/bridging-the-divide-a-conversation-on-tariffs-today-in-the-book-industry/
Presented by BookNet Canada and the Book Industry Study Group on May 29, 2025 with support from the Department of Canadian Heritage.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2025/06/how-qualcomm-is-powering-ai-driven-multimedia-at-the-edge-a-presentation-from-qualcomm/
Ning Bi, Vice President of Engineering at Qualcomm Technologies, presents the “How Qualcomm Is Powering AI-driven Multimedia at the Edge” tutorial at the May 2025 Embedded Vision Summit.
In this talk, Bi explores the evolution of multimedia processing at the edge, from simple early use cases such as audio and video processing powered by algorithm-centric approaches to modern sophisticated capabilities such as digital human avatars that are transmitted over the communication channel, powered by data-driven AI. He explains how Qualcomm is applying AI and generative AI technologies on the edge to enrich computer vision for new and high-quality visual solutions. He also shows how Qualcomm enables a broad range of OEMs, ODMs and third-party developers to harness innovative technologies via initiatives such as the Qualcomm AI Hub, which provides a library of optimized machine learning models to enable developers to quickly incorporate AI into their applications.
Trends Artificial Intelligence - Mary MeekerClive Dickens
Mary Meeker’s 2024 AI report highlights a seismic shift in productivity, creativity, and business value driven by generative AI. She charts the rapid adoption of tools like ChatGPT and Midjourney, likening today’s moment to the dawn of the internet. The report emphasizes AI’s impact on knowledge work, software development, and personalized services—while also cautioning about data quality, ethical use, and the human-AI partnership. In short, Meeker sees AI as a transformative force accelerating innovation and redefining how we live and work.
מכונות CNC קידוח אנכיות הן הבחירה הנכונה והטובה ביותר לקידוח ארונות וארגזים לייצור רהיטים. החלק נוסע לאורך ציר ה-x באמצעות ציר דיגיטלי מדויק, ותפוס ע"י צבת מכנית, כך שאין צורך לבצע setup (התאמות) לגדלים שונים של חלקים.
Domino IQ – What to Expect, First Steps and Use Casespanagenda
Webinar Recording: https://www.panagenda.com/webinars/domino-iq-what-to-expect-first-steps-and-use-cases/
HCL Domino iQ Server – From Ideas Portal to implemented Feature. Discover what it is, what it isn’t, and explore the opportunities and challenges it presents.
Key Takeaways
- What are Large Language Models (LLMs) and how do they relate to Domino iQ
- Essential prerequisites for deploying Domino iQ Server
- Step-by-step instructions on setting up your Domino iQ Server
- Share and discuss thoughts and ideas to maximize the potential of Domino iQ
Data Virtualization: Bringing the Power of FME to Any ApplicationSafe Software
Imagine building web applications or dashboards on top of all your systems. With FME’s new Data Virtualization feature, you can deliver the full CRUD (create, read, update, and delete) capabilities on top of all your data that exploit the full power of FME’s all data, any AI capabilities. Data Virtualization enables you to build OpenAPI compliant API endpoints using FME Form’s no-code development platform.
In this webinar, you’ll see how easy it is to turn complex data into real-time, usable REST API based services. We’ll walk through a real example of building a map-based app using FME’s Data Virtualization, and show you how to get started in your own environment – no dev team required.
What you’ll take away:
-How to build live applications and dashboards with federated data
-Ways to control what’s exposed: filter, transform, and secure responses
-How to scale access with caching, asynchronous web call support, with API endpoint level security.
-Where this fits in your stack: from web apps, to AI, to automation
Whether you’re building internal tools, public portals, or powering automation – this webinar is your starting point to real-time data delivery.
Boosting MySQL with Vector Search -THE VECTOR SEARCH CONFERENCE 2025 .pdfAlkin Tezuysal
As the demand for vector databases and Generative AI continues to rise, integrating vector storage and search capabilities into traditional databases has become increasingly important. This session introduces the *MyVector Plugin*, a project that brings native vector storage and similarity search to MySQL. Unlike PostgreSQL, which offers interfaces for adding new data types and index methods, MySQL lacks such extensibility. However, by utilizing MySQL's server component plugin and UDF, the *MyVector Plugin* successfully adds a fully functional vector search feature within the existing MySQL + InnoDB infrastructure, eliminating the need for a separate vector database. The session explains the technical aspects of integrating vector support into MySQL, the challenges posed by its architecture, and real-world use cases that showcase the advantages of combining vector search with MySQL's robust features. Attendees will leave with practical insights on how to add vector search capabilities to their MySQL systems.
2. Overview
Functions
Definition
Role functions
Types of functions
Communication in functions
Types of variables
Recursion
Program demos
Pointers
Uses of pointers
Declaration of pointers
Errors
Definition
Types of errors
Testing
Qualities of a good program
3. Functions
Self contained block of statements which performs a particular task and
returns a value.
The function contains the set of programming statements enclosed by {}.
Collection of functions creates a C program i.e
C = main() + add() + sum() + ….. +last()
Function also called module, block, partition, procedure, subroutine
Every C program must have the main()
Check the role of main() [ 2 main / key roles ]
4. Importance of functions in a program
Facilitate code Re-use
Facilitate program expansion
Facilitate the location and isolation of faulty functions in a program
Facilitate top down programming
5. Types of functions
1. Library Functions: Functions which are
declared in the C header files such as
scanf(), printf(), gets(), puts(), ceil(), floor(),
sqrt(), pow() etc.
Functions which have been coded, compiled
and utilized in other programs.
2. User-defined functions: Functions which
are created by the C programmer, so that
he/she can use it many times. It reduces the
complexity of a big program and optimizes
the code.
6. Communication in functions
Functions communicate by passing messages.
Three concepts in functions that are very important:
Function declaration
Function call
Function definition
User defined functions must be declared before they are used in the
program.
7. Program demo for functions
/* functions demo program */
#include<stdio.h>
#include<conio.h>
void japan();
void china();
int main()
{
printf(“n initially in main functionn”);
japan();
printf(“nfrom japan n”);
china();
printf(“nfrom china n”);
return 0;
}
void china()
{
printf(“n iam in china n”);
}
void japan()
{
printf(“n iam in japan n”);
}
8. Concepts of functions
1. Function Declaration:
Done outside all other functions [ between header files and main() ]
Syntax:
return_type function_name(return_type1 arg1, ……);
E.g, int addition(int a, int b, int c);
Declaration informs the compiler about the following:
Return type of the function
Function name
Return types of parameters in the argument list.
Number of parameters in the argument list
Nb: Declaration creates a template / structure of the function. This structure will
be used to link the function call and function definition.
12. Pass by value
Call/Pass by value is the process where the copies of the actual parameters
are passed in one to one correspondence to the formal parameters in the
function definition. Therefore, any changes made in the formal parameters do
not affect the actual parameters.
e.g, int addition(int a, int b, int c);
Copies
int addition(int x, int y, int z)
Nb: Variables a, b, c are called actual parameters
Variables x, y, z are called formal parameters
13. /* Pass by Value*/
#include<stdio.h>
#include<conio.h>
int badilisha(int, int);
int main()
{
int a=5, b=7;
printf("nOriginal valuesn");
printf("na = %dt", a);
printf("b = %dn",b);
badilisha(a,b);
printf("nValue after interchangen");
printf("na = %dt", a);
printf("b = %dn",b);
return 0;
}
int badilisha(int x, int y)
{
int z;
z = x;
x = y;
y = z;
printf("nValues in function
definitin");
printf("na = %dt", x);
printf("b = %dn",y);
}
14. Pass by reference
Call by reference is the process where the original values are passed to the
corresponding function definition. Any changes made in the function definition
affects the actual parameters.
eg int addition(int &a, int &b, int &c);
int addition(int *x, int *y, int *z)
Pass by reference uses the concept of pointers:
15. 5
Operators used in Pointers
& Ampersand
Address of operator
Returns the address where the variable is residing in the memory
* Asterisk
Value at address operator
returns the value contained in the address
Let a = 5;
a
5
6500
16. Pointers
Variable which stores the address of another variable.
Pointer variables can be of type i.e, int, float, char, array, function, etc.
Pointers are user defined datatypes
Syntax for declaration:
return type *variable_name;
int *ptr;
char *c;
17. /* Pass by Reference*/
#include<stdio.h>
#include<conio.h>
int swap(int *x, int *y);
int main()
{
int a=5, b=7;
printf("nOriginal valuesn");
printf("na = %dt", a);
printf("b = %dn",b);
badilisha(&a,&b);
printf("nValue after interchangen");
printf("na = %dt", a);
printf("b = %dn",b);
return 0;
}
int badilisha(int *x, int *y)
{
int z;
z = *x;
*x = *y;
*y = z;
printf("nValues in function
definitionn");
printf("na = %dt", *x);
printf("b = %dn", *y);
}
18. Advantages / uses of pointers
Reduces the code and improves the performance, it is used to retrieving strings,
trees, etc. and used with arrays, structures, and functions.
We can return multiple values from a function using the pointer.
It makes you able to access any memory location in the computer's memory.
Dynamic memory allocation
c language, we can dynamically allocate memory using malloc() and calloc()
functions
Arrays, Functions, and Structures
C language pointers are widely used in arrays, functions, and structures.
19. Types of variables
Local variables:
Variables declared within a function. Lifetime and the scope is within the
function for which it is declared.
Global variables:
Variables declared outside all other functions in the program. Lifetime and
the scope is the entire program
20. Program example
/* Types of Variable*/
#include<stdio.h>
#include<conio.h>
int a = 20;
int show();
int main()
{
int a = 10;
printf("n a = %dn",a);
show();
return 0;
}
int show()
{
printf("n a = %dn", a);
return 0;
}
21. Storage Classes in C
Storage classes in C are used to determine the lifetime, visibility,
memory location, and initial value of a variable.
There are four types of storage classes in C:
Automatic
External
Static
Register
22. Storage
Classes
Storage
Place
Default
Value
Scope Lifetime
auto RAM Garbage Value Local Within function
extern RAM Zero Global Whole program
static RAM Zero Local Till the end of the main program,
Retains value between multiple
functions call
register Register Garbage Value Local Within the function
Storage Classes in C
23. Recursion in C
A process where a function calls itself several times; e.g,
/*Recursion */
#include<stdio.h>
#include<conio.h>
int main()
{
printf("nExample of recursionn");
main();
return 0;
}
24. /*factorial of any value */
#include <stdio.h>
#include<conio.h>
int fact(int);
int main()
{
int n,f;
printf("Enter valuen");
scanf("%d",&n);
f = fact(n);
printf("factorial = %dn", f);
}
int fact(int n)
{
int res = 1;
if (n==0)
{
return res;
}
else if ( n == 1)
{
return res;
}
else
{
res = res * n*fact(n-1);
return res;
}
25. Errors
Problems or faults that occur in the program, which makes the behavior of the
program abnormal.
Also known as the bugs or faults
Detected either during the time of compilation or execution.
The process of removing these bugs is known as debugging.
Types of errors
1. Syntax error
2. Run-time error
3. Logical error
4. Latent / Hidden errors
5. Semantic error
26. Syntax error
Errors that occur as a result of the violation of the rules of the language;
Detected by the compiler at compilation time.
Commonly occurred syntax errors are:
If we miss the parenthesis (}) while writing the code.
Displaying the value of a variable without its declaration.
If we miss the semicolon (;) at the end of the statement.
#include <stdio.h>
int main()
{
a = 10;
printf("The value of a is : %d", a);
return 0;
}
27. Runtime error
Errors that occur at runtime.
Detected by the compiler when running the program.
Examples
Mismatch of data types
Trying to open a file which is not created
Lack of free memory space.
28. Logical error
Errors that occur as a result of poor understanding of the logic.
Compiler cannot detect such errors.
Program runs and outputs results but results are wrong.
29. Latent error
Errors that are only visible when some set of values are used in the program.
Example:
result = (a + b) /(a – b);
Let1 a = 10, b = 5;
Output: result = 3
Let2 a = 5, b = 5;
Output: division by zero
30. Semantic error
Errors that occurred when the statements are not understandable by the compiler. E.g,
Use of a un-initialized variable.
int i;
i=i+2;
Type compatibility
int b = "javatpoint";
Errors in expressions
int a, b, c;
a+b = c;
31. Testing
The process of evaluating a system or its component(s) with the intent to find
whether it satisfies the specified requirements or not.
Executing a system in order to identify any gaps, errors, or missing
requirements in contrary to the actual requirements.
The process of analyzing a software item to detect the differences between
existing and required conditions (that is defects/errors/bugs) and to evaluate the
features of the software item.
32. Criteria for testing a program
1. Accuracy
2. Functionality
3. Reliability
4. Usability
5. Efficiency
6. Maintainability
7. Portability
8. Robustness
9. User friendliness
10. Completeness
11. Consistency