SAU Entrance Exam Syllabus 2024 {Soon} Exam Pattern Download Direct Link @sau.int

SAU Entrance Exam Syllabus:- SAU (South Asian University) entrance exam, it’s important to be familiar with the syllabus beforehand. The SAU Entrance Exam Syllabus 2024 typically covers topics in language and literature, economics, legal studies, sociology, international relations, mathematics and computer science. It’s recommended that you review your notes from previous courses in these subjects, as well as any relevant textbooks or study materials. Additionally SAU Entrance Exam Syllabus, practicing past exam papers can help you get a sense of the format and types of questions that may be asked. Don’t forget to also take breaks and stay well-rested during your preparation period. With the right amount of effort and preparation, you can ace the SAU Entrance Exam Syllabus 2024 and take the first step towards achieving your academic goals.

SAU Entrance Exam Syllabus 2024, it’s important to know the syllabus so that you can prepare yourself accordingly. The exam consists of multiple-choice questions and is designed to test your knowledge in a variety of subjects, including English language proficiency, basic math skills, analytical reasoning, and general knowledge. The English language section covers grammar, vocabulary, comprehension, and writing skills. The SAU Entrance Exam Syllabus 2024 math section includes topics such as algebra, geometry, trigonometry, and calculus. The analytical reasoning section tests your ability to analyze information and solve problems using logical reasoning. Finally SAU Entrance Exam Syllabus 2024, the general knowledge section covers a wide range of topics including history, geography, science, politics, and current affairs.

SAU Entrance Exam Syllabus 2024

SAU entrance exam, it’s important to know what topics are covered in the SAU Entrance Exam Syllabus 2024. The exam is designed to test your knowledge in four key areas: general awareness, analytical and comprehension skills, quantitative ability, and English language proficiency. In the general awareness section, you can expect questions related to current events, politics, and international affairs. The SAU Entrance Exam Syllabus analytical and comprehension skills section will test your ability to analyze data and solve problems. The quantitative ability section will cover topics such as mathematics and statistics. Finally, the English language proficiency section will assess your reading comprehension, grammar, and vocabulary skills. By understanding the SAU entrance exam syllabus, you can better prepare yourself for success on test day.

Preparing for the SAU entrance exam can seem daunting, but understanding the syllabus can make a big difference. The SAU entrance exam syllabus covers a wide range of topics across multiple disciplines, including mathematics, reasoning, English language, and general knowledge. It is important to review and practice each of these areas in order to perform well on the exam. Some specific topics covered in the SAU Entrance Exam Syllabus 2024 include algebra, geometry, reading comprehension, vocabulary, current events, and basic science concepts. To prepare effectively for the exam, it may be helpful to create a study schedule that includes regular practice sessions in each of these areas. Additionally, seeking out resources such as study guides and sample questions can provide valuable insight into what to expect on the exam and how to best prepare for SAU Entrance Exam Syllabus. With dedication and hard work, anyone can excel on the SAU entrance exam and take an important step toward their academic goals.

SAU Entrance Exam Syllabus 2024 Details

SAU Entrance Exam Pattern 2024

Program-specific South Asian university exam formats may differ. Thus, every one of the applied competitors need to check the SAU Placement test Example to know about numerous parts of the Placement test. In addition, the SAU Entrance Exam 2024 consists of 100 multiple-choice questions (MCQs) on the relevant topics. In the SAU Entrance Exam 2024, each incorrect answer will result in a penalty of one-fourth of a point. Candidates can check the beneath tables for point by point SAU Placement test Example according to their ideal course.

M.Sc in Applied Mathematics

M.Sc in Computer Science

M.Sc in Biotechnology

MA in Economics

MA in International Relations

MA in Sociology

The entrance exam will last two hours, and the question paper will have two sections: Section 1 will consist of 26 multiple-choice questions worth one point each. These questions will assess the applicant’s undergraduate subject knowledge as well as his or her general knowledge of South Asia and the world. Students will be required to respond to a set of multiple-choice questions in Section 2 based on their reading of a given passage. There are 24 marks for this. All questions must be answered.

Master of Laws

Ph.D. in Mathematics

Ph.D. in Biotechnology

Phase 1

