DA-IICT Dhirubhai Ambani Institute of Information and Communication Technology http://QuestionPaper.in/EntranceExam181-DA-IICT.aspx DA-IICT Dhirubhai Ambani Institute of Information and Communication Technology en-us About Exam http://QuestionPaper.in/EntranceExam181-DA-IICT.aspx#About-Exam ]]> Scheme of Examination http://QuestionPaper.in/EntranceExam181-DA-IICT.aspx#Scheme-of-Examination
Pattern: The test contains subjective questions. Questions are designed to test the clarity of understanding and reasoning ability of the candidate in the subject areas which are essential during doctoral work in ICT.

The question paper consists of two parts.
]]>
Eligibility http://QuestionPaper.in/EntranceExam181-DA-IICT.aspx#Eligibility A. Candidates willing to pursue research in the ICT and related domain must possess a degree in:

M Tech / ME in: Information and Communication Technology related areas such as ICT, CS, IT, CT, EC, ECE, EE, Telecommunications, Instrumentation, Biomedical Engineering and allied disciplines.
                          Or
B Tech / BE / MSc in: Information and Communication Technology related areas such as ICT, CS, IT, CT, EC, ECE, EE, Telecommunication, Instrumentation, Biomedical Engineering and allied disciplines.
                          Or
MS /MSc degree of DA-IICT and MCA.

Candidate interested in pursuing PhD in ICT and related areas must have at least 60% marks in the qualifying degree.

B. Candidates with M Phil in the field of Arts, Humanities, Social Sciences, Mathematics, and Sciences and interested in these areas must have an M Phil degree in the desired area with at least 60% marks.

Candidates with an MSc or MCA degree (or MS Degree of DA-IICT), unless they have a subsequent M Phil degree, will be considered equivalent to candidates with a B Tech / BE degree and will need to fulfill additional course and research requirements.]]>
Syllabus http://QuestionPaper.in/EntranceExam181-DA-IICT.aspx#Syllabus PART – I – Mathematics:

Part - I comprising of 10 to 15 questions designed to test the understanding and aptitude of the candidate in the basic concepts underlying the following subject areas:

Mathematics: Combinatorics, complex variables, calculus, differential equations, sequences and series; discrete mathematics, linear algebra, probability, statistics.
Basic Physics: Electricity & Magnetism and Mechanics.

PART – II – Subject matter:

Part II will comprise of 20 to 25 questions on the basic concepts in the subject areas mentioned below. The students have to answer as many questions as possible. Subject areas and list of topics are given below:

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: Asymptotic notation; time complexity of algorithms. Tree and graph traversals; connected components; spanning trees; shortest paths. Hashing, sorting, and searching.

Computer Organization and Operating System:Computer Arithmetic and number systems. Thevon Neumann Model: stored program concept, CPU basics, fetch-decode-execute cycle. Instruction set architecture: addressing modes, arithmetic, data movement, and control instructions; assembly language programming; subroutine calls/return in assembly, subroutine implementation using stacks, assembly process. Pipelining. I/O fundamentals: programmed I/O, interrupts, and DMA; I/O bus operation; Processes; threads. Inter-process communication; concurrency, synchronization. Deadlocks. Process management. Memory management and virtual memory. File systems; I/O systems. UNIX system calls.

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), ICMP. Application layer protocols (dns, smtp, pop, ftp, http). Basic concepts of hubs, switches, gateways, and routers.

Basic Electronics: Nodal and mesh analysis. Superposition, Thevenin’s and Norton’s theorems; maximum power transfer. Steady state sinusoidal analysis using phasors. Linear constant coefficient differential equations; time and frequency domain analysis of simple RLC circuits. BJTs, MOSFETs. Simple diode circuits, clipping, clamping, rectifiers. Biasing and bias stability of transistor and FET amplifiers. Amplifiers: single- and multi-stage, differential and operational. Frequency response of amplifiers. Simple op-amp circuits. Simple filters. Sinusoidal oscillators; criterion for oscillation; single-transistor and op-amp configurations.

Digital Circuits: Boolean algebra, minimization of Boolean functions; logic gates. Combinatorial circuits: arithmetic circuits, multiplexers, decoders. Sequential circuits: latches and flip- flops, counters and shift-registers.

Signals and Systems: Definitions and properties of Laplace transform, continuous-time and discrete-time Fourier series, Sampling theorem. Linear Time-Invariant (LTI) Systems: definitions and properties; causality, stability, impulse response, convolution, poles and zeros, parallel and cascade structure, frequency response. Digital Signal Processing, Digital Image Processing, Pattern Recognition.

Communication Theory: Electromagnetic theory; Random signals and noise; autocorrelation, power spectral density. Analog communication systems: amplitude and angle modulation and demodulation systems; spectral analysis; super-heterodyne receivers; elements of hardware, realizations of analog communication systems; signal- to-noise ratio (SNR) calculations for amplitude and frequency modulation for low noise conditions. Fundamentals of information theory; channel capacity theorem.

]]>
Courses http://QuestionPaper.in/EntranceExam181-DA-IICT.aspx#Courses