Recursive functions in C

Jun 10, 2020Download as pptx, pdf1 like279 views

1. A recursive function is a function that calls itself, either directly or indirectly. It is related to mathematical induction. 2. Examples of inherently recursive functions include calculating factorials and finding terms in the Fibonacci series recursively. 3. Recursive functions require a base or stop condition to return the final value, otherwise the function will keep calling itself indefinitely. Pseudocode and C code examples are provided to find factorials, sum of natural numbers, and Fibonacci series recursively.

SESSION – 20
RECURSIVE FUNCTION
Session Outcome:
1. Understanding Recursive Functions
2. Examples Of Recursive Functions

Recursive Functions
• Recursive function is closely related to
mathematical induction
• Recursive function is a function that calls itself
• Every Recursive function will have exit or stop
condition
– other wise the recursive function will keep on
calling itself
Wednesday, June 10, 2020
For suggestions or queries contact
drkrk@kluniversity.in

Inherently recursive functions
5!
5*4!
4*3!
3*2!
2*1!
1
5!
5*4!
4*3!
3*2!
2*1!
1
Final value=120
1
2!=2*1=2 returned
3!=3*2=6 returned
4!=4*6=24 returned
5!=5*24=120 returned

Finding Factorial Recursively
Wednesday, June 10, 2020
For suggestions or queries contact
drkrk@kluniversity.in
fact(5)
5*fact(4)
4*fact(3)
3*fact(2)
2*fact(1)1
2
6
24
120

Finding Factorial Recursively
𝑓𝑎𝑐𝑡 𝑛 =
1 𝑖𝑓 𝑛 == 0 𝑜𝑟 𝑛 == 1
𝑛 ∗ 𝑓𝑎𝑐𝑡 𝑛 − 1 𝑖𝑓 𝑛 > 1
Wednesday, June 10, 2020
For suggestions or queries contact
drkrk@kluniversity.in
Corresponding Recursive Function
int fact(int n)
{
if(n ==1 || n ==0)
return 1;
else
return n*fact(n-1);
}

Finding Factorial Recursively
Complete program is:
#include<stdio.h>
int fact(int);
main()
{
int n;
scanf("%d",&n);
printf("%d",fact(n));
}
int fact(int n)
{
if(n ==1 || n ==0)
return 1;
else
return n*fact(n-1);
}

Sum of Natural Numbers Recursively
Wednesday, June 10, 2020
For suggestions or queries contact
drkrk@kluniversity.in
𝑠𝑢𝑚 𝑛 =
1 𝑖𝑓 𝑛 == 1
𝑛 + 𝑠𝑢𝑚 𝑛 − 1 𝑖𝑓 𝑛 > 1
Corresponding Recursive Function
int sum(int n)
{
if(n ==1)
return 1;
else
return n + sum(n-1);
}

Finding nth term in Fibonacci Series Recursively
𝑓𝑖𝑏 𝑛 =
0 𝑖𝑓 𝑛 == 0
1 𝑖𝑓 𝑛 == 1
𝑓𝑖𝑏 𝑛 − 1 + 𝑓𝑖𝑏 𝑛 − 2 𝑖𝑓 𝑛 > 1
Corresponding Recursive Function
int fib(int n)
{
if( n ==0)
return 0;
if( n ==1)
return 1;
else
return fib(n-1)*fib(n-2);
}

This document discusses polymorphism in C++. It defines static polymorphism as function overloading and overriding, where functions can have the same name but different parameters. Dynamic polymorphism uses virtual functions and runtime binding via pointers. Virtual functions allow overriding in derived classes. Pure virtual functions make a class abstract, requiring implementation in derived classes. Interface classes are like abstract classes but inheritance is not required.

Stack using ArraySayantan Sur

Pointers in c++Vineeta Garg

Pointer is a variable that stores the memory address of another variable. It allows dynamic memory allocation and access of memory locations. There are three ways to pass arguments to functions in C++ - pass by value, pass by reference, and pass by pointer. Pass by value copies the value, pass by reference copies the address, and pass by pointer passes the address of the argument. Pointers can also point to arrays or strings to access elements. Arrays of pointers can store multiple strings. References are alternative names for existing variables and any changes made using the reference affect the original variable. Functions can return pointers or references.

C Programming: Control StructureSokngim Sa

stack presentationShivalik college of engineering

Inline functionTech_MX