The entrance exam will last two hours and consist of forty multiple-choice questions. Mathematical Methods, Statistical & Econometric Methods, Development Economics, and Microeconomics will all be covered in the questions. Assuming the response given to any of the Numerous Decision Questions is off-base, ¼ of the imprints allotted to that question will be deducted.

Phase 2

Research Proposal- Candidates who are selected based on their performance on the entrance exam will be required to submit a brief research proposal of no more than one thousand words that clearly identifies a research issue and the approach they intend to take. In this regard, candidates should look at the research interests of individual faculty members to learn about the faculty’s extensive research expertise.

Ph.D. in International Relations

Phase 1

The entrance exam will last two hours, and the question paper will have two sections: Segment 1 will have 26 various decision inquiries of one imprint every that will test the candidate’s subject information and general information relating to South Asia and the world. Students will be required to respond to a series of multiple-choice questions based on a provided passage in Section 2. There are 24 marks for this. All questions must be answered. The level of subject knowledge and comprehension abilities will be postgraduate.

Phase 2

Shortlisted candidates will be required to submit two letters of recommendation, a statement of purpose worth 05 points, a comprehensive research proposal worth 30 points, a brief passage worth 05 points, and an interview worth 10 points.

Ph.D. in Sociology

The entrance exam will last two hours and include multiple-choice questions that will test the applicant’s knowledge of South Asia and the world as a whole as well as their subject knowledge. All questions must be answered.

Ph.D. in Legal Studies

The Entrance Test will last two hours, and it will have 50 multiple-choice questions at the LLM level, each worth two points. One-fourth of the marks for that question will be deducted if the answer to any multiple-choice question is incorrect. Country-wise legitimacy arrangements of competitors effective in the entry test will be drawn.

Read Also:- ICAR IARI Assistant Syllabus

South Asain University Entrance Exam Syllabus 2024

We depicted the most recent data on the SAU Selection test Schedule 2024. The subtopics that will be asked on the SAU Entrance Exam in 2024 are listed below. Candidates can study for the SAU Entrance Exam 2024 using these Subtopics. Up-and-comers should rehearse according to the weightage of the points to accomplish a decent score in the SAU Selection test 2024. Additionally, the SAU Entrance Exam 2024 Syllabus PDF can be downloaded to save all of the provided subtopics.

M.Sc in Applied Mathematics

Calculus and Analysis– Limit, congruity, uniform progression, and differentiability; Bolzano Weierstrass hypothesis; theorems of mean value; digressions and ordinary; peaks and valleys; integral calculus theorems; sequences and functions in series; homogeneous convergence; power bundles; sums by Riemann; Riemann mix; incorrect and precise integrals; derivatives in part and the Leibnitz theorem; sum of all derivatives; Fourier analysis; elements of a few factors; numerous integrals; Line; integrals of surface and volume; Green’s theorems; Gauss and Stokes; curl; gradient and divergence of the vectors.

Algebra– A fundamental theory of determinants and matrices; groups and the fundamental properties of groups; normal subgroups, cyclic groups, permutation groups, and subgroups; Theorem of Lagrange; groups of quotients; group homomorphism; correspondence and isomorphism theorems; rings; integral fields and domains; ideals and homomorphism in rings; vector space, vector subspace, the basis, dimension, and linear independence of vectors of a vector space.

Differential equations-General and specific arrangements of customary differential conditions (Tributes); development of Tribute; ODEs’ order, magnitude, and classification; integrating linear equations and a factor; linear differential equations of first and higher order with constant coefficients; change in the parameter; a linearly reducible equation; first-order partial differential equations (PDEs) with linear and quasi-linear solutions; Lagrange and Charpits strategies for first-request PDE; general, constant-coefficient solutions to higher-order PDEs

Numerical Analysis- Computerized arithmetic; machine handling; bisectional secant; Newton-Raphson and fixed-point accentuation methods for logarithmic and otherworldly circumstances; systems of linear equations: Condition number, Gauss elimination, LU decomposition, the Gauss, Siedal, and Jacobi methods; Administrators with limited contrasts; Lagrange and Newton’s interpolation; simplest guess; separating numbers; Integration by Simpson and the trapezoidal method.

Probability and Statistics– Sandard deviation, mean, median, and restrictive likelihood; distinct events; total probabilities and the theorem of Baye; random factors; functions for generating moments and expectations; conditional expectation, density and distribution functions.

Linear Programming-Problem in linear programming and its formulation; sensitivity, duality, and post-optimality analyses, the graphical method, the simplex method, and an artificial starting solution.

M.Sc in Computer Science

PART A

• Set Theory and Algebra- Sets, Relations, Functions, Groups, Partial Orders, Lattice, Boolean Algebra.
• Combinatorics- Permutations, Combinations, Counting, Summation, Binomial Theorem, Exponential Series.
• Matrix- Basic Concepts, Types of Matrices, Determinants, Transpose, Inverse and Rank of a Matrix, Matrix Algebra, Systems of Linear Equations.
• Calculus- Limit, Continuity, and Differentiability, Mean Value Theorems, Theorems of Integral Calculus, Evaluation of Definite and Improper Integrals, Partial Derivatives, Total Derivatives, Maxima and Minima.
• Ordinary Differential Equations- First Order First Degree Equations, Variable Separable Method, Homogeneous Equations, Exact Equations, Integrating Factors, Linear Equations.
• Vector Analysis- Addition, Subtraction, Dot Product, and Cross Products of Vectors.

PART B

• Programming in C– Elements of C, Identifiers, Data Types, Control Structures, Array, Structure, Union, Strings, Pointers, Functions, Parameter Passing to Functions, Recursion, File Handling.
• Data Structures & Algorithms- Elementary Concepts of List, Stack, Queue, Tree and Graph, Space and Time Complexity Analysis, Sorting Techniques: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, etc., Searching Techniques: Linear and Binary Search.
• Database Management System: Basic Concepts, Attributes, Entity and Relationships, ER Diagram, Database Decomposition and Normalization, Database Constraints, Relational Algebra, SQL.
• Digital Logic and Computer Architecture: Number System, Data Representation, Compliments, Computer Arithmetic, Logic Gates, Combinational and Sequential Circuits, Computer Organization, Instruction Formats, Addressing Modes, Memory Organization, and I/O Interfaces.
• Computer Networks: Introduction to computer networks, transmission media, transmission modes, network types: LAN, MAN, and WAN, network topologies, the basic concept of MAC and IP Address, and reference models: OSI & TCP/IP.
• Operating System (OS): Overview of OS, functionalities, and characteristics of OS, process and process states, threads, CPU scheduling and algorithms, memory management, memory allocation strategies, virtual memory concepts, paging, and segmentation.

M.Sc in Biotechnology

Part A will consist of 30 questions carrying one mark each and will have 10+2 level questions from Physics, Chemistry, Biology, and Mathematics. Candidates will be expected to attempt all questions from Part A.

Part B will consist of 100 questions, out of which 70 questions need to be answered. Each question will carry one mark and will have undergraduate-level questions from Biochemistry, Cell Biology, Molecular Biology, Immunology, Animal Sciences, Plant Sciences, Genetics, Microbiology, Biophysics, and Biostatistics. If more than 70 questions are answered, the first 70 will be considered for evaluation.

MA in Economics (with specialization in Economic Development)

• Microeconomics
• Macroeconomics
• Development Economics
• Mathematics and Statistics, respectively.

MA in International Relations

• General Awareness
• Subject knowledge

Master of Laws (LLM)

Part A

General Knowledge, Political Science, Geography, General Science, and Civics of the 10+2 level.

Part B

Legal Methods of Law; Jurisprudence: Analytical School of Law; Pure Theory of Law; Sociological Jurisprudence; Legal Personality and Legal Rights; Ownership; Possession and Rule of Law. Public International Law: Sources of International Law, Relation of International Law and Municipal Law, Principles of International Law; the Law of International Organizations; International Trade Law; International Humanitarian Law; Intellectual Property Law; International Environment Law; International Human Rights Law.

Ph.D. in Mathematics

Analysis– real purposes; limit, continuity, and distinctiveness; sequences; series; homogeneous convergence; complex variable functions; complex integration, analytical functions; singularities, Laurent series, and power; metric voids; stereographic projection; geography, smallness, connectedness; inner product spaces and normed linear spaces; linear operators, dual spaces; Lebesgue integration and measurement; Theorems about convergence.

Algebra-A fundamental theory of determinants and matrices; eigenvalues and eigenvectors; Gatherings and their rudimentary properties; normal subgroups, cyclic groups, permutation groups, and subgroups; Theorem of Lagrange; remainder gatherings, homomorphism of gatherings; P-groups and the Cauchy Theorem; the design of gatherings; Sylow’s hypotheses and their applications; fields, rings, and integral domains; ideals and homomorphism in rings; polynomial rings and criteria for irreducibility; orthonormal basis, inner product spaces, vector space, vector subspace, linear independence of vectors, basis and dimensions of a vector space; Gram-Schmidt process, direct changes.

Differential Equations– Ordinary differential equations (ODEs) of the first order; arrangement of first-request introductory worth issues; a single first-order ODE solution; system of linear ODEs of the first order; how to solve the problem dx/P=dy/Q=dz/R; orthogonal course; arrangement of Pfaffian differential conditions in three factors; ODEs of linear second order; issues of Sturm-Liouville; Laplace change of Tributes; series arrangements; For first-order partial differential equations (PDEs), the Cauchy problem; strategy for qualities; second-request direct PDEs in two factors and their arrangement; variable separation; arrangement of Laplace, wave, and dispersion conditions; Fourier changes and Laplace change of PDEs.

Numerical Analysis– Algebraic and transcendental equations numerically solved; immediate and iterative strategies for arrangement of straight conditions; grid eigenvalue issues; approximations and interpolation; differentiation and integration of numbers; combining numerical methods; double integration of numbers; numerical solution for problems with initial values; boundary value problems can be solved using the finite difference and finite element methods.

Probability and Statistics– Axiomatic approach of probability; random variables; expectation, moments generating functions, density and distribution functions; conditional expectation.

Linear Programming– Linear programming problem and its formulation; graphical method, simplex method; artificial starting solution; sensitivity analysis; duality and post-optimality analysis.

Ph.D. Computer Science

PART A:

• Discrete Mathematics- Sets, Relations, Functions, Boolean Algebra, Propositional logic, First Order Predicate Logic, Lattice.
• Combinatorics- Permutations, Combinations, Counting, Summation, Recurrence Relations, Binomial Theorem, Exponential Series, Pigeonhole Principle.
  Probability and Statistics: Conditional Probability, Mean, Median, Mode, Standard Deviation, Variance, Covariance, Random Variable, Distributions (Uniform, Normal, Exponential, Poisson, Binomial).
• Vector Analysis- Rectangular Cartesian Co-ordinates, Equations of a Line, Mid-point, Intersections, etc., Equations of a Circle, Distance Formulae, Pair of Straight Lines, Addition and Subtraction of Vectors, Scalar and Vector, Product of Two Vectors, Scalar Triple Product, Vector Triple Product.
• Matrices: Basic Concepts, Types of Matrices, Determinants, Transpose, Inverse and Rank of a Matrix, Matrix Algebra, Systems of Linear Equations, Eigen Values, and Eigen Vectors.

Part B

• Programming in C– Data Types & Qualifiers, Identifiers, Control Structures, Array and Pointers, Array of Pointers, Pointers to Array, Ragged Array, Strings, Structure, Union, Functions, Recursion, File Handling, Macros, Enumeration.
• Data & File Structures-Linked Lists, Doubly Linked Lists, Circular Linked Lists, Stack, Postfix and Prefix Representation and Evaluation, Binary Search Tree, Heap Tree, AVL Trees, B Tree, B+ Tree, Graph Representation, Properties and Traversals, Inverted List, Multi-List, Hashing, and Tables are all examples of graph representation.
  Analysis and Design of Algorithms: Graph (Spanning tree, connected component, shortest path), Divide-and-Conquer Approach, Greedy Approach, Dynamic Programming, Asymptotic Notations, Asymptotic Analysis (best, worst, average cases) of Time and Space, Sorting, Searching, Recursion, and Complexity Classes (P, NP, NP-hard, and NP-Complete).
• Operating Systems-Processes, Strings, Between Cycle Correspondence, Simultaneousness, Synchronization (Semaphores, Basic Areas, Common Rejection), Gridlock Taking care of (Brokers Calculation), computer chip Planning, Memory The board, and Virtual Memory (Paging and Division), Document Frameworks, I/O frameworks, Assurance and Security, UNIX and Windows, Essential UNIX Orders, Shell Programming.
• Computer Networks– Neighborhood (LAN), Metropolitan Region Organizations (MAN), Wide Region Organizations (WAN), OSI Model, TCP/IP Model, Encoding and Adjustment, Multiplexing, Exchanging, Transmission Media, Stream Control, Mistake Identification and Remedy, Numerous Entrance Conventions, IP Locations, Steering Calculations, Multicasting, Blockage Control, QoS, TCP/UDP, Application Layer Conventions.
  System for managing databases: Database Design (Integrity Constraints, Normal Forms), SQL/PL-SQL, Transactions, and Concurrency Control, Distributed Databases, File Organization, and Indexing; Relational Model (Relational Algebra, Tuple, and Domain Calculus).
• Computer Architecture and Organization– Instruction formats, addressing modes, processor datapath design, control unit design, pipelining, memory organization, I/O organization, interrupts and DMA, parallelism, and the subsystems of a computer are just a few of the topics covered.

Ph.D. in Biotechnology

All biological sciences, including biochemistry, cell biology, cancer biology, molecular biology, immunology, animal sciences, plant biotechnology, genetics, microbiology, virology, neurosciences, biochemical engineering, biophysics, and biostatistics, are eligible for the Master of Science degree.

Ph.D. in Economics

Microeconomics, Macroeconomics, Mathematical Methods, Statistical & Econometric Methods, and Development Economics

Ph.D. in International Relations, Ph.D. in Sociology

• Subject Knowledge
• General Knowledge

Ph.D. in Legal Studies

Phase 1

• Research Methods
• Comparative Constitutional Law of the SAARC Nations
• Public International Law: Sources of International Law, Relation of International Law and
• Municipal Law Principal of International Law, State Responsibility.
• The Law of International Organizations.
• International Trade Law: World Trade Organization (WTO) and its covered agreements
• International Humanitarian Law: Geneva Conventions.
• Intellectual Property Rights: Patents; Copyright; Trademarks and Related Rights.
• Jurisprudence: Sources of Law; Legal Personality; Analytical Jurisprudence; Sociological School of Law and Rule of Law.
• International Environmental Law: Sustainable development, precautionary principle, common but differentiated responsibility, contemporary developments.
• International Human Rights Law: Civil and political rights, economic, social, and cultural rights, current developments.

Phase 2

Letters of Recommendation– Candidates who have been shortlisted are required to arrange for two letters of recommendation from teachers who have taught and evaluated them at the graduate or postgraduate level. These letters should demonstrate the candidates’ intellectual acumen, subject knowledge, ability to articulate ideas, sincerity, and dedication to their studies, as demonstrated by their consistently high academic performance. Please be aware that the candidate will not be permitted to proceed further if the university does not receive the letters of recommendation by the deadline.

Research Proposal– Candidates are likewise expected to present a short exploration proposition of not in excess of 1500 words obviously showing an examination issue alongside the strategy they propose to utilize. The candidate’s comprehension of the field’s literature and the significance of the research topic in South Asia should also be demonstrated.

Statement of Purpose– Up-and-comers should likewise give a mission statement expressing why they were propelled to embrace the proposed examination, and why it ought to be attempted. For the selection panel to comprehend the candidate’s approach and background, they should emphasize the personal and subjective factors that may have influenced the conceptualization of the proposed research.

Can Check:- ITM NEST Syllabus

How to Check SAU Entrance Exam Syllabus 2024 Online?

If you’re planning to take the SAU Entrance Exam in 2024, it’s important to be familiar with the syllabus in order to prepare effectively. Fortunately, you can easily access the syllabus online. The official website of South Asian University provides all the information you need about the exam, including the syllabus for each program. You can simply visit their website and navigate to the section for admissions, where you’ll find detailed information on the entrance exam and its syllabus. The syllabus will provide a breakdown of topics and subjects that will be covered in the exam, giving you a clear idea of what to expect and how to prepare. Make sure to review the syllabus thoroughly and plan your studies accordingly to give yourself the best chance of success on exam day.

• Candidates need to open the official web portal, sau.int
• Now on the web page check the Notice section.
• Then search for the SAU Entrance Exam Syllabus.
• When found click on the “SAU Entrance Exam Syllabus.
• Now, a PDF document showing answers will be display on the screen.
• Then download it and cross-verify the Syllabus kept in the paper.

Related Post:-

AUAT Syllabus

SPSAT Syllabus

DPU AIET Syllabus

RMAT Syllabus