05_fragments.pdf
•
0 likes•44,190 views
This document provides instructions for an assignment to implement fragments using an array of pointers. It asks the student to write a program that reads the number of rows and columns for each row, reads the elements for each row, calculates the average for each row, sorts the rows based on average, and prints the results. It includes examples that show reading input values, storing them in an array using pointers, calculating averages, sorting rows, and sample output. The prerequisites are listed as pointers, functions, and dynamic memory allocation, and the objective is stated as understanding dynamic memory allocation and arrays of pointers.
Report
Share
Report
Share
Download to read offline
Recommended
13_median.pdf
The document discusses finding the median of two unsorted arrays. It begins with an example of reading in two arrays of sizes M and N, sorting the arrays, finding the median of each array, and calculating the average of the two medians. It then provides more examples and details the steps involved, such as sorting the arrays, finding the individual medians, and calculating the final median. It also discusses prerequisites like loops and arrays and the objective of understanding one-dimensional arrays.
STRINGS_IN_PYTHON 9-12 (1).pptx
This document provides information about Python and web development. It discusses strings in Python, including creating, accessing, modifying, deleting strings and various string methods and functions. It also provides example problems and code snippets related to string operations in Python.
Lecture 2.pdf
This document provides an outline for a lecture on the NumPy library for scientific computing in Python. It introduces NumPy arrays and their attributes like shape and size. It covers various array operations like indexing, slicing, sorting, copying, reshaping, concatenating, and splitting arrays. It also discusses vectorized operations, universal functions (ufuncs), broadcasting rules, and masking arrays. The goal is to demonstrate the core functionality of NumPy for working with multi-dimensional numerical data in Python.
UiPath Studio Web workshop series - Day 4
📣 Welcome to Day 4 of the UiPath Studio Web Workshop. In this session, we will focus on sharpening your data manipulation skills in UiPath Studio Web. Join us as we dive into tasks that involve various string operations, including length checks, substring extraction, index manipulation, handling last letters, and executing replace functions.
👉 Topics covered:
📌 Task1: String Manipulations
Assigning a Set of Strings
Performing Length Check, Substring Extraction, Index Manipulation, Handling Last Letters, and Removal Operations
📌 Task2: Word Replacement Magic
Assigning Input Value
Executing Replace Function to Substitute a word with another
Speakers:
Vajrang Billlakurthi, Digital Transformation Leader, Vajrang IT Services Pvt Ltd. and UiPath MVP
Swathi Nelakurthi, Associate Automation Developer, Vajrang IT Services Pvt Ltd
Rahul Goyal, SR. Director, ERP Systems, Ellucian and UiPath MVP
👉 Visit the series page to register to all events.
5. string
The document discusses various methods for working with string objects in Python. It covers how to create, access, modify, compare and search strings. Some key string methods mentioned include len() to get the length, slicing to extract substrings, concatenation with +, checking for substrings with in/not in, comparing with relational operators, iterating with for loops, testing characters with isalpha() etc. and searching/replacing with endswith(), find(), replace() among others.
Algorithms Lecture 4: Sorting Algorithms I
The document discusses three sorting algorithms: bubble sort, selection sort, and insertion sort. Bubble sort works by repeatedly swapping adjacent elements that are in the wrong order. Selection sort finds the minimum element and swaps it into the sorted portion of the array. Insertion sort inserts elements into the sorted portion of the array, swapping as needed to put the element in the correct position. Both selection sort and insertion sort have a time complexity of O(n^2) in the worst case.
Python_Unit_III.pptx
Strings in Python are sequence of characters that are immutable. They can be indexed, sliced, concatenated and their cases can be changed. Common string methods include find, count, strip, replace, capitalize etc. Lists are mutable sequences that can contain elements of different types. Common list operations include append, insert, pop, remove, sort etc. Tuples are immutable sequences that can be nested and support operations like slicing, indexing, unpacking etc. Sets are unordered collections of unique elements that support membership testing and set operations. Dictionaries are mutable mappings of unique keys to values that support various operations like get, update, keys, values etc.
Data Structure.pdf
This document provides a practical manual on data structures for computer science students. It was prepared by Mr. Naveen Choudhary and Dr. Dharm Singh of the Computer Science and Engineering department at Maharana Pratap University of Agriculture and Technology in Udaipur. The 138-page manual contains exercises and solutions to help students understand data structures from an applied perspective. It covers topics like stacks, queues, linked lists, trees, and sorting and searching algorithms.
Recommended
13_median.pdf
The document discusses finding the median of two unsorted arrays. It begins with an example of reading in two arrays of sizes M and N, sorting the arrays, finding the median of each array, and calculating the average of the two medians. It then provides more examples and details the steps involved, such as sorting the arrays, finding the individual medians, and calculating the final median. It also discusses prerequisites like loops and arrays and the objective of understanding one-dimensional arrays.
STRINGS_IN_PYTHON 9-12 (1).pptx
This document provides information about Python and web development. It discusses strings in Python, including creating, accessing, modifying, deleting strings and various string methods and functions. It also provides example problems and code snippets related to string operations in Python.
Lecture 2.pdf
This document provides an outline for a lecture on the NumPy library for scientific computing in Python. It introduces NumPy arrays and their attributes like shape and size. It covers various array operations like indexing, slicing, sorting, copying, reshaping, concatenating, and splitting arrays. It also discusses vectorized operations, universal functions (ufuncs), broadcasting rules, and masking arrays. The goal is to demonstrate the core functionality of NumPy for working with multi-dimensional numerical data in Python.
UiPath Studio Web workshop series - Day 4
📣 Welcome to Day 4 of the UiPath Studio Web Workshop. In this session, we will focus on sharpening your data manipulation skills in UiPath Studio Web. Join us as we dive into tasks that involve various string operations, including length checks, substring extraction, index manipulation, handling last letters, and executing replace functions.
👉 Topics covered:
📌 Task1: String Manipulations
Assigning a Set of Strings
Performing Length Check, Substring Extraction, Index Manipulation, Handling Last Letters, and Removal Operations
📌 Task2: Word Replacement Magic
Assigning Input Value
Executing Replace Function to Substitute a word with another
Speakers:
Vajrang Billlakurthi, Digital Transformation Leader, Vajrang IT Services Pvt Ltd. and UiPath MVP
Swathi Nelakurthi, Associate Automation Developer, Vajrang IT Services Pvt Ltd
Rahul Goyal, SR. Director, ERP Systems, Ellucian and UiPath MVP
👉 Visit the series page to register to all events.
5. string
The document discusses various methods for working with string objects in Python. It covers how to create, access, modify, compare and search strings. Some key string methods mentioned include len() to get the length, slicing to extract substrings, concatenation with +, checking for substrings with in/not in, comparing with relational operators, iterating with for loops, testing characters with isalpha() etc. and searching/replacing with endswith(), find(), replace() among others.
Algorithms Lecture 4: Sorting Algorithms I
The document discusses three sorting algorithms: bubble sort, selection sort, and insertion sort. Bubble sort works by repeatedly swapping adjacent elements that are in the wrong order. Selection sort finds the minimum element and swaps it into the sorted portion of the array. Insertion sort inserts elements into the sorted portion of the array, swapping as needed to put the element in the correct position. Both selection sort and insertion sort have a time complexity of O(n^2) in the worst case.
Python_Unit_III.pptx
Strings in Python are sequence of characters that are immutable. They can be indexed, sliced, concatenated and their cases can be changed. Common string methods include find, count, strip, replace, capitalize etc. Lists are mutable sequences that can contain elements of different types. Common list operations include append, insert, pop, remove, sort etc. Tuples are immutable sequences that can be nested and support operations like slicing, indexing, unpacking etc. Sets are unordered collections of unique elements that support membership testing and set operations. Dictionaries are mutable mappings of unique keys to values that support various operations like get, update, keys, values etc.
Data Structure.pdf
This document provides a practical manual on data structures for computer science students. It was prepared by Mr. Naveen Choudhary and Dr. Dharm Singh of the Computer Science and Engineering department at Maharana Pratap University of Agriculture and Technology in Udaipur. The 138-page manual contains exercises and solutions to help students understand data structures from an applied perspective. It covers topics like stacks, queues, linked lists, trees, and sorting and searching algorithms.
IGARSSWellLog_Vancouver_07_29.pptx
This document describes using radial basis function networks (RBF) for well log data inversion. It proposes modifying a conventional two-layer RBF and introducing a three-layer RBF. Simulation experiments show the three-layer 10-27-9-10 RBF model achieves the smallest error in testing simulated well log data. When applied to real well log data, the 10-27-9-10 RBF model provides an acceptable inversion of true formation conductivity from apparent conductivity measurements.
08_pyramid_pattern.pdf
The document provides instructions for writing a program to print a pyramid pattern based on a user-provided integer input. It explains that the program should take a number as input, then output a pyramid shape with that number of columns by printing numbers row by row, with each row containing the relevant numbers spaced appropriately. It provides examples for input numbers 4 and 5 to illustrate the expected output format. It also lists prerequisites of loops and notes the objective is to understand nested looping.
Aho-Corasick algorithm parallelization
The document discusses parallelizing the string-matching Aho-Corasick algorithm. It describes splitting the text into chunks that are processed independently by threads. However, this can miss occurrences that span chunks, so an overlap between chunks is used. The matching phase is parallelized using OpenMP pragmas. Testing on large Bible and dictionary files showed speedups from using multiple threads, up to a point determined by hardware threads.
Matlab commands
This document provides a summary of MATLAB commands and functions organized into categories such as general purpose commands, input/output commands, vector/matrix commands, plotting commands, programming commands, mathematical functions, and numerical methods. It lists commonly used commands like plot, print, zeros, ones, mean, and dsolve and provides brief descriptions of what each command/function does.
Huffman Text Compression Technique
Huffman is one of the compression algorithms. It is the most famous algorithm to compress text. There are four phases in the Huffman algorithm to compress text. The first is to group the characters. The second is to build the Huffman tree. The third is the encoding, and the last one is the construction of coded bits. The Huffman algorithm principle is the character that often appears on encoding with a series of short bits and characters that rarely appeared in bit-encoding with a longer series. Huffman compression technique can provide savings of 30% from the original bits. It works based on the frequency of characters. The more the similar character reached, the higher the compression rate gained.
05-stack_queue.ppt
This document discusses stacks and queues as abstract data types (ADTs). It defines stacks as last-in, first-out (LIFO) collections where elements are added and removed from the top. Queues are first-in, first-out (FIFO) collections where elements are added to the back and removed from the front. Examples of using stacks and queues in computer science are provided. The key operations for each - push, pop for stacks and add, remove for queues - are also summarized.
Matlab Tutorial for Beginners - I
This document provides a 3 sentence summary of a short term training program on Matlab for beginners:
The training program covers basic Matlab topics like the desktop interface, variables, arithmetic operations, matrices and arrays. It explains how to create and manipulate numeric data, perform common operations element-wise and on whole matrices, and generate matrices using functions. The document also demonstrates how to index and slice arrays to access subsets of elements and concatenate arrays horizontally and vertically.
Arrays in programming
The document provides an overview of arrays in Java, including:
- Arrays can hold multiple values of the same type, unlike primitive variables which can only hold one value.
- One-dimensional arrays use a single index, while multi-dimensional arrays use two or more indices.
- Elements in an array are accessed using their index number, starting from 0.
- The size of an array is set when it is declared and cannot be changed, but reference variables can point to different arrays.
- Common operations on arrays include initializing values, accessing elements, looping through elements, and copying arrays.
Matlab: Procedures And Functions
Script files, also called M-files, make MATLAB programming more efficient than entering individual commands. M-files are text files that contain MATLAB commands to perform specific tasks. They can be created and edited in any plain text editor or the built-in MATLAB editor. User defined functions are a special type of M-file that take inputs and produce outputs, with the function name and arguments specified in the first line. Strings in MATLAB are matrices of character elements that can be manipulated using various functions like converting between data types and extracting substrings.
Procedures And Functions in Matlab
Script files, also called M-files, make MATLAB programming more efficient than entering individual commands. M-files are text files that contain MATLAB commands to perform specific tasks. They can be created and edited in any plain text editor or the built-in MATLAB editor. User defined functions are a special type of M-file that take inputs and produce outputs, with the function name and arguments specified in the first line. Strings in MATLAB are matrices of character elements that can be manipulated using various functions like converting between data types and extracting substrings.
Data Structures & Algorithms Coursework Assignment for Sem.docx
Data Structures & Algorithms
Coursework Assignment for Semester 2, 2016-17
Due Date: Friday 12th May 2017
An examination of the number of comparisons needed for successful searches of sorted arrays using ten different search algorithms
SID Number: XXXXXXX
Instructions
1. In this assignment, you will analyse some array search algorithms using MATLAB. The first search algorithm (linear search) is analysed for you as an example. There are 10 marks available for each of the remaining search algorithms to be analysed. Test your algorithms before analysing them to ensure that they operate correctly (e.g., using small arrays passed to your functions from the Command Window).
2. Complete the report in exactly the format given here (i.e., fill in the sections and do not change the structure of the document). 10 marks will be awarded for keeping the document in the correct format as you complete the report. In particular, note that code should be pasted directly from MATLAB, in order that a fixed-width font is used, and to ensure that indentation is maintained.
3. Your printed report must be submitted with a CD or USB drive containing your source code (functions for each search algorithm and test harnesses). Work must be submitted to the iCentre by the published deadline. This assignment is worth 50% of your grade for the module.
4. Some initial references are provided, but further research will be needed to learn about the search algorithms that have not been discussed in class. Additional references should be added to the Harvard style reference list to acknowledge the sources consulted. Use reliable sources wherever possible.
5. In the mark scheme (shown below) insert 0s for any algorithms or subsections not completed to determine the maximum possible mark that you can score and to indicate which parts were attempted.
Mark Scheme
Algorithm
Subsection 1
Subsection 2
Subsection 3
Subsection 4
Subsection 5
Marks
1. Linear
N/A
N/A
N/A
N/A
N/A
N/A
2. Random
0..2
0..2
0..2
0..2
0..2
0..10
3. Jump
0..2
0..2
0..2
0..2
0..2
0..10
4. K-level Jump
0..2
0..2
0..2
0..2
0..2
0..10
5. Exponential
0..2
0..2
0..2
0..2
0..2
0..10
6. Fibonaccian
0..2
0..2
0..2
0..2
0..2
0..10
7. Binary
0..2
0..2
0..2
0..2
0..2
0..10
8. Ternary
0..2
0..2
0..2
0..2
0..2
0..10
9. Interpolation-Sequential
0..2
0..2
0..2
0..2
0..2
0..10
10. Interpolation
0..2
0..2
0..2
0..2
0..2
0..10
Presentation
0..10
Total Marks
0..100
Table of Contents
1. Linear Search (Sequential Search)
1.1 Basic logic used by the algorithm
1.2 Published and/or theoretically deduced time complexity
1.3 Presentation of algorithm as a function in MATLAB
1.4 Presentation of successful search test results graphs for increasing array sizes
1.5 Discussion of results
2. Random Search
2.1 Basic logic used by the algorithm
2.2 Published and/or theoretically deduced time complexity
2.3 Presentation of algorithm as a function in MATLAB
2.4 Presentation of successful search test results graphs for inc.
01_memory_manager.pdf
This document provides examples for an assignment to create a menu-driven program that stores and manipulates different data types (char, int, float, double) in dynamically allocated memory. It allocates 8 consecutive bytes to store the variables and uses flags to track which data types are stored. The menu allows the user to add, display, and remove elements as well as exit the program. Examples demonstrate initializing the flags, adding/removing elements, updating the flags, and displaying only elements whose flags are set. The objective is to understand dynamic memory allocation using pointers.
Programming in ansi C by Balaguruswami
This document provides Scilab code examples that correspond to chapters and examples from the textbook "Programming In Ansi C" by E. Balagurusamy. It includes over 100 code examples organized by chapter that demonstrate concepts like input/output operations, decision making, arrays, strings, functions, structures, file management, and linked lists. Each code example is numbered and labeled to match the relevant example from the textbook. Introductory sections provide numbering policies and a list of codes.
Programming in Ansi C
This document provides Scilab code examples that correspond to chapters and examples from the textbook "Programming In Ansi C" by E. Balagurusamy. It includes over 100 code examples organized by chapter that demonstrate concepts like input/output operations, decision making, looping, arrays, strings, functions, structures, file management, and linked lists. Each code example is numbered and labeled to match the relevant example from the textbook. Introductory sections provide numbering policies and a list of codes.
Algorithms devised for a google interview
Google interviewer asked for an algorithm to extract the k smallest elements from a set of ordered arrays. I suggested a vectorised bucket sort and merge sort approach. I took the problem offline and produced this analysis and C++.
Strings.pptx
A string is a sequence of characters that can be accessed individually using indexes. Strings are immutable, so their characters cannot be changed, only new strings can be reassigned or created. Common string methods include upper()/lower() to convert case, split() to separate a string into a list by a delimiter, join() to combine a list into a string, replace() to substitute characters, and find() to locate a substring.
MATLAB
The document provides information about Mohsin Gulab Tanwari's education details and an assignment given by Sir Afaque Manzoor Soomro. It then summarizes key aspects of MATLAB including its functions, layout, creating variables, plotting graphs, matrix operations, and referencing matrix elements.
Matlab matrics
A matrix is a two-dimensional array of numbers that can be created in MATLAB by entering comma or space delimited numbers in rows and using semicolons to mark the end of each row. Elements in a matrix can be referenced using subscripts specifying the row and column. Parts of a matrix can be selected to form a sub-matrix, or rows and columns can be deleted by assigning an empty array to them. Common operations on matrices include addition, subtraction, scalar operations, transposition, concatenation, multiplication, and calculating the determinant and inverse.
Matlab commands
This document provides an overview of MATLAB commands organized into categories such as general purpose commands, input/output commands, vector and matrix commands, plotting commands, programming commands, mathematical functions, numerical methods, and symbolic math toolbox functions. It summarizes the purpose and usage of many common MATLAB functions and operators.
More Related Content
Similar to 05_fragments.pdf
IGARSSWellLog_Vancouver_07_29.pptx
This document describes using radial basis function networks (RBF) for well log data inversion. It proposes modifying a conventional two-layer RBF and introducing a three-layer RBF. Simulation experiments show the three-layer 10-27-9-10 RBF model achieves the smallest error in testing simulated well log data. When applied to real well log data, the 10-27-9-10 RBF model provides an acceptable inversion of true formation conductivity from apparent conductivity measurements.
08_pyramid_pattern.pdf
The document provides instructions for writing a program to print a pyramid pattern based on a user-provided integer input. It explains that the program should take a number as input, then output a pyramid shape with that number of columns by printing numbers row by row, with each row containing the relevant numbers spaced appropriately. It provides examples for input numbers 4 and 5 to illustrate the expected output format. It also lists prerequisites of loops and notes the objective is to understand nested looping.
Aho-Corasick algorithm parallelization
The document discusses parallelizing the string-matching Aho-Corasick algorithm. It describes splitting the text into chunks that are processed independently by threads. However, this can miss occurrences that span chunks, so an overlap between chunks is used. The matching phase is parallelized using OpenMP pragmas. Testing on large Bible and dictionary files showed speedups from using multiple threads, up to a point determined by hardware threads.
Matlab commands
This document provides a summary of MATLAB commands and functions organized into categories such as general purpose commands, input/output commands, vector/matrix commands, plotting commands, programming commands, mathematical functions, and numerical methods. It lists commonly used commands like plot, print, zeros, ones, mean, and dsolve and provides brief descriptions of what each command/function does.
Huffman Text Compression Technique
Huffman is one of the compression algorithms. It is the most famous algorithm to compress text. There are four phases in the Huffman algorithm to compress text. The first is to group the characters. The second is to build the Huffman tree. The third is the encoding, and the last one is the construction of coded bits. The Huffman algorithm principle is the character that often appears on encoding with a series of short bits and characters that rarely appeared in bit-encoding with a longer series. Huffman compression technique can provide savings of 30% from the original bits. It works based on the frequency of characters. The more the similar character reached, the higher the compression rate gained.
05-stack_queue.ppt
This document discusses stacks and queues as abstract data types (ADTs). It defines stacks as last-in, first-out (LIFO) collections where elements are added and removed from the top. Queues are first-in, first-out (FIFO) collections where elements are added to the back and removed from the front. Examples of using stacks and queues in computer science are provided. The key operations for each - push, pop for stacks and add, remove for queues - are also summarized.
Matlab Tutorial for Beginners - I
This document provides a 3 sentence summary of a short term training program on Matlab for beginners:
The training program covers basic Matlab topics like the desktop interface, variables, arithmetic operations, matrices and arrays. It explains how to create and manipulate numeric data, perform common operations element-wise and on whole matrices, and generate matrices using functions. The document also demonstrates how to index and slice arrays to access subsets of elements and concatenate arrays horizontally and vertically.
Arrays in programming
The document provides an overview of arrays in Java, including:
- Arrays can hold multiple values of the same type, unlike primitive variables which can only hold one value.
- One-dimensional arrays use a single index, while multi-dimensional arrays use two or more indices.
- Elements in an array are accessed using their index number, starting from 0.
- The size of an array is set when it is declared and cannot be changed, but reference variables can point to different arrays.
- Common operations on arrays include initializing values, accessing elements, looping through elements, and copying arrays.
Matlab: Procedures And Functions
Script files, also called M-files, make MATLAB programming more efficient than entering individual commands. M-files are text files that contain MATLAB commands to perform specific tasks. They can be created and edited in any plain text editor or the built-in MATLAB editor. User defined functions are a special type of M-file that take inputs and produce outputs, with the function name and arguments specified in the first line. Strings in MATLAB are matrices of character elements that can be manipulated using various functions like converting between data types and extracting substrings.
Procedures And Functions in Matlab
Script files, also called M-files, make MATLAB programming more efficient than entering individual commands. M-files are text files that contain MATLAB commands to perform specific tasks. They can be created and edited in any plain text editor or the built-in MATLAB editor. User defined functions are a special type of M-file that take inputs and produce outputs, with the function name and arguments specified in the first line. Strings in MATLAB are matrices of character elements that can be manipulated using various functions like converting between data types and extracting substrings.
Data Structures & Algorithms Coursework Assignment for Sem.docx
Data Structures & Algorithms
Coursework Assignment for Semester 2, 2016-17
Due Date: Friday 12th May 2017
An examination of the number of comparisons needed for successful searches of sorted arrays using ten different search algorithms
SID Number: XXXXXXX
Instructions
1. In this assignment, you will analyse some array search algorithms using MATLAB. The first search algorithm (linear search) is analysed for you as an example. There are 10 marks available for each of the remaining search algorithms to be analysed. Test your algorithms before analysing them to ensure that they operate correctly (e.g., using small arrays passed to your functions from the Command Window).
2. Complete the report in exactly the format given here (i.e., fill in the sections and do not change the structure of the document). 10 marks will be awarded for keeping the document in the correct format as you complete the report. In particular, note that code should be pasted directly from MATLAB, in order that a fixed-width font is used, and to ensure that indentation is maintained.
3. Your printed report must be submitted with a CD or USB drive containing your source code (functions for each search algorithm and test harnesses). Work must be submitted to the iCentre by the published deadline. This assignment is worth 50% of your grade for the module.
4. Some initial references are provided, but further research will be needed to learn about the search algorithms that have not been discussed in class. Additional references should be added to the Harvard style reference list to acknowledge the sources consulted. Use reliable sources wherever possible.
5. In the mark scheme (shown below) insert 0s for any algorithms or subsections not completed to determine the maximum possible mark that you can score and to indicate which parts were attempted.
Mark Scheme
Algorithm
Subsection 1
Subsection 2
Subsection 3
Subsection 4
Subsection 5
Marks
1. Linear
N/A
N/A
N/A
N/A
N/A
N/A
2. Random
0..2
0..2
0..2
0..2
0..2
0..10
3. Jump
0..2
0..2
0..2
0..2
0..2
0..10
4. K-level Jump
0..2
0..2
0..2
0..2
0..2
0..10
5. Exponential
0..2
0..2
0..2
0..2
0..2
0..10
6. Fibonaccian
0..2
0..2
0..2
0..2
0..2
0..10
7. Binary
0..2
0..2
0..2
0..2
0..2
0..10
8. Ternary
0..2
0..2
0..2
0..2
0..2
0..10
9. Interpolation-Sequential
0..2
0..2
0..2
0..2
0..2
0..10
10. Interpolation
0..2
0..2
0..2
0..2
0..2
0..10
Presentation
0..10
Total Marks
0..100
Table of Contents
1. Linear Search (Sequential Search)
1.1 Basic logic used by the algorithm
1.2 Published and/or theoretically deduced time complexity
1.3 Presentation of algorithm as a function in MATLAB
1.4 Presentation of successful search test results graphs for increasing array sizes
1.5 Discussion of results
2. Random Search
2.1 Basic logic used by the algorithm
2.2 Published and/or theoretically deduced time complexity
2.3 Presentation of algorithm as a function in MATLAB
2.4 Presentation of successful search test results graphs for inc.
01_memory_manager.pdf
This document provides examples for an assignment to create a menu-driven program that stores and manipulates different data types (char, int, float, double) in dynamically allocated memory. It allocates 8 consecutive bytes to store the variables and uses flags to track which data types are stored. The menu allows the user to add, display, and remove elements as well as exit the program. Examples demonstrate initializing the flags, adding/removing elements, updating the flags, and displaying only elements whose flags are set. The objective is to understand dynamic memory allocation using pointers.
Programming in ansi C by Balaguruswami
This document provides Scilab code examples that correspond to chapters and examples from the textbook "Programming In Ansi C" by E. Balagurusamy. It includes over 100 code examples organized by chapter that demonstrate concepts like input/output operations, decision making, arrays, strings, functions, structures, file management, and linked lists. Each code example is numbered and labeled to match the relevant example from the textbook. Introductory sections provide numbering policies and a list of codes.
Programming in Ansi C
This document provides Scilab code examples that correspond to chapters and examples from the textbook "Programming In Ansi C" by E. Balagurusamy. It includes over 100 code examples organized by chapter that demonstrate concepts like input/output operations, decision making, looping, arrays, strings, functions, structures, file management, and linked lists. Each code example is numbered and labeled to match the relevant example from the textbook. Introductory sections provide numbering policies and a list of codes.
Algorithms devised for a google interview
Google interviewer asked for an algorithm to extract the k smallest elements from a set of ordered arrays. I suggested a vectorised bucket sort and merge sort approach. I took the problem offline and produced this analysis and C++.
Strings.pptx
A string is a sequence of characters that can be accessed individually using indexes. Strings are immutable, so their characters cannot be changed, only new strings can be reassigned or created. Common string methods include upper()/lower() to convert case, split() to separate a string into a list by a delimiter, join() to combine a list into a string, replace() to substitute characters, and find() to locate a substring.
MATLAB
The document provides information about Mohsin Gulab Tanwari's education details and an assignment given by Sir Afaque Manzoor Soomro. It then summarizes key aspects of MATLAB including its functions, layout, creating variables, plotting graphs, matrix operations, and referencing matrix elements.
Matlab matrics
A matrix is a two-dimensional array of numbers that can be created in MATLAB by entering comma or space delimited numbers in rows and using semicolons to mark the end of each row. Elements in a matrix can be referenced using subscripts specifying the row and column. Parts of a matrix can be selected to form a sub-matrix, or rows and columns can be deleted by assigning an empty array to them. Common operations on matrices include addition, subtraction, scalar operations, transposition, concatenation, multiplication, and calculating the determinant and inverse.
Matlab commands
This document provides an overview of MATLAB commands organized into categories such as general purpose commands, input/output commands, vector and matrix commands, plotting commands, programming commands, mathematical functions, numerical methods, and symbolic math toolbox functions. It summarizes the purpose and usage of many common MATLAB functions and operators.
Similar to 05_fragments.pdf (20)
Data Structures & Algorithms Coursework Assignment for Sem.docx
Data Structures & Algorithms Coursework Assignment for Sem.docx
More from Emertxe Information Technologies Pvt Ltd
10_isxdigit.pdf
The document discusses implementing a function to check if a character is a hexadecimal digit. It explains that a hexadecimal digit ranges from 0-9, A-F, a-f in the ASCII table. It provides examples of inputting different characters and checking if they are hexadecimal digits or not. The sample execution section is empty. It lists functions as the prerequisite for understanding how to create a custom function to check for hexadecimal digits.
01_student_record.pdf
The document provides an example program to implement a student record system using an array of structures. It involves reading the number of students and subjects, student names and marks for each subject, calculating averages and grades. The program displays menus to view all student details or a particular student's details based on roll number or name. It demonstrates declaring a structure for student records, reading input into an array of structures, calculating averages and grades, and printing the student records with options to search by roll number or name.
02_swap.pdf
This document discusses writing a macro called swap(t,x,y) that swaps two arguments of any data type t. It asks the user to input a data type and two values of that type, then swaps the values and displays the output. It explains how to swap two integers by using a temporary variable and applying the same concept to arguments of any type t by using macros. The objective is to understand macro preprocessing in C.
01_sizeof.pdf
This document discusses defining a macro called SIZEOF to return the size of a data type without using the sizeof operator. It explains that by taking the difference of the addresses of a variable and the variable plus one, cast to char pointers, you can get the size in bytes. An example is provided using an integer variable x, showing how taking the difference of (&x+1) and &x after casting to char pointers returns the size of an int, which is 4 bytes. Background on macros and pointers is provided. The objective is stated as understanding macro usage in preprocessing.
07_product_matrix.pdf
The document describes a C program to multiply two matrices. It explains that the program takes input of rows and columns for Matrix A and B, reads in the element values, and checks that the column of the first matrix equals the row of the second before calculating the product. An example is provided where the matrices can be multiplied, producing the output matrix, and another where they cannot due to mismatched dimensions. Requirements for the program include pointers, 2D arrays, and dynamic memory allocation.
06_sort_names.pdf
The document describes an assignment to read in an unspecified number (n) of names of up to 20 characters each, sort the names alphabetically, and print the sorted list. It provides examples of reading in 3 names ("Arunachal", "Bengaluru", "Agra"), sorting them using a custom string comparison function, and printing the sorted list ("Agra", "Arunachal", "Bengaluru"). Pre-requisites for the assignment include functions, dynamic arrays, and pointers. The objective is to understand how to use functions, arrays and pointers to complete the task.
04_magic_square.pdf
The document describes an algorithm to generate a magic square of size n×n. It takes the integer n as input from the user and outputs the n×n magic square. A magic square is an arrangement of distinct numbers in a square grid where the sum of each row, column and diagonal is equal. The algorithm uses steps like starting from the middle of the grid and moving element by element in a pattern, wrapping around when reaching the boundaries.
03_endianess.pdf
This document discusses endianness and provides an example program to convert between little endian and big endian formats. It defines endianness as the order of bytes in memory, and describes little endian as having the least significant byte at the lowest memory address and big endian as the opposite. An example shows inputting a 2-byte number in little endian format and outputting it in big endian. Pre-requisites of pointers and the objective of understanding endianness representations are also stated.
02_variance.pdf
The document provides steps to calculate variance of an array using dynamic memory allocation in C. It explains what variance is, shows an example to calculate variance of a sample array by finding the mean, deviations from mean, squaring the deviations and calculating the average of squared deviations. The key steps are: 1) Read array size and elements, 2) Calculate mean, 3) Find deviations from mean, 4) Square the deviations and store in another array, 5) Calculate average of squared deviations to get variance.
09_nrps.pdf
The document discusses generating non-repetitive pattern strings (NRPS) of length n using k distinct characters. It explains that an NRPS has a pattern that is not repeated consecutively. It provides steps to check if a string is an NRPS, including comparing characters and resetting a count if characters do not match. It also describes how to create an NRPS by starting with an ordered pattern and then copying subsequent characters to generate new patterns without repetition until the string reaches the desired length n. Sample inputs and outputs are provided.
11_pangram.pdf
The document discusses how to check if a string is a pangram, which is a sentence containing all 26 letters of the English alphabet. It provides an example of implementing the algorithm to check for a pangram by initializing an array to track letter occurrences, iterating through the input string to mark letters in the array, and checking if all letters are marked to determine if it is a pangram.
10_combinations.pdf
The document explains how to print all possible combinations of a given string by swapping characters. It provides an example of generating all six combinations of the string "ABC" through a step-by-step process of swapping characters. It also lists the prerequisites as strings, arrays, and pointers and the objective as understanding string manipulations.
08_squeeze.pdf
The document describes an assignment to write a program that squeezes characters from one string (s1) that match characters in a second string (s2). It provides examples of input/output and step-by-step demonstrations of the program removing matching characters from s1. It also lists prerequisites of functions, arrays, and pointers and the objective of understanding these concepts as they relate to strings.
07_strtok.pdf
The document discusses implementing the strtok() string tokenization function. It explains that strtok() breaks a string into tokens based on delimiters. The document then provides pseudocode to implement a custom strtok() function by iterating through the string, overwriting delimiter characters with null terminators to create tokens, and returning a pointer to each token. Sample input/output is provided. The objective is stated as understanding string functions, with prerequisites of strings, storage classes, and pointers.
06_reverserec.pdf
The document provides details on an assignment to write a program that recursively reverses a given string without using static variables, global variables, or loops. It includes the input, output, and examples of reversing the strings "Extreme" and "hello world". It also provides sample execution and pre-requisites of strings and recursive functions, with the objective being to understand reversing a string recursively.
05_reverseiter.pdf
The document provides code and examples for reversing a string using an iterative method in C++. It explains taking in a string as input, declaring output and input strings of the same length, and swapping the first and last characters, second and second to last, and so on through multiple iterations until the string is reversed. Examples show reversing the strings "Extreme" to "emertxE" and "hello world" to "dlrow olleh" through this iterative swap process. Pre-requisites of strings and loops are noted, with the objective stated as understanding string reversal using an iterative approach.
04_itoa.pdf
This document discusses implementing the itoa function, which converts an integer to a string. It provides examples of converting integers like 246, +123, and 23a7 to their string representations. The key steps are: getting each digit of the integer, converting each digit to a character, reversing the characters, and returning the string. Implementing itoa requires an understanding of functions and pointers. Sample code execution and prerequisites like functions and pointers are also outlined.
03_atoi.pdf
This document discusses implementing the atoi function in C, which converts a string to an integer. It provides examples of converting the strings "28", "543a", and "54a2" to integers. It also explains the steps to implement atoi by iterating through each character of the string, multiplying the value of the current character by 10 and adding it to the running integer total. The prerequisites of functions and pointers are listed, with the objective of understanding how to implement a function to convert a string to an integer.
More from Emertxe Information Technologies Pvt Ltd (20)
Recently uploaded
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar KanvariaTop five deadliest dog breeds in America
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
The Diamonds of 2023-2024 in the IGRA collection
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...National Information Standards Organization (NISO)
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.Recently uploaded (20)
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptx
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
05_fragments.pdf
- 1. Team Emertxe Advanced Pointers, Arrays and Functions
- 2. Assignment 5
- 3. Assignment 5
- 4. Assignment 5 WAP to implement fragments using Array of Pointers
- 5. Assignment 5 WAP to implement fragments using Array of Pointers Input:
- 6. Assignment 5 WAP to implement fragments using Array of Pointers Input: Read number of rows and no of columns for each row and read elements for each row
- 7. Assignment 5 WAP to implement fragments using Array of Pointers Input: Read number of rows and no of columns for each row and read elements for each row Output:
- 8. Assignment 5 WAP to implement fragments using Array of Pointers Input: Read number of rows and no of columns for each row and read elements for each row Output: Calculate average for each row separately and sort each row based on average and print row elements
- 10. Examples:- Read Number of rows/fragments(n) Assume n = 3 Assignment 5
- 11. Examples:- Read Number of rows/fragments(n) Assume n = 3 Assignment 5 500 504 508
- 12. Examples:- Read Number of elements/columns in each rows/fragment. Assume in 1st row = 3 elements/columns 2nd row = 2 elements/columns 3rd row = 4 elements/columns Assignment 5 1000 2000 3000 500 504 508 1000 1008 1004 2000 2004 3000 3012 3008 3004
- 13. Examples:- Allocate one extra column for storing average of each row. Assignment 5 500 504 508 1000 1008 1004 2000 2004 3000 3012 3008 3004 1000 2000 3000
- 14. Examples:- Initialize one more array to store number of columns in each row. Assignment 5 500 504 508 1000 1008 1004 2000 2004 3000 3012 3008 3004 1000 2000 3000 4 3 5 int arr
- 15. Examples:- Read the elements in each row. Assignment 5 500 504 508 30 5 18 12 6 1 8 6 2 1000 1008 1004 2000 2004 3000 3012 3008 3004 1000 2000 3000 4 3 5 int arr
- 16. Examples:- Calculate the average for each row and store it in last index of each row. Assignment 5 500 504 508 30 5 18 17.6 12 6 9 1 8 6 2 4.25 1000 1008 1004 2000 2004 3000 3012 3008 3004 1000 2000 3000 4 3 5 int arr
- 17. Examples:- Compare the average of each row and sort the rows accordingly. Assignment 5 500 504 508 30 5 18 17.6 12 6 9 1 8 6 2 4.25 1000 1008 1004 2000 2004 3000 3012 3008 3004 1000 2000 3000 Swap 3000 and 1000 4 3 5 int arr
- 18. Examples:- Compare the average of each row and sort the rows accordingly. Assignment 5 500 504 508 30 5 18 17.6 12 6 9 1 8 6 2 4.25 1000 1008 1004 2000 2004 3000 3012 3008 3004 3000 2000 1000 5 3 4 int arr
- 25. Assignment 5 Pre-requisites:- ⮚ Pointers ⮚ Functions
- 26. Assignment 5 Pre-requisites:- ⮚ Pointers ⮚ Functions ⮚ Dynamic memory allocation
- 27. Assignment 5 Pre-requisites:- ⮚ Pointers ⮚ Functions ⮚ Dynamic memory allocation Objective:-
- 28. Assignment 5 Pre-requisites:- ⮚ Pointers ⮚ Functions ⮚ Dynamic memory allocation Objective:- ⮚ To understand the concept of DMA and array of pointers