The document discusses inline functions in C++. Inline functions allow code from a function to be pasted directly into the call site rather than executing a function call. This avoids overhead from calling and returning from functions. Good candidates for inline are small, simple functions called frequently. The document provides an example of a function defined with the inline keyword and the optimizations a compiler may perform after inlining. It also compares inline functions to macros and discusses where inline functions are best used.

Programming in c Arraysjanani thirupathi

An array is a collection of data that holds a fixed number of values of the same type. Arrays allow storing multiple values in a single variable through indices. There are one-dimensional, two-dimensional, and multi-dimensional arrays. One-dimensional arrays use a single subscript, two-dimensional arrays use two subscripts like rows and columns, and multi-dimensional arrays can have more than two subscripts. Arrays can be initialized during declaration with values or initialized at runtime by user input or other methods. Elements are accessed using their indices and operations can be performed on the elements.

Chapter 08 data file handlingPraveen M Jigajinni

The document discusses data file handling in Python. It covers the basics of opening, reading from, and writing to both text and binary files. The key points covered include: opening and closing files, different file access modes, reading methods like readline(), readlines(), and read(), writing methods like write() and writelines(), random access methods like seek() and tell(), pickling and unpickling using the pickle module, and the differences between text and binary files.

Functions in CKamal Acharya

This document discusses different types of functions in C programming. It defines library functions, user-defined functions, and the key elements of functions like prototypes, arguments, parameters, return values. It categorizes functions based on whether they have arguments and return values. The document also explains how functions are called, either by value where changes are not reflected back or by reference where the original values are changed.

Dynamic memory allocationViji B

Dynamic memory allocation allows programs to request memory from the operating system at runtime. This memory is allocated on the heap. Functions like malloc(), calloc(), and realloc() are used to allocate and reallocate dynamic memory, while free() releases it. Malloc allocates a single block of uninitialized memory. Calloc allocates multiple blocks of initialized (zeroed) memory. Realloc changes the size of previously allocated memory. Proper use of these functions avoids memory leaks.

Loops in c programmingCHANDAN KUMAR

TemplatesPranali Chaudhari

C++ supports templates to implement generic programming. Templates allow generating a family of classes or functions to handle different data types. A class created from a class template is called a template class. The process of creating a template class is known as instantiation. Like other functions, template functions can be overloaded. Non-type parameters can also be used as arguments for templates.

Single linked listjasbirsingh chauhan

A linked list is a series of nodes where each node contains data and a pointer to the next node. Each node is a separate allocation of memory containing the data and a link/pointer to the next node. Common operations on linked lists include adding nodes, removing nodes, counting nodes, traversing the list, and sorting the data. Linked lists allow for efficient insertion/removal of nodes compared to arrays but are slower to access individual elements.

Types of loops in c languagesneha2494

The document discusses the different types of loops in C language: while loop, do-while loop, and for loop. It provides the syntax and an example of each loop. The while loop checks the condition first and repeats the block of code as long as the condition is true. The do-while loop ensures the block of code executes at least once before checking the condition. The for loop allows initialization of a counter, specifies a condition to test, and how to change the counter between iterations of the loop.

Function in CDr. Abhineet Anand

The document discusses functions in C programming. It defines a function as a self-contained block of code that performs a specific task. Functions make code more modular and reusable. There are two types of functions: standard/library functions and user-defined functions. Functions can take input parameters and return values. Functions are an essential part of program structure in C as they help organize code and logic.

Inheritance in c++Paumil Patel

This document discusses inheritance in C++. It defines inheritance as a mechanism that allows classes to acquire properties from other classes. The class that inherits properties is called the derived or child class, while the class being inherited from is called the base or parent class. The key advantages of inheritance are that it saves memory, time, and development efforts by promoting code reuse. The document provides examples of single inheritance with one parent and one child class, and multiple inheritance with a class inheriting from multiple parent classes.

Function overloading(c++)Ritika Sharma

07. Virtual FunctionsHaresh Jaiswal

C programming language tutorial javaTpoint s

The document provides an overview of the C programming language. It states that C was developed in 1972 by Dennis Ritchie at Bell Labs and was used to develop the UNIX operating system. The document then covers various features of C like it being a mid-level programming language, having structured programming, pointers, loops, functions, arrays, and more. It provides examples to explain concepts like input/output functions, data types, operators, control structures, and pointers.

Pointer to function 1Abu Bakr Ramadan

