Introduction to datastructure and algorithm
Download as pptx, pdf4 likes4,242 views
Introduction to data structure and algorithm -Basics of Data Structure and Algorithm -Practical Examples of where Data Structure Algorithms is used -Asymptotic Notations [ O(n), o(n), θ(n), Ω(n), ω(n) ] -Calculation of Time and Space Complexity -GNU gprof basic
1 of 12
Downloaded 194 times
![Objectives
Basics of Data Structure and Algorithm
Practical Examples of where Data Structure Algorithms is used
Asymptotic Notations [ O(n), o(n), θ(n), Ω(n), ω(n) ]
Time and Space Complexity
GNU gprof basic](https://image.slidesharecdn.com/introductiontodatastructureandalgorithm-140609133918-phpapp01/85/Introduction-to-datastructure-and-algorithm-2-320.jpg)
![Basics of Data structure and Algorithm
Data structure is a particular way of storing and organizing data in a computer so that it can be
used efficiently.
Some Well-know Data structure
1) Array
2) List [Singly and Doubly Linked List]
3) Tree [ Binary,AVL, Red Black..etc ]
4) B+ Tree
5) Heap [ Max and Min Heap ]
6) Hashing
7) Graph [ BFS, DFS,..etc ]](https://image.slidesharecdn.com/introductiontodatastructureandalgorithm-140609133918-phpapp01/85/Introduction-to-datastructure-and-algorithm-3-320.jpg)
![GNU gprof
Gprof is a profiling program which collects performance statistics of our programs.
For Performance analysis -pg option needed for GCC / g++ Compiler.
Ex:- g++ -pg gprof_test.cpp -o gprof_test
After running ./gprof_test , It generates gmon.out file.
gmon.out file contain Performance analysis statistics, which can be analyze using
gprof tool. Ex:- gprof gprof_test gmon.out > analysis.txt
It provides mainly two type of Performance Analysis
1) Flat Profile [ Total amount of time your program spent executing each function ]
2) Call graph [ How much time was spent in each function and its children ]](https://image.slidesharecdn.com/introductiontodatastructureandalgorithm-140609133918-phpapp01/85/Introduction-to-datastructure-and-algorithm-11-320.jpg)
Ad
Recommended
Data Structure and Algorithms 
Data Structure and Algorithms ManishPrajapati78 This slide contain some most basic concepts of Data Structures like Complexity Analysis,Notation etc.
Data Structure and Algorithms
Data Structure and Algorithmsiqbalphy1 This document provides an introduction and overview of data structures and algorithms. It begins by outlining the topics that will be covered, including data structures, algorithms, abstract data types, and object-oriented programming. It then defines what a data structure is and provides examples. Different types of data structures are discussed, including linear structures like lists, queues, and stacks, as well as non-linear structures like trees, graphs, and hash tables. The document also defines what an algorithm is and discusses why algorithms are important. It provides examples of successful algorithms and discusses the need for correctness and efficiency in algorithms. The relationship between programs, data structures, and algorithms is also briefly explained.
Supervised Machine Learning
Supervised Machine LearningLivares Technologies Pvt Ltd Supervised machine learning uses labeled training data to build models that can predict outputs. There are two main types: regression predicts continuous variables, while classification predicts categorical variables. Supervised learning algorithms include linear regression, which finds a linear relationship between variables, and logistic regression or decision trees for classification. The process involves collecting labeled data, training an algorithm on part of the data, and evaluating its accuracy on test data.
Lec1,2
Lec1,2alaa223 This document provides an overview of information retrieval systems, including their definition, objectives, and key functional processes. An information retrieval system aims to minimize the time and effort users spend locating needed information by supporting search generation, presenting relevant results, and allowing iterative refinement of searches. The major functional processes involve normalizing input items, selectively disseminating new items to users, searching archived documents and user-created indexes. Information retrieval systems differ from database management systems in their handling of unstructured text-based information rather than strictly structured data.
1.7 data reduction
1.7 data reductionKrish_ver2 The document discusses various data reduction strategies including attribute subset selection, numerosity reduction, and dimensionality reduction. Attribute subset selection aims to select a minimal set of important attributes. Numerosity reduction techniques like regression, log-linear models, histograms, clustering, and sampling can reduce data volume by finding alternative representations like model parameters or cluster centroids. Dimensionality reduction techniques include discrete wavelet transformation and principal component analysis, which transform high-dimensional data into a lower-dimensional representation.
Data Wrangling
Data WranglingAshwini Kuntamukkala Companies are finding that data can be a powerful differentiator and are investing heavily in infrastructure, tools and personnel to ingest and curate raw data to be "analyzable". This process of data curation is called "Data Wrangling"
This task can be very cumbersome and requires trained personnel. However with the advances in open source and commercial tooling, this process has gotten a lot easier and the technical expertise required to do this effectively has dropped several notches.
In this tutorial, we will get a feel for what data wranglers do and use R, RStudio, Trifacta Wrangler, Open Refine tools with some hands-on exercises available at http://akuntamukkala.blogspot.com/2016/05/data-wrangling-examples.html
Data structures and algorithms
Data structures and algorithmsJulie Iskander Covers basic data structure like linked list, stack and queue and main sorting snf searching algorithms
Data Analysis in Python-NumPy
Data Analysis in Python-NumPyDevashish Kumar First in the series of Data Analysis in Python. Upcoming series will cover the concepts of Scipy, Pandas, Metplotlib, StatsModels
PPT On Sorting And Searching Concepts In Data Structure | In Programming Lang...
PPT On Sorting And Searching Concepts In Data Structure | In Programming Lang...Umesh Kumar The document discusses various sorting and searching algorithms:
- Bubble sort, selection sort, merge sort, quicksort are sorting algorithms that arrange data in a particular order like numerical or alphabetical.
- Linear search and binary search are searching algorithms where linear search sequentially checks each item while binary search divides the data set in half with each comparison.
- Examples are provided to illustrate how each algorithm works step-by-step on sample data sets.
Information retrieval 10 tf idf and bag of words
Information retrieval 10 tf idf and bag of wordsVaibhav Khanna The bag-of-words model is a simplifying representation used in natural language processing and information retrieval (IR). In this model, a text (such as a sentence or a document) is represented as the bag (multiset) of its words, disregarding grammar and even word order but keeping multiplicity.
Bruteforce algorithm
Bruteforce algorithmRezwan Siam This powerpoint slide is for educational purposes only.!
We have given our best to educate people about the basic brute-force algorithm. Best of luck.
Algorithms Lecture 6: Searching Algorithms
Algorithms Lecture 6: Searching AlgorithmsMohamed Loey We will discuss the following: Search Algorithms, Linear Search, Binary Search, Jump Search, and Interpolation Search
Rabin Karp - String Matching Algorithm
Rabin Karp - String Matching AlgorithmSyed Owais Ali Chishti This document describes the Rabin-Karp string matching algorithm. It proposes using hashing to improve on the naive string matching algorithm. The Rabin-Karp algorithm calculates a hash of the pattern string and compares it to the hash of successive substring slices of the text. If the hashes match, it does a character-by-character comparison. This allows it to avoid unnecessary comparisons and achieves an average runtime of O(m+n), improving on the naive algorithm. It also discusses how to mitigate hash collisions.
Measures of query cost
Measures of query costHitesh Mohapatra The document discusses measures of query cost in database management systems. It explains that query cost can be measured by factors like the number of disk accesses, size of the table, and time taken by the CPU. It further breaks down disk access time into components like seek time, rotational latency, and sequential vs. random I/O. The document then provides an example formula to calculate estimated query cost based on these components.
Query processing and optimization (updated)
Query processing and optimization (updated)Ravinder Kamboj The document discusses techniques used by a database management system (DBMS) to process, optimize, and execute high-level queries. It describes the phases of query processing which include syntax checking, translating the SQL query into an algebraic expression, optimization to choose an efficient execution plan, and running the optimized plan. Query optimization aims to minimize resources like disk I/O and CPU time by selecting the best execution strategy. Techniques for optimization include heuristic rules, cost-based methods, and semantic query optimization using constraints.
Linear search-and-binary-search
Linear search-and-binary-searchInternational Islamic University This document provides an overview of linear search and binary search algorithms.
It explains that linear search sequentially searches through an array one element at a time to find a target value. It is simple to implement but has poor efficiency as the time scales linearly with the size of the input.
Binary search is more efficient by cutting the search space in half at each step. It works on a sorted array by comparing the target to the middle element and determining which half to search next. The time complexity of binary search is logarithmic rather than linear.
search strategies in artificial intelligence
search strategies in artificial intelligenceHanif Ullah (Gold Medalist) The document discusses search strategies in artificial intelligence. It defines key terms like search space, start state, goal test, and search tree. It describes properties of search algorithms like completeness, optimality, time complexity, and space complexity. It differentiates between uninformed searches, which do not use domain knowledge, like breadth-first search and depth-first search, and informed searches, which use heuristics to guide the search more efficiently, like greedy search and A* search. The document outlines the differences between informed and uninformed searches.
Divide and Conquer
Divide and ConquerDr Shashikant Athawale The document discusses the divide and conquer algorithm design paradigm. It begins by defining divide and conquer as recursively breaking down a problem into smaller sub-problems, solving the sub-problems, and then combining the solutions to solve the original problem. Some examples of problems that can be solved using divide and conquer include binary search, quicksort, merge sort, and the fast Fourier transform algorithm. The document then discusses control abstraction, efficiency analysis, and uses divide and conquer to provide algorithms for large integer multiplication and merge sort. It concludes by defining the convex hull problem and providing an example input and output.
String Matching (Naive,Rabin-Karp,KMP)
String Matching (Naive,Rabin-Karp,KMP)Aditya pratap Singh This document discusses and compares several algorithms for string matching:
1. The naive algorithm compares characters one by one and has O(mn) runtime, where m and n are the lengths of the pattern and text.
2. Rabin-Karp uses hashing to compare substrings, running in O(m+n) time. It calculates hash values for the pattern and text substrings.
3. Knuth-Morris-Pratt improves on naive by using the prefix function to avoid re-checking characters, running in O(m+n) time. It constructs a state machine from the pattern to skip matching.
Brute force method
Brute force methodpriyankabhansali217 The document discusses brute force and exhaustive search approaches to solving problems. It provides examples of how brute force can be applied to sorting, searching, and string matching problems. Specifically, it describes selection sort and bubble sort as brute force sorting algorithms. For searching, it explains sequential search and brute force string matching. It also discusses using brute force to solve the closest pair, convex hull, traveling salesman, knapsack, and assignment problems, noting that brute force leads to inefficient exponential time algorithms for TSP and knapsack.
Timestamp protocols
Timestamp protocolsPrashant Saini This document provides an overview of timestamp protocols in database management systems. It discusses how timestamps are generated and used to order transactions. The basic timestamp ordering protocol checks timestamps on read and write operations to ensure serializability. Strict timestamp ordering delays some transactions to ensure schedules are both serializable and strict. Multiversion timestamp ordering uses multiple versions of data items to allow reads to always succeed while maintaining serializability.
2. visualization in data mining
2. visualization in data miningAzad public school Visual data mining combines traditional data mining methods with information visualization techniques to explore large datasets. There are three levels of integration between visualization and automated mining methods - no/limited integration, loose integration where methods are applied sequentially, and full integration where methods are applied in parallel. Different visualization methods exist for univariate, bivariate and multivariate data based on the type and dimensions of the data. The document describes frameworks and algorithms for visual data mining, including developing new algorithms interactively through a visual interface. It also summarizes a document on using data mining and visualization techniques for selective visualization of large spatial datasets.
Demonstrate interpolation search
Demonstrate interpolation searchmanojmanoj218596 The document discusses interpolation search, an improved variant of binary search that works by computing the probe position of a target value. It begins by explaining how interpolation search is more efficient than linear or binary search when values are uniformly distributed. It then provides the formula used to calculate the probe position and describes how the search algorithm narrows the search space at each step based on whether the target value is higher or lower than the value at the probe position. The document concludes by providing Python code to implement an interpolation search function on a sorted array.
Data Structures and Algorithm - Module 1.pptx
Data Structures and Algorithm - Module 1.pptxEllenGrace9 This document provides an introduction to data structures and algorithms from instructor Ellen Grace Porras. It defines data structures as ways of organizing data to allow for efficient operations. Linear data structures like arrays, stacks, and queues arrange elements sequentially, while non-linear structures like trees and graphs have hierarchical relationships. The document discusses characteristics of good data structures and algorithms, provides examples of common algorithms, and distinguishes between linear and non-linear data structures. It aims to explain the fundamentals of data structures and algorithms.
Lectures 1,2,3
Lectures 1,2,3alaa223 The document provides an overview of the key components and objectives of an information retrieval system. It discusses how an IR system aims to minimize the time a user spends locating needed information by facilitating search generation, presenting search results in a relevant order, and processing incoming documents through normalization, indexing, and selective dissemination to users. The major measures of an IR system's effectiveness are precision and recall.
Mathematical Analysis of Recursive Algorithm.
Mathematical Analysis of Recursive Algorithm.mohanrathod18 Guide line of Mathematically analysis of Recursive algorithm with example.
using forward and backsword substitution method.
Certinity Factor and Dempster-shafer theory .pptx
Certinity Factor and Dempster-shafer theory .pptxRamakrishna Reddy Bijjam The Certainty Factor Theory uses numeric values between -1 and 1 to represent the likelihood or certainty of statements or hypotheses being true based on evidence. It was developed for artificial intelligence systems to represent uncertain or incomplete information. The Certainty Factor can be calculated based on the Measure of Belief and Measure of Disbelief of hypotheses given evidence, and formulas are provided to combine Certainty Factors from multiple pieces of evidence. However, the theory has limitations, such as difficulty accurately assigning certainty values and the limited numeric range. The Dempster-Shafer Theory was introduced to address some of the limitations of probability theory. It defines a mass function over all subsets of a set of possible conclusions to represent degrees of belief, and uses belief
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms IMohamed Loey This document discusses analysis of algorithms and time complexity. It explains that analysis of algorithms determines the resources needed to execute algorithms. The time complexity of an algorithm quantifies how long it takes. There are three cases to analyze - worst case, average case, and best case. Common notations for time complexity include O(1), O(n), O(n^2), O(log n), and O(n!). The document provides examples of algorithms and determines their time complexity in different cases. It also discusses how to combine complexities of nested loops and loops in algorithms.
Type research
Type researchResearch Scholar - HNB Garhwal Central University, Srinagar, Uttarakhand. Research is defined as a systematic investigation to establish facts and reach new conclusions. It involves posing a question, collecting data to answer the question, and presenting an answer. The main types of research are fundamental, quantitative, applied, longitudinal, qualitative, and action research. Research aims to extend knowledge, establish generalizations, verify facts, analyze relationships, and support rational decision making. The key steps in research are formulating the problem, developing hypotheses, designing the study, collecting and analyzing data, testing hypotheses, interpreting results, and reporting conclusions.
Major Types of Research
Major Types of ResearchTabi Khan There are two main types of research: basic research and applied research. Basic research aims to advance fundamental knowledge and understanding without necessarily having practical applications. Applied research seeks to address specific problems and needs in the short term. Other distinctions include exploratory, descriptive, and explanatory research based on their purposes. Research can also be classified as case studies, cross-sectional, or longitudinal based on their design and approach.
More Related Content
What's hot (20)
PPT On Sorting And Searching Concepts In Data Structure | In Programming Lang...
PPT On Sorting And Searching Concepts In Data Structure | In Programming Lang...Umesh Kumar The document discusses various sorting and searching algorithms:
- Bubble sort, selection sort, merge sort, quicksort are sorting algorithms that arrange data in a particular order like numerical or alphabetical.
- Linear search and binary search are searching algorithms where linear search sequentially checks each item while binary search divides the data set in half with each comparison.
- Examples are provided to illustrate how each algorithm works step-by-step on sample data sets.
Information retrieval 10 tf idf and bag of words
Information retrieval 10 tf idf and bag of wordsVaibhav Khanna The bag-of-words model is a simplifying representation used in natural language processing and information retrieval (IR). In this model, a text (such as a sentence or a document) is represented as the bag (multiset) of its words, disregarding grammar and even word order but keeping multiplicity.
Bruteforce algorithm
Bruteforce algorithmRezwan Siam This powerpoint slide is for educational purposes only.!
We have given our best to educate people about the basic brute-force algorithm. Best of luck.
Algorithms Lecture 6: Searching Algorithms
Algorithms Lecture 6: Searching AlgorithmsMohamed Loey We will discuss the following: Search Algorithms, Linear Search, Binary Search, Jump Search, and Interpolation Search
Rabin Karp - String Matching Algorithm
Rabin Karp - String Matching AlgorithmSyed Owais Ali Chishti This document describes the Rabin-Karp string matching algorithm. It proposes using hashing to improve on the naive string matching algorithm. The Rabin-Karp algorithm calculates a hash of the pattern string and compares it to the hash of successive substring slices of the text. If the hashes match, it does a character-by-character comparison. This allows it to avoid unnecessary comparisons and achieves an average runtime of O(m+n), improving on the naive algorithm. It also discusses how to mitigate hash collisions.
Measures of query cost
Measures of query costHitesh Mohapatra The document discusses measures of query cost in database management systems. It explains that query cost can be measured by factors like the number of disk accesses, size of the table, and time taken by the CPU. It further breaks down disk access time into components like seek time, rotational latency, and sequential vs. random I/O. The document then provides an example formula to calculate estimated query cost based on these components.
Query processing and optimization (updated)
Query processing and optimization (updated)Ravinder Kamboj The document discusses techniques used by a database management system (DBMS) to process, optimize, and execute high-level queries. It describes the phases of query processing which include syntax checking, translating the SQL query into an algebraic expression, optimization to choose an efficient execution plan, and running the optimized plan. Query optimization aims to minimize resources like disk I/O and CPU time by selecting the best execution strategy. Techniques for optimization include heuristic rules, cost-based methods, and semantic query optimization using constraints.
Linear search-and-binary-search
Linear search-and-binary-searchInternational Islamic University This document provides an overview of linear search and binary search algorithms.
It explains that linear search sequentially searches through an array one element at a time to find a target value. It is simple to implement but has poor efficiency as the time scales linearly with the size of the input.
Binary search is more efficient by cutting the search space in half at each step. It works on a sorted array by comparing the target to the middle element and determining which half to search next. The time complexity of binary search is logarithmic rather than linear.
search strategies in artificial intelligence
search strategies in artificial intelligenceHanif Ullah (Gold Medalist) The document discusses search strategies in artificial intelligence. It defines key terms like search space, start state, goal test, and search tree. It describes properties of search algorithms like completeness, optimality, time complexity, and space complexity. It differentiates between uninformed searches, which do not use domain knowledge, like breadth-first search and depth-first search, and informed searches, which use heuristics to guide the search more efficiently, like greedy search and A* search. The document outlines the differences between informed and uninformed searches.
Divide and Conquer
Divide and ConquerDr Shashikant Athawale The document discusses the divide and conquer algorithm design paradigm. It begins by defining divide and conquer as recursively breaking down a problem into smaller sub-problems, solving the sub-problems, and then combining the solutions to solve the original problem. Some examples of problems that can be solved using divide and conquer include binary search, quicksort, merge sort, and the fast Fourier transform algorithm. The document then discusses control abstraction, efficiency analysis, and uses divide and conquer to provide algorithms for large integer multiplication and merge sort. It concludes by defining the convex hull problem and providing an example input and output.
String Matching (Naive,Rabin-Karp,KMP)
String Matching (Naive,Rabin-Karp,KMP)Aditya pratap Singh This document discusses and compares several algorithms for string matching:
1. The naive algorithm compares characters one by one and has O(mn) runtime, where m and n are the lengths of the pattern and text.
2. Rabin-Karp uses hashing to compare substrings, running in O(m+n) time. It calculates hash values for the pattern and text substrings.
3. Knuth-Morris-Pratt improves on naive by using the prefix function to avoid re-checking characters, running in O(m+n) time. It constructs a state machine from the pattern to skip matching.
Brute force method
Brute force methodpriyankabhansali217 The document discusses brute force and exhaustive search approaches to solving problems. It provides examples of how brute force can be applied to sorting, searching, and string matching problems. Specifically, it describes selection sort and bubble sort as brute force sorting algorithms. For searching, it explains sequential search and brute force string matching. It also discusses using brute force to solve the closest pair, convex hull, traveling salesman, knapsack, and assignment problems, noting that brute force leads to inefficient exponential time algorithms for TSP and knapsack.
Timestamp protocols
Timestamp protocolsPrashant Saini This document provides an overview of timestamp protocols in database management systems. It discusses how timestamps are generated and used to order transactions. The basic timestamp ordering protocol checks timestamps on read and write operations to ensure serializability. Strict timestamp ordering delays some transactions to ensure schedules are both serializable and strict. Multiversion timestamp ordering uses multiple versions of data items to allow reads to always succeed while maintaining serializability.
2. visualization in data mining
2. visualization in data miningAzad public school Visual data mining combines traditional data mining methods with information visualization techniques to explore large datasets. There are three levels of integration between visualization and automated mining methods - no/limited integration, loose integration where methods are applied sequentially, and full integration where methods are applied in parallel. Different visualization methods exist for univariate, bivariate and multivariate data based on the type and dimensions of the data. The document describes frameworks and algorithms for visual data mining, including developing new algorithms interactively through a visual interface. It also summarizes a document on using data mining and visualization techniques for selective visualization of large spatial datasets.
Demonstrate interpolation search
Demonstrate interpolation searchmanojmanoj218596 The document discusses interpolation search, an improved variant of binary search that works by computing the probe position of a target value. It begins by explaining how interpolation search is more efficient than linear or binary search when values are uniformly distributed. It then provides the formula used to calculate the probe position and describes how the search algorithm narrows the search space at each step based on whether the target value is higher or lower than the value at the probe position. The document concludes by providing Python code to implement an interpolation search function on a sorted array.
Data Structures and Algorithm - Module 1.pptx
Data Structures and Algorithm - Module 1.pptxEllenGrace9 This document provides an introduction to data structures and algorithms from instructor Ellen Grace Porras. It defines data structures as ways of organizing data to allow for efficient operations. Linear data structures like arrays, stacks, and queues arrange elements sequentially, while non-linear structures like trees and graphs have hierarchical relationships. The document discusses characteristics of good data structures and algorithms, provides examples of common algorithms, and distinguishes between linear and non-linear data structures. It aims to explain the fundamentals of data structures and algorithms.
Lectures 1,2,3
Lectures 1,2,3alaa223 The document provides an overview of the key components and objectives of an information retrieval system. It discusses how an IR system aims to minimize the time a user spends locating needed information by facilitating search generation, presenting search results in a relevant order, and processing incoming documents through normalization, indexing, and selective dissemination to users. The major measures of an IR system's effectiveness are precision and recall.
Mathematical Analysis of Recursive Algorithm.
Mathematical Analysis of Recursive Algorithm.mohanrathod18 Guide line of Mathematically analysis of Recursive algorithm with example.
using forward and backsword substitution method.
Certinity Factor and Dempster-shafer theory .pptx
Certinity Factor and Dempster-shafer theory .pptxRamakrishna Reddy Bijjam The Certainty Factor Theory uses numeric values between -1 and 1 to represent the likelihood or certainty of statements or hypotheses being true based on evidence. It was developed for artificial intelligence systems to represent uncertain or incomplete information. The Certainty Factor can be calculated based on the Measure of Belief and Measure of Disbelief of hypotheses given evidence, and formulas are provided to combine Certainty Factors from multiple pieces of evidence. However, the theory has limitations, such as difficulty accurately assigning certainty values and the limited numeric range. The Dempster-Shafer Theory was introduced to address some of the limitations of probability theory. It defines a mass function over all subsets of a set of possible conclusions to represent degrees of belief, and uses belief
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms IMohamed Loey This document discusses analysis of algorithms and time complexity. It explains that analysis of algorithms determines the resources needed to execute algorithms. The time complexity of an algorithm quantifies how long it takes. There are three cases to analyze - worst case, average case, and best case. Common notations for time complexity include O(1), O(n), O(n^2), O(log n), and O(n!). The document provides examples of algorithms and determines their time complexity in different cases. It also discusses how to combine complexities of nested loops and loops in algorithms.
Viewers also liked (7)
Type research
Type researchResearch Scholar - HNB Garhwal Central University, Srinagar, Uttarakhand. Research is defined as a systematic investigation to establish facts and reach new conclusions. It involves posing a question, collecting data to answer the question, and presenting an answer. The main types of research are fundamental, quantitative, applied, longitudinal, qualitative, and action research. Research aims to extend knowledge, establish generalizations, verify facts, analyze relationships, and support rational decision making. The key steps in research are formulating the problem, developing hypotheses, designing the study, collecting and analyzing data, testing hypotheses, interpreting results, and reporting conclusions.
Major Types of Research
Major Types of ResearchTabi Khan There are two main types of research: basic research and applied research. Basic research aims to advance fundamental knowledge and understanding without necessarily having practical applications. Applied research seeks to address specific problems and needs in the short term. Other distinctions include exploratory, descriptive, and explanatory research based on their purposes. Research can also be classified as case studies, cross-sectional, or longitudinal based on their design and approach.
Introduction to data structures and Algorithm
Introduction to data structures and AlgorithmDhaval Kaneria This document provides an introduction to algorithms and data structures. It defines algorithms as step-by-step processes to solve problems and discusses their properties, including being unambiguous, composed of a finite number of steps, and terminating. The document outlines the development process for algorithms and discusses their time and space complexity, noting worst-case, average-case, and best-case scenarios. Examples of iterative and recursive algorithms for calculating factorials are provided to illustrate time and space complexity analyses.
Types of research
Types of researchAshish Sahu This document outlines and describes the major types of research, including descriptive research, analytical research, applied research, basic research, quantitative research, qualitative research, conceptual research, and non-scientific methods. Descriptive research involves surveys and fact-finding to describe the current state of affairs, while analytical research involves in-depth study and evaluation of available information to explain complex phenomena. Applied research aims to solve immediate problems, and basic research focuses on developing general theories. Quantitative research relies on measurement, while qualitative research examines qualities and characteristics.
Presentation on types of research
Presentation on types of researchResearch Scholar - HNB Garhwal Central University, Srinagar, Uttarakhand. The document provides an overview of a presentation on types of research given by Manoj Patel. It defines research and lists its main objectives as extending knowledge, revealing hidden facts, generalizing laws, and verifying existing theories and facts. The presentation then describes several common types of research, including descriptive and analytical research, applied and fundamental research, quantitative and qualitative research, conceptual and empirical research, and others. It provides examples to illustrate the differences between each type.
Types of Research Designs RS Mehta
Types of Research Designs RS MehtaBP KOIRALA INSTITUTE OF HELATH SCIENCS,, NEPAL The document discusses various types of research designs and studies. It describes descriptive studies which characterize distributions without inferring causation. Cross-sectional studies capture data at a single point in time to determine prevalence. Cohort studies follow groups over time from exposure to outcome to establish risk. The document provides details on the design, advantages, and disadvantages of these observational study types.
Definition and types of research
Definition and types of researchfadifm This document provides an overview of key concepts in research methodology, including:
1. It defines research as an organized and systematic process of finding answers to questions through a defined set of steps and procedures.
2. It discusses different types of research including quantitative, qualitative, basic, applied, longitudinal, descriptive, classification, comparative, exploratory, explanatory, causal, theory testing, and theory building research.
3. It also discusses alternatives to research-based knowledge such as relying on authority, tradition, common sense, media, and personal experience.
Ad
Similar to Introduction to datastructure and algorithm (20)
Algorithm Complexity and Main Concepts
Algorithm Complexity and Main ConceptsAdelina Ahadova An algorithm is a finite set of instructions to accomplish a predefined task. Performance of an algorithm is measured by its time and space complexity, with common metrics being big O, big Omega, and big Theta notation. Common data structures include arrays, linked lists, stacks, queues, trees and graphs. Key concepts are asymptotic analysis of algorithms, recursion, and analyzing complexity classes like constant, linear, quadratic and logarithmic time.
Data Structures (BE)
Data Structures (BE)PRABHAHARAN429 The document discusses the fundamentals of algorithms and data structures. It covers key topics like algorithm analysis, asymptotic notation, different data structures like arrays, stacks, queues, linked lists, trees, graphs and their applications. It also discusses storage management techniques like lists and garbage collection. The course aims to teach students important algorithm design techniques and how to evaluate algorithms based on parameters like time complexity, space complexity and efficiency.
Cs 331 Data Structures
Cs 331 Data StructuresNational Institute of Technology Durgapur This document provides information about the CS 331 Data Structures course. It includes the contact information for the professor, Dr. Chandran Saravanan, as well as online references and resources about data structures. It then covers topics like structuring and organizing data, different types of data structures suitable for different applications, basic principles of data structures, language support for data structures, selecting an appropriate data structure, analyzing algorithms, and provides an example analysis of a sample algorithm's runtime complexity.
ALGORITHM-ANALYSIS.ppt
ALGORITHM-ANALYSIS.pptsapnaverma97 This document discusses performance analysis of algorithms. It introduces key concepts like time complexity, which measures the amount of CPU time an algorithm needs to run, and space complexity, which measures the amount of memory needed. Common time complexities include constant O(1), linear O(n), quadratic O(n^2), and exponential O(2^n). Big O notation is used to analyze the rate of growth of these complexities and simplify comparisons between algorithms.
DATA STRUCTURE
DATA STRUCTURERobinRohit2 The document discusses stacks and queues as linear data structures. A stack follows LIFO (last in first out) where the last element inserted is the first to be removed. Common stack operations are push to add an element and pop to remove an element. Stacks can be implemented using arrays or linked lists. A queue follows FIFO (first in first out) where the first element inserted is the first to be removed. Common queue operations are enqueue to add an element and dequeue to remove an element. Queues can also be implemented using arrays or linked lists. Circular queues and priority queues are also discussed briefly.
DATA STRUCTURE.pdf
DATA STRUCTURE.pdfibrahim386946 The document discusses stacks and queues as linear data structures. A stack follows LIFO (last in first out) where the last element inserted is the first removed. Common stack operations are push to insert and pop to remove elements. Stacks can be implemented using arrays or linked lists. A queue follows FIFO (first in first out) where the first element inserted is the first removed. Common queue operations are enqueue to insert and dequeue to remove elements. Queues can also be implemented using arrays or linked lists. Circular queues and priority queues are also introduced.
III_Data Structure_Module_1.pptx
III_Data Structure_Module_1.pptxshashankbhadouria4 The document discusses data structures and algorithms. It begins by introducing data structures and how they organize data to enable efficient operations. It provides examples of using arrays and linked lists to represent polynomials. The document then covers searching algorithms like binary search and recursive functions. It discusses abstract data types and how they separate an object's specification from its implementation. Finally, it covers analyzing algorithms, including analyzing their time and space complexity using asymptotic notations.
19. Java data structures algorithms and complexity
19. Java data structures algorithms and complexityIntro C# Book In this chapter we will compare the data structures we have learned so far by the performance (execution speed) of the basic operations (addition, search, deletion, etc.). We will give specific tips in what situations what data structures to use.
Introduction to Data Structures Sorting and searching
Introduction to Data Structures Sorting and searchingMvenkatarao This document provides an overview of data structures and algorithms. It begins by defining a data structure as a way of storing and organizing data in a computer so that it can be used efficiently by algorithms. Data structures can be primitive, directly operated on by machine instructions, or non-primitive, developed from primitive structures. Linear structures maintain adjacency between elements while non-linear do not. Common operations on data structures include adding, deleting, traversing, sorting, searching, and updating elements. The document also defines algorithms and their properties, including finiteness, definiteness, inputs, outputs, and effectiveness. It discusses analyzing algorithms based on time and space complexity and provides examples of different complexities including constant, logarithmic, linear, quadratic,
Mca ii dfs u-1 introduction to data structure
Mca ii dfs u-1 introduction to data structureRai University This document provides an introduction to data structures. It defines data structures as a way of organizing and storing data in a computer so that it can be used efficiently. The document discusses different types of data structures including primitive, non-primitive, linear and non-linear structures. It provides examples of various data structures like arrays, linked lists, stacks, queues and trees. It also covers important concepts like time complexity, space complexity and Big O notation for analyzing algorithms. Common operations on data structures like search, insert and delete are also explained.
jn;lm;lkm';m';;lmppt of data structure.pdf
jn;lm;lkm';m';;lmppt of data structure.pdfVinayNassa3 This document provides an introduction to data structures, algorithms, and complexity analysis. It begins with an overview of data structures and their classification as simple, compound, linear, or non-linear. Common operations on data structures like adding, deleting, and searching elements are described. The document then covers algorithm analysis, asymptotic notation, and examples of recursive and sorting algorithms like bubble sort, selection sort, and their time complexities. Searching techniques like linear, binary, and Fibonacci search are also summarized.
Iare ds ppt_3
Iare ds ppt_3AlugatiRajitha The document provides an introduction to various data structures and algorithms concepts. It discusses different types of data structures like simple, compound, linear and non-linear data structures. It also covers algorithm analysis concepts like time complexity, asymptotic notations and different searching and sorting algorithms like linear search, binary search, bubble sort, selection sort, insertion sort, quick sort and merge sort. It provides pseudocode examples of recursive algorithms like factorial, Fibonacci sequence and towers of Hanoi problem.
DATA STRUCTURE AND ALGORITHM FULL NOTES
DATA STRUCTURE AND ALGORITHM FULL NOTESAniruddha Paul 1. Data structures organize data in memory for efficient access and processing. They represent relationships between data values through placement and linking of the values.
2. Algorithms are finite sets of instructions that take inputs, produce outputs, and terminate after a finite number of unambiguous steps. Common data structures and algorithms are analyzed based on their time and space complexity.
3. Data structures can be linear, with sequential elements, or non-linear, with branching elements. Abstract data types define operations on values independently of implementation through inheritance and polymorphism.
Intro to Data Structure & Algorithms
Intro to Data Structure & AlgorithmsAkhil Kaushik The document introduces data structures and algorithms, explaining that a good computer program requires both an efficient algorithm and an appropriate data structure. It defines data structures as organized ways to store and relate data, and algorithms as step-by-step processes to solve problems. Additionally, it discusses why studying data structures and algorithms is important for developing better programs and software applications.
Bsc cs ii dfs u-1 introduction to data structure
Bsc cs ii dfs u-1 introduction to data structureRai University This document provides an introduction to data structures. It defines data structures as a way of organizing and storing data in a computer so it can be used efficiently. The document discusses different types of data structures including primitive, non-primitive, linear and non-linear structures. It provides examples of common data structures like arrays, linked lists, stacks, queues and trees. It also covers important concepts like time and space complexity analysis and Big O notation for analyzing algorithm efficiency.
19. Data Structures and Algorithm Complexity
19. Data Structures and Algorithm ComplexityIntro C# Book In this chapter we will compare the data structures we have learned so far by the performance (execution speed) of the basic operations (addition, search, deletion, etc.). We will give specific tips in what situations what data structures to use. We will explain how to choose between data structures like hash-tables, arrays, dynamic arrays and sets implemented by hash-tables or balanced trees. Almost all of these structures are implemented as part of NET Framework, so to be able to write efficient and reliable code we have to learn to apply the most appropriate structures for each situation.
Ad
Recently uploaded (20)
Software Engineering Process, Notation & Tools Introduction - Part 3
Software Engineering Process, Notation & Tools Introduction - Part 3Gaurav Sharma Software Engineering Process, Notation & Tools Introduction
Generative Artificial Intelligence and its Applications
Generative Artificial Intelligence and its ApplicationsSandeepKS52 The exploration of generative AI begins with an overview of its fundamental concepts, highlighting how these technologies create new content and ideas by learning from existing data. Following this, the focus shifts to the processes involved in training and fine-tuning models, which are essential for enhancing their performance and ensuring they meet specific needs. Finally, the importance of responsible AI practices is emphasized, addressing ethical considerations and the impact of AI on society, which are crucial for developing systems that are not only effective but also beneficial and fair.
How Insurance Policy Administration Streamlines Policy Lifecycle for Agile Op...
How Insurance Policy Administration Streamlines Policy Lifecycle for Agile Op...Insurance Tech Services A modern Policy Administration System streamlines workflows and integrates with core systems to boost speed, accuracy, and customer satisfaction across the policy lifecycle. Visit https://www.damcogroup.com/insurance/policy-administration-systems for more details!
DevOps for AI: running LLMs in production with Kubernetes and KubeFlow
DevOps for AI: running LLMs in production with Kubernetes and KubeFlowAarno Aukia Presented by Aarno Aukia on June 4th, 2025, at Kubernetes Community Days KCD New York
Meet You in the Middle: 1000x Performance for Parquet Queries on PB-Scale Dat...
Meet You in the Middle: 1000x Performance for Parquet Queries on PB-Scale Dat...Alluxio, Inc. Alluxio Webinar
June 10, 2025
For more Alluxio Events: https://www.alluxio.io/events/
Speaker:
David Zhu (Engineering Manager @ Alluxio)
Storing data as Parquet files on cloud object storage, such as AWS S3, has become prevalent not only for large-scale data lakes but also as lightweight feature stores for training and inference, or as document stores for Retrieval-Augmented Generation (RAG). However, querying petabyte-to-exabyte-scale data lakes directly from S3 remains notoriously slow, with latencies typically ranging from hundreds of milliseconds to several seconds.
In this webinar, David Zhu, Software Engineering Manager at Alluxio, will present the results of a joint collaboration between Alluxio and a leading SaaS and data infrastructure enterprise that explored leveraging Alluxio as a high-performance caching and acceleration layer atop AWS S3 for ultra-fast querying of Parquet files at PB scale.
David will share:
- How Alluxio delivers sub-millisecond Time-to-First-Byte (TTFB) for Parquet queries, comparable to S3 Express One Zone, without requiring specialized hardware, data format changes, or data migration from your existing data lake.
- The architecture that enables Alluxio’s throughput to scale linearly with cluster size, achieving one million queries per second on a modest 50-node deployment, surpassing S3 Express single-account throughput by 50x without latency degradation.
- Specifics on how Alluxio offloads partial Parquet read operations and reduces overhead, enabling direct, ultra-low-latency point queries in hundreds of microseconds and achieving a 1,000x performance gain over traditional S3 querying methods.
Software Engineering Process, Notation & Tools Introduction - Part 4
Software Engineering Process, Notation & Tools Introduction - Part 4Gaurav Sharma Software Engineering Process, Notation & Tools Introduction
Build Smarter, Deliver Faster with Choreo - An AI Native Internal Developer P...
Build Smarter, Deliver Faster with Choreo - An AI Native Internal Developer P...WSO2 Enterprises must deliver intelligent, cloud native applications quickly—without compromising governance or scalability. This session explores how an internal developer platform increases productivity via AI for code and accelerates AI-native app delivery via code for AI. Learn practical techniques for embedding AI in the software lifecycle, automating governance with AI agents, and applying a cell-based architecture for modularity and scalability. Real-world examples and proven patterns will illustrate how to simplify delivery, enhance developer productivity, and drive measurable outcomes.
Learn more: https://wso2.com/choreo
Maximizing Business Value with AWS Consulting Services.pdf
Maximizing Business Value with AWS Consulting Services.pdfElena Mia An overview of how AWS consulting services empower organizations to optimize cloud adoption, enhance security, and drive innovation. Read More: https://www.damcogroup.com/aws-cloud-services/aws-consulting.
GDG Douglas - Google AI Agents: Your Next Intern?
GDG Douglas - Google AI Agents: Your Next Intern?felipeceotto Presentation done at the GDG Douglas event for June 2025.
A first look at Google's new Agent Development Kit.
Agent Development Kit is a new open-source framework from Google designed to simplify the full stack end-to-end development of agents and multi-agent systems.
Porting Qt 5 QML Modules to Qt 6 Webinar
Porting Qt 5 QML Modules to Qt 6 WebinarICS Have you upgraded your application from Qt 5 to Qt 6? If so, your QML modules might still be stuck in the old Qt 5 style—technically compatible, but far from optimal. Qt 6 introduces a modernized approach to QML modules that offers better integration with CMake, enhanced maintainability, and significant productivity gains.
In this webinar, we’ll walk you through the benefits of adopting Qt 6 style QML modules and show you how to make the transition. You'll learn how to leverage the new module system to reduce boilerplate, simplify builds, and modernize your application architecture. Whether you're planning a full migration or just exploring what's new, this session will help you get the most out of your move to Qt 6.
Leveraging Foundation Models to Infer Intents
Leveraging Foundation Models to Infer IntentsKeheliya Gallaba Invited Talk at RAISE 2025: Requirements engineering for AI-powered SoftwarE Workshop co-located with ICSE, the IEEE/ACM International Conference on Software Engineering.
Abstract: Foundation Models (FMs) have shown remarkable capabilities in various natural language tasks. However, their ability to accurately capture stakeholder requirements remains a significant challenge for using FMs for software development. This paper introduces a novel approach that leverages an FM-powered multi-agent system called AlignMind to address this issue. By having a cognitive architecture that enhances FMs with Theory-of-Mind capabilities, our approach considers the mental states and perspectives of software makers. This allows our solution to iteratively clarify the beliefs, desires, and intentions of stakeholders, translating these into a set of refined requirements and a corresponding actionable natural language workflow in the often-overlooked requirements refinement phase of software engineering, which is crucial after initial elicitation. Through a multifaceted evaluation covering 150 diverse use cases, we demonstrate that our approach can accurately capture the intents and requirements of stakeholders, articulating them as both specifications and a step-by-step plan of action. Our findings suggest that the potential for significant improvements in the software development process justifies these investments. Our work lays the groundwork for future innovation in building intent-first development environments, where software makers can seamlessly collaborate with AIs to create software that truly meets their needs.
AI and Deep Learning with NVIDIA Technologies
AI and Deep Learning with NVIDIA TechnologiesSandeepKS52 Artificial intelligence and deep learning are transforming various fields by enabling machines to learn from data and make decisions. Understanding how to prepare data effectively is crucial, as it lays the foundation for training models that can recognize patterns and improve over time. Once models are trained, the focus shifts to deployment, where these intelligent systems are integrated into real-world applications, allowing them to perform tasks and provide insights based on new information. This exploration of AI encompasses the entire process from initial concepts to practical implementation, highlighting the importance of each stage in creating effective and reliable AI solutions.
Agentic Techniques in Retrieval-Augmented Generation with Azure AI Search
Agentic Techniques in Retrieval-Augmented Generation with Azure AI SearchMaxim Salnikov Discover how Agentic Retrieval in Azure AI Search takes Retrieval-Augmented Generation (RAG) to the next level by intelligently breaking down complex queries, leveraging full conversation history, and executing parallel searches through a new LLM-powered query planner. This session introduces a cutting-edge approach that delivers significantly more accurate, relevant, and grounded answers—unlocking new capabilities for building smarter, more responsive generative AI applications.
Traditional Retrieval-Augmented Generation (RAG) pipelines work well for simple queries—but when users ask complex, multi-part questions or refer to previous conversation history, they often fall short. That’s where Agentic Retrieval comes in: a game-changing advancement in Azure AI Search that brings LLM-powered reasoning directly into the retrieval layer.
This session unveils how agentic techniques elevate your RAG-based applications by introducing intelligent query planning, subquery decomposition, parallel execution, and result merging—all orchestrated by a new Knowledge Agent. You’ll learn how this approach significantly boosts relevance, groundedness, and answer quality, especially for sophisticated enterprise use cases.
Key takeaways:
- Understand the evolution from keyword and vector search to agentic query orchestration
- See how full conversation context improves retrieval accuracy
- Explore measurable improvements in answer relevance and completeness (up to 40% gains!)
- Get hands-on guidance on integrating Agentic Retrieval with Azure AI Foundry and SDKs
- Discover how to build scalable, AI-first applications powered by this new paradigm
Whether you're building intelligent copilots, enterprise Q&A bots, or AI-driven search solutions, this session will equip you with the tools and patterns to push beyond traditional RAG.
wAIred_RabobankIgniteSession_12062025.pptx
wAIred_RabobankIgniteSession_12062025.pptxSimonedeGijt In today's world, artificial intelligence (AI) is transforming the way we learn.
This talk will explore how we can use AI tools to enhance our learning experiences, by looking at some (recent) research that has been done on the matter.
But as we embrace these new technologies, we must also ask ourselves:
Are we becoming less capable of thinking for ourselves?
Do these tools make us smarter, or do they risk dulling our critical thinking skills?
This talk will encourage us to think critically about the role of AI in our education. Together, we will discover how to use AI to support our learning journey while still developing our ability to think critically.
Revolutionize Your Insurance Workflow with Claims Management Software
Revolutionize Your Insurance Workflow with Claims Management SoftwareInsurance Tech Services Claims management software enhances efficiency, accuracy, and satisfaction by automating processes, reducing errors, and speeding up transparent claims handling—building trust and cutting costs. Explore More - https://www.damcogroup.com/insurance/claims-management-software
Async-ronizing Success at Wix - Patterns for Seamless Microservices - Devoxx ...
Async-ronizing Success at Wix - Patterns for Seamless Microservices - Devoxx ...Natan Silnitsky In a world where speed, resilience, and fault tolerance define success, Wix leverages Kafka to power asynchronous programming across 4,000 microservices. This talk explores four key patterns that boost developer velocity while solving common challenges with scalable, efficient, and reliable solutions:
1. Integration Events: Shift from synchronous calls to pre-fetching to reduce query latency and improve user experience.
2. Task Queue: Offload non-critical tasks like notifications to streamline request flows.
3. Task Scheduler: Enable precise, fault-tolerant delayed or recurring workflows with robust scheduling.
4. Iterator for Long-running Jobs: Process extensive workloads via chunked execution, optimizing scalability and resilience.
For each pattern, we’ll discuss benefits, challenges, and how we mitigate drawbacks to create practical solutions
This session offers actionable insights for developers and architects tackling distributed systems, helping refine microservices and adopting Kafka-driven async excellence.
From Chaos to Clarity - Designing (AI-Ready) APIs with APIOps Cycles
From Chaos to Clarity - Designing (AI-Ready) APIs with APIOps CyclesMarjukka Niinioja Teams delivering API are challenges with:
- Connecting APIs to business strategy
- Measuring API success (audit & lifecycle metrics)
- Partner/Ecosystem onboarding
- Consistent documentation, security, and publishing
🧠 The big takeaway?
Many teams can build APIs. But few connect them to value, visibility, and long-term improvement.
That’s why the APIOps Cycles method helps teams:
📍 Start where the pain is (one “metro station” at a time)
📈 Scale success across strategy, platform, and operations
🛠 Use collaborative canvases to get buy-in and visibility
Want to try it and learn more?
- Follow APIOps Cycles in LinkedIn
- Visit the www.apiopscycles.com site
- Subscribe to email list
-
Maintaining + Optimizing Database Health: Vendors, Orchestrations, Enrichment...
Maintaining + Optimizing Database Health: Vendors, Orchestrations, Enrichment...BradBedford3 Join the Denver Marketo User Group, Captello and Integrate as we dive into the best practices, tools, and strategies for maintaining robust, high-performing databases. From managing vendors and automating orchestrations to enriching data for better insights, this session will unpack the key elements that keep your data ecosystem running smoothly—and smartly.
We will hear from Steve Armenti, Twelfth, and Aaron Karpaty, Captello, and Frannie Danzinger, Integrate.
How the US Navy Approaches DevSecOps with Raise 2.0
How the US Navy Approaches DevSecOps with Raise 2.0Anchore Join us as Anchore's solutions architect reveals how the U.S. Navy successfully approaches the shift left philosophy to DevSecOps with the RAISE 2.0 Implementation Guide to support its Cyber Ready initiative. This session will showcase practical strategies for defense application teams to pivot from a time-intensive compliance checklist and mindset to continuous cyber-readiness with real-time visibility.
Learn how to break down organizational silos through RAISE 2.0 principles and build efficient, secure pipeline automation that produces the critical security artifacts needed for Authorization to Operate (ATO) approval across military environments.
How Insurance Policy Administration Streamlines Policy Lifecycle for Agile Op...
How Insurance Policy Administration Streamlines Policy Lifecycle for Agile Op...Insurance Tech Services
Introduction to datastructure and algorithm
- 1. Introduction to Data Structure and Algorithm Presented By: Pratik Mota
- 2. Objectives Basics of Data Structure and Algorithm Practical Examples of where Data Structure Algorithms is used Asymptotic Notations [ O(n), o(n), θ(n), Ω(n), ω(n) ] Time and Space Complexity GNU gprof basic
- 3. Basics of Data structure and Algorithm Data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Some Well-know Data structure 1) Array 2) List [Singly and Doubly Linked List] 3) Tree [ Binary,AVL, Red Black..etc ] 4) B+ Tree 5) Heap [ Max and Min Heap ] 6) Hashing 7) Graph [ BFS, DFS,..etc ]
- 4. Basics of Data structure and Algorithm Algorithm is a step-by-step procedure for calculations OR you can tell it is sequence of program instructions designed to compute a particular result. Examples:- Sorting, Searching, Shortest Path, Dynamic Programming, Numerical Algorithms etc.. Sort INPUT sequence of numbers a1, a2, a3,….,an b1,b2,b3,….,bn OUTPUT a permutation of the sequence of numbers 2 5 4 10 7 2 4 5 7 10 Sorting Algorithm
- 5. Use of Data Structure and Algorithm
- 8. Asymptotic Notations 1n 2n 3n 4n 5n 6n Runningtime 1 2 3 4 5 6 7 8 9 10 11 12 ….. best-case Ω(n) average-case θ(n) worst-case O(n) Input instance size o(n) ω(n)
- 9. Basics of Complexity O(1) < O(log n ) < O(n) < O(n log n ) < O(n^2) < ….. < O(n^k) < O(2^n) O( n^2 + n + 1 ) => O(n^2) MAX ( f(n), g(n) ) O(N + a)^b O(N^b) Time Complexity :- Amount of time taken by an algorithm to run. Space Complexity:- Extra/Temporary Space use by algorithm .
- 10. Time and Space Complexity O(n) O(n^2) O( log n )
- 11. GNU gprof Gprof is a profiling program which collects performance statistics of our programs. For Performance analysis -pg option needed for GCC / g++ Compiler. Ex:- g++ -pg gprof_test.cpp -o gprof_test After running ./gprof_test , It generates gmon.out file. gmon.out file contain Performance analysis statistics, which can be analyze using gprof tool. Ex:- gprof gprof_test gmon.out > analysis.txt It provides mainly two type of Performance Analysis 1) Flat Profile [ Total amount of time your program spent executing each function ] 2) Call graph [ How much time was spent in each function and its children ]