Get CollegeDekho
Mobile App
 Live Help
 0141-3990699
Login
Signup
Institutes
Courses & Exams
News & Articles

Symbiosis Entrance Test (SET- M.Tech) - Computer Science Engineering Exam Pattern

Exam Pattern

The SET M.Tech in Computer Science Engineering Entrance Exam follows GATE Exam pattern - 

In all the papers, there will be a total of 65 questions carrying 100 marks. The exam would contain questions of two different types in various papers:

Multiple Choice Questions (MCQ) carrying 1 or 2 marks each in all papers and sections. These questions are objective in nature, and each will have a choice of four answers, out of which the candidate has to mark the correct answer(s).

Numerical Answer Questions of 1 or 2 marks each in all papers and sections. For these questions the answer is a real number, to be entered by the candidate using the virtual keypad. No choices will be shown for this type of questions.

Test duration- 2 Hours

Marking System for all branches – For 1-mark multiple-choice questions, 1/3 marks will be deducted for a wrong answer. Likewise, for 2-marks multiple-choice questions, 2/3 marks will be deducted for a wrong answer. There is no negative marking for numerical answer type questions.

Syllabus Summary

No. Of Subject 11
No. Of Unit 15
No. Of Chapter 71
Chapters
  1. Inter-process Communication, and Synchronization
  2. Deadlock
  3. CPU Scheduling
  4. Memory Management and Virtual Memory
  5. File Systems
Chapters
  1. Concept of Layering
  2. LAN Technologies
  3. Flow and Error Control Techniques
  4. IPv4/IPv6, routers and Routing Algorithms
  5. Application Layer Protocols
  6. Basics of Wi-Fi
  7. Network Security
Chapters
  1. Programming in C
  2. Recursion
  3. Arrays, stacks, queues
Chapters
  1. Boolean algebra
  2. Combinational and sequential circuits
  3. Minimization
  4. Number Representations
  5. Computer Arithmetic
Chapters
  1. Lexical analysis, Syntax-Directed Translation
  2. Runtime Environments
  3. Intermediate Code Generation
Chapters
  1. Machine Instructions
  2. ALU, data-path and Control Unit
  3. Instruction Pipelining
  4. Memory Hierarchy
  5. I/O Interface
Chapters
  1. Searching, Sorting, Hashing
  2. Asymptotic Worst Case Time
  3. Algorithm Design Techniques
  4. Graph search, Minimum Spanning Trees, Shortest Paths
Chapters
  1. Numerical computation
  2. Numerical Estimation
  3. Numerical Reasoning
  4. Data Interpretation
Chapters
  1. English grammar
  2. Sentence Completion
  3. Verbal Analogies
  4. Word Groups
  5. Instructions
  6. Critical Reasoning
  7. Verbal Deduction
Chapters
  1. ER-model
  2. Relational Model
  3. Integrity Constraints, Normal Forms
  4. File organization, Indexing
  5. Transactions and Concurrency Control
Chapters
  1. Limits, continuity and differentiability
  2. Maxima and Minima
  3. Mean value theorem
  4. Integration
Chapters
  1. Vector algebra
  2. Matrix Algebra
  3. Systems of Linear Equations
  4. Rank of a matrix
  5. Eigenvalues and Eigenvectors
Chapters
  1. Random Variables
  2. Binomial Distributions
  3. Mean, Median, Mode
  4. Conditional Probability
  5. Bayes Theorem
Chapters
  1. Propositional and first order logic
  2. Sets, relations, functions
  3. Partial orders and lattices
  4. Graphs
  5. Combinatorics
Chapters
  1. Regular Expressions and Finite Automata
  2. Context-free Grammars and Pushdown Automata
  3. Regular and Context-free Languages, Pumping Lemma
  4. Turing Machines and Undecidability

How to prepare

?Preparation Strategy

Make a proper Time Table

It is very important that you make a time table and stick to it and you will have an exact idea of what you are required to study and the time required for it.

Concept clarity rather than rote learning

It is essential that you have a clear idea of the formulas and concepts rather than rote learning of things for the papers. While you might require it for memorizing formulas it is important that for other stuff you make sure you clear your basis and concepts before moving on.

Prepare Notes

It is very important make small notes or a comprehensive list of formulas on each covered topic and chapter which will come in handy at the time of revision. This will require you to be regular with your work but will surely make things easy at the time of revision.

Duration : 120 Minutes

Important Instructions

Bring the following documents while reporting to the Test Centre: Admit Card Your latest colored passport size photograph should be pasted on the Admit Card at the place provided for Photo identity as specified in the Admit Card page Blue/Black ballpoint pen Cell phones, calculators, watch calculators, alarm clocks, digital watches with built-in calculators/memory or any electronic gadgets will not be allowed in the examination hall Occupy the seat allotted to you by verifying the SEAT NUMBER pasted on the desk and indicated in your Admit Card The Test Invigilator will check your Admit Card The Test Booklet will be distributed just before the starting time of the Test. The candidate must ensure that the booklet is sealed. If the seal is found broken or tampered with, please bring this matter to the notice of the invigilator immediately Check immediately that all the pages of the booklet are in order. In the rare event of the Test Booklet being defective, bring it to the notice of the invigilator immediately who will arrange for the replacement of Test Booklet, if required Candidates found using any unfair means will forfeit their chance of being considered for admission and will be debarred from receiving scores Invigilator or Symbiosis Test Secretariat Representative will stamp and authenticate your Admit Card