Exam matlab1
Download as DOCX, PDF0 likes317 views
The document outlines a programming languages exam for third year engineering students from Minia University that contains 3 questions, defines several arrays with different contents and sizes, includes a MATLAB program to evaluate a function for user-specified values, and provides a MATLAB code segment to output values for variables ii, jj, and a in different loops and conditions. The exam is scheduled for April 3rd, 2012 and is worth a total of 25 degrees.
1 of 1
Download to read offline
![Minia University
Third Year
Faculty of Engineering
Programming Lang.
CSE Department
First Exam.,3rd April, 2012
Time allowed: 2 Hrs.
Degree: 25
Attempt the following questions and assume any missing data
Question (I):Determine the size and contents of the following arrays. Note
that thelater arrays may depend on the definitions of arrays defined earlier
inthis exercise.
(a) a = 2:3:8;
(b) b = [a' a' a'];
(c) c = b(1:2:3,1:2:3);
(d) d = a + b(2,:);
(e) w = [zeros(1,3) ones(3,1)' 3:5'];
(f )b([1 3],2) = b([3 1],2);
(g) e = 1:-1:5;
Question (III)Write a MATLAB program to evaluate a function f(x, y) for any two
user-specifiedvalues x and y. The function f (x, y) is defined as follows:
Question(III): Evaluate the output of the following MATLAB segment,
% question 3, exam #1 April,2012
for ii = 1 : 2 : 4
a = 0;
forjj = 1 : ii
ifjj == 3
a = ii*jj;
elseifjj == 2
a = ii^2;
continue
else
a = jj^3;
end
fprintf('ii = %d, jj = %d and a =
end
end
%dn',ii,jj,a)](https://image.slidesharecdn.com/exammatlab1-131113002718-phpapp01/85/Exam-matlab1-1-320.jpg)
Ad
Recommended
EC202 SIGNALS & SYSTEMS PREVIOUS QUESTION PAPER
EC202 SIGNALS & SYSTEMS PREVIOUS QUESTION PAPERVISHNUPRABHANKAIMAL This document provides information about a signals and systems exam, including sample exam questions. The questions cover topics such as:
- Plotting and analyzing signals
- Properties of linear time-invariant systems
- Fourier series and transforms
- Sampling theory
- Z-transforms and region of convergence
- Difference equations and impulse responses
The document contains multiple choice and numerical problems testing understanding of fundamental concepts in signals and systems.
Lab no.08
Lab no.08moeen khan afridi This document describes a lab experiment on complex exponentials and phasors. It introduces complex numbers and defines common operations like obtaining the real and imaginary parts. It then presents tasks involving calculating values for complex exponential signals and adding phasors. The document was designed by Dawar Awan for a class at CECOS College of Engineering and IT from March to July 2012.
1.1 and 1.2 slides revised
1.1 and 1.2 slides revisedsabon1005 This document provides an overview of objectives and content covered in Chapter 1, Sections 1.1 and 1.2 of a College Algebra course. Section 1.1 focuses on graphing points and equations in a rectangular coordinate system, interpreting graphs, and using graphing utilities. Section 1.2 covers solving linear and rational equations, including those with fractions, as well as identifying identities, conditional, and inconsistent equations.
Lecture 5 Relationship between pixel-2
Lecture 5 Relationship between pixel-2VARUN KUMAR The document discusses various topics related to image processing and computer vision, including connected component labeling, distance measures, arithmetic and logical operations, and neighborhood operations on images. Connected component labeling identifies shapes, areas, and boundaries in an image and is a fundamental step for high-level image analysis. Distance measures like Euclidean, city block, and chessboard distance are used to quantify the similarity between pixels. Arithmetic, logical, and neighborhood operations are common image processing techniques used for tasks like noise filtering, edge detection, and thinning.
January 9, 2015 intro to functions
January 9, 2015 intro to functionskhyps13 The document contains notes and examples about functions and relations. It defines functions and relations, and shows how to determine if a relation is a function using the vertical line test. Examples demonstrate evaluating functions for given inputs and writing the outputs in set notation. Steps are provided for mapping relations and identifying if they are functions. Practice problems have students substitute values into functions and write the outputs.
1
1Dell R&D Bangalore, INDIA This document contains a 20 question mock exam for the GATE exam. It provides instructions that each question is worth 1 mark, unanswered questions receive 0 marks and incorrect answers receive negative marks. It then lists 20 multiple choice questions related to computer science topics like operating systems, algorithms, data structures, computer networks and formal languages. For each question there are 4 possible answer choices and space to write the answer.
Lecture one
Lecture oneMahmoud Hussein r(6:-2:1) reverses the order and increments by -2, so it will give [-7, -5, -3, -1].
Lecture three
Lecture threeMahmoud Hussein This document discusses several MATLAB functions for working with polynomials, including:
- Using polyfit to find the polynomial that best fits a set of data points
- Evaluating polynomials with polyval
- Storing and running MATLAB code from text files called M-files
- Performing operations on polynomials like multiplication with conv and division with deconv
Lecture two
Lecture twoMahmoud Hussein The document discusses MATLAB vectors and matrices. It describes that MATLAB has row and column vectors. Row vectors are lists of numbers separated by commas or spaces within square brackets. Column vectors are similar but have elements separated by semicolons. Matrices are rectangular arrays of numbers with rows and columns. The document provides examples of defining, manipulating, and performing operations on vectors and matrices in MATLAB.
Doc 20180130-wa0006
Doc 20180130-wa0006HarithaRanasinghe This document contains 5 questions regarding algorithms and data structures for a 3 hour examination. Question 1 asks about algorithms, asymptotic analysis, and Big-O notation. Question 2 involves analyzing a binary search algorithm. Question 3 is about implementing selection sort. Question 4 focuses on implementing a dynamic stack using nodes and linked lists. Question 5 deals with binary search trees, including drawing a sample tree, traversing it, defining a node structure, and writing functions to traverse and search the tree.
유한요소법(FEM)을 이용한 구조해석
유한요소법(FEM)을 이용한 구조해석chimco.net This document discusses different numerical analysis methods for structural analysis, including finite element methods (FEM). It covers static and dynamic analysis approaches, as well as implicit and explicit solution procedures. It also summarizes characteristics of direct and iterative solvers for implicit methods, and techniques for parallelizing analysis solutions. Direct solvers require matrix factorization while iterative solvers use matrix-vector multiplications, which can be efficiently parallelized through domain decomposition and minimizing interface degrees of freedom.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -4 notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -4 notesJayanth Dwijesh H P This document provides information and formulas related to error control coding and binary cyclic codes. It begins with defining the code vector, message vector, parity check matrix, and generator matrix for error control coding. It then provides the parameters and capabilities for single error correcting Hamming codes. Finally, it presents formulas for non-systematic and systematic cyclic codes, including defining the remainder polynomial, parity check polynomial, and code vector formulations.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...![VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...](https://cdn.slidesharecdn.com/ss_thumbnails/itcmodule-4-190103070746-thumbnail.jpg?width=560&fit=bounds)
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...Jayanth Dwijesh H P INFORMATION THEORY AND CODING
B.E., V Semester, Electronics & Communication Engineering /
Telecommunication Engineering
[As per Choice Based Credit System (CBCS) scheme]
Subject Code:15EC54 and 17EC54
Module-4
Error Control Coding:
Introduction, Examples of Error control coding, methods of Controlling Errors, Types of Errors, types of Codes, Linear Block Codes: matrix description of Linear Block Codes, Error Detection and Error Correction Capabilities of Linear Block Codes, Single Error Correcting hamming Codes, Table lookup Decoding using Standard Array.
Binary Cyclic Codes:
Algebraic Structure of Cyclic Codes, Encoding using an (n-k) Bit Shift register, Syndrome Calculation, Error Detection and Correction (Sections 9.1, 9.2, 9.3, 9.3.1, 9.3.2, 9.3.3 of Text 1).
Question paper pattern:
The question paper will have ten questions
Each full question consists of 16marks.
There will be 2 full questions (with a maximum of four sub questions) from each module.
Each full question will have sub questions covering all the topics under a Module.
The students will have to answer 5 full questions, selecting one full question From each module.
Text Book:
1. Information Theory and Coding, Muralidhar Kulkarni , K.S. Shivaprakasha, Wiley India Pvt. Ltd, 2015, ISBN:978-81-265-5305-1
2. Digital and analog communication systems, K. Sam Shanmugam, John Wiley India Pvt. Ltd, 1996.
3. Digital communication, Simon Haykin, John Wiley India Pvt. Ltd, 2008.
Reference Books:
1. ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007
2. Principles of digital communication, J. Das, S. K. Mullick, P. K. Chatterjee, Wiley, 1986 - Technology & Engineering
3. Digital Communications – Fundamentals and Applications, Bernard Sklar, Second Edition, Pearson Education, 2016, ISBN: 9780134724058.
4. Information Theory and Coding, K.N.Hari bhat, D.Ganesh Rao, Cengage Learning, 2017.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...![VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...](https://cdn.slidesharecdn.com/ss_thumbnails/itcmodule-5-190103071115-thumbnail.jpg?width=560&fit=bounds)
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...Jayanth Dwijesh H P INFORMATION THEORY AND CODING
B.E., V Semester, Electronics & Communication
Engineering / Telecommunication Engineering
[As per Choice Based Credit System (CBCS) scheme]
Subject Code: 15EC54 & 17EC54
Module-5
Some Important Cyclic Codes: Golay Codes, BCH Codes (Section 8.4 – Article 5 of Text 3).
Convolution Codes: Convolution Encoder, Time domain approach, Transform domain approach, Code Tree, Trellis and State Diagram, The Viterbi Algorithm) (Section 8.5 – Articles 1,2 and 3, 8.6- Article 1 of Text 3).
Question paper pattern:
The question paper will have ten questions
Each full question consists of 16marks.
There will be 2 full questions (with a maximum of four sub questions) from each module.
Each full question will have sub questions covering all the topics under a Module.
The students will have to answer 5 full questions, selecting one full question From each module.
Text Book:
1. Information Theory and Coding, Muralidhar Kulkarni , K.S. Shivaprakasha, Wiley India Pvt. Ltd, 2015, ISBN:978-81-265-5305-1
2. Digital and analog communication systems, K. Sam Shanmugam, John Wiley India Pvt. Ltd, 1996.
3. Digital communication, Simon Haykin, John Wiley India Pvt. Ltd, 2008.
Reference Books:
1. ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007
2. Principles of digital communication, J. Das, S. K. Mullick, P. K. Chatterjee, Wiley, 1986 - Technology & Engineering
3. Digital Communications – Fundamentals and Applications, Bernard Sklar, Second Edition, Pearson Education, 2016, ISBN: 9780134724058.
4. Information Theory and Coding, K.N.Hari bhat, D.Ganesh Rao, Cengage Learning, 2017.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -5 notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -5 notesJayanth Dwijesh H P This document provides information and formulas related to information theory and coding. It discusses important cyclic codes like Reed-Solomon codes and convolution codes. For convolution codes, it provides the generator matrix formulas in the time and transform domains, showing how the output of the encoder is calculated from the input and generator matrix. It also gives the formulas for calculating the output polynomials from the input polynomial and generator polynomials in the transform domain approach.
Math unit29 using graphs to solve equations
Math unit29 using graphs to solve equationseLearningJa This document discusses using graphs to solve equations. It covers solving simultaneous equations by graphing the lines and finding their intersection point. It also discusses graphs of quadratic, cubic, and reciprocal functions, including their key characteristics and shapes. Examples of each type of function are shown. The document concludes by discussing using graphs to find specific values or intervals related to equations.
Math unit30 functions
Math unit30 functionseLearningJa This document contains 6 presentations on functions, mappings, and domains:
1) It introduces functions, mappings, and domains.
2) It further explores functions, mappings, and domains with examples.
3) It provides another example and asks about domain and range.
4) It covers composite functions, finding functions of other functions.
5) It introduces the concept of inverse functions.
6) It gives another example of finding the inverse of a function.
Assignment 1
Assignment 1Ciaran Cox This document summarizes three numerical computing tasks completed in C:
1) Newton's method to find the root of an equation to 5 decimal places of accuracy. Results were tabulated for different starting values.
2) The composite Simpson's rule to approximate integrals, with errors decreasing as panels (N) increased. Results were tabulated for different N.
3) Gaussian elimination to solve a system of linear equations Ax=b, where A is an N×N matrix and b is a vector. Tabulated the L2 and L∞ norms of the errors for different N.
Week7
Week7Ashutosh Singh This document provides course material on matrix operations and multi-dimensional arrays in C programming. It includes definitions and examples of two-dimensional arrays, matrix operations like addition and multiplication, and functions for reading, writing and manipulating matrices. It also discusses concepts like input buffers and the Collatz conjecture, and provides examples of generating Hailstone sequences from initial numbers.
Two Dimentional Array
Two Dimentional ArraySonya Akter Rupa The document discusses two dimensional arrays. It defines a two dimensional array as having two subscripts/indexes, with the first referring to the row and second to the column. It provides examples of declaring, initializing, inputting, outputting, adding and subtracting two dimensional arrays. It also lists applications of two dimensional arrays such as storing tables of data, matrix processing, images composed of pixel elements, and modeling graphs.
Directed Acyclic Graph Representation of basic blocks
Directed Acyclic Graph Representation of basic blocksMohammad Vaseem Akaram The document summarizes a seminar presentation on using directed acyclic graphs (DAGs) to represent and optimize basic blocks in compiler design. DAGs can be constructed from three-address code to identify common subexpressions and eliminate redundant computations. Rules for DAG construction include creating a node only if it does not already exist, representing identifiers as leaf nodes and operators as interior nodes. DAGs allow optimizations like common subexpression elimination and dead code elimination to improve performance of local optimizations on basic blocks. Examples show how DAGs identify common subexpressions and avoid recomputing the same values.
First Partial Review
First Partial ReviewCarlos Vázquez Esta es una presentación con el repaso del primer parcial de Cálculo diferencial en el pizarrón electrónico Promethean.
Matrix Multiplication(An example of concurrent programming)
Matrix Multiplication(An example of concurrent programming)Pramit Kumar its deals with how parallel programming can be achieved. its just an example of parallel programming.
Assignment premier academic writing agency with industry 
Assignment premier academic writing agency with industry Nicole Valerio Hello Sir
We are a premier academic writing agency with industry partners in UK, Australia and Middle East and over 15 years of experience. We are looking to establish long-term relationships with industry partners and would love to discuss this opportunity further with you.
Thanks & Regards
visit our website.
www.onlineassignmenthelp.com.au
www.freeassignmenthelp.com
www.btechndassignment.cheapassignmenthelp.co.uk
www.cheapassignmenthelp.com
www.cheapassignmenthelp.co.uk/
http://www.cheapassignmenthelp.net/
Fuzzy Sequencing Problem Using Generalized Triangular Fuzzy Numbers
Fuzzy Sequencing Problem Using Generalized Triangular Fuzzy NumbersIJERA Editor In this paper, we present the different methods to solve fuzzy sequencing problem using fuzzy technological
values like generalized triangular fuzzy numbers. The procedure adopted was the fuzzy sequencing problems
are defuzzified using ranking functions and hence solving the crisp sequencing problem by standard sequencing
algorithm for obtaining the optimal sequence and minimum completion time in terms of fuzzy values which is
illustrated with numerical examples and solutions
Parallel algorithms
Parallel algorithmsguest084d20 Parallel algorithms can be specifically written to execute on computers with multiple processing units. When designing parallel algorithms, the cost of communication and number of processors must be considered. Parallel algorithms are often modeled using the parallel random-access machine (PRAM) model, which simplifies issues like synchronization and communication. Common parallel algorithms include matrix multiplication, merge sort, and shortest path algorithms like Floyd's algorithm.
Machine Learning Basics
Machine Learning BasicsHumberto Marchezi This document provides an overview of machine learning concepts including supervised and unsupervised learning algorithms. It describes naive Bayes classifiers which use probabilistic models to classify data based on features. It also describes k-means clustering which groups unlabeled data into k clusters by minimizing distances between data points and assigned cluster centroids. The document provides examples of applying these algorithms to tasks like document and image classification, customer segmentation, and grouping related news articles.
Gate-Cs 1995
Gate-Cs 1995Ravi Rajput This document contains information about a GATE CS test paper from 1995, including sample questions from sections A and B. It also provides information about GATE Forum, which conducts mock GATE tests and online discussion forums to help students prepare for GATE. The document encourages thinking about GATE and considering GATE Forum as a resource.
2nd mid term daa paper
2nd mid term daa paperMansi Puri This document contains instructions and questions for an exam on the subject of Design and Analysis of Algorithms. It is divided into 3 sections worth a total of 30 marks. Section 1 contains 4 short questions about the differences between greedy and dynamic programming, constructing a binary search tree from a list of elements, and applying the knapsack problem and activity selection problem using each approach. Section 2 contains 2 longer questions about the longest common subsequence problem and scheduling jobs with deadlines and profits. Section 3 asks students to discuss matrix chain multiplication using dynamic programming and write an algorithm to insert an element into a binary search tree.
Ad
More Related Content
What's hot (20)
Lecture two
Lecture twoMahmoud Hussein The document discusses MATLAB vectors and matrices. It describes that MATLAB has row and column vectors. Row vectors are lists of numbers separated by commas or spaces within square brackets. Column vectors are similar but have elements separated by semicolons. Matrices are rectangular arrays of numbers with rows and columns. The document provides examples of defining, manipulating, and performing operations on vectors and matrices in MATLAB.
Doc 20180130-wa0006
Doc 20180130-wa0006HarithaRanasinghe This document contains 5 questions regarding algorithms and data structures for a 3 hour examination. Question 1 asks about algorithms, asymptotic analysis, and Big-O notation. Question 2 involves analyzing a binary search algorithm. Question 3 is about implementing selection sort. Question 4 focuses on implementing a dynamic stack using nodes and linked lists. Question 5 deals with binary search trees, including drawing a sample tree, traversing it, defining a node structure, and writing functions to traverse and search the tree.
유한요소법(FEM)을 이용한 구조해석
유한요소법(FEM)을 이용한 구조해석chimco.net This document discusses different numerical analysis methods for structural analysis, including finite element methods (FEM). It covers static and dynamic analysis approaches, as well as implicit and explicit solution procedures. It also summarizes characteristics of direct and iterative solvers for implicit methods, and techniques for parallelizing analysis solutions. Direct solvers require matrix factorization while iterative solvers use matrix-vector multiplications, which can be efficiently parallelized through domain decomposition and minimizing interface degrees of freedom.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -4 notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -4 notesJayanth Dwijesh H P This document provides information and formulas related to error control coding and binary cyclic codes. It begins with defining the code vector, message vector, parity check matrix, and generator matrix for error control coding. It then provides the parameters and capabilities for single error correcting Hamming codes. Finally, it presents formulas for non-systematic and systematic cyclic codes, including defining the remainder polynomial, parity check polynomial, and code vector formulations.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...Jayanth Dwijesh H P INFORMATION THEORY AND CODING
B.E., V Semester, Electronics & Communication Engineering /
Telecommunication Engineering
[As per Choice Based Credit System (CBCS) scheme]
Subject Code:15EC54 and 17EC54
Module-4
Error Control Coding:
Introduction, Examples of Error control coding, methods of Controlling Errors, Types of Errors, types of Codes, Linear Block Codes: matrix description of Linear Block Codes, Error Detection and Error Correction Capabilities of Linear Block Codes, Single Error Correcting hamming Codes, Table lookup Decoding using Standard Array.
Binary Cyclic Codes:
Algebraic Structure of Cyclic Codes, Encoding using an (n-k) Bit Shift register, Syndrome Calculation, Error Detection and Correction (Sections 9.1, 9.2, 9.3, 9.3.1, 9.3.2, 9.3.3 of Text 1).
Question paper pattern:
The question paper will have ten questions
Each full question consists of 16marks.
There will be 2 full questions (with a maximum of four sub questions) from each module.
Each full question will have sub questions covering all the topics under a Module.
The students will have to answer 5 full questions, selecting one full question From each module.
Text Book:
1. Information Theory and Coding, Muralidhar Kulkarni , K.S. Shivaprakasha, Wiley India Pvt. Ltd, 2015, ISBN:978-81-265-5305-1
2. Digital and analog communication systems, K. Sam Shanmugam, John Wiley India Pvt. Ltd, 1996.
3. Digital communication, Simon Haykin, John Wiley India Pvt. Ltd, 2008.
Reference Books:
1. ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007
2. Principles of digital communication, J. Das, S. K. Mullick, P. K. Chatterjee, Wiley, 1986 - Technology & Engineering
3. Digital Communications – Fundamentals and Applications, Bernard Sklar, Second Edition, Pearson Education, 2016, ISBN: 9780134724058.
4. Information Theory and Coding, K.N.Hari bhat, D.Ganesh Rao, Cengage Learning, 2017.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...Jayanth Dwijesh H P INFORMATION THEORY AND CODING
B.E., V Semester, Electronics & Communication
Engineering / Telecommunication Engineering
[As per Choice Based Credit System (CBCS) scheme]
Subject Code: 15EC54 & 17EC54
Module-5
Some Important Cyclic Codes: Golay Codes, BCH Codes (Section 8.4 – Article 5 of Text 3).
Convolution Codes: Convolution Encoder, Time domain approach, Transform domain approach, Code Tree, Trellis and State Diagram, The Viterbi Algorithm) (Section 8.5 – Articles 1,2 and 3, 8.6- Article 1 of Text 3).
Question paper pattern:
The question paper will have ten questions
Each full question consists of 16marks.
There will be 2 full questions (with a maximum of four sub questions) from each module.
Each full question will have sub questions covering all the topics under a Module.
The students will have to answer 5 full questions, selecting one full question From each module.
Text Book:
1. Information Theory and Coding, Muralidhar Kulkarni , K.S. Shivaprakasha, Wiley India Pvt. Ltd, 2015, ISBN:978-81-265-5305-1
2. Digital and analog communication systems, K. Sam Shanmugam, John Wiley India Pvt. Ltd, 1996.
3. Digital communication, Simon Haykin, John Wiley India Pvt. Ltd, 2008.
Reference Books:
1. ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007
2. Principles of digital communication, J. Das, S. K. Mullick, P. K. Chatterjee, Wiley, 1986 - Technology & Engineering
3. Digital Communications – Fundamentals and Applications, Bernard Sklar, Second Edition, Pearson Education, 2016, ISBN: 9780134724058.
4. Information Theory and Coding, K.N.Hari bhat, D.Ganesh Rao, Cengage Learning, 2017.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -5 notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -5 notesJayanth Dwijesh H P This document provides information and formulas related to information theory and coding. It discusses important cyclic codes like Reed-Solomon codes and convolution codes. For convolution codes, it provides the generator matrix formulas in the time and transform domains, showing how the output of the encoder is calculated from the input and generator matrix. It also gives the formulas for calculating the output polynomials from the input polynomial and generator polynomials in the transform domain approach.
Math unit29 using graphs to solve equations
Math unit29 using graphs to solve equationseLearningJa This document discusses using graphs to solve equations. It covers solving simultaneous equations by graphing the lines and finding their intersection point. It also discusses graphs of quadratic, cubic, and reciprocal functions, including their key characteristics and shapes. Examples of each type of function are shown. The document concludes by discussing using graphs to find specific values or intervals related to equations.
Math unit30 functions
Math unit30 functionseLearningJa This document contains 6 presentations on functions, mappings, and domains:
1) It introduces functions, mappings, and domains.
2) It further explores functions, mappings, and domains with examples.
3) It provides another example and asks about domain and range.
4) It covers composite functions, finding functions of other functions.
5) It introduces the concept of inverse functions.
6) It gives another example of finding the inverse of a function.
Assignment 1
Assignment 1Ciaran Cox This document summarizes three numerical computing tasks completed in C:
1) Newton's method to find the root of an equation to 5 decimal places of accuracy. Results were tabulated for different starting values.
2) The composite Simpson's rule to approximate integrals, with errors decreasing as panels (N) increased. Results were tabulated for different N.
3) Gaussian elimination to solve a system of linear equations Ax=b, where A is an N×N matrix and b is a vector. Tabulated the L2 and L∞ norms of the errors for different N.
Week7
Week7Ashutosh Singh This document provides course material on matrix operations and multi-dimensional arrays in C programming. It includes definitions and examples of two-dimensional arrays, matrix operations like addition and multiplication, and functions for reading, writing and manipulating matrices. It also discusses concepts like input buffers and the Collatz conjecture, and provides examples of generating Hailstone sequences from initial numbers.
Two Dimentional Array
Two Dimentional ArraySonya Akter Rupa The document discusses two dimensional arrays. It defines a two dimensional array as having two subscripts/indexes, with the first referring to the row and second to the column. It provides examples of declaring, initializing, inputting, outputting, adding and subtracting two dimensional arrays. It also lists applications of two dimensional arrays such as storing tables of data, matrix processing, images composed of pixel elements, and modeling graphs.
Directed Acyclic Graph Representation of basic blocks
Directed Acyclic Graph Representation of basic blocksMohammad Vaseem Akaram The document summarizes a seminar presentation on using directed acyclic graphs (DAGs) to represent and optimize basic blocks in compiler design. DAGs can be constructed from three-address code to identify common subexpressions and eliminate redundant computations. Rules for DAG construction include creating a node only if it does not already exist, representing identifiers as leaf nodes and operators as interior nodes. DAGs allow optimizations like common subexpression elimination and dead code elimination to improve performance of local optimizations on basic blocks. Examples show how DAGs identify common subexpressions and avoid recomputing the same values.
First Partial Review
First Partial ReviewCarlos Vázquez Esta es una presentación con el repaso del primer parcial de Cálculo diferencial en el pizarrón electrónico Promethean.
Matrix Multiplication(An example of concurrent programming)
Matrix Multiplication(An example of concurrent programming)Pramit Kumar its deals with how parallel programming can be achieved. its just an example of parallel programming.
Assignment premier academic writing agency with industry
Assignment premier academic writing agency with industry Nicole Valerio Hello Sir
We are a premier academic writing agency with industry partners in UK, Australia and Middle East and over 15 years of experience. We are looking to establish long-term relationships with industry partners and would love to discuss this opportunity further with you.
Thanks & Regards
visit our website.
www.onlineassignmenthelp.com.au
www.freeassignmenthelp.com
www.btechndassignment.cheapassignmenthelp.co.uk
www.cheapassignmenthelp.com
www.cheapassignmenthelp.co.uk/
http://www.cheapassignmenthelp.net/
Fuzzy Sequencing Problem Using Generalized Triangular Fuzzy Numbers
Fuzzy Sequencing Problem Using Generalized Triangular Fuzzy NumbersIJERA Editor In this paper, we present the different methods to solve fuzzy sequencing problem using fuzzy technological
values like generalized triangular fuzzy numbers. The procedure adopted was the fuzzy sequencing problems
are defuzzified using ranking functions and hence solving the crisp sequencing problem by standard sequencing
algorithm for obtaining the optimal sequence and minimum completion time in terms of fuzzy values which is
illustrated with numerical examples and solutions
Parallel algorithms
Parallel algorithmsguest084d20 Parallel algorithms can be specifically written to execute on computers with multiple processing units. When designing parallel algorithms, the cost of communication and number of processors must be considered. Parallel algorithms are often modeled using the parallel random-access machine (PRAM) model, which simplifies issues like synchronization and communication. Common parallel algorithms include matrix multiplication, merge sort, and shortest path algorithms like Floyd's algorithm.
Machine Learning Basics
Machine Learning BasicsHumberto Marchezi This document provides an overview of machine learning concepts including supervised and unsupervised learning algorithms. It describes naive Bayes classifiers which use probabilistic models to classify data based on features. It also describes k-means clustering which groups unlabeled data into k clusters by minimizing distances between data points and assigned cluster centroids. The document provides examples of applying these algorithms to tasks like document and image classification, customer segmentation, and grouping related news articles.
Gate-Cs 1995
Gate-Cs 1995Ravi Rajput This document contains information about a GATE CS test paper from 1995, including sample questions from sections A and B. It also provides information about GATE Forum, which conducts mock GATE tests and online discussion forums to help students prepare for GATE. The document encourages thinking about GATE and considering GATE Forum as a resource.
Similar to Exam matlab1 (20)
2nd mid term daa paper
2nd mid term daa paperMansi Puri This document contains instructions and questions for an exam on the subject of Design and Analysis of Algorithms. It is divided into 3 sections worth a total of 30 marks. Section 1 contains 4 short questions about the differences between greedy and dynamic programming, constructing a binary search tree from a list of elements, and applying the knapsack problem and activity selection problem using each approach. Section 2 contains 2 longer questions about the longest common subsequence problem and scheduling jobs with deadlines and profits. Section 3 asks students to discuss matrix chain multiplication using dynamic programming and write an algorithm to insert an element into a binary search tree.
09 a1ec01 c programming and data structures
09 a1ec01 c programming and data structuresjntuworld This document contains questions for an exam on C programming and data structures. It asks students to answer any 5 of the following 8 questions:
1. Explain functions of preprocessor, compiler, linker and provide a flowchart to find maximum and minimum of 3 numbers.
2. Write C expressions for various mathematical operations and determine differences between C terms. Provide a program to check if a number is prime.
3. Write recursive and iterative functions to calculate power and provide a program to print currency denominations for a given amount.
4. Trace a sample program and determine its output.
5. Provide structures for college data and a function to calculate student strength in a college.
6.
Sp 1418794917
Sp 1418794917lakshmi r This document contains a sample paper for Class XII Computer Science subject. It has 7 questions covering various topics in C++ programming. Question 1 has multiple parts on variables, built-in functions, error correction, output of programs, function overloading. Question 2 covers classes, constructors, inheritance. Question 3 includes array and memory problems. Question 4 tests file handling concepts. Questions 5-7 deal with SQL, Boolean algebra, networking, and cyber crimes respectively. The paper tests a range of skills from syntax to problem solving to applying concepts.
CBSE Class 12 Computer Science(083) Sample Question Paper 2020-21
CBSE Class 12 Computer Science(083) Sample Question Paper 2020-21chinthala Vijaya Kumar This document provides the instructions and sample questions for a Computer Science exam. It details the structure and format of the exam, which consists of two parts (A and B) with multiple choice, short answer, long answer, and descriptive questions. Part A contains two sections - short answer questions to be answered in one word/line, and case study questions with subparts. Part B contains three sections - short answer questions worth 2 marks each, long answer questions worth 3 marks each, and a very long answer question worth 5 marks. All programming questions must be answered in Python. The document provides examples of different types of questions on topics like SQL, cybercrime, networks, Python programming, and more.
Aerospace Engineering (AE) - Gate Previous Question Paper 2011 Download
Aerospace Engineering (AE) - Gate Previous Question Paper 2011 DownloadRakesh Bhupathi The document provides instructions for an online aerospace engineering examination. It states that the exam has 65 multiple-choice questions worth a total of 100 marks. Questions are either worth 1 or 2 marks depending on the question number. There is no negative marking for numerical answer questions but negative marking for multiple choice questions. Calculators are allowed but no other materials. The exam is timed for 3 hours.
CS Sample Paper 1
CS Sample Paper 1kvs The document provides a model question paper for class 12 computer science. It contains 7 questions covering various topics like C++, OOPs, data structures, file handling, SQL, boolean algebra and networking. The paper has a total of 70 marks distributed across different sub-questions having 1, 2, 3 or 4 marks each. Detailed blueprints specifying the marks distribution across different units is also provided.
D E S I G N A N D A N A L Y S I S O F A L G O R I T H M S J N T U M O D E L...
D E S I G N A N D A N A L Y S I S O F A L G O R I T H M S J N T U M O D E L...guest3f9c6b This document contains four sets of questions for a Design and Analysis of Algorithms exam. Each set contains 8 questions related to algorithms and their analysis. The questions cover topics such as performance analysis, matrix multiplication, binary search trees, greedy algorithms, dynamic programming, graph algorithms, NP-completeness, and more. Students must answer any 5 of the 8 questions in each set, which involve explaining concepts, proving statements, writing pseudocode, and analyzing time complexity.
R05010303 C O M P U T E R P R O G R A M M I N G A N D N U M E R I C A L M E ...
R05010303 C O M P U T E R P R O G R A M M I N G A N D N U M E R I C A L M E ...guestd436758 The document is a question paper for a Computer Programming and Numerical Methods exam containing 8 questions. Each question has multiple parts related to programming concepts in C language and numerical methods. The questions cover topics like C programming fundamentals, functions, arrays, pointers, structures, stacks, queues, and numerical techniques like Newton Raphson, bisection, interpolation, integration, and differential equations. Students have to answer any 5 out of the 8 questions in the exam.
Computer Science Sample Paper 2
Computer Science Sample Paper 2kvs This document contains a model question paper for Class XII Computer Science subject. It includes 6 questions covering various topics like C++, OOPs, Data Structures, File Handling, SQL, Boolean Algebra etc. A blue print is provided showing the distribution of topics and marks. Each question has various subparts with varying marks. Code snippets and problems are given to test the concepts.
Gate-Cs 1994
Gate-Cs 1994Ravi Rajput This document contains a GATE exam paper from 1994. It has two sections - Section A with 8 multiple choice questions and Section B with 20 questions where the test taker must answer 10. The questions cover topics in computer science including algorithms, data structures, automata theory, databases, computer architecture and electronics.
MATLAB Questions and Answers.pdf
MATLAB Questions and Answers.pdfahmed8651 This document contains multiple choice questions about MATLAB input and output, arithmetic operations, algebra, and managing variables. It asks about MATLAB commands, variable types, matrix operations, and polynomial functions. The correct answers are provided at the end.
Mca 104
Mca 104smumbahelp Dear students, get JNU 2021 Solved assignments and case study help by professionals.
Mail us at : [email protected]
Call us at : 08263069601
ComputerScience-SQP.pdffhtu h kya hua hai ap ka school
ComputerScience-SQP.pdffhtu h kya hua hai ap ka schoolravita44554455 Good morning babu lal mandir wala bhaiya sa puch raha hai ap ka school wala picnic pr Laker jata hai kya
Mathematica model test paper
Mathematica model test paperLuckshay Batra This document outlines a practical examination in Mathematica for a Mathematics degree program. It consists of 4 questions worth a total of 27 marks to be completed within 2 hours. Question 1 involves writing Mathematica commands to generate 4 different matrices. Question 2 asks to create sparse matrices with specified entries. Question 3 requires solving systems of equations using Solve and LinearSolve commands. Question 4 covers defining Fibonacci sequences, finding the product of even numbers, plotting functions with various options, and plotting and commenting on piecewise functions. The exam is concluded with the student's name and an end of exam statement.
Computer science ms
Computer science msB Bhuvanesh This document provides a marking scheme for a Computer Science exam for Class XII. It includes instructions, 6 sections (A through C), and multiple choice questions with parts. Section A focuses on C++ programming, Section B on Python, and Section C is compulsory for all students. Questions assess topics like functions, OOPs concepts, arrays, file handling, and more. For each part, the number of marks and what is required are specified. Sample code is provided to test understanding of concepts like data abstraction, inheritance, operator overloading and more.
matlab example
matlab exampleBirukTigistu This document contains the answers to a midterm exam for a Math 251 course. It includes 5 pages with 4 questions. Question 1 has multiple choice and short answer math problems. Question 2 evaluates variable names and fixes syntax errors in code. Question 3 involves matrix operations and creating a matrix with specified elements. Question 4 calculates totals from shopping and evaluates expressions. The document provides the solutions to a closed book math exam assessing MATLAB skills.
Gate-Cs 2006
Gate-Cs 2006Ravi Rajput This document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, logic, automata theory and databases. Sample questions ask about the minimum number of multiplications needed to evaluate a polynomial, the expected value of the smallest number in a random sample, and the recovery procedure after a database system crash during transaction logging.
Ad
Exam matlab1
- 1. Minia University Third Year Faculty of Engineering Programming Lang. CSE Department First Exam.,3rd April, 2012 Time allowed: 2 Hrs. Degree: 25 Attempt the following questions and assume any missing data Question (I):Determine the size and contents of the following arrays. Note that thelater arrays may depend on the definitions of arrays defined earlier inthis exercise. (a) a = 2:3:8; (b) b = [a' a' a']; (c) c = b(1:2:3,1:2:3); (d) d = a + b(2,:); (e) w = [zeros(1,3) ones(3,1)' 3:5']; (f )b([1 3],2) = b([3 1],2); (g) e = 1:-1:5; Question (III)Write a MATLAB program to evaluate a function f(x, y) for any two user-specifiedvalues x and y. The function f (x, y) is defined as follows: Question(III): Evaluate the output of the following MATLAB segment, % question 3, exam #1 April,2012 for ii = 1 : 2 : 4 a = 0; forjj = 1 : ii ifjj == 3 a = ii*jj; elseifjj == 2 a = ii^2; continue else a = jj^3; end fprintf('ii = %d, jj = %d and a = end end %dn',ii,jj,a)