Abstract Data TypeskarthikeyanC40

The document discusses abstract data types (ADTs). It defines an ADT as a collection of data together with a set of operations on that data. An ADT specifies what data can be stored and what operations can be performed. Simple ADTs are predefined types like integers, while complex ADTs like lists are user-defined. Lists are presented as an example complex ADT, with elements ordered in a sequence and operations to insert, find, delete and traverse elements.

Data structure by DigvijayDigvijay Singh Karakoti

This document discusses stacks, which are non-linear data structures that follow the LIFO (last in, first out) principle. Stacks have operations like push and pop that insert and remove elements from the top of the stack. Pushing adds an element and increments the top pointer, while popping removes an element and decrements the top pointer. Stacks have applications in expression evaluation, memory management, and recursion. The document provides algorithms and code examples for implementing push and pop operations on a stack.

RECURSION IN C v_jk

Functions allow programmers to break programs into smaller, reusable parts. There are two types of functions in C: library functions and user-defined functions. User-defined functions make programs easier to understand, debug, test and maintain. Functions are declared with a return type and can accept arguments. Functions can call other functions, allowing for modular and structured program design.

StringsMitali Chugh

The document discusses strings in C programming. It defines strings as sequences of characters stored as character arrays that are terminated with a null character. It covers string literals, declaring and initializing string variables, reading and writing strings, and common string manipulation functions like strlen(), strcpy(), strcmp(), and strcat(). These functions allow operations on strings like getting the length, copying strings, comparing strings, and concatenating strings.

Constructors and Destructor in C++International Institute of Information Technology (I²IT)

RecursionEsther Leytush

Recursion is defined as a function that calls itself. It solves a larger problem by breaking it down into smaller instances of the same problem. A recursive function must have a base case, where it stops calling itself, and it builds solutions up the call stack until the base case is reached. Examples of recursive functions include calculating factorials, Fibonacci sequences, and tree/graph traversals. While powerful, recursion risks stack overflow errors if not implemented properly.

Recursion cps.pptxSivaramakrishnaKapil

Rahul K discussed recursion in his topic. Recursion is a method of solving problems by breaking them down into smaller instances of the same problem. There are two types of recursion: direct recursion, where a function calls itself, and indirect recursion, where a function calls another function that eventually calls the original function. An example of direct recursion is a factorial function that returns n * fact(n-1), continually calling itself with decreasing values of n until the base case of n == 0 is reached.

More Related Content

What's hot (20)

Inline functionTech_MX

Programming in c Arraysjanani thirupathi

Chapter 08 data file handlingPraveen M Jigajinni

Functions in CKamal Acharya

Dynamic memory allocationViji B

Loops in c programmingCHANDAN KUMAR

TemplatesPranali Chaudhari

Single linked listjasbirsingh chauhan

Types of loops in c languagesneha2494

Function in CDr. Abhineet Anand

Inheritance in c++Paumil Patel

Function overloading(c++)Ritika Sharma

07. Virtual FunctionsHaresh Jaiswal

C programming language tutorial javaTpoint s

Pointer to function 1Abu Bakr Ramadan

Abstract Data TypeskarthikeyanC40

Data structure by DigvijayDigvijay Singh Karakoti

RECURSION IN C v_jk

StringsMitali Chugh

Constructors and Destructor in C++International Institute of Information Technology (I²IT)

Inline functionTech_MX

Programming in c Arraysjanani thirupathi

Chapter 08 data file handlingPraveen M Jigajinni

Functions in CKamal Acharya

Dynamic memory allocationViji B

Loops in c programmingCHANDAN KUMAR

TemplatesPranali Chaudhari

Single linked listjasbirsingh chauhan

Types of loops in c languagesneha2494

Function in CDr. Abhineet Anand

Inheritance in c++Paumil Patel

Function overloading(c++)Ritika Sharma

07. Virtual FunctionsHaresh Jaiswal

C programming language tutorial javaTpoint s

Pointer to function 1Abu Bakr Ramadan

Abstract Data TypeskarthikeyanC40

Data structure by DigvijayDigvijay Singh Karakoti

RECURSION IN C v_jk

StringsMitali Chugh

Constructors and Destructor in C++International Institute of Information Technology (I²IT)

Similar to Recursive functions in C (20)

RecursionEsther Leytush

Recursion cps.pptxSivaramakrishnaKapil

