Nothing Special   »   [go: up one dir, main page]
Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    Duration:Two Pattern: The Test Contains Subjective Questions. Questions Are Designed To Test The Clarity of

    Uploaded by

    Shivani Sharma
    The test contains two parts. Part I includes 10-15 questions on basic mathematics, physics, and statistics. Part II includes 20-25 questions on programming, algorithms, computer organization, operating systems, computer networks, electronics, digital circuits, signals and systems, communication theory, and information theory. Candidates with non-technical backgrounds may be interviewed instead of taking the test.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Duration:Two Pattern: The Test Contains Subjective Questions. Questions Are Designed To Test The Clarity of

    Uploaded by

    Shivani Sharma
    27 views2 pages
    The test contains two parts. Part I includes 10-15 questions on basic mathematics, physics, and statistics. Part II includes 20-25 questions on programming, algorithms, computer organization, operating systems, computer networks, electronics, digital circuits, signals and systems, communication theory, and information theory. Candidates with non-technical backgrounds may be interviewed instead of taking the test.

    Original Description:

    Original Title

    New Microsoft Word Document

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The test contains two parts. Part I includes 10-15 questions on basic mathematics, physics, and statistics. Part II includes 20-25 questions on programming, algorithms, computer organization, operating systems, computer networks, electronics, digital circuits, signals and systems, communication theory, and information theory. Candidates with non-technical backgrounds may be interviewed instead of taking the test.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    27 views2 pages

    Duration:Two Pattern: The Test Contains Subjective Questions. Questions Are Designed To Test The Clarity of

    Uploaded by

    Shivani Sharma
    The test contains two parts. Part I includes 10-15 questions on basic mathematics, physics, and statistics. Part II includes 20-25 questions on programming, algorithms, computer organization, operating systems, computer networks, electronics, digital circuits, signals and systems, communication theory, and information theory. Candidates with non-technical backgrounds may be interviewed instead of taking the test.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 2

    Duration:Two

    hours

    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 Syllabus: The PART question paper I consists of two parts. Mathematics: doctoral work in ICT.

    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, Thevenins and Nortons 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.

    Note: Candidates having qualifying degree in Humanities/Social Sciences/Arts will not be required to appear in the entrance test based on syllabus as given on this page. They will be asked to appear for interview and/or additional presentations/assignments.

    You might also like