The document provides information about a test for candidates applying for M.Tech in Computer Science. It consists of two parts - Test MIII in the morning and Test CS in the afternoon. Test CS has two groups - Group A containing questions on analytical ability and mathematics, and Group B containing subject-specific questions in one of several sections according to the candidate's choice. The document then provides sample questions for Group A (mathematics-based) and Group B (subject-specific for various domains like mathematics, statistics, physics, computer science, and engineering).
The document describes the structure and content of a test for candidates applying for an M.Tech. in Computer Science. It contains two parts:
1. Group A contains 30 multiple choice questions testing mathematics at the B.Sc. pass level, covering topics like sets, functions, calculus, and linear algebra.
2. Group B contains 70 questions testing mathematics, statistics, physics, computer science, or engineering at the B.Sc. Hons. or B.Tech. level, depending on the candidate's choice of section. The syllabus for each subject is provided.
3. Sample questions are given for the Group A mathematics section, testing topics like roots of unity, invertible matrices, vector
The document describes the structure and content of the M.Tech Computer Science entrance exam. The exam consists of two tests - a morning objective test and an afternoon short answer test. The short answer test has two groups: Group A covers analytical ability and mathematics at the B.Sc. pass level, and Group B covers advanced topics in mathematics, statistics, physics, computer science, or engineering/technology depending on the candidate's choice. Sample questions are provided for both groups focusing on concepts like roots of unity, vector spaces, and differential equations.
The document provides instructions for a written test for admission to the Tata Institute of Fundamental Research. It describes that the test will have three parts, with Part A being common to both Computer Science and Systems Science streams. Part B will cover topics specific to Computer Science, while Part C will cover topics specific to Systems Science. Sample topics and questions are provided for each stream. The test will be three hours, multiple choice, and involve negative marking for incorrect answers. Calculators will not be permitted.
The document describes a test for candidates applying for an M.Tech. in Computer Science. [The test consists of two parts - an objective test in the morning and a short answer test in the afternoon. The short answer test has two groups - Group A covers analytical ability and mathematics at the B.Sc. level, while Group B covers additional topics in mathematics, statistics, physics, computer science, or engineering depending on the candidate's choice.] The document provides sample questions testing concepts in mathematics including algebra, calculus, number theory, and logic.
Jr imp, Maths IB Important, Mathematics IB, Mathematics, Jr. Maths, Mathematics AP board, Mathematics important, Maths AP Board, Inter Maths IB, Inter Maths IB Important.
The document discusses the concept of slope and how it is used to describe the steepness of a line. It defines slope as the ratio of the vertical change (rise) to the horizontal change (run) between two points on a line. Several forms of linear equations are presented, including point-slope form, slope-intercept form, and standard form. Relationships between parallel and perpendicular lines based on their slopes are also described. Examples are provided to demonstrate finding slopes, writing equations of lines, and determining if lines are parallel or perpendicular based on their slopes.
This document contains problems related to discrete-time signals and systems. It asks the student to:
1. Determine if various signals are periodic and calculate their fundamental frequencies.
2. Graph a sampled analog sinusoidal signal, calculate the discrete-time signal's frequency, and compare it to the original analog signal.
3. Graph a piecewise defined discrete-time signal, derive transformed versions of it, and express it using unit step and impulse functions.
Three key points about three-dimensional geometry from the document:
1) Three-dimensional geometry developed in accordance with Einstein's field equations and is useful in fields like electromagnetism and for constructing 3D models using computer algorithms.
2) The document presents a vector-algebra approach to three-dimensional geometry, defining points as ordered triples of real numbers and discussing properties of lines and planes.
3) Key concepts discussed include the vector and Cartesian equations of lines and planes, direction cosines and ratios, angles between lines, perpendicularity, parallelism, and intersections. Formulas are provided for distances, divisions, and reflections.
The document describes the structure and content of a test for candidates applying for an M.Tech. in Computer Science. It contains two parts:
1. Group A contains 30 multiple choice questions testing mathematics at the B.Sc. pass level, covering topics like sets, functions, calculus, and linear algebra.
2. Group B contains 70 questions testing mathematics, statistics, physics, computer science, or engineering at the B.Sc. Hons. or B.Tech. level, depending on the candidate's choice of section. The syllabus for each subject is provided.
3. Sample questions are given for the Group A mathematics section, testing topics like roots of unity, invertible matrices, vector
The document describes the structure and content of the M.Tech Computer Science entrance exam. The exam consists of two tests - a morning objective test and an afternoon short answer test. The short answer test has two groups: Group A covers analytical ability and mathematics at the B.Sc. pass level, and Group B covers advanced topics in mathematics, statistics, physics, computer science, or engineering/technology depending on the candidate's choice. Sample questions are provided for both groups focusing on concepts like roots of unity, vector spaces, and differential equations.
The document provides instructions for a written test for admission to the Tata Institute of Fundamental Research. It describes that the test will have three parts, with Part A being common to both Computer Science and Systems Science streams. Part B will cover topics specific to Computer Science, while Part C will cover topics specific to Systems Science. Sample topics and questions are provided for each stream. The test will be three hours, multiple choice, and involve negative marking for incorrect answers. Calculators will not be permitted.
The document describes a test for candidates applying for an M.Tech. in Computer Science. [The test consists of two parts - an objective test in the morning and a short answer test in the afternoon. The short answer test has two groups - Group A covers analytical ability and mathematics at the B.Sc. level, while Group B covers additional topics in mathematics, statistics, physics, computer science, or engineering depending on the candidate's choice.] The document provides sample questions testing concepts in mathematics including algebra, calculus, number theory, and logic.
Jr imp, Maths IB Important, Mathematics IB, Mathematics, Jr. Maths, Mathematics AP board, Mathematics important, Maths AP Board, Inter Maths IB, Inter Maths IB Important.
The document discusses the concept of slope and how it is used to describe the steepness of a line. It defines slope as the ratio of the vertical change (rise) to the horizontal change (run) between two points on a line. Several forms of linear equations are presented, including point-slope form, slope-intercept form, and standard form. Relationships between parallel and perpendicular lines based on their slopes are also described. Examples are provided to demonstrate finding slopes, writing equations of lines, and determining if lines are parallel or perpendicular based on their slopes.
This document contains problems related to discrete-time signals and systems. It asks the student to:
1. Determine if various signals are periodic and calculate their fundamental frequencies.
2. Graph a sampled analog sinusoidal signal, calculate the discrete-time signal's frequency, and compare it to the original analog signal.
3. Graph a piecewise defined discrete-time signal, derive transformed versions of it, and express it using unit step and impulse functions.
Three key points about three-dimensional geometry from the document:
1) Three-dimensional geometry developed in accordance with Einstein's field equations and is useful in fields like electromagnetism and for constructing 3D models using computer algorithms.
2) The document presents a vector-algebra approach to three-dimensional geometry, defining points as ordered triples of real numbers and discussing properties of lines and planes.
3) Key concepts discussed include the vector and Cartesian equations of lines and planes, direction cosines and ratios, angles between lines, perpendicularity, parallelism, and intersections. Formulas are provided for distances, divisions, and reflections.
The document discusses key concepts about linear equations in two variables including:
1) It describes the Cartesian coordinate plane and how to plot points based on their x and y coordinates.
2) It explains how to find the slope, y-intercept, and x-intercept of a linear equation graphically and algebraically.
3) It provides examples of rewriting linear equations in slope-intercept form (y=mx+b) and using intercepts and slopes to graph lines on the coordinate plane.
Here are the steps to find the line of intersection of the two planes:
1) Write the equations of the planes in standard form:
Plane 1: x + 2y - z = 4
Plane 2: 2x - y + z = 1
2) Set the equations equal to each other and solve as a system of equations:
x + 2y - z = 4
2x - y + z = 1
3) Eliminate one variable:
Subtract the second equation from the first:
(x + 2y - z) - (2x - y + z) = 4 - 1
-x + y = 3
4) Substitute back into one of the
The document discusses lines and planes in 3D space. It defines lines as being determined by a point and direction vector, and gives parametric and symmetric equations to represent lines. Planes are defined by a point and normal vector, with standard and general forms for their equations. Methods are provided for finding the intersection of lines or planes, as well as the distance between a point and plane or line. Examples demonstrate finding equations of lines and planes, sketching planes, and determining relationships between lines or planes.
This chapter discusses describing and analyzing points, lines, and planes in 3-dimensional space. It introduces vectors as a way to represent geometric objects with both magnitude and direction. Key topics covered include defining lines and planes parametrically using a point and direction vector, vector arithmetic, perpendicular and parallel lines/planes, and computing lengths, angles, and intersections between lines and planes.
The document introduces concepts of vector algebra and geometry in two dimensions. It defines vectors, vector operations like addition and scalar multiplication, and properties including equality of vectors, parallelism, orthogonality, and the Cauchy-Schwarz inequality. It also covers vector representations geometrically as arrows, vector length, unit vectors, and linear combinations of vectors. Key concepts are illustrated with diagrams of vectors in the Cartesian plane.
This document defines key concepts related to lines in the Euclidean plane including:
1. The definition of a line L as the set of points P0 + ta, where P0 is a base point, a is a non-zero direction vector, and t is a real parameter.
2. Methods for finding the equation of a line including the vector form, parametric form, symmetric form, normal form, and point-slope form.
3. Concepts such as the angle of inclination and slope of a line, and conditions for parallelism and orthogonality between lines.
Hermite spline english_20161201_jintaeksJinTaek Seo
The document discusses Hermite splines and their implementation for mobile game programming. It defines splines and their properties such as continuity and order. It also explains cubic Hermite splines which are specified by values and derivatives at endpoints. The key steps to implement a Hermite spline are presented, including defining the geometry and basis matrices to calculate spline points and derivatives as a function of a parameter. Code examples of 1D and 2D Hermite spline classes are also provided.
This document contains a series of exercises related to vectors in a plane. It begins with exercises involving vector operations like finding scalar multiples that satisfy equations and vector addition and subtraction. Later questions involve vector properties such as parallelism of vectors, orthogonality, vector lengths, and linear combinations of vectors. Geometric representations of vectors are also explored through problems finding points and line segments. The document aims to reinforce concepts of vector algebra and geometry through multiple practice problems.
Distinguish equations representing the circles and the conics; use the properties of a particular geometry to sketch the graph in using the rectangular or the polar coordinate system. Furthermore, to be able to write the equation and to solve application problems involving a particular geometry.
The document discusses different forms of equations for straight lines, including:
- Point-slope form, which defines a line through a known point with a given slope
- Slope-intercept form, which defines a line with a given slope and y-intercept
- Normal form, which defines a line based on its perpendicular distance from the origin and the angle it forms with the x-axis
- General form, which is the standard Ax + By + C = 0 equation for a line
It also covers how to find the distance from a point to a line, and how parallel and perpendicular lines can be identified based on the coefficients in their equations.
The cubic Hermite spline curve uses a cubic polynomial to interpolate between data points and guarantees continuity of the curve as well as its first and second derivatives at points. It is defined by two endpoints and the tangent vectors at those endpoints. The curve shape can be controlled by changing the endpoints or tangent vectors. The curve is represented parametrically and the coefficients of the polynomial are determined by satisfying boundary conditions at the endpoints.
René Descartes introduced a coordinate system that represented geometric figures using algebra. This allowed geometry and algebra to be linked by applying the methods of one field to problems in the other. The document then discusses several ways that geometry is used in daily life and provides formulas to calculate distances and areas using coordinate systems. It also defines key geometric concepts like slope, parallel and perpendicular lines, and the angle between two lines in terms of their slopes. Overall, the document outlines Descartes' contributions to representing geometry algebraically and defines important geometric relationships using coordinates.
A vector is a quantity with both magnitude and direction. There are two main operations on vectors: vector addition and scalar multiplication. Vector addition involves placing the tail of one vector at the head of another and drawing the third side of the resulting triangle or parallelogram. Scalar multiplication scales the length of a vector without changing its direction. Vectors can be represented using Cartesian components, where the magnitude and direction of a vector are given by its x, y, and z values relative to a set of perpendicular axes.
The document provides information on properties of straight lines and methods to write equations of straight lines given different conditions. It also discusses solving systems of linear equations using different methods like graphing, substitution, elimination and Cramer's rule. Key points covered include writing equations in slope-intercept and standard form, finding slopes of parallel and perpendicular lines, and properties of consistent, inconsistent and dependent systems of linear equations.
This document covers straight lines and their properties including positive and negative gradient, the relationship between perpendicular lines, using graphs to determine speed and distance, and finding equations of lines. It provides examples of calculating gradient, determining if two lines are perpendicular, finding speed from a distance-time graph, and deriving equations of lines given points or being parallel/perpendicular to another line. The content builds understanding of key concepts involving straight lines through worked examples.
The document discusses different types of equations that can represent straight lines in a plane, including point-slope form, two-point form, slope-intercept form, and normal form. It provides examples of writing the equation of a line given characteristics like two points, slope and intercept, or being parallel/perpendicular to another line. The document also covers topics like finding the distance from a point to a line and the equations of angle bisectors.
This document discusses parametric curves and their properties. It contains examples of curves defined by parametric equations in x and y, and explains how to plot these curves. It also describes how to find the Cartesian equation for a parametric curve by eliminating the parameter from the equations. Finally, it shows how to calculate the gradient of tangents to a parametric curve and find the equation of a tangent line for a given value of the parameter.
1) Bring necessary documents like passport photos, certificates, offer letter, proof of fees paid, and PAN card.
2) Reach IISc campus which is known locally as TATA Institute. Take a taxi from airport or take BMTC buses from Majestic.
3) On joining day, verify documents and get hostel room allotment, mess card, temporary ID card with SR number.
Pondicherry University is celebrating its 25th anniversary. It was established in 1985 by an Act of Parliament. The university has excellent facilities for higher education including lush green campuses, modern laboratories, WiFi, scholarships, and 147 degree programs across various disciplines. It aims to expand its student, teacher, and research capacity fourfold by 2011-2012 through new courses, departments, and infrastructure.
This document contains a syllabus for 3 engineering disciplines:
1. Chemical Engineering - Covering topics like thermodynamics, fluid mechanics, heat transfer, mass transfer, reaction engineering, and plant design.
2. Computer Science and Engineering - Covering topics like theory of computation, digital logic, computer architecture, programming, algorithms, compiler design, operating systems, databases, and computer networks.
3. Electronics and Communication Engineering - Covering topics like networks, electronic devices, analog circuits, digital circuits, signals and systems, control systems, communications, and electromagnetics.
The document provides information about the International Institute of Information Technology in Bangalore (IIIT-B). Some key points:
- IIIT-B is a deemed university established in 1999 with a vision of contributing to IT through education and research.
- It offers graduate programs in information technology that are among the best in India, focused on producing highly qualified practitioners and researchers.
- The campus is located in Bangalore, known as the Silicon Valley of India, near many major IT companies allowing collaboration opportunities.
- Facilities on campus include classrooms, labs, hostel accommodation, cafeteria and green spaces to support learning and research.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive function. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
The document discusses key concepts about linear equations in two variables including:
1) It describes the Cartesian coordinate plane and how to plot points based on their x and y coordinates.
2) It explains how to find the slope, y-intercept, and x-intercept of a linear equation graphically and algebraically.
3) It provides examples of rewriting linear equations in slope-intercept form (y=mx+b) and using intercepts and slopes to graph lines on the coordinate plane.
Here are the steps to find the line of intersection of the two planes:
1) Write the equations of the planes in standard form:
Plane 1: x + 2y - z = 4
Plane 2: 2x - y + z = 1
2) Set the equations equal to each other and solve as a system of equations:
x + 2y - z = 4
2x - y + z = 1
3) Eliminate one variable:
Subtract the second equation from the first:
(x + 2y - z) - (2x - y + z) = 4 - 1
-x + y = 3
4) Substitute back into one of the
The document discusses lines and planes in 3D space. It defines lines as being determined by a point and direction vector, and gives parametric and symmetric equations to represent lines. Planes are defined by a point and normal vector, with standard and general forms for their equations. Methods are provided for finding the intersection of lines or planes, as well as the distance between a point and plane or line. Examples demonstrate finding equations of lines and planes, sketching planes, and determining relationships between lines or planes.
This chapter discusses describing and analyzing points, lines, and planes in 3-dimensional space. It introduces vectors as a way to represent geometric objects with both magnitude and direction. Key topics covered include defining lines and planes parametrically using a point and direction vector, vector arithmetic, perpendicular and parallel lines/planes, and computing lengths, angles, and intersections between lines and planes.
The document introduces concepts of vector algebra and geometry in two dimensions. It defines vectors, vector operations like addition and scalar multiplication, and properties including equality of vectors, parallelism, orthogonality, and the Cauchy-Schwarz inequality. It also covers vector representations geometrically as arrows, vector length, unit vectors, and linear combinations of vectors. Key concepts are illustrated with diagrams of vectors in the Cartesian plane.
This document defines key concepts related to lines in the Euclidean plane including:
1. The definition of a line L as the set of points P0 + ta, where P0 is a base point, a is a non-zero direction vector, and t is a real parameter.
2. Methods for finding the equation of a line including the vector form, parametric form, symmetric form, normal form, and point-slope form.
3. Concepts such as the angle of inclination and slope of a line, and conditions for parallelism and orthogonality between lines.
Hermite spline english_20161201_jintaeksJinTaek Seo
The document discusses Hermite splines and their implementation for mobile game programming. It defines splines and their properties such as continuity and order. It also explains cubic Hermite splines which are specified by values and derivatives at endpoints. The key steps to implement a Hermite spline are presented, including defining the geometry and basis matrices to calculate spline points and derivatives as a function of a parameter. Code examples of 1D and 2D Hermite spline classes are also provided.
This document contains a series of exercises related to vectors in a plane. It begins with exercises involving vector operations like finding scalar multiples that satisfy equations and vector addition and subtraction. Later questions involve vector properties such as parallelism of vectors, orthogonality, vector lengths, and linear combinations of vectors. Geometric representations of vectors are also explored through problems finding points and line segments. The document aims to reinforce concepts of vector algebra and geometry through multiple practice problems.
Distinguish equations representing the circles and the conics; use the properties of a particular geometry to sketch the graph in using the rectangular or the polar coordinate system. Furthermore, to be able to write the equation and to solve application problems involving a particular geometry.
The document discusses different forms of equations for straight lines, including:
- Point-slope form, which defines a line through a known point with a given slope
- Slope-intercept form, which defines a line with a given slope and y-intercept
- Normal form, which defines a line based on its perpendicular distance from the origin and the angle it forms with the x-axis
- General form, which is the standard Ax + By + C = 0 equation for a line
It also covers how to find the distance from a point to a line, and how parallel and perpendicular lines can be identified based on the coefficients in their equations.
The cubic Hermite spline curve uses a cubic polynomial to interpolate between data points and guarantees continuity of the curve as well as its first and second derivatives at points. It is defined by two endpoints and the tangent vectors at those endpoints. The curve shape can be controlled by changing the endpoints or tangent vectors. The curve is represented parametrically and the coefficients of the polynomial are determined by satisfying boundary conditions at the endpoints.
René Descartes introduced a coordinate system that represented geometric figures using algebra. This allowed geometry and algebra to be linked by applying the methods of one field to problems in the other. The document then discusses several ways that geometry is used in daily life and provides formulas to calculate distances and areas using coordinate systems. It also defines key geometric concepts like slope, parallel and perpendicular lines, and the angle between two lines in terms of their slopes. Overall, the document outlines Descartes' contributions to representing geometry algebraically and defines important geometric relationships using coordinates.
A vector is a quantity with both magnitude and direction. There are two main operations on vectors: vector addition and scalar multiplication. Vector addition involves placing the tail of one vector at the head of another and drawing the third side of the resulting triangle or parallelogram. Scalar multiplication scales the length of a vector without changing its direction. Vectors can be represented using Cartesian components, where the magnitude and direction of a vector are given by its x, y, and z values relative to a set of perpendicular axes.
The document provides information on properties of straight lines and methods to write equations of straight lines given different conditions. It also discusses solving systems of linear equations using different methods like graphing, substitution, elimination and Cramer's rule. Key points covered include writing equations in slope-intercept and standard form, finding slopes of parallel and perpendicular lines, and properties of consistent, inconsistent and dependent systems of linear equations.
This document covers straight lines and their properties including positive and negative gradient, the relationship between perpendicular lines, using graphs to determine speed and distance, and finding equations of lines. It provides examples of calculating gradient, determining if two lines are perpendicular, finding speed from a distance-time graph, and deriving equations of lines given points or being parallel/perpendicular to another line. The content builds understanding of key concepts involving straight lines through worked examples.
The document discusses different types of equations that can represent straight lines in a plane, including point-slope form, two-point form, slope-intercept form, and normal form. It provides examples of writing the equation of a line given characteristics like two points, slope and intercept, or being parallel/perpendicular to another line. The document also covers topics like finding the distance from a point to a line and the equations of angle bisectors.
This document discusses parametric curves and their properties. It contains examples of curves defined by parametric equations in x and y, and explains how to plot these curves. It also describes how to find the Cartesian equation for a parametric curve by eliminating the parameter from the equations. Finally, it shows how to calculate the gradient of tangents to a parametric curve and find the equation of a tangent line for a given value of the parameter.
1) Bring necessary documents like passport photos, certificates, offer letter, proof of fees paid, and PAN card.
2) Reach IISc campus which is known locally as TATA Institute. Take a taxi from airport or take BMTC buses from Majestic.
3) On joining day, verify documents and get hostel room allotment, mess card, temporary ID card with SR number.
Pondicherry University is celebrating its 25th anniversary. It was established in 1985 by an Act of Parliament. The university has excellent facilities for higher education including lush green campuses, modern laboratories, WiFi, scholarships, and 147 degree programs across various disciplines. It aims to expand its student, teacher, and research capacity fourfold by 2011-2012 through new courses, departments, and infrastructure.
This document contains a syllabus for 3 engineering disciplines:
1. Chemical Engineering - Covering topics like thermodynamics, fluid mechanics, heat transfer, mass transfer, reaction engineering, and plant design.
2. Computer Science and Engineering - Covering topics like theory of computation, digital logic, computer architecture, programming, algorithms, compiler design, operating systems, databases, and computer networks.
3. Electronics and Communication Engineering - Covering topics like networks, electronic devices, analog circuits, digital circuits, signals and systems, control systems, communications, and electromagnetics.
The document provides information about the International Institute of Information Technology in Bangalore (IIIT-B). Some key points:
- IIIT-B is a deemed university established in 1999 with a vision of contributing to IT through education and research.
- It offers graduate programs in information technology that are among the best in India, focused on producing highly qualified practitioners and researchers.
- The campus is located in Bangalore, known as the Silicon Valley of India, near many major IT companies allowing collaboration opportunities.
- Facilities on campus include classrooms, labs, hostel accommodation, cafeteria and green spaces to support learning and research.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive function. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
The document provides information about the courses, admission criteria, and entrance examinations for the University of Hyderabad. It lists the various postgraduate, integrated, and doctoral programs offered across different schools and departments. The minimum eligibility criteria for admission to these programs is also outlined. It notes that admission is based on merit in the entrance exam, except for some M.Tech programs which consider GATE scores. Students awaiting qualifying exam results can receive conditional admission up to August 31st.
The document provides information about post-graduate programs being offered at Bengal Engineering and Science University for the 2010-2011 academic year. It lists five master's degree programs - Master of Town and Regional Planning, Master of Engineering in various disciplines like Civil Engineering, Electrical Engineering, etc. For each program, it provides the intake details under different categories and eligibility qualifications. Important dates for application, interview and admission are also listed. In addition, a brief profile of the university is given, outlining its history, vision, facilities and location.
The document describes the structure and content of a test for candidates applying for an M.Tech. in Computer Science. It contains two parts:
1) Test CS consists of two groups - Group A contains mathematics questions at the B.Sc. pass level. Group B contains more advanced mathematics, statistics, physics or computer science questions depending on the candidate's choice.
2) The document provides sample questions for Group A mathematics including questions on roots of unity, invertible matrices, vector space basis, and complex numbers.
The document provides information about a test for candidates applying for an M.Tech in Computer Science. It describes:
1) The test will have two parts - a morning objective test (Test MIII) and an afternoon short answer test (Test CS).
2) The CS test booklet will have two groups - Group A covering analytical ability and mathematics at the B.Sc. pass level, and Group B covering advanced topics in mathematics, statistics, physics, computer science, and engineering at the B.Sc. Hons. and B.Tech. levels.
3) Sample questions are provided for both Group A (mathematical reasoning and basic concepts) and Group B (advanced topics in real analysis
The document describes a test for candidates pursuing an M.Tech in Computer Science. The test consists of two parts - Test MIII in the morning and Test CS in the afternoon. Test CS has two groups: Group A contains questions on analytical ability and mathematics at the BSc pass level. Group B contains questions testing knowledge in various subjects at higher levels, and candidates must choose one section to answer questions from. Sample questions are provided for both groups covering topics in mathematics, statistics, physics, computer science, and engineering.
The document describes a test for candidates seeking an M.Tech in Computer Science. It discusses the structure and content of the test, which includes two parts - an objective test in the morning and a short answer test in the afternoon. The short answer test contains two groups: Group A covers analytical ability and mathematics at the B.Sc. pass level, while Group B covers various subjects at higher levels and candidates must choose one section to answer questions from. Sample questions are provided covering a range of mathematical and technical topics that may appear on the test.
The document describes the structure and content of the M.Tech Computer Science entrance exam. The exam consists of two tests - a morning objective test and an afternoon short answer test. The short answer test has two groups: Group A covers analytical ability and mathematics at the B.Sc. pass level, and Group B covers advanced topics in mathematics, statistics, physics, computer science, or engineering/technology depending on the candidate's choice. Sample questions are provided for both groups focusing on concepts like roots of unity, vector spaces, and differential equations.
The given matrix will become singular when x = 4. For a matrix to be singular, its determinant must be equal to 0. Computing the determinant of the given 3x3 matrix yields a quadratic equation in x with a solution of x = 4.
The document discusses matrices and determinants. It defines different types of matrices like rectangular, square, diagonal, scalar, row, column, identity and zero matrices. It explains how to find the determinant of matrices of order 1, 2 and 3 by expansion along the first row. It also defines minors, cofactors and properties of determinants. It describes how to perform row and column operations to evaluate determinants.
The document discusses matrices and determinants. It defines different types of matrices like rectangular, square, diagonal, scalar, row, column, identity and zero matrices. It explains how to find the determinant of matrices of order 1, 2 and 3 by expansion along the first row. It also defines minors, cofactors and properties of determinants. It describes how to perform row and column operations to evaluate determinants. Finally, it provides examples to calculate determinants.
3STUDY MATERIAL XII(Maths) 2022-23.pdfssuser47fc07
This document provides study material for class 12 mathematics. It includes the syllabus, important trigonometric results and substitutions, and study material on various topics like relations and functions, inverse trigonometric functions, matrices and determinants, continuity and differentiability, applications of derivatives, integrals, applications of integrals, differential equations, vectors, three-dimensional geometry, linear programming, and probability. The purpose of providing this study material is to help students enrich their subject knowledge and facilitate their learning.
1. The document discusses matrices and determinants, including types of matrices like rectangular, square, diagonal, and scalar matrices.
2. It defines determinants and provides rules for computing determinants of matrices of order 2 and 3 by expanding along rows or columns.
3. Key concepts covered include minors, cofactors, properties of determinants like how row operations affect the determinant value, and examples of computing determinants.
The document provides lecture notes for a course on matrix algebra for engineers. It covers topics such as the definition of matrices, addition and multiplication of matrices, special matrices like the identity and zero matrices, transposes, inverses, orthogonal matrices, and systems of linear equations. The notes are intended to teach the basics of matrix algebra at a level appropriate for engineering students who have taken calculus. They include video links, examples, problems at the end of each section, and solutions to the problems in an appendix.
The document provides instructions for a written test for admission to the Tata Institute of Fundamental Research. It describes that the test will have three parts, with Part A being common to both Computer Science and Systems Science streams. Part B will cover topics specific to Computer Science, while Part C will cover topics specific to Systems Science. Sample topics and questions are provided for each stream. The test will be three hours, multiple choice, and involve negative marking for incorrect answers. Calculators will not be permitted.
1. The document discusses matrices and determinants. It defines different types of matrices such as rectangular, square, diagonal, scalar, row, column, identity, zero, upper triangular, and lower triangular matrices.
2. It explains how to calculate determinants of matrices. The determinant of a 1x1 matrix is the single element. The determinant of a 2x2 matrix is calculated using a formula. Determinants of higher order matrices are calculated by expanding along rows or columns.
3. It introduces concepts of minors, cofactors, and explains how the value of a determinant can be written in terms of its minors and cofactors. It also lists some properties and operations for determinants.
The document discusses key concepts related to sets. It defines what a set is and the different ways of representing sets. It describes types of sets such as empty, finite, infinite and singleton sets. It explains the concepts of subset, equal sets, power set and different set operations like union, intersection, difference and complement. It provides properties and laws related to these set operations including commutative, associative and De Morgan's laws. It also discusses different types of intervals on the number line.
The document contains 15 multiple choice questions related to circles (circunferências) in the plane. Some key details assessed include:
1) Equations of lines parallel to a given line that intersect a circle and form equal chord lengths.
2) Finding which values satisfy an equation relating a line intersecting a circle.
3) Analyzing statements about triangles, lines, and circles.
4) Calculating the product of symmetrics and conjugates of complex numbers within a given set.
5) Determining the range of a chord length measured by a line intersecting a circle.
The questions cover topics such as parallel lines, secants, tangents, intersections, radii,
This document provides an introduction to calculus by discussing pure versus applied mathematics. It then reviews basic mathematical concepts such as exponents, algebraic expressions, solving equations, inequalities, and sets that are used in numerical analysis. Finally, it discusses graphical representations of rectangular and polar coordinate systems and includes examples of converting between the two systems.
Review of Trigonometry for Calculus “Trigon” =triangle +“metry”=measurement =...KyungKoh2
Review of Trigonometry for Calculus “Trigon” =triangle +“metry”=measurement =Trigonometry so Trigonometry got its name as the science of measuring triangles.
This document provides study material for Class 10 Mathematics, including the syllabus, chapters, sample papers, and marking schemes. It covers topics like number systems, algebra, coordinate geometry, trigonometry, mensuration, and statistics & probability. The document includes chapter-wise content for 15 topics, 5 sample papers each for standard and basic mathematics, and their respective marking schemes. It aims to help students prepare for their Class 10 mathematics exam.
The document is a maths project report for class 12th student Tabrez Khan on the topic of determinants. It contains definitions and properties of determinants of order 1, 2 and 3 matrices. It discusses minors, cofactors and applications of determinants like solving systems of linear equations using Cramer's rule. It also contains examples of evaluating determinants and applying properties of determinants to simplify expressions.
Tutorial of topological_data_analysis_part_1(basic)Ha Phuong
This document provides an overview of topological data analysis (TDA) concepts, including:
- Simplicial complexes which represent topological spaces and holes of different dimensions
- Persistent homology which tracks the appearance and disappearance of holes over different scales
- Applications of TDA concepts like using persistent homology to analyze protein compressibility.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms for those who already suffer from conditions like anxiety and depression.
The document is an application form for admission to the Ph.D. program at the Indian Institute of Technology Ropar. It requests personal details like name, date of birth, address, qualifications from past degrees, professional experience, and test scores if applicable. It lists required enclosures like mark sheets and certificates. It provides instructions on applying to multiple departments and states that employed applicants must get employer approval. The declaration section notes that the institute's decision is final and it can expel students who were admitted based on false information.
The document summarizes the topics covered in the entrance examination for the MSc/PhD Computer Science program at Chennai Mathematical Institute. The topics include discrete mathematics, probability theory, automata theory, algorithms, data structures, graphs, algorithmic techniques, and logic. It also lists 4 suggested reading materials that cover these topics in more depth.
The document provides information about a test for candidates applying to an M.Tech. program in Computer Science. [The test consists of two parts - an objective test in the morning and a short answer test in the afternoon. The short answer test has two groups - Group A covers analytical ability and mathematics at the B.Sc. pass level, and Group B covers various subjects at higher levels and the candidate must choose one section to answer questions from according to their background.] The document then provides sample questions that may be asked in Group A, which covers topics in mathematics including calculus, linear algebra, number theory, and sequences and series.
The document provides instructions for the entrance test for admission to the Indian Institute of Science's research program in Biological Science. The test will consist of 100 multiple choice questions worth 1 mark each. Candidates must mark their answers on the provided optical mark recognition sheet using an HB pencil by darkening the appropriate bubble for each question. They should darken only one bubble per question and change answers by fully erasing the previous mark. The test aims to evaluate candidates for the Biological Science paper which is part of the institute's research program admission process.
The document outlines important admission dates for various degree programs including BE, ME/MSc, and PhD at Delhi College of Engineering. Key dates are provided for application form release and submission, counseling, and registration. Eligibility requirements are specified for ME programs in various engineering disciplines as well as MSc Applied Physics. Minimum qualifications include an appropriate BE degree along with qualifying the GATE exam for full-time programs. Part-time programs are available for working professionals and have different duration and class timings. Seat reservation policies are also summarized.
This document provides information and important dates for the 2010-2011 academic year at Jamia Hamdard University in New Delhi, India. It outlines admission procedures and deadlines for various degree programs across multiple faculties, including Management and IT, Medicine, Nursing, Pharmacy, Science, Engineering, and others. It also provides details on available student support, scholarships, faculty members, fees, and contact information. Key dates listed include last dates for admission forms between March and April 2010, entrance tests from May 20-24, 2010, and commencement of classes starting July 15, 2010.
The document provides information for new students joining the Department of Computer Science and Automation at IISc for the ME, MSc(Engg), and PhD programs in 2010. It outlines guidance resources like faculty advisors and student advisors to help with adjustment. It emphasizes pursuing research and publication for dissertations and exploring research careers. Guidelines are provided for course selection and requirements for each term of study to aid successful program completion.
The document lists the intake capacity for various M.Phil, Ph.D, M.Tech, M.A, and M.Sc programs at Jawaharlal Nehru University for the year 2010-11. It provides details of over 50 departments/centers across 13 schools, specifying the number of seats available for each program. The intake ranges from 2 to 92 seats per program.
This document lists the courses offered by Osmania University's various faculties. It provides details of undergraduate, postgraduate, and diploma programs across faculties like Arts, Social Sciences, Commerce, Science, Oriental Languages, Management, Education, Engineering, Technology, Law, and Informatics. Admission criteria and processes vary for different programs but generally require qualifying exams and entrance tests. Annexures at the end provide additional course combination options for BA and BSc programs.
The document provides information about postgraduate degree programs offered at Malaviya National Institute of Technology Jaipur for the 2010-2011 academic year. It lists the degrees offered which include Doctor of Philosophy (PhD), Master of Technology (MTech), Master of Business Administration (MBA), Master of Science (MSc), and Master of Planning. It provides eligibility requirements and admission procedures for the PhD program. It also gives brief descriptions of the credit system used, course offerings, and locations of departments. The document serves as an informational brochure for those seeking admission to postgraduate programs at the Institute.
Bit mesra eligibility criteria for m. tech programmesbikram ...
The document outlines the minimum eligibility criteria for M.Tech programs at Mesra. It details:
1) Candidates must have at least 60% marks in their BE/BTech or equivalent, or 55% marks in their MSc/MA degree. Candidates awaiting final exam results can provisionally apply.
2) The document then lists each M.Tech program and the relevant qualifying examinations and disciplines that are eligible.
3) It notes that candidates admitted with a valid GATE score may be eligible for scholarships if funding is approved, but that some programs do not currently offer scholarships.
The document announces a common admission process for full-time M.Tech programs starting in 2010 at six National Institutes of Technology. Applicants must submit their online application by May 31, 2010 along with a registration fee, after which they will participate in a common counseling for admission determination. More details and the application are available starting May 3rd on the website of the National Institute of Technology in Tiruchirappalli.
The document announces admission notifications for the M.Sc. (Computer Science) and MCA (Master of Computer Applications) programs at the University of Delhi for 2010. It provides details on the admission procedure and eligibility criteria for M.Sc. Computer Science. 50% of seats are filled based on merit in the B.Sc. Computer Science exam from Delhi University. The remaining 50% are filled based on an entrance exam. The document lists the eligibility requirements and provides important dates for the M.Sc. Computer Science application process and entrance exam.
The document contains criteria for different departments. Some common criteria include a minimum percentage or CGPA required in previous degrees which varies for general, SC/ST and OBC categories. Many departments also require a minimum GATE score. Criteria include degree requirements, marks/CGPA cutoffs, and sometimes other factors like choice of specialization or fellowship awards.
Shortlisting criteria for m.tech(vdtt) 1bikram ...
The document outlines the shortlisting criteria and interview process for the VLSI Design Tools & Technology (VDTT) Programme to be held on May 12th and 13th, 2010. Candidates meeting the minimum GATE score and degree performance criteria in specific disciplines will be interviewed on the 12th, with industry sponsored candidates requiring at least 1 year of experience. Shortlisted candidates will interview with sponsoring industries on the 13th. Instructions are provided regarding reporting times, selection announcements, accommodation, and payments for admission if offered a position in the program.
1. Test Code: CS (Short answer type) 2006
M.Tech. in Computer Science
The candidates for M.Tech. in Computer Science will have to take two
tests – Test MIII (objective type) in the forenoon session and Test CS
(short answer type) in the afternoon session. The CS test booklet will have
two groups as follows.
GROUP A
A test for all candidates in analytical ability and mathematics at the B.Sc.
(pass) level, carrying 30 marks.
GROUP B
A test, divided into several sections, carrying equal marks of 70 in
mathematics, statistics, and physics at the B. Sc. (Hons.) level and in
computer science, and engineering and technology at the B.Tech. level. A
candidate has to answer questions from only one of these sections
according to his/her choice.
The syllabi and sample questions of the CS test are given below.
Note: All questions in the sample set are not of equal difficulty. They
may not carry equal marks in the test.
Syllabus
GROUP A
Elements of set theory. Permutations and combinations. Functions and
relations. Theory of equations. Inequalities.
Limit, continuity, sequences and series, differentiation and integration
with applications, maxima-minima, complex numbers and De Moivre’s
theorem.
Elementary Euclidean geometry and trigonometry.
Elementary number theory, divisibility, congruences, primality.
Determinants, matrices, solutions of linear equations, vector spaces, linear
independence, dimension, rank and inverse.
1
2. GROUP B
Mathematics
(B.Sc. Hons. level)
In addition to the syllabus of Mathematics in Group A, the syllabus
includes:
Calculus and real analysis – Real numbers, basic properties; convergence
of sequences and series; limits, continuity, uniform continuity of
functions; differentiability of functions of one or more variables and
applications. Indefinite integral, fundamental theorem of Calculus,
Riemann integration, improper integrals, double and multiple integrals and
applications. Sequences and series of functions, uniform convergence.
Linear algebra - Vector spaces and linear transformations; matrices and
systems of linear equations, characteristic roots and characteristic vectors,
Cayley-Hamilton theorem, canonical forms, quadratic forms.
Graph Theory - Connectedness, trees, vertex coloring, planar graphs,
Eulerian graphs, Hamiltonian graphs, digraphs and tournaments.
Abstract algebra – Groups, subgroups, cosets, Lagrange’s theorem; normal
subgroups and quotient groups; permutation groups; rings, subrings,
ideals, integral domains, fields, characteristics of a field, polynomial rings,
unique factorization domains, field extensions, finite fields.
Differential equations – Solutions of ordinary and partial differential
equations and applications.
Linear programming including duality theory.
Statistics
(B.Sc. Hons. level)
Notions of sample space and probability, combinatorial probability,
conditional probability, Bayes theorem and independence, random
variable and expectation, moments, standard univariate discrete and
continuous distributions, sampling distribution of statistics based on
normal samples, central limit theorem, approximation of binomial to
normal. Poisson law, Multinomial, bivariate normal and multivariate
normal distributions.
2
3. Descriptive statistical measures, product-moment correlation, partial and
multiple correlation; regression (simple and multiple); elementary theory
and methods of estimation (unbiasedness, minimum variance, sufficiency,
maximum likelihood method, method of moments, least squares methods).
Tests of hypotheses (basic concepts and simple applications of Neyman-
Pearson Lemma). Confidence intervals. Tests of regression. Elements of
non-parametric inference. Contingency Chi-square, ANOVA, basic
designs (CRD/RBD/LSD) and their analyses. Elements of factorial
designs. Conventional sampling techniques, ratio and regression methods
of estimation.
Physics
(B.Sc. Hons. level)
Kinetic theory of gases. Laws of thermodynamics. Heat engines. General
properties of matter – elasticity, surface tension & viscosity. Physical
optics – Interference, diffraction & polarization of light. Lagrangian and
Hamiltonian formulation of classical mechanics. Simple harmonic motion.
Conservation laws. Atomic physics and basic idea of nuclear physics.
Non-relativistic quantum mechanics. Special theory of relativity.
Semiconductor physics – transport phenomenon of electrons and holes, p-
n junctions, transistors and diodes, oscillators, amplifiers. Fundamentals of
electric circuits – LR, RC, LCR. Boolean algebra and logic circuits.
Electricity and magnetism – Coulomb’s Law, Gauss’ theorem, Biot-Savart
law, Ampere’s law. Electro-magnetic induction – self and mutual
induction. Electro-magnetic theory of light – reflection and refraction.
Computer Science
(B.Tech. level)
Data structure - arrays, stack, queue, linked list, binary tree, heap, AVL
tree, B-tree.
Programming languages - fundamental concepts – abstract data types,
procedure call and parameter passing, languages like C and C++.
Design and analysis of algorithms: - sorting, selection, searching.
Computer organization and architecture: number representation, computer
arithmetic, memory organization, I/O organization, microprogramming,
pipelining, instruction level parallelism.
Operating systems: - memory management, processor management,
critical section, deadlocks, device management.
3
4. Formal languages and automata theory: - finite automata & regular
expression, pushdown automata, context-free grammars, Turing machines,
elements of undecidability.
Principles of Compiler Construction: - lexical analyzer, parser, code
optimization, symbol table.
Database management systems: - ER diagram, relational model, relational
algebra, relational calculus, functional dependency, normalization (up to
3rd normal form), concurrency control, crash recovery.
Computer networks: - Computer networks: OSI, TCP/IP protocol suite;
Internetworking (specially IPv4, IPv6); LAN technology - Bus/tree, Ring,
Star; ALOHA, CSMA, CSMA-CD; IEEE standards (802.3 to .5); WAN
technology - Circuit switching, packet switching; data communications -
data encoding, flow control, error detection/correction.
Switching Theory and Logic Design: Boolean algebra, minimization of
Boolean functions, combinational and sequential circuits – synthesis and
design.
Engineering and Technology
(B.Tech. level)
Moments of inertia, motion of a particle in two dimensions, elasticity,
friction, strength of materials, surface tension, viscosity and gravitation.
Geometrical optics.
Laws of thermodynamics, and heat engines.
Electrostatics, magnetostatics and electromagnetic induction.
Magnetic properties of matter - dia, para and ferromagnetism.
Laws of electrical circuits - RC, RL and RLC circuits, measurement of
current, voltage and resistance.
D.C. generators, D.C. motors, induction motors, alternators, transformers.
p-n junction, bipolar & FET devices, transistor amplifier, oscillator, multi-
vibrator, operational amplifier.
Digital circuits - Logic gates, multiplexer, de-multiplexer, counter, A/D
and D/A converters.
Boolean algebra, minimization of switching function, combinational and
sequential circuits.
4
5. Sample Questions
GROUP A
Mathematics
A1. If 1, a1, a2,…, an-1 are the n roots of unity, find the value of
(1 - a1) (1 - a2)…(1 - an-1).
A2. Let
S = {( a1 , a 2 , a3 , a 4 ) : ai ∈ ℜ , i = 1, 2, 3, 4 and a1 + a 2 + a3 + a 4 = 0}
and
Γ = {( a1 , a 2 , a3 , a 4 ) : ai ∈ ℜ , i = 1, 2 , 3, 4 and a1 − a 2 + a3 − a 4 = 0}.
Find a basis for S ∩ Γ .
A3. Provide the inverse of the following matrix:
c0 c1 c2 c3
c 2 c3 c0 c1
c − c c1 − c0
3 2
c − c c3 − c2
1 0
1+ 3 3+ 3 3− 3 1− 3
where c 0 = , c1 = , c2= , and c 3 = .
4 2 4 2 4 2 4 2
(Hint: What is c0 + c12 + c 2 + c3 ?)
2 2 2
A4. For any real number x and for any positive integer n show that
[x] + x + 1 + x + 2 + L + x + n − 1 = [nx]
n n n
where [a] denotes the largest integer less than or equal to a.
A5. Let bqbq-1…b1b0 be the binary representation of an integer b, i.e.,
q
b = ∑ 2 j b j , bj = 0 or 1, for j = 0, 1, …, q.
j =0
Show that b is divisible by 3 if b0 − b1 + b2 − K +(−1) q bq = 0 .
A6. A sequence {xn} is defined by x1 = 2, xn+1 = 2 + x n , n =1,2, …
5
6. Show that the sequence converges and find its limit.
A7. Is sin ( x | x | ) differentiable for all real x? Justify your answer.
A8. Find the total number of English words (all of which may not have
proper English meaning) of length 10, where all ten letters in a word
are not distinct.
a1 a 2 a
A9. Let a0 + + + ..... + n = 0, where ai’s are some real constants.
2 3 n +1
Prove that the equation a 0 + a 1 x + a 2 x + ... + a n x = 0 has at least one
2 n
solution in the interval (0, 1).
A10. Let φ (n) be the number of positive integers less than n and having
no common factor with n. For example, for n = 8, the numbers 1, 3,
5, 7 have no common factors with 8, and hence φ(8) = 4. Show that
(i) φ ( p) = p − 1 ,
(ii) φ ( pq ) = φ ( p)φ (q) , where p and q are prime numbers.
A11. A set S contains integers 1 and 2. S also contains all integers of the
form 3x+ y where x and y are distinct elements of S, and every
element of S other than 1 and 2 can be obtained as above. What is S?
Justify your answer.
A12. Let f be a real-valued function such that f(x+y) = f(x) + f(y)
∀x, y ∈ R. Define a function φ by φ(x) = c + f(x), x ∈ R, where c is a
real constant. Show that for every positive integer n,
φ n ( x) = (c + f (c ) + f 2 (c) + ..... + f n −1 (c)) + f n ( x);
where, for a real-valued function g, g n (x ) is defined by
g 0 ( x) = 0, g 1 ( x) = g ( x), g k +1 ( x) = g ( g k ( x)).
A13. Consider a square grazing field with each side of length 8 metres.
There is a pillar at the centre of the field (i.e. at the intersection of
the two diagonals). A cow is tied with the pillar using a rope of
length 83 metres. Find the area of the part of the field that the cow is
allowed to graze.
6
7. A14. Let f : [0,1] → [-1,1] be such that f(0) = 0 and f(x) = sin 1 for x > 0.
x
Is it possible to get three sequences {an}, {bn}, {cn} satisfying all
the three properties P1, P2 and P3 stated below? If so, provide an
example sequence for each of the three sequences. Otherwise,
prove that it is impossible to get three such sequences.
P1: an > 0, bn > 0, cn > 0, for all n.
P2: lim an = 0, lim bn = 0, lim cn = 0.
n→∞ n→∞ n→∞
P3: lim f (an ) = 0, lim f (bn ) = 0.5, lim f (cn ) = 1.
n→∞ n→∞ n →∞
GROUP B
Mathematics
x n +3
M1. Let 0 < x1 < 1. If xn+1 = 3x + 1 , n = 1,2,3, …
n
5x n +3
(i) Show that xn+2 = 3x + 5 , n = 1,2,3, …
n
(ii) Hence or otherwise, show that lim xn exists.
n→∞
(iii) Find lim xn .
n→∞
M2. (a) A function f is defined over the real line as follows:
x sin π , x > 0
f ( x) = x
0, x = 0.
Show that f ′(x) vanishes at infinitely many points in (0,1).
(b) Let f : [0,1] → ℜ be a continuous function with f(0) = 0. Assume
that f ′ is finite and increasing on (0,1).
Let g ( x) = f ( x)
x
x ∈ (0,1) . Show that g is increasing.
M3. Let a1=1, and
an = n(an-1+1) for n = 2, 3, …
7
8. Let Pn = (1 + a11 )(1 + 1
a2
)L(1 + 1
an
)
Find lim Pn .
n→∞
M4. Consider the function of two variables
F(x,y) = 21x - 12x2 - 2y2 + x3 + xy2.
(a) Find the points of local minima of F.
(b) Show that F does not have a global minimum.
M5. Find the volume of the solid given by 0 ≤ y ≤ 2 x , x 2 + y 2 ≤ 4 and
0≤ z≤ x.
M6. (a) Let A, B and C be 1×n, n×n and n×1 matrices respectively. Prove
or disprove: Rank(ABC) ≤ Rank(AC).
(b) Let S be the subspace of R4 defined by
S = {(a1, a2, a3, a4) : 5a1 - 2a3 -3a4 = 0}.
Find a basis for S.
M7. Let A be a 3×3 matrix with characteristic equation λ − 5λ = 0.
3 2
(i) Show that the rank of A is either 1 or 2.
(ii) Provide examples of two matrices A1 and A2 such that the rank
of A1 is 1, rank of A2 is 2 and Ai has characteristic equation λ3 -
5λ2 = 0 for i = 1, 2.
M8. Define B to be a multi-subset of a set A if every element of B is an
element of A and elements of B need not be distinct. The ordering of
elements in B is not important.
For example, if A = {1,2,3,4,5} and B = {1,1,3}, B is a 3-element
multi-subset of A. Also, multi-subset {1,1,3} is the same as the
multi-subset {1,3,1}.
(a) How many 5-element multi-subsets of a 10-element set are
possible?
(b) Generalize your result to m-element multi-subsets of an n-
element set (m < n).
M9. Consider the vector space of all n x n matrices over ℜ .
8
9. (a) Show that there is a basis consisting of only symmetric and
skew-symmetric matrices.
(b) Find out the number of skew-symmetric matrices this basis
must contain.
M10. Let R be the field of reals. Let R[x] be the ring of polynomials over
R, with the usual operations.
(a) Let I ⊆ R[x] be the set of polynomials of the form a0 +a1x
+....+ anxn with a0 = a1 = 0. Show that I is an ideal.
(b) Let P be the set of polynomials over R of degree ≤ 1. Define ⊕
and Θ on P by (a0 +a1x) ⊕ (b0 +b1 x) = (a0 + b0)+(a1 +b1)x and
(a0 +a1x) Θ (b0 + b1x) = a0b0 + (a1b0 +a0b1)x. Show that (P, ⊕,
Θ ) is a commutative ring. Is it an integral domain? Justify your
answer.
M11. (a) If G is a group of order 24 and H is a subgroup of G of order 12,
prove that H is a normal subgroup of G.
(b) Show that a field of order 81 cannot have a subfield of order 27.
M12. (a) Consider the differential equation:
d2y dy
2
cos x + sin x − 2 y cos 3 x = 2 cos5 x.
dx dx
By a suitable transformation, reduce this equation to a second
order linear differential equation with constant coefficients.
Hence or otherwise solve the equation.
(b) Find the surfaces whose tangent planes all pass through the
origin.
M13. (a) Consider the following two linear programming problems:
P1: Minimize x1 subject to
x 1 + x2 ≥ 1
− x1 − x2 ≥ 1
where both x1 and x2 are unrestricted.
P2: Minimize x1 subject to
x 1 + x2 ≥ 1
− x1 − x2 ≥ 1
x1 ≥ 0, x2 ≥ 0.
9
10. Solve both the LPs. Write the duals of both the LPs and solve
the duals.
(b) If an LP is infeasible, what can you say about the solution of its
dual?
M14. Solve the following linear programming problem without using
Simplex method:
minimize 6 w1 + 8 w2 + 7 w3 + 15 w4 + w5
subject to w1 + w3 + 3 w4 ≥ 4,
w2 + w3 + w4 – w5 ≥ 3,
w1, w2, w3, w4, w5 ≥ 0.
M15. (a) Show that a tree on n vertices has at most n−2 vertices with
degree > 1.
(b) Show that in an Eulerian graph on 6 vertices, a subset of 5
vertices cannot form a complete subgraph.
M16. (a) Show that the edges of K4 can be partitioned into 2 edge-disjoint
spanning trees.
(b) Use (a) to show that the edges of K6 can be partitioned into 3
edge-disjoint spanning trees.
(c) Let Kn denote the complete undirected graph with n vertices and
let n be an even number. Prove that the edges of Kn can be
partitioned into exactly n/2 edge-disjoint spanning trees.
Statistics
S1. (a) X and Y are two independent and identically distributed random
variables with Prob[X = i] = pi, for i = 0, 1, 2, ……… Find
Prob[X < Y] in terms of the pi values.
(b) Based on one random observation X from N(0, σ2), show that
√π/2 |X| is an unbiased estimate of σ.
S2. (a) Let X0, X1, X2, … be independent and identically distributed
random variables with common probability density function f. A
random variable N is defined as
N = n if X1 ≤ X 0 , X 2 ≤ X 0 , , X n−1 ≤ X 0 , X n > X 0 , n = 1, 2, 3,
Find the probability of N = n .
10
11. (b) Let X and Y be independent random variables distributed
uniformly over the interval [0,1]. What is the probability that
the integer closest to Y is 2?
X
S3. If a die is rolled m times and you had to bet on a particular number of
sixes occurring, which number would you choose? Is there always
one best bet, or could there be more than one?
S4. Let X 1 , X 2 and X3 be independent random variables with Xi
following a uniform distribution over (0, iθ), for i = 1 , 2, 3 . Find
the maximum likelihood estimate of θ based on observations
x1 , x 2 , x3 on X 1 , X 2 , X 3 respectively. Is it unbiased? Find the
variance of the estimate.
S5. New laser altimeters can measure elevation to within a few inches,
without bias. As a part of an experiment, 25 readings were made on
the elevation of a mountain peak. These averaged out to be 73,631
inches with a standard deviation (SD) of 10 inches. Examine each of
the following statements and ascertain whether the statement is true
or false, giving reasons for your answer.
(a) 73631 ± 4 inches is a 95% confidence interval for the elevation
of the mountain peak.
(b) About 95% of the readings are in the range 73631 ± 4 inches.
(c) There is about 95% chance that the next reading will be in the
range of 73631 ± 4 inches.
S6. Consider a randomized block design with two blocks and two
treatments A and B. The following table gives the yields:
Treatment A Treatment B
Block 1 a b
Block 2 c d
(a) How many orthogonal contrasts are possible with a, b, c and d?
Write down all of them.
(b) Identify the contrasts representing block effects, treatment
effects and error.
(c) Show that their sum of squares equals the total sum of squares.
11
12. S7. Let X be a discrete random variable having the probability mass
function
p ( x) = Λx(1- Λ)1-x, x = 0, 1,
where Λ takes values ≥ 0.5 only. Find the most powerful test, based
1 2
on 2 observations, for testing H0 : Λ = against H1 : Λ = , with
2 3
level of significance 0.05.
S8. Let X1, X2, …, Xn be n independent N(θ,1) random variables where
−1 ≤ θ ≤ 1. Find the maximum likelihood estimate of θ and show
that it has smaller mean square error than the sample mean X .
S9. Let t1, t2, …tk be k independent and unbiased estimators of the same
k
t
parameter θ with variances σ 12 ,σ 2 ,Kσ k2 . Define t as ∑ i . Find
2
i =1 k
k
E( t ) and the variance of t . Show that ∑ (t
i =1
i − t ) 2 /{k (k − 1)} is an
unbiased estimator of var( t ).
S10. Consider a simple random sample of n units, drawn without
replacement from a population of N units. Suppose the value of Y1 is
unusually low whereas that of Yn is very high. Consider the following
estimator of Y , the population mean.
y + c, if the sample contains unit 1 but not unit N ;
ˆ = y − c, if the sample contains unit N but not unit 1;
Y
y , for all other samples;
where y is sample mean and c is a constant. Show that Y isˆ
unbiased. Given that
ˆ S2 2c
V (Y ) = (1 − f ) − (Y N −Y 1− nc)
n N −1
n 1 N
where f =
N
and S2 = ∑ (Yi − Y ) 2 , comment on the choice
N − 1 i =1
of c.
12
13. S11. In order to compare the effects of four treatments A, B, C, D, a block
design with 2 blocks each having 3 plots was used. Treatments A, B,
C were given randomly to the plots of one block and treatments A, B,
D were given randomly to the plots of the other block. Write down a
set of 3 orthogonal contrasts with the 4 treatment effects and show
that all of them are estimable from the above design.
S12. Let X1, X2, …Xn (Xi= (xi1, xi2, …, xip), i=1, 2, …, n) be n random
samples from a p-variate normal population with mean vector µ and
covariance matrix I.
Further, let S = ((sjk)) denote the sample sums of squares and
products matrix, namely
s jk = ∑i =1 ( xij − x j )( xik − x k ),1 ≤ j , k ≤ p, where
n
1 n
xj = ∑ xij ,1 ≤ j ≤ p.
n i =1
Obtain the distribution of l ' Sl where l ∈ ℜ k , l ≠ 0.
4
S13. Let Yi = ∑ β j X ij + ∈i , i = 1,2,L, k ,
j =1
where Yi’s and X’ijs are known, and ∈i’s are independent and each
∈i’s follows N(0,σ2).
Derive the likelihood ration tests for the following hypotheses
indicating their distributions under the respective null hypothesis.
(a) H0: β2 = 3β1 against H1: β2 = 3β1, and
(b) H0: β1 = β2, β3 = β4, β3 = 2β2 against
H1: at least one of the equalities in H0 is not true
S14. In a factory, the distribution of workers according to age-group and
sex is given below.
Sex Age-group Row
↓ 20-40 yrs. 40-60 yrs. total
Male 60 40 100
Female 40 10 50
Column Total 100 50 150
13
14. Give a scheme of drawing a random sample of size 5 so that both the
sexes and both the age-groups are represented. Compute the first-
order inclusion probabilities for your scheme.
Physics
P1. A beam of X-rays of frequency v falls upon a metal and gives rise to
photoelectrons. These electrons in a magnetic field of intensity H
describe a circle of radius γ. Show that
1
2
1 + e2 2 H 2 2
h (v − v 0 ) = m 0 c −1
m 2 c 4
0
where v0 is the frequency at the absorption limit and m0 is the rest
mass of the electron, e being expressed in e.s.u.
P2. (a) Two bodies A and B have constant heat capacities 2C and 2 C
3
respectively. The initial temperatures of A and B are 3T and
2T , respectively, in Kelvin scale. A refrigerator working
between these two bodies cools down B to a temperature of
TΟ
4
K . What is the minimum amount of work required to do this?
(b) A 60Ω resistor carrying a current of 4 ampere for 11seconds is
kept at a constant temperature of 47 Ο C by a stream of cooling
water. Calculate the change in entropy of (i) the resistor, and (ii)
the universe.
P3. The nucleus BZA decays by alpha ( He2 ) emission with a half-life T
4
−4
to the nucleus C ZA− 2 which in turn, decays by beta (electron)
T A−
emission with a half-life to the nucleus DZ −14 . If at time t = 0 , the
4
decay chain B → C → D had started with B0 number of B nuclei
only, then find out the time t at which the number of C nuclei will
be maximum.
14
15. P4. p1 and p 2 are two relativistic protons traveling along a straight line in
n 14n
the same direction with kinetic energies , and fractions
n +1 14n + 1
of their respective total energies. Upon entering a region where a
uniform magnetic field B acts perpendicularly on both, p1 and p 2
describe circular paths of radii r1 and r2 respectively. Determine the
r
ratio ρ = 1 . What is the value of ρ when n = 5 ?
r2
P5. A particle of mass m is fixed to the midpoint of a weightless rod of
length l , so that it cannot slide. The two ends of the rod can move
along the x and y axes respectively. A uniform gravitational field
acts in the negative y -direction. Using θ as the generalized co-
ordinate and neglecting friction, write the Lagrangian for the system
and obtain the equation of motion of the particle. Also, solve this
equation of motion for small θ , given that at t = 0 , θ = θ 0 and
dθ
= 0.
dt
P6. A test tube of mass 4 gm and diameter 1.5 cm floats vertically in a
large tub of water. It is further depressed vertically by 2 cm from its
equilibrium position and suddenly released, whereby the tube is seen
to execute a damped, oscillatory motion in the vertical direction. If
the resistive force due to viscous damping offered by water to the
tube in motion is √π Dv, where v is the instantaneous velocity of the
tube in water, and D is the diameter of the tube in cm, then find the
time period of oscillation of the tube. (Assume that there is no ripple
generated in the water of the tub.)
15
16. P7. An electron is confined to move within a linear interval of length L.
Assuming the potential to be zero throughout the interval except for
the two end points, where the potential is infinite, find the following:
(a) probability of finding the electron in the region 0 < x < L/4, when
it is in the lowest (ground) state of energy;
(b) taking the mass of the electron me to be 9 × 10-31 Kg, Planck's
constant h to be 6.6 × 10-34 Joule-sec and L = 1.1 cm, determine
the electron's quantum number when it is in the state having an
energy equal to 5 × 10-32 Joule.
P8. Consider the following circuit in which an a.c. source of V volts at a
frequency of 106/π cycles/sec is applied across the combination of
resistances and inductances. The total rms current flowing through
the circuit as measured by an a.c. ammeter is 10 amp. Find the rms
current I1 flowing through the upper branch of impedances. The self-
inductance of the two coils are as shown in the figure. The mutual
inductance between the coils is 2 mH and is such that the
magnetization of the two coils are in opposition.
P9. (a) Given the circuit shown in the figure, find out the current through
the resistance R = 3Ω between A and B .
(b) Suppose a metal ring of mean radius 100 cm is made of iron and
steel as shown in the figure. The cross-section of the ring is 10
16
17. sq.cm. If the ring is uniformly wound with 1000 turns, calculate
the current required to produce a flux of 1 milliweber. The
absolute permeability of air is 4π × 10 −7 H/m and relative
permeability of iron and steel are 250 and 1000 , respectively.
P10. (a) Calculate the donor concentration of an n-type Germanium
specimen having a specific resistivity of 0.1 ohm-metre at
300K, if the electron mobility µe = 0.25 metre2/Volt-sec at
300K, and the magnitude of the electronic charge is 1.6 × 10-19
Coulomb.
(b) An n-type Germanium specimen has a donor density of 1.5
15 -3
×10 cm . It is arranged in a Hall effect experiment where the
magnitude of the magnetic induction field B is 0.5
Weber/metre2 and current density J = 480 amp/metre2. What is
the Hall voltage if the specimen is 3 mm thick?
P11. Two heavy bodies A and B , each having charge − Q , are kept
rigidly fixed at a distance 2a apart. A small particle C of mass m
and charge + q ( << Q ), is placed at the midpoint of the straight
line joining the centers of A and B . C is now displaced slightly
along a direction perpendicular to the line joining A and B , and
then released. Find the period of the resultant oscillatory motion of
C , assuming its displacement y << a .
If instead, C is slightly displaced towards A , then find the
instantaneous velocity of C , when the distance between A and C
a
is .
2
P12. An elementary particle called ∑-, at rest in laboratory frame,
decays spontaneously into two other particles according to
17
18. Σ − → π − + n . The masses of ∑-, π- and n are M1, m1, and m2
respectively.
(a) How much kinetic energy is generated in the decay process?
(b) What are the ratios of kinetic energies and momenta of π
−
and n?
P13. An insurance company formulated a set of conditions under which
it will issue a policy. The applicant must be :
i) A married female 25 years old or above, or
ii) A female under 25 , or
iii) A married male under 25 , who has not been involved in a car
accident, or
iv) A married male who has been involved in a car accident, or
v) A married male, 25 years or above, who has not been involved
in a car accident.
(a) Select at most four Boolean variables, to find an algebraic
expression for a Boolean function f in terms of the four
variables, such that f assumes the value 1, whenever the policy
should be issued.
(b) Simplify algebraically the above expression for f and find the
simplest set of conditions.
P14. (a) Find the relationship between L, C and R in the circuit shown in
the figure such that the impedance of the circuit is independent
of frequency. Find out the impedance.
(b) Find the value of R and the current flowing through R shown in
the figure when the current is zero through R′.
18
19. τ B(τ )
P15. A gas obeys the equation of state P = + where B (τ ) is a
V V2
function of temperature τ only. The gas is initially at temperature
τ and volume V0 and is expanded isothermally and reversibly to
volume V1 = 2V0 .
(a) Find the work done in the expansion.
(b) Find the heat absorbed in the expansion.
∂S ∂P
(Hint: Use the relation = where the symbols have
∂V τ ∂τ V
their usual meaning.
P16. (a) A spaceship moving away from the Earth at a speed of 0.80C
fires a missile parallel to its direction of motion. The missile
moves at a speed of 0.60C relative to the ship. What is the
speed of the missile as measure by an observer on the earth? (C
is the velocity of light in vacuum)
(b) What is the Kinetic energy of a proton (with rest energy 938
MeV) moving at a speed of v=0.86C?
Computer Science
C1. (a) A grammar is said to be left recursive if it has a non-terminal A
such that there is a derivation A ⇒ + Aα for some sequence of
symbols α. Is the following grammar left-recursive? If so, write
an equivalent grammar that is not left-recursive.
A → Bb A→a
B →Cc B→b
C → Aa C→c
19
20. (b) An example of a function definition in C language is given
below:
char fun (int a, float b, int c)
{ /* body */ … }
Assuming that the only types allowed are char, int, float (no
arrays, no pointers, etc.), write a grammar for function headers,
i.e., the portion char fun(int a, …) in the above example.
(c) Consider the floating point number representation in C
programming language.
Give a regular expression for it using the following convention:
l denotes a letter, d denotes a digit, S denotes sign and p
denotes point.
State any assumption that you may need to make.
C2. The following functional dependencies are defined on the
relation ℜ( A, B, C , D, E , F ) :
(a) Find the candidate keys for ℜ .
(b) Is ℜ normalized? If not, create a set on normalized relations by
decomposing ℜ using only the given set of functional
dependencies.
(c) If a new attribute F is added to ℜ to create a new relation
ℜ′( A, B, C , D, E , F ) without any addition to the set of
functional dependencies, what would be the new set of
candidate key for ℜ′ ?
(d) What is the new set of normalized relations that can be derived
by decomposing ℜ′ for the same set of functional
dependencies?
(e) If a new dependency is declared as follows:
For each value of A , attribute F can have two values,
what would be the new set of normalized relations that can be
created by decomposing ℜ′ ?
C3. (a) A relation R(A, B, C, D) has to be accessed under the query
σB=10(R). Out of the following possible file structures, which
one should be chosen and why?
i) R is a heap file.
ii) R has a clustered hash index on B.
iii) R has an unclustered B+ tree index on (A, B).
20
21. (b) If the query is modified as πA,B(σB=10(R)), which one of the
three possible file structures given above should be chosen in
this case and why?
(c) Let the relation have 5000 tuples with 10 tuples/page. In case of
a hashed file, each bucket needs 10 pages. In case of B+ tree,
the index structure itself needs 2 pages. If the disk needs 25
msecs. to read or write a disk page, what would be the disk
access time for answering the above queries?
C4. Let A and B be two arrays, each of size n. A and B contain numbers
in sorted order. Give an O(log n) algorithm to find the median of
the combined set of 2n numbers.
C5. (a) Consider a pipelined processor with m stages. The processing
time at every stage is the same. What is the speed-up achieved
by the pipelining?
(b) In a certain computer system with cache memory, 750 ns
(nanosec) is the access time for main memory for a cache miss
and 50 ns is the access time for a cache hit. Find the percentage
decrease in the effective access time if the hit ratio is increased
from 80% to 90%.
C6. (a) A disk has 500 bytes/sector, 100 sectors/track, 20 heads and
1000 cylinders. The speed of rotation of the disk is 6000 rpm.
The average seek time is 10 millisecs. A file of size 50 MB is
written from the beginning of a cylinder and a new cylinder
will be allocated only after the first cylinder is totally occupied.
i) Find the maximum transfer rate.
ii) How much time will be required to transfer the file of 50
MB written on the disk? Ignore the rotational delay but not
the seek time.
(b) Consider a 4-way traffic crossing as shown in the figure.
Suppose that we model the crossing as follows:
21
22. - each vehicle is modeled by a process,
- the crossing is modeled as a shared data structure. Assume that
the vehicles can only move straight through the intersection (no
left or right turns). Using read-write locks (or any standard
synchronization primitive), you have to device a
synchronization scheme for the processes. Your scheme should
satisfy the following criteria:
i) prevent collisions,
ii) prevent deadlock, and
iii) maximize concurrency but prevent indefinite waiting
(starvation).
Write down the algorithm that each vehicle must follow in order
to pass through the crossing. Justify that your algorithm satisfies
the given criteria.
C7. (a) A computer on a 6 Mbps network is regulated by a token
bucket. The bucket is filled at a rate of 2 Mbps. It is initially
filled to capacity with 8 Megabits. How long can the computer
transmit at the full 6 Mbps?
(b) Sketch the Manchester encoding for the bit stream
0001110101.
(c) If delays are recorded in 8-bit numbers in a 50-router network,
and delay vectors are exchanged twice a second, how much
bandwidth per (full-duplex) line is consumed by the
distributed routing algorithm? Assume that each router has 3
lines to other routers.
C8. Consider a binary operation shuffle on two strings, that is just like
shuffling a deck of cards. For example, the operation shuffle on
22
23. strings ab and cd, denoted by ab || cd, gives the set of strings
{abcd, acbd, acdb, cabd, cadb, cdab}.
(a) Define formally by induction the shuffle operation on any two
strings x, y ∈ Σ*.
(b) Let the shuffle of two languages A and B, denoted by A || B be
the set of all strings obtained by shuffling a string x ∈ A with a
string y ∈ B. Show that if A and B are regular, then so is A || B.
C9. (a)Give a method of encoding the microinstructions (given in the
table below) so that the minimum number of control bits are
used and maximum parallelism among the microinstructions
is achieved.
Microinstructions Control signals
I1 C1 , C2 , C3 , C4 , C5 , C6 ,
I2 C1 , C3 , C4C6 ,
I3 C2 , C5 , C6 ,
I4 C4 , C5 , C8 ,
I5 C7 , C8 ,
I6 C1 , C8 , C9 ,
I7 C3 , C4 , C8 ,
I8 C1 , C2 , C9 ,
(b) A certain four-input gate G realizes the switching function G(a,
b, c, d) = abc + bcd. Assuming that the input variables are
available in both complemented and uncomplemented forms:
(i) Show a realization of the function f(u, v, w, x) = Σ (0, 1, 6, 9,
10, 11, 14, 15) with only three G gates and one OR gate.
(ii) Can all switching functions be realized with {G, OR} logic
set ?
C10. Consider a set of n temperature readings stored in an array T.
Assume that a temperature is represented by an integer. Design an
O(n + k log n) algorithm for finding the k coldest temperatures.
C11. Assume the following characteristics of instruction execution in a
given computer:
23
24. • ALU/register transfer operations need 1 clock cycle each,
• each of the load/store instructions needs 3 clock cycles, and
• branch instructions need 2 clock cycles each.
(a) Consider a program which consists of 40% ALU/register
transfer instructions, 30% load/store instructions, and 30%
branch instructions. If the total number of instructions in this
program is 10 billion and the clock frequency is 1GHz, then
compute the average cycles per instruction (CPI), total
execution time for this program, and the corresponding MIPS
rate.
(b) If we now use an optimizing compiler which reduces the total
number of ALU/register transfer instructions by a factor of 2,
keeping the number of other instruction types unchanged, then
compute the average CPI, total time of execution and the
corresponding MIPS rate for this modified program.
C12. A tape S contains n records, each representing a vote in an election.
Each candidate for the election has a unique id. A vote for a
candidate is recorded as his/her id.
(i) Write an O(n) time algorithm to find the candidate who wins
the election. Comment on the main memory space required by
your algorithm.
(ii) If the number of candidates k is known a priori, can you
improve your algorithm to reduce the time and/or space
complexity?
(iii) If the number of candidates k is unknown, modify your
algorithm so that it uses only O(k) space. What is the time
complexity of your modified algorithm?
C13. (a) The order of a regular language L is the smallest integer k for
which Lk = Lk+1, if there exists such a k, and ∞ otherwise.
(i) What is the order of the regular language a + (aa)(aaa)*?
(ii) Show that the order of L is finite if and only if there is an
integer k such that Lk = L*, and that in this case the order of L
is the smallest k such that Lk = L*.
(b) Solve for T(n) given by the following recurrence relations:
T(1) = 1;
T(n) = 2T(n/2) + n log n, where n is a power of 2.
24
25. (c) An A.P. is {p + qn|n = 0, 1, . . .} for some p, q ∈ IN . Show
that if L ⊆ {a}* and {n| an ∈ L} is an A.P., then L is regular.
C14. (a) You are given an unordered sequence of n integers with many
duplications, such that the number of distinct integers in the
sequence is O(log2 n). Design a sorting algorithm and its
necessary data structure(s) which can sort the sequence using
at most O(n log2(log2 n)) time. (You have to justify the time
complexity of your proposed algorithm.)
(b) Let A be a real-valued matrix of order n x n already stored in
memory. Its (i, j)-th element is denoted by a[i, j]. The
elements of the matrix A satisfy the following property:
Let the largest element in row i occur in column li. Now, for any
two rows i1, i2, if i1 < i2, then li1 ≤ li2 .
2 6 4 5 3
5 3 7 2 4
4 2 10 7 8
6 4 5 9 7
3 7 6 8 12
(a)
Row I l(i)
1 2
2 3
3 3
4 4
5 5
(b)
Figure shows an example of (a) matrix A, and (b) the corresponding
values of li for each row i.
Write an algorithm for identifying the largest valued element
in matrix A which performs at most O(nlog2n) comparisons.
25
26. C15. (a) You are given the following file abc.h:
#include <stdio.h>
#define SQR(x) (x*x)
#define ADD1(x) (x=x+1)
#define BeginProgram int main(int argc,char *argv[]){
#define EndProgram return 1; }
For each of the following code fragments, what will be the output?
(i) #include "abc.h"
main() { int y = 4; printf("%dn", SQR(y+1)); }
(ii) #include "abc.h"
BeginProgram
int y=3; printf("%dn", SQR(ADD1(y)));
EndProgram
(b) Given the following program:
#include <iostream.h>
main()
{
cout<<"MTech (CS)n";
}
Without changing the main() in any way, modify the program to
produce the following output:
Sample Question
MTech (CS)
Indian Statistical Institute
Engineering and Technology
E1. A bullet of mass M is fired with a velocity of 40 m/s at an angle θ
with the horizontal plane. At P, the highest point of its trajectory,
the bullet collides with a bob of mass 3M suspended freely by a
3
mass-less string of length m. After the collision, the bullet gets
10
26
27. stuck inside the bob and the string deflects with the total mass
through an angle of 120o keeping the string taut. Find
(i) the angle θ, and
(ii) the height of P from the horizontal plane.
Assume, g = 10 m / s 2 m, and friction in air is negligible.
E2. A rod of length 120 cm is suspended from the ceiling horizontally
by two vertical wires of equal length tied to its ends. One of the
wires is made of steel and has cross-section 0.2 cm 2 and the other
one is of brass having cross-section 0.4 cm 2 . Find out the position
along the rod where a weight may be hung to produce equal stress
in both wires
E3. A chain of total length L = 4 meter rests on a table top, with a part
of the chain hanging over the edge, as shown in the figure below.
Let α be the ratio of the length of the overhanging part of the chain
to L.
If the coefficient of friction between the chain and the table top is
0.5, find the values of α for which the chain remains stationary. If α
= 0.5, what is the velocity of the chain when the last link leaves the
table?
E4. A flywheel of mass 100 kg and radius of gyration 20 cm is mounted
on a light horizontal axle of radius 2 cm, and is free to rotate on
bearings whose friction may be neglected. A light string wound on
the axle carries at its free end a mass of 5 kg. The system is released
from rest with the 5 kg mass hanging freely. If the string slips off
the axle after the weight has descended 2 m, prove that a couple of
moment 10/π2 kg.wt.cm. must be applied in order to bring the
flywheel to rest in 5 revolutions.
27
28. E5. The truss shown in the figure rotates around the pivot O in a vertical
plane at a constant angular speed ω. Four equal masses (m) hang from
the points B, C, D and E. The members of the truss are rigid,
weightless and of equal length. Find a condition on the angular speed
ω so that there is compression in the member OE.
E6. If the inputs A and B to the circuit shown below can be either 0 Volt
or 5 Volt,
(i) what would be the corresponding voltages at output Z, and
(ii) what operation is being performed by this circuit ?
Assume that the transistor and the diodes are ideal and base to
emitter saturation voltage = 0.5 Volt
28
29. E7. Two bulbs of 500cc capacity are connected by a tube of length 20 cm
and internal radius 0.15 cm. The whole system is filled with oxygen,
the initial pressures in the bulbs before connection being 10 cm and
15 cm of Hg, respectively. Calculate the time taken for the pressures
to become 12 cm and 13 cm of Hg, respectively. Assume that the
coefficient of viscosity η of oxygen is 0.000199 cgs unit.
E8. Two identical watch glasses with negligible thickness are glued
together.
The rear one is silvered [see Figure(a)]. Sharp focus is obtained when
both object and image distance are equal to 20 cm. Suppose the space
between the glasses is filled with water (refractive index = 4/3) [see
Figure (b)]. Calculate d [Figure (b)] for which a sharp real image is
formed.
E9. (a) Two systems of equal mass m1 and m2 and heat capacity C are at
temperatures T1 and T2 respectively (T1 > T2). If the first is used as
source and the second as sink, find the maximum work obtainable
from such an arrangement.
(b) A Carnot engine A operates between temperatures T1 and T2 whose
dissipated heat at T2 is utilised by another Carnot engine B
operating between T2 and T3. What is the efficiency of a third
engine that operates between T1 and T3 in terms of the efficiencies
hA and hB of engines A and B respectively?
E10. (a) A system receives 10 Kcal of heat from a reservoir to do 15 Kcal
of work. How much work must the system do to reach the initial
state by an adiabatic process?
(b) A certain volume of Helium at 15˚C is suddenly expanded to 8
times its volume. Calculate the change in temperature (assume
that the ratio of specific heats is 5/3).
29
30. E11. A spherical charge distribution has a volume density ρ, which is a
function of r, the radial distance from the center of the sphere, as
given below.
A / r , A is constant for 0 ≤ r ≤ R
ρ=
0 , for r > R
Determine the electric field as a function of r, for r ≥ R. Also deduce
the expression for the electrostatic potential energy U(r), given that
U(∞) = 0 in the region r ≥ R.
E12. Consider the distribution of charges as shown in the figure below.
Determine the potential and field at the point p.
E13. A proton of velocity 107 m/s is projected at right angles to a uniform
magnetic induction field of 0.1 w/m2. How much is the path of the
particle deflected from a straight line after it has traversed a distance
of 1 cm? How long does it take for the proton to traverse a 900 arc?
E14. (a) State the two necessary conditions under which a feedback
amplifier circuit becomes an oscillator.
(b) A two-stage FET phase shift oscillator is shown in the diagram
below.
(i) Derive an expression for the feedback factor β.
(ii) Find the frequency of oscillation.
30
31. (iii) Establish that the gain A must exceed 3.
E15. A circular disc of radius 10cm is rotated about its own axis in a
uniform magnetic field of 100 weber/m2, the magnetic field being
perpendicular to the plane of the disc. Will there be any voltage
developed across the disc? If so, then find the magnitude of this
voltage when the speed of rotation of the disc is 1200 rpm.
E16. A 3-phase, 50-Hz, 500-volt, 6-pole induction motor gives an output
of 50 HP at 900 rpm. The frictional and windage losses total 4 HP
and the stator losses amount to 5 HP. Determine the slip, rotor
copper loss, and efficiency for this load.
E17. A shunt D.C. generator supplies a load of two motors each drawing
46 Amps and a lighting load consisting of twenty-two 60 watt lamps
at 220V. The resistance of shunt field, series field and armature are
110 ohms, 0.06 ohms and 0.05 ohms respectively.
(i) Find the electrical efficiency of the generator.
(ii) If the overall efficiency of the generator at the above load is
77%, find the total constant (iron and mechanical) loss.
E18. An alternator on open-circuit generates 360 V at 60 Hz when the
field current is 3.6 A. Neglecting saturation, determine the open-
circuit e.m.f. when the frequency is 40 Hz and the field-current is
24A.
E19. A 150 KVA, 4400/440 volt single phase transformer has primary and
secondary resistance and leakage reactance values as follows:
Rp = 2.4 Ω, Rs = 0.026 Ω, Xp =5.8 Ω, and Xs = 0.062 Ω.
This transformer is connected with a 290 KVA transformer in
parallel to deliver a total load of 330 KVA at a lagging power factor
of 0.8. If the first transformer alone delivers 132 KVA, calculate the
equivalent resistance, leakage reactance and percentage regulation of
the second transformer at this load. Assume that both the
transformers have the same ratio of the respective equivalent
resistance to equivalent reactance.
E20. The hybrid parameters of a p-n-p junction transistor used as an
amplifier in the common-emitter configuration are: hie = 800Ω, hfe =
46, hoe = 8 x 10-5 mho, hre = 55.4 x 10-4. If the load resistance is 5 kΩ
31
32. and the effective source resistance is 500 Ω, calculate the voltage
and current gains and the output resistance.
E21. Find the equivalent resistance between the points A and D of the
circuit shown in the diagram.
E22. (a) Design a special purpose counter to count from 6 to 15 using a
decade counter. Inverter gates may be used if required.
(b) For a 5 variable Boolean function the following minterms are
true: (0, 2, 3, 8, 10, 11, 16, 17, 18, 24, 25 and 26). Find a
minimized Boolean expression using Karnaugh map.
E23. In the figure, consider that FF1 and FF2 cannot be set to a desired
value by reset/preset line. The initial states of the flip-flops are
unknown. Determine a sequence of inputs (x1, x2) such that the
output is zero at the end of the sequence.
Output
___________________________________________________
32