Jaypee Institute of Information Technology ( JIIT ) PhD Entrance Examination

PhD | JIIT PhD | Computer Science Syllabus

The Ph.D. programmes are available in various specializations - Biotechnology, Computer Science and Engineering, Electronics and Communication Engineering, Humanities & Social Sciences, Mathematics, Physics & Materials Science and Engineering, Management. The Scholars are required to take up intensive research work under the guidance of a supervisor on a specific problem for a minimum duration as specified. The research work is expected to result in new findings contributing to the advancement of knowledge in the chosen field. The doctoral research programme gives an opportunity to students to demonstrate their analytical, innovative and independent thinking abilities leading to creativity and application of knowledge. The scholars are required to deliver seminars on their research progress regularly and publish their work.

Finally, they are required to submit the thesis embodying their research findings for the award of the Ph.D. degree. They are also required to undergo some advanced level course work. Financial support may be provided to select deserving full time Ph.D. students in the form of Research/Teaching Assistantship.

Research scholars in the areas given below will be preferred, however, scholars interested in other related areas may also be considered.

JIIT PhD 2021 Computer Science Syllabus

Jaypee Institute Of Information Technology ( JIIT ) PhD Entrance Exam Computer Science and Engineering Syllabus-2018

Jaypee Institute of Information Technology has announced admission for various PhD courses. Admissions for PhD courses are based on Ph.D. Entrance Test and Performance in interview

Part - A

Research: Meaning, Characteristics and Types; Steps of Research, Methods of Research, Ethics and Plagiarism, Awareness of Research Paper, Articles, Workshop, Seminar, Conference and Symposium, Report Writing: Its characteristics and format, Understanding the Structure of Argument, Evaluating and distinguishing Deductive and Inductive Reasoning, Analytical Reasoning, Verbal Analogies; Logical Diagrams, Venn Diagram; Networks and Flow Diagram. ( 20 MCQs ).

Basic statistics: Sources and type of data: quantitative and qualitative data; diagrammatic and graphical representation of data. Mean, median, mode, geometric mean, harmonic mean and other measures of central tendency, measure of dispersion, mean deviation, quartile deviation, standard deviation, variance, coefficient of variation, skewness, kurtosis, moments, correlation and regression, elementary probability theory, Baye’s theorem, random variables (one dimensional), Poisson, Normal and Binomial distributions. Random sampling, testing of hypothesis. ( 20 MCQs ) .

Part - B

Programming Skills: Procedural programming using C, C++ and JAVA, data types, arrays, functions, pointers, structures & union, file handling; OOPS Concepts: Classes and objects, constructors and destructors, Function and Operator overloading, inheritance and polymorphism, Exception handling.

Data Structures: Linked list, Multi list, Stack & Queue; Tree: Binary Tree, Tree traversals, BST, AVL Tree, Red-black Tree. Splay Tree, B Tree, B+ Tree; Skip-lists; Hash Table; Priority Queue. Graph: Depth-first and Breadth-first Search. Searching and Sorting Methods

Algorithms: Asymptotic notation, Amortized Analysis, Recurrences, Notions of space and time complexity, Algorithm Correctness and Efficiency; Algorithm based puzzles; Algorithm Design Paradigms: Greedy Algorithms, Dynamic Programming, Divide-and-Conquer; Backtracking; String Matching; Graph algorithms: MST, Shortest paths, Connected components; Series Evaluation; Matrix Operations

Operating Systems: Synchronization Mechanisms. Process Deadlocks. Resource Models. Local and Global states. Scheduling. Comparative Performance Analysis. Concurrency Control. Shared Memory. File Systems. Coordination of Processes and related Algorithms.

Database Systems : Database design. ER-model, Relational model, Storage and File Structures. Indexing and Hashing. Transactions and Concurrency control. Recovery. Query Processing & Optimization. Object Oriented DBMS. Extended ER-Model.

Computer Organisation and Architecture : Design and synthesis of combinational and sequential circuits; Computer arithmetic (fixed and floating point). Machine instructions and addressing modes, ALU, CPU control design, Memory interface, I/O interface, Instruction pipelining, Cache and main memory.

Computer Networks : ISO/OSI stack, TCP/IP, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP, IP(v4), Application layer protocols; Basic concepts of hubs, switches, gateways, and routers. Network security, IPv6 Protocols and its Applications. High speed local and wide area networks. Virtual Private networks.

Please refer official website for more details

jiit.ac.in/syllabus_phd