Recursion c programming.pptxSivaramakrishnaKapil

RecursionAbdur Rehman

Recursion is a process where an object is defined in terms of smaller versions of itself. It involves a base case, which is the simplest definition that cannot be further reduced, and a recursive case that defines the object for larger inputs in terms of smaller ones until the base case is reached. Examples where recursion is commonly used include defining mathematical functions, number sequences, data structures, and language grammars. While recursion can elegantly solve problems, iterative algorithms are generally more efficient.

Lec-32 Recursion -Recursion in Computer ScienceAnil Yadav

CMSC 56 | Lecture 12: Recursive Definition & Algorithms, and Program Correctnessallyn joy calcaben

This document discusses recursive definitions, algorithms, and program correctness. It provides examples of recursively defining functions and sets using a basis step and recursive step. Examples of recursive algorithms are given for computing factorials and exponentials. The difference between recursion and iteration is explained. Program verification and correctness are defined, and examples are worked through to show initial and final assertions for program segments. The document concludes with an announcement about an upcoming exam.

Lecture09 recursionHariz Mustafa

Lec-6 Recursion of Data Structures & Algorithmshaseebanjum2611

14 recursionHimadri Sen Gupta

This document discusses recursion in programming. Recursion is when a function calls itself, either directly or indirectly. For a recursive function to work properly it must have a base case, which provides the terminating condition, and make progress toward the base case with each recursive call. Examples of recursively defined functions include factorials, powers, Fibonacci numbers, and towers of Hanoi. Recursion allows for simple programming of some complex problems but iterative solutions may have better performance due to less function call overhead.

RecursionJesmin Akhter

The document discusses recursion, which is a technique that solves a problem by solving smaller instances of the same problem. It provides examples of recursive functions, including factorial, combinations, multiplication, Fibonacci, and greatest common divisor (GCD). Recursive functions contain a base case with a straightforward solution and recursively define the problem in terms of smaller instances until reaching the base case. C uses a call stack to maintain the state of each recursive call.

WT-Pravesh Sakhare.pptxTuleshwarGupta1

This document discusses recursion through examples of recursive functions and recursive processes on linked lists. It provides examples of the factorial function written recursively and explains the base case and guidelines for writing recursive functions, including having a base case, each call approaching the base case, the base case working for the recursive call, and the function making logical sense assuming the recursive call works. It also gives an example of searching a linked list recursively.

L16FALLEE31188

Recursion DMRokonuzzaman Rony

The document discusses recursion and recursively defined sequences, functions, and algorithms. It provides examples of recursively defined sequences like powers of 2 and the Fibonacci sequence. Recursively defined functions are given, such as factorials and Fibonacci numbers. Recursive algorithms solve problems by reducing them to smaller instances of the same problem, like the Euclidean algorithm to find the greatest common divisor or a recursive Fibonacci algorithm. While recursive solutions are often shorter and more elegant, iterative algorithms using loops are usually more efficient.

PROGRAMMING IN C EXAMPLE PROGRAMS FOR NEW LEARNERS - SARASWATHI RAMALINGAMSaraswathiRamalingam

Fundamental Algorithms, Exchanging the values of Two Variables,Counting,Summation of a Set of Numbers,Factorial Computation ,Sine Function Computation ,Generation of the Fibonacci Sequence,Reversing the Digits of an Integer,Base Conversion , Character to Number Conversion , Factoring Methods: Finding the square Root of a Number ,The Smallest Divisor of an Integer,The Greatest Common Divisor of the two integers,Generating Prime Numbers,Computing the Prime Factors of an integer ,Generation of Pseudo,random Numbers,Raising a Number to a Large Power,Computing the nth Fibonacci Number,thiruvalluvar university syllabus,unit 5,computer science basics,new syllabus,programming in c,example program in c,

recursion2Mohamed Elsayed

In this playlist https://youtube.com/playlist?list=PLT... I'll illustrate algorithms and data structures course, and implement the data structures using java programming language. the playlist language is arabic. The Topics: -------------------- 1- Arrays 2- Linear and Binary search 3- Linked List 4- Recursion 5- Algorithm analysis 6- Stack 7- Queue 8- Binary search tree 9- Selection sort 10- Insertion sort 11- Bubble sort 12- merge sort 13- Quick sort 14- Graphs 15- Hash table 16- Binary Heaps Reference : Object-Oriented Data Structures Using Java - Third Edition by NELL DALE, DANEIEL T.JOYCE and CHIP WEIMS Slides is owned by College of Computing & Information Technology King Abdulaziz University, So thanks alot for these great materials

recursion, syntax, types, example programletheyabala

3-Recursive Function in programming .pptxnaushigrdcs

Simple program recursion problem solving.pptxswethab129

Recursion in CLakshmi Sarvani Videla

C program to find factorial of number using recursion as well as iteration , Calculate power of a number program in c using Recursion and Iteration, Write a C program to count digits of a number using Recursion and Iteration, Write a C program to find sum of first n natural numbers using Recursion, C program to print sum of digits of a given number using recursion ,Write a C program to find nth term in Fibonacci Series using Recursion, C program to find out the GCD (Greatest Common Divisor )of the two numbers using recursion, Write a C program to find the first upper case letter in the given string using recursion, write C program to calculate length of the string using Recursion , Write a program in C to count number of divisors of a given number using recursion, Recursive program to check whether a given number is prime or composite, C program to displays integers 100 through 1 using Recursion and Iteration, Write a program in C to convert a decimal number to binary using recursion, Recursion Stack of factorial of 3 Recursion stack of 4th term of Fibonacci

PyOhio Recursion SlidesRinita Gulliani

The document provides an introduction to recursion through a presentation on defining the factorial function recursively. It begins by explaining why recursion is an important concept for technical interviews. It then defines recursion conceptually, using the factorial function to illustrate a recursive definition. It emphasizes the need for a base case to terminate the recursion. The presentation walks through defining the factorial function recursively step-by-step and translates the definition into code. It concludes by providing tips for approaching recursive problems in general.

RecursionEsther Leytush

Recursion cps.pptxSivaramakrishnaKapil

Recursion c programming.pptxSivaramakrishnaKapil

RecursionAbdur Rehman

Lec-32 Recursion -Recursion in Computer ScienceAnil Yadav

CMSC 56 | Lecture 12: Recursive Definition & Algorithms, and Program Correctnessallyn joy calcaben

Lecture09 recursionHariz Mustafa

Lec-6 Recursion of Data Structures & Algorithmshaseebanjum2611

14 recursionHimadri Sen Gupta

RecursionJesmin Akhter

WT-Pravesh Sakhare.pptxTuleshwarGupta1

L16FALLEE31188

Recursion DMRokonuzzaman Rony

PROGRAMMING IN C EXAMPLE PROGRAMS FOR NEW LEARNERS - SARASWATHI RAMALINGAMSaraswathiRamalingam

recursion2Mohamed Elsayed

recursion, syntax, types, example programletheyabala

3-Recursive Function in programming .pptxnaushigrdcs

Simple program recursion problem solving.pptxswethab129

Recursion in CLakshmi Sarvani Videla

PyOhio Recursion SlidesRinita Gulliani

More from Lakshmi Sarvani Videla (20)

Data Science Using PythonLakshmi Sarvani Videla

Logistic regression fits an S-shaped curve to categorical or binary data to predict class membership. It calculates probabilities of class membership based on predictor variables. Hierarchical clustering builds a hierarchy of clusters through a bottom-up approach by initially treating each data point as its own cluster, then recursively merging the closest pairs of clusters until all are merged into one cluster. Multiple regression finds relationships between one continuous dependent variable and multiple independent variables by fitting a linear equation to the data and estimating coefficients using methods like least squares or maximum likelihood estimation.

Programs on multithreadingLakshmi Sarvani Videla

Menu Driven programs in JavaLakshmi Sarvani Videla

This document discusses menu-driven programs in Java. It provides examples of using switch statements, infinite loops, and do-while loops to create menu options. The key aspects covered are: 1) Menu-driven programs allow a user to select options from a menu to trigger different parts of a program. 2) Switch statements can be used to evaluate a variable and run different code blocks based on its value. 3) Infinite loops coupled with switch statements are well-suited for menu programs, allowing the menu to repeat until a quit option is selected. 4) Do-while loops guarantee the code block runs at least once before evaluating the while condition, suitable for menus requiring an initial display

Simple questions on structures conceptLakshmi Sarvani Videla

The document describes two projects: an employee management system and a voting system. The employee system stores details of employees and their children, including ID, name, age, gender, salary, and children's names, ages, and percentages. It lists employees with salary over $20,000 and children over 75%. The voting system stores candidate names, ages, and votes in 3 regions using an array in a structure. It adds new candidates and displays total votes for each candidate across all 3 regions.

Errors incompetitiveprogrammingLakshmi Sarvani Videla

The document discusses common programming errors like wrong answer, run time error (SIGSEGV), and time limit exceeded error. It provides examples to explain these errors. Wrong answer can occur due to wrong logic or choice of data type. Run time error (SIGSEGV) is caused by invalid memory reference like accessing an array out of bounds. Time limit exceeded error happens when a loop runs infinitely without a break. Violating constraints like string length limit can also cause segmentation fault.

Relational Operators in CLakshmi Sarvani Videla

The document discusses algorithms and flowcharts for conditional and iterative problems. It provides examples and solutions for writing algorithms and flowcharts to determine voter eligibility based on age, print all natural numbers from 1 to N, and find the biggest of two or three numbers. It also includes practice problems for students to write algorithms and flowcharts to solve problems related to discounts based on order quantity and calculating the sum of two numbers using functions. The document aims to help students understand how to design algorithms and flowcharts for conditional and iterative problems.

Function Pointer in CLakshmi Sarvani Videla

This document discusses function pointers, call by value, and call by reference. It defines a function pointer as storing the address of a function. It explains the steps to declare a function pointer and provides an example. It then describes call by value as copying the value of actual parameters into formal parameters, so changes within the function are not reflected in the original variables. Finally, it defines call by reference as passing the reference/address of the original variable, allowing the function to directly modify the original data.

FunctionsLakshmi Sarvani Videla

Functions allow programmers to break programs into smaller, more manageable units called functions to make programs more modular and easier to write and debug; functions contain elements like a function prototype, parameters, definition, and body; and there are different types of functions like user-defined functions, library functions, and categories of functions based on whether they have arguments or return values.

Java sessionnotesLakshmi Sarvani Videla

Here is the Cuboid class with private instance variables, public volume() method, setter and getter methods as specified in the question: public class Cuboid { private double length; private double breadth; private double height; public double volume() { return length * breadth * height; } public boolean setLength(double len) { if(len > 0) { this.length = len; return true; } return false; } public boolean setBreadth(double bre) { if(bre > 0) { this.breadth = bre; return true; } return false; } public boolean setHeight(double hei

Singlelinked listLakshmi Sarvani Videla

GraphsLakshmi Sarvani Videla

B treesLakshmi Sarvani Videla

B-trees are used for indexing and have a specified order that determines the maximum number of keys per node. The document demonstrates inserting elements into an empty B-tree of order 3, showing how nodes split as they exceed the maximum 2 keys per node, with the splitting element moving up the tree. Elements are inserted into nodes based on being less than or greater than splitting keys, maintaining the binary search tree property.

Functions in python3Lakshmi Sarvani Videla

1) Functions in Python allow for modular and reusable code. A function is defined using the def keyword followed by the function name and parameters. 2) Functions can take arguments, including default, required, keyword, and arbitrary arguments. They can also return single or multiple values. 3) Local variables exist only inside the function whereas global variables can be accessed inside and outside the function. The global keyword is used to modify global variables from within a function.

DictionaryLakshmi Sarvani Videla

Dictionaries in Python are used to store data values in key-value pairs. A dictionary is a collection of key-value pairs that is unordered, changeable and indexed. Dictionaries use curly brackets, and contain keys and their associated values. Values can be accessed, added, changed, removed or looped through by referring to keys. Common dictionary methods allow checking for keys, getting lengths, copying and defaulting values.

SetsLakshmi Sarvani Videla

ListsLakshmi Sarvani Videla

This document provides an overview of lists in Python. It defines lists as ordered and changeable collections that allow duplicate elements. It describes how to create, access, modify, loop through, add and remove elements from lists. Built-in list methods like append(), pop(), sort(), count() and their usage are explained. The document also shows examples of sorting lists, removing failed grades, shuffling words to create anagrams, and reading/writing lists from user input.

DataStructures notesLakshmi Sarvani Videla

Solutionsfor co2 C Programs for data structuresLakshmi Sarvani Videla

The document contains questions and program code snippets related to data structures and algorithms topics. 1) The first section contains a program to remove negative values from a queue using arrays as the underlying data structure. 2) The second section shows functions to implement enqueue, dequeue and display operations on a circular queue using arrays. 3) The third section contains a program to implement an ascending priority queue as a linked list.

C programsLakshmi Sarvani Videla

The document contains questions and program code related to C programming and data structures. Some key points: - There are questions on sorting arrays, checking for loops in arrays, nested structures, sorting based on dates of birth, and implementing functions for book-author-shelf structures. - Program code is provided as solutions to these questions, making use of structures, pointers, functions, and linked lists. - One question asks to write a function to sort records in a linked list based on social security number, and code for creating, displaying, and sorting a linked list is given.

Data Mining: Data PreprocessingLakshmi Sarvani Videla

This document discusses various techniques for data preprocessing, including data cleaning, integration and transformation, reduction, and discretization. It provides details on techniques for handling missing data, noisy data, and data integration issues. It also describes methods for data transformation such as normalization, aggregation, and attribute construction. Finally, it outlines various data reduction techniques including cube aggregation, attribute selection, dimensionality reduction, and numerosity reduction.

Data Science Using PythonLakshmi Sarvani Videla

Programs on multithreadingLakshmi Sarvani Videla

Menu Driven programs in JavaLakshmi Sarvani Videla

Simple questions on structures conceptLakshmi Sarvani Videla

Errors incompetitiveprogrammingLakshmi Sarvani Videla

Relational Operators in CLakshmi Sarvani Videla

Function Pointer in CLakshmi Sarvani Videla

FunctionsLakshmi Sarvani Videla

Java sessionnotesLakshmi Sarvani Videla

Singlelinked listLakshmi Sarvani Videla

GraphsLakshmi Sarvani Videla

B treesLakshmi Sarvani Videla

Functions in python3Lakshmi Sarvani Videla

DictionaryLakshmi Sarvani Videla

SetsLakshmi Sarvani Videla

ListsLakshmi Sarvani Videla

DataStructures notesLakshmi Sarvani Videla

Solutionsfor co2 C Programs for data structuresLakshmi Sarvani Videla

C programsLakshmi Sarvani Videla

Data Mining: Data PreprocessingLakshmi Sarvani Videla

Recently uploaded (20)

A Comprehensive Guide on Integrating Monoova Payment Gatewaydanielle hunter

System Card: Claude Opus 4 & Claude Sonnet 4Razin Mustafiz

The fundamental misunderstanding in Team TopologiesPatricia Aas

Kubernetes Cloud Native Indonesia Meetup - May 2025Prasta Maha

Marko.js - Unsung Hero of Scalable Web Frameworks (DevDays 2025)Eugene Fidelin

Marko.js is an open-source JavaScript framework created by eBay back in 2014. It offers super-efficient server-side rendering, making it ideal for big e-commerce sites and other multi-page apps where speed and SEO really matter. After over 10 years of development, Marko has some standout features that make it an interesting choice. In this talk, I’ll dive into these unique features and showcase some of Marko's innovative solutions. You might not use Marko.js at your company, but there’s still a lot you can learn from it to bring to your next project.

Reducing Bugs With Static Code Analysis php tek 2025Scott Keck-Warren

With Claude 4, Anthropic redefines AI capabilities, effectively unleashing a ...SOFTTECHHUB

AI against disinformation and why it is not enoughYiannis Kompatsiaris

In recent years, the proliferation of generative AI technology has revolutionized the landscape of media content creation, enabling even the average user to fabricate convincing videos, images, text, and audio. However, this advancement has also exacerbated the issue of online disinformation, which is spiraling out of control due to the vast reach of social media platforms, sophisticated campaigns, and the proliferation of deepfakes. After an introduction including the significant impact on key societal values such as Democracy, Public Health and Peace, the talk focuses on techniques to detect visual disinformation, manipulated photos/video, deepfakes and visuals out of context. While AI technologies offer promising avenues for addressing disinformation, it is clear that they alone are not sufficient to address this complex and multifaceted problem. Limitations of current AI approaches will be discussed, along with broader human behaviour, societal and financial challenges that must be addressed to effectively combat online disinformation. A holistic approach that encompasses technological, regulatory, and educational interventions, developing critical thought will be finally presented.

Fully Open-Source Private Clouds: Freedom, Security, and ControlShapeBlue

In this presentation, Swen Brüseke introduced proIO's strategy for 100% open-source driven private clouds. proIO leverage the proven technologies of CloudStack and LINBIT, complemented by professional maintenance contracts, to provide you with a secure, flexible, and high-performance IT infrastructure. He highlighted the advantages of private clouds compared to public cloud offerings and explain why CloudStack is in many cases a superior solution to Proxmox. -- The CloudStack European User Group 2025 took place on May 8th in Vienna, Austria. The event once again brought together open-source cloud professionals, contributors, developers, and users for a day of deep technical insights, knowledge sharing, and community connection.

John Carmack’s Notes From His Upper Bound 2025 TalkRazin Mustafiz

Building Agents with LangGraph & GeminiHusseinMalikMammadli

SAP Sapphire 2025 ERP1612 Enhancing User Experience with SAP Fiori and AIPeter Spielvogel

Introducing FME Realize: A New Era of Spatial Computing and ARSafe Software

A new era for the FME Platform has arrived – and it’s taking data into the real world. Meet FME Realize: marking a new chapter in how organizations connect digital information with the physical environment around them. With the addition of FME Realize, FME has evolved into an All-data, Any-AI Spatial Computing Platform. FME Realize brings spatial computing, augmented reality (AR), and the full power of FME to mobile teams: making it easy to visualize, interact with, and update data right in the field. From infrastructure management to asset inspections, you can put any data into real-world context, instantly. Join us to discover how spatial computing, powered by FME, enables digital twins, AI-driven insights, and real-time field interactions: all through an intuitive no-code experience. In this one-hour webinar, you’ll: -Explore what FME Realize includes and how it fits into the FME Platform -Learn how to deliver real-time AR experiences, fast -See how FME enables live, contextual interactions with enterprise data across systems -See demos, including ones you can try yourself -Get tutorials and downloadable resources to help you start right away Whether you’re exploring spatial computing for the first time or looking to scale AR across your organization, this session will give you the tools and insights to get started with confidence.

Content and eLearning Standards: Finding the Best Fit for Your-TrainingRustici Software

Agentic AI - The New Era of IntelligenceMuzammil Shah

This presentation is specifically designed to introduce final-year university students to the foundational principles of Agentic Artificial Intelligence (AI). It aims to provide a clear understanding of how Agentic AI systems function, their key components, and the underlying technologies that empower them. By exploring real-world applications and emerging trends, the session will equip students with essential knowledge to engage with this rapidly evolving area of AI, preparing them for further study or professional work in the field.

Optimize IBM i with Consulting Services HelpAlice Gray

We offers a comprehensive overview of legacy system modernization, integration, and support services. It highlights key challenges businesses face with IBM i systems and presents tailored solutions such as modernization strategies, application development, and managed services. Ideal for IT leaders and enterprises relying on AS400, the deck includes real-world case studies, engagement models, and the benefits of expert consulting. Perfect for showcasing capabilities to clients or internal stakeholders.

John Carmack’s Slides From His Upper Bound 2025 TalkRazin Mustafiz

UiPath Community Zurich: Release Management and Build PipelinesUiPathCommunity

Ensuring robust, reliable, and repeatable delivery processes is more critical than ever - it's a success factor for your automations and for automation programmes as a whole. In this session, we’ll dive into modern best practices for release management and explore how tools like the UiPathCLI can streamline your CI/CD pipelines. Whether you’re just starting with automation or scaling enterprise-grade deployments, our event promises to deliver helpful insights to you. This topic is relevant for both on-premise and cloud users - as well as for automation developers and software testers alike. 📕 Agenda: - Best Practices for Release Management - What it is and why it matters - UiPath Build Pipelines Deep Dive - Exploring CI/CD workflows, the UiPathCLI and showcasing scenarios for both on-premise and cloud - Discussion, Q&A 👨‍🏫 Speakers Roman Tobler, CEO@ Routinuum Johans Brink, CTO@ MvR Digital Workforce We look forward to bringing best practices and showcasing build pipelines to you - and to having interesting discussions on this important topic! If you have any questions or inputs prior to the event, don't hesitate to reach out to us. This event streamed live on May 27, 16:00 pm CET. Check out all our upcoming UiPath Community sessions at: 👉 https://community.uipath.com/events/ Join UiPath Community Zurich chapter: 👉 https://community.uipath.com/zurich/

Cyber security cyber security cyber security cyber security cyber security cy...pranavbodhak

AI in Java - MCP in Action, Langchain4J-CDI, SmallRye-LLM, Spring AIBuhake Sindi