Get Admission Alerts by SMS
Last Date : 30 Jul 2010 Exam Date : 08 Aug 2010
1. Before filling the application form, the candidates should read the Prospectus thoroughly.
2. The
Application form for admission available with this prospectus or
downloaded from website should be accompanied with a Bank Draft of Rs.
1000/- (Rs. 250/- for SC/BC candidates of Haryana only) drawn in favour
of the Finance Officer,MAHARSHI DAYANAND UNIVERSITY, ROHTAK and payable
at ROHTAK.
3. No
original documents / testimonials should be attached with the
Application Form for admission. Attested photocopies of the necessary
certificates / documents / testimonials should be attached with the
application form.
4. Original
certificates/documents and a set of three attested photostat copies of
all such certificates / documents / testimonials; will be required for
verification at the time of Counseling.
5. All
the particulars in the Application Form must be written using a ball
point pen carefully and legibly by the candidate in his/her own
handwriting in English. Incomplete applications will not be considered
and rejected.
6. All the entries in the Application Form should be filled. No entry should be left unfilled.
7. Affix the duly attested recent passport size photographs on the Application Forms at the places meant for them.
8. Duly stamped Acknowledgment Card should be enclosed with the Application Form for acknowledgement purpose.
9. Duly filled Address Slips must be enclosed with the Application Form.
10. The Application Form duly completed in all respects in candidate's own handwriting should reach in the office of The
DIRECTOR , UNIVERSITY INSTITUTE OF ENGINEERING & TECHNOLOGY(UIET)/
HEAD DEPARTMENT OF PHYSICS (FOR M.TECH ENGINEERING PHYSICS) AND HEAD
DEPT. OF GEOGRAPHY (FOR M.TECH GEO-INFORMATICS), MAHARSHI DAYANAND
UNIVERSITY, ROHTAK - 124 001 on or before 30-07-2010 (up to 5.00 PM).
11. Application
Forms could be delivered personally or sent by registered post.
Application Forms received after the closing date should not be
entertained and rejected summarily. The University shall not be
responsible for postal or any other delay as well as loss of
application form(s) or document(s) in transit.
12. If
the last date for receipt of applications falls on a holiday or that
day is declared a holiday by the University, the next working day will
be considered as the last date for the purpose. However, the timings
will remain unchanged.
13. Separate application should be sent for each course.
14. The
candidates must ensure that they obtain the certificates for claimed
categories from the appropriate competent authority approved and
notified by Govt. of Haryana.
http://mdurohtak.com/upload/Prospectus_MTech_Session_2010_11.pdf
Rohtak
Haryana
Phone-No:
01262-292039, 294465
Fax:
01262-262435
Email: mailto:ardde@rediffmail.com
Website:
www.mdurohtak.com
- Only objective type questions will be included in the Entrance Examination.
- More than one answer indicated against a question will be deemed as incorrect response and will be negatively marked.
For each correct response, the candidate will get full credit. Each incorrect response will be negatively marked and the candidate will get one-fourth discredit for it.
M.Tech. Computer Science & Engineering & Software Engineering
(i) B.E/B.Tech or equivalent degree in Computer Science & Engineering /Computer Engineering / Information
Technology or B.E/B.Tech or equivalent degree in Electronics &
Communication Engineering / Electronics Engineering / Electrical &
Electronics Engineering/Electronics & Instrumentation Engineering /
Electrical Engineering or Master of Computer Applications (MCA) or
M.Sc. (Computer Science / IT / Software) or M.Sc. (Maths.) or M.Sc.
(Physics) with at least 55% (50% marks for SC candidates of Haryana)
marks alongwith valid GATE Score in Computer Science & Engineering
/IT.
(ii) If
Gate qualified candidates are not available, the remaining seats will
be filled up by the candidates having qualification as (i) above
without GATE score on the basis of merit of marks obtained in the
entrance test to be conducted by the University.
Note: - The GATE qualified candidates will not be required to appear in the Entrance Test.
M.Tech. Electronics & Communication Engineer
i) First preference in the order:-B.E/B.Tech or equivalent degree in Electronics & Communication Engineering/Electronics & Telecom Engineering /Electronics Engineering.
ii) Second preference in the order:- B.E/B.Tech or equivalent degree in Electrical & Electronics Engineering/Applied Electronics & Instrumentation Engineering/ Electronics Instrumentation & Control Engineering/Electrical Engineering/ Instrumentation & Control Engineering / Instrumentation Engineering /Control Engineering (b) Biomedical Engineering /Mechatronics
iii) Third preference in the order: - (a) M.Sc (Electronics) (b) M.Sc (Physics with specialization in Electronics)/with valid GATE Score in Electronics & Comm. Engineering / Electronics Engineering.
M.Tech Mechanical Engineering (Manufacturing and Automation) B.E/B.Tech or equivalent degree in Mechanical Engineering/ Production Engineering/ Thermal Power Engineering/ Automobile Engg./ Robotics Engg./ CAD/ Mechatronics/ Aeronautical Engg./ Industrial Engineering.
M.Tech. Biotechnology i) First preference in the order : - B.E/B.Tech or equivalent degree in (a) Biotechnology /Industrial Biotechnology (b) Bioinformatics/Bio-Chemical Engg./Bio-Medical Engg.
ii) Second preference in the order:- :-(a) MBBS (b) B.Pharma (c) M.Sc (Biotech)/ M.Sc (Industrial Biotech)/ M.Sc (Medical Biotech)/ M.Sc. (Food Biotech) /M.Sc (Bioinformatics) (d) M.Sc (Life Sciences)/ Microbiology/ Biochemistry.
iii) Third Preference in the order: B.E/B.Tech or equivalent degree in (a) Chemical Technology/ Chemical Engineering (b) M. Sc. Chemistry.
SYLLABI FOR ENTRANCE TEST FOR ADMISSION TO M.TECH(COMPUTER SCIENCE & ENGINEERING),M.TECH (SOFTWARE ENGINEERING) and M.TECH(COMPUTER SCIENCE)
Mathematical Logic: Propositional Logic; First Order Logic.
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.
Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules.
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.
Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).
Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.
Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes - P, NP, NPhard, NP-complete.
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.
Information Systems and Software Engineering: Information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.
Computer Networks: 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, and routers. Network security - basic concepts of public key and private key cryptography, digital signature, firewalls.
Web technologies: HTML, XML, basic concepts of client-server computing.
M.Tech. (Computer Science and Engineering) M.Tech. (Software Engineering) M.Tech. (Electronics and Communication Engineering) M.Tech. (Mechanical Engineering) M.Tech. (Biotechnology)
Important Dates
|
Last Date | Friday, 30 Jul, 2010 |
Exam Date | Tuesday, 10 Aug, 2010 |
|
Get Admission Alerts by SMS
|