Chaitanya Ph. D. Eligibility Test 2021 Syllabus

Organisation : Chaitanya
Exam Name : Chaitanya Ph. D. Eligibility Test 2021
Announcement : Syllabus
Website : https://www.chaitanya.edu.in/cet-syllabus-2021/

Chaitanya Ph. D. Eligibility Test

Chaitanya Ph. D. Eligibility Test 2021 Syllabus

Chaitanya Eligibility Test Pattern

The eligibility test will be of 90 minutes duration and question paper consists of 100 objective (multiple choice only) type questions

** Exam will conduct in two parts. Part-A and Part-B.
** Part-A contains 30 questions from Research Methodology (Common for all subjects)
** Part-B Contains 70 questions from specific subjects.

The eligibility test will consist of any 3 or 4 varieties of objective type items such as analogies, classification, matching, comprehension of a research study / experiment / theoretical point of view, etc., with multiple answers besides the usual multiple choice items. The items will be framed only from the syllabus of eligibility test.

Maximum marks for eligibility test:100 marks
Nature of test:Objective type with multiple choice questions.
Medium of eligibility test:The medium of eligibility test will be English

Chaitanya Eligibility Test Syllabus

Part-A:
1. Research Methodology:
Meaning of Research, Objectives of Research, Motivation in Research, Types of Research, Research Approaches, Significance of Research, Research Methods versus Methodology.

2. Defining the Research Problem:
What is a Research Problem? Selecting the Problem, Necessity of defining the Problem.

3. Research Design:
Meaning of Research Design, Need for Research Design, Features of a Good Design. Sampling Design: Census and Sample Survey, Implications of a Sample Design, Steps in Sampling Design, Criteria of Selecting a Sampling Procedure

4. Aptitude:
Coding and decoding, blood relations, time and distance, simple and compound interest, Permutation and combination, number system, odd man out.

Computer Science & Engineering :
Part-B:
Discrete Mathematics:
Propositional and first-order logic. Sets, relations, functions, partial orders, and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.

Programming & Data Structures With Algorithms:
Programming in C. Recursion. Arrays,stack, queue, list, set, string, tree, binary search tree, heap, graph, tree and graph traversals, connected components, spanning trees, shortest paths, hashing, sorting, searching, design techniques (greedy, dynamic, divide and conquer), asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds.

Digital Logics & Computer Organization:
Boolean algebra, minimization of Boolean functions; logic gates,Synthesis of combinational and sequential circuits. Machine instructions and addressing modes, ALU and control, memory interface, I/O interface (cache, main and secondary storage. data path and hardwired), serial communication interface, cache, main and secondary storage.

Operating Systems:
Classical concepts (concurrency, synchronization, deadlock), processes, threads and inter-process communication, CPU scheduling, memory management, file systems.

Software Engineering:
Information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle.

Database Management Systems:
Definition, relational model, database design, E-R diagrams, integrity constraints, normal forms, Relational Algebra, query languages (SQL).

Data Communication And Networks:
ISO/OSI stack, transmission media, data encoding, multiplexing, flow and error control, LAN technologies, network devices – switches, gateways, routers, ICMP, application layer protocols – SMTP, POP3, HTTP, DNS, FTP, Telnet.

Theory of Computation:
Finite automata, Regular expressions, Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.