PHD CSE Entrance Exam Syllabus of Pondicherry University

Will you please provide here the Pondicherry University PHD Computer Science and Engineering entrance exam syllabus?

As you want I am here providing you syllabus of the Entrance Exam for admission in PHD CSE at Pondicherry University .

Syllabus:

Theory of Computation:
Regular languages and finite automata,
Context free languages and Push-down automata, Recursively enumerable sets
Turing machines, Undecidability;
NPcompleteness.

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.

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.

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.

Computer Science PhD Question Paper 1

Computer Science PhD Question Paper 2





Here is the attachment of the sample paper of the entrance exam..................

Attached Files Available for Download

	Computer Science PhD Question Paper 1 .pdf (1.91 MB, 94 views)
	Computer-Science-PhD-Question-Paper-2.pdf (1.40 MB, 107 views)

The Pondicherry University PHD Computer Science and Engineering entrance exam is objective type and question paper is of 100question topics related to Computer Science and Engineering.

Syllabus:

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NPcompleteness.

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.

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.
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.

__________________
Answered By StudyChaCha Member