Scribd
Upload
8 views

Syllabus For Test

The document outlines the syllabus for the M.Tech entrance examination, which will include questions testing English vocabulary and comprehension (15%), computer science topics like algorithms, operating systems, databases, and computer networks (60%), and mathematics topics like logic, probability, calculus, and algebra (25%). The exam will consist of multiple choice questions with negative marking for wrong answers, last 1 hour, and be administered at test centers based on candidate location.

Uploaded by

dipa112
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Syllabus For Test

The document outlines the syllabus for the M.Tech entrance examination, which will include questions testing English vocabulary and comprehension (15%), computer science topics like algorithms, operating systems, databases, and computer networks (60%), and mathematics topics like logic, probability, calculus, and algebra (25%). The exam will consist of multiple choice questions with negative marking for wrong answers, last 1 hour, and be administered at test centers based on candidate location.

Uploaded by

dipa112
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SyllabusForM.Tech.

(CSE)EntranceExamination
English
Vocabulary,comprehensionetc.

ComputerScience
DigitalLogic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuitsNumberrepresentationandcomputer arithmetic(fixedandfloatingpoint). ProgrammingandDataStructures: ProgramminginCandC++Functions,Recursion,Parameterpassing,Scope,Binding Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binaryheaps. Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis Design: Greedy approach, Dynamic programming, Divideand conquer Tree and graph traversals, Connected components, Spanning trees, Shortest pathsHashing,Sorting,Searching.Asymptoticanalysis(best,worst,averagecases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NPhard,NPcomplete. Operating System: Processes, Threads, Interprocess communication, Concurrency, Synchronization, Deadlock,CPUscheduling,Memorymanagementandvirtualmemory,I/Osystems. Databases: ERmodel, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequentialfiles,indexing,BandB+trees),Transactionsandconcurrencycontrol. ComputerNetworks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http) Basic concepts of hubs, switches,gateways,androuters.

Mathematics
MathematicalLogic: PropositionalLogicFirstOrderLogic. Probability&Statistics: Conditional Probability Mean, Median, Mode and Standard Deviation Random VariablesDistributionsuniform,normal,exponential,Poisson,Binomial. SetTheory&Algebra: SetsRelationsFunctionsGroupsPartialOrdersLatticeBooleanAlgebra. Combinatorics: Permutations Combinations Counting Summation generating functions recurrence relations. Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives,maxima&minima.

NOTE:
1. Allthequestionswillbeofmultiplechoice types. 2. Theweightagedistributionofthequestionsisasperfollows: (a) English:15% (b) ComputerScience:60% (c)Mathematics:25% 3. TherewillbeNEGATIVEmarkingfor the wronganswers. 4. Thedurationofthewrittentestwillbeof1hour. 5. The respective test centers for examination will be communicated to the candidatesbasedupontheirchoiceandviability.

You might also like