Education and Career Forum

I want to know syllabus for PhD Entrance Exam that will be held on 21st dec.
in cse stream

I have that give here your e-mail id so, that i can forward it to you.

U have specified the dat of exam but for which university u want to know not specified plz specify that so it would be easy to answer

please mention for which university you would prefer to have the syllabus so that i will be able to help you.

Mention first about the university which you prefer.........

syllabus for phd entrance exam in computer science engineering can be mentioned only if you mention the university you are applying for ..

hi

sorry i can't tell you because you have not mentioned the university.....:-)

well, best of luck for you life

dear friend
i don't give you details..
because of you did not mention the name of university..
good luck.

which book is preferable for phd in computer science entrance exam 2010.university is SRI KRISHNA DEVARAYA UNIVERSITY

sir I need syllabus for phd admission (computer science) for VIT university

Pondicherry University

hi, dear friend
syllabus for phd entrance exam im computer science & engg.
is like this way:

Syllabus for PhD Admission Test
Computer Science and Engineering

Part - I : Mathematical Techniques

Linear Algebra: Matrix algebra; Systems of Linear Equations; Eigen Values and Eigenvectors.
Calculus: Functions of Single Variable; Limit, Continuity and Differentiability; Mean value Theorems; Evaluation of Definite and Improper Integrals; Partial derivatives, Total Derivative, Maxima and Minima, Gradient, Divergence and Curl, Vector Identities, Directional Derivatives, Line, Surface and Volume Integrals, Stokes, Gauss and Green’s Theorems.
Differential equations: First Order Equations (Linear and Nonlinear); Higher Order Linear Differential Equations with Constant Coefficients; Initial and Boundary Value Problems, Laplace and Fourier Transforms; Solutions of one Dimensional Diffusion and wave Equations and Laplace Equation.
Complex variables: Analytic Functions; Cauchy’s Integral Theorem; Taylor and Laurent Series; Residue Theorem.
Probability and Statistics: Definitions of Probability and Sampling Theorems; Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Poisson, Normal and Binomial Distributions. Least Squares, Correlation and Regression and Covariance.
Numerical Methods: Numerical Solutions of Linear and Non-Linear Algebraic Equations; Finite Differences, Numerical Integration, Runga – Kutta Methods.


Part - II : Computer Science and Engineering
Data Structures :
Complexity of Algorithm. Algorithm Design Paradigms. Stack. Queues. Hash Table. Binary Search, AVL. Red-black. Splay. Skip. B-Trees. Skip-lists. Priority Queue. Graph: Shortest Path, MST, Depth-first and Breadth-first Algorithms. Advanced Sorting Methods. Multi-Dimensional, Kinetic Data Structures.
Algorithms :
Review of Set theory, Induction, Series Evaluation, and Algorithms. Algorithm Correctness and Efficiency. Growth of Functions. Amortized Analysis. Recurrences. Divide and Conquer. Backtracking. Dynamic Programming. Greedy Algorithm. Sorting. Search Pruning. Matrix Operations. String Matching. Computational Geometry. NP - Completeness. Heuristic Methods. Approximation Algorithm. Linear Programming.
Computation Theory :
Regular Languages and Finite Automata (Mealy, Moore, Hybrid FSM, Exposed FSM, Encapsulated FSM, Static State Instantiation FSM). Context free Languages and Pushdown Automata. Recursively Enumerable sets and Turing Machines. Undecidability.

Operating Systems :
Synchronization Mechanisms. Process Deadlocks. Resource Models. Local and Global states. Distributed Operating Systems. Event Ordering. Timestamps. Distributed Mutual Exclusion. Token and Non-token based Algorithms. Comparative Performance Analysis. Concurrency Control. Shared Memory. File Systems. Agreement Protocols for handling Processor Failures. Coordination of Processes and related Algorithms. Failure Handling and Recovery Mechanisms. Multiprocessor Operating Systems and related Thread Handlings.
Database Systems :
Review of Database Systems. Web-enabled Database Systems. Storage and File Structures. Indexing and Hashing. Concurrency. Recovery. Query Processing. Query Optimization. Object Oriented DBMS. Extended Relational Model. Spatial databases. Multimedia Databases. Distributed Databases. Active Databases. Temporal Databases. Deductive Databases. Mobile Databases.
High Performance Computer Architecture :
Basic Computer architecture. Performance Analysis, Fault Tolerance and Scalability. Modeling Performance. Pipelined Systems. Interconnection Networks. Processor Array. Multi-computers. Multiprocessors. Systolic Array. Vector Processors. Structured Memory Design for Parallel Systems – Symmetric Shared, Distributed Shared and Synchronization. Grid computing.
Software Engineering :
Personal Software Process. Team Software Process. Usability. Agile Methods. Process Models- Iterative, Scrum, XP, and Evo. Requirements Engineering. Advanced UML, Petri net. Domain specific modeling. Systems Modeling Language. Meta modeling. Software architecture and design patterns. Software metrics. Software reliability. Advanced testing techniques. Aspect oriented programming.
Computer Networks :
Seven Layer OSI Model. TCP/IP details. IPv6 Protocols and its Applications. Real Time Communication Protocols. High speed local and wide area networks. Virtual networks. Network security. Broadband networks. Introduction to intelligent networking. Performance analysis of networks.


good luck...

please tell me the syllabus for Ph.d in IIt delhi for computer science & engineering department

hello friend hope you get them from faiyaz sir
here you should mention that for which university you need .

hi friend,
the admission in phd is taken through the net exam as well as the exam conducted by the university......
so here please mention about which exam or university you want to know...

please specify the name of the college or the university for which you want the syllabus........

waiting for your reply

Anna university
Ph.D Extrance question model

HI, the information provided is very nice. Please give reference books. My ID is [email protected]

Originally Posted by brrrravi

hi, dear friend
syllabus for phd entrance exam im computer science & engg.
is like this way:

Syllabus for PhD Admission Test
Computer Science and Engineering

Part - I : Mathematical Techniques

Linear Algebra: Matrix algebra; Systems of Linear Equations; Eigen Values and Eigenvectors.
Calculus: Functions of Single Variable; Limit, Continuity and Differentiability; Mean value Theorems; Evaluation of Definite and Improper Integrals; Partial derivatives, Total Derivative, Maxima and Minima, Gradient, Divergence and Curl, Vector Identities, Directional Derivatives, Line, Surface and Volume Integrals, Stokes, Gauss and Green’s Theorems.
Differential equations: First Order Equations (Linear and Nonlinear); Higher Order Linear Differential Equations with Constant Coefficients; Initial and Boundary Value Problems, Laplace and Fourier Transforms; Solutions of one Dimensional Diffusion and wave Equations and Laplace Equation.
Complex variables: Analytic Functions; Cauchy’s Integral Theorem; Taylor and Laurent Series; Residue Theorem.
Probability and Statistics: Definitions of Probability and Sampling Theorems; Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Poisson, Normal and Binomial Distributions. Least Squares, Correlation and Regression and Covariance.
Numerical Methods: Numerical Solutions of Linear and Non-Linear Algebraic Equations; Finite Differences, Numerical Integration, Runga – Kutta Methods.


Part - II : Computer Science and Engineering
Data Structures :
Complexity of Algorithm. Algorithm Design Paradigms. Stack. Queues. Hash Table. Binary Search, AVL. Red-black. Splay. Skip. B-Trees. Skip-lists. Priority Queue. Graph: Shortest Path, MST, Depth-first and Breadth-first Algorithms. Advanced Sorting Methods. Multi-Dimensional, Kinetic Data Structures.
Algorithms :
Review of Set theory, Induction, Series Evaluation, and Algorithms. Algorithm Correctness and Efficiency. Growth of Functions. Amortized Analysis. Recurrences. Divide and Conquer. Backtracking. Dynamic Programming. Greedy Algorithm. Sorting. Search Pruning. Matrix Operations. String Matching. Computational Geometry. NP - Completeness. Heuristic Methods. Approximation Algorithm. Linear Programming.
Computation Theory :
Regular Languages and Finite Automata (Mealy, Moore, Hybrid FSM, Exposed FSM, Encapsulated FSM, Static State Instantiation FSM). Context free Languages and Pushdown Automata. Recursively Enumerable sets and Turing Machines. Undecidability.

Operating Systems :
Synchronization Mechanisms. Process Deadlocks. Resource Models. Local and Global states. Distributed Operating Systems. Event Ordering. Timestamps. Distributed Mutual Exclusion. Token and Non-token based Algorithms. Comparative Performance Analysis. Concurrency Control. Shared Memory. File Systems. Agreement Protocols for handling Processor Failures. Coordination of Processes and related Algorithms. Failure Handling and Recovery Mechanisms. Multiprocessor Operating Systems and related Thread Handlings.
Database Systems :
Review of Database Systems. Web-enabled Database Systems. Storage and File Structures. Indexing and Hashing. Concurrency. Recovery. Query Processing. Query Optimization. Object Oriented DBMS. Extended Relational Model. Spatial databases. Multimedia Databases. Distributed Databases. Active Databases. Temporal Databases. Deductive Databases. Mobile Databases.
High Performance Computer Architecture :
Basic Computer architecture. Performance Analysis, Fault Tolerance and Scalability. Modeling Performance. Pipelined Systems. Interconnection Networks. Processor Array. Multi-computers. Multiprocessors. Systolic Array. Vector Processors. Structured Memory Design for Parallel Systems – Symmetric Shared, Distributed Shared and Synchronization. Grid computing.
Software Engineering :
Personal Software Process. Team Software Process. Usability. Agile Methods. Process Models- Iterative, Scrum, XP, and Evo. Requirements Engineering. Advanced UML, Petri net. Domain specific modeling. Systems Modeling Language. Meta modeling. Software architecture and design patterns. Software metrics. Software reliability. Advanced testing techniques. Aspect oriented programming.
Computer Networks :
Seven Layer OSI Model. TCP/IP details. IPv6 Protocols and its Applications. Real Time Communication Protocols. High speed local and wide area networks. Virtual networks. Network security. Broadband networks. Introduction to intelligent networking. Performance analysis of networks.


good luck...

dear friend

The syllabus of PhD Entrace Exam in Computer Science and Engineering are availiable in the below attach files. So, please find the attach files and get the syllabus from there-

dear friend

Sorry, i will post my answer again because i will not attach the syllabus and by mistake i will post my answer-


SYLLABUS-

The syllabus of P.hD Entrace Exam in Computer Science and Engineering are availiable in the below attach file. So, please find the attach files and get the syllabus from there-

Please inform me entrance exam syllabus for p.hd computer science in anna university coimbatore and where to get model question papers of past exams.

hai swetha,
can anyone say me what is the syllabus for ph.d entrance exam for anna university.

Hi, this is my first message.
Which are the good reference books for study?

can you upload phd entrance test syllabus of kuvempu university for computer science

Sir
Kindly let me know the Syllabus for PhD Entrance Examination for Computer science and Computer Applications in Anna University, Coimbatore .It will be much helpful for me if you forward one sample question and kindly help me with more inputs and some reference sites where i can get more input towards securing good marks in the same.The tentative exam falls on the 15th of January. Sir.
Regards
GANESH

sir,
please let me know the latest syllabus for Phd Entrance Examination for computer science for delhi university and also please help me by forwading me the question paper of past ten years.

Please also let me know any other institute provide the Phd degree in delhi.

i want only for COMPUTER SECURITY A PRIVACY syllabus for PHD plz help me

Originally Posted by vetriselvi

please mention for which university you would prefer to have the syllabus so that i will be able to help you.

For Karnatak University

Originally Posted by faiyaz

I have that give here your e-mail id so, that i can forward it to you.

My email id is [email protected] can i have the syllabus for M-tech entrance test 201 in computer and engineering.? /if possible even the material if you have a soft copy. hank you.

plz send me the syllabus and model paper for PhD entrance exam, Kariavattom University

Originally Posted by Mintoo

Mention first about the university which you prefer.........

BBAu and lucknow university

please send me the Ph.D written exam paper of iit Delhi
my [email protected]

--------------------------------------------------------------------------------

please tell me the syllabus for Ph.d in IIt delhi for computer science & engineering department

My [email protected]

please ! let me know the syllabus for Ph.D entrance exam in computer science and engineering in AnnaUniversity......

i am msc (IT) graduate in 2006.now i wish to study phd in ComputerScience (distance education).give me information about which university provide distance education in Phd ComputerScience.Its syllabus.fee structure and every thing about it.about the entrance exam.if so give me a soft copy of study material

my id [email protected]

dear sir, i don't know the PhD computer science & engineering syllabus. please give me the syllabus
my mail id : [email protected]

Thank you

Syllabus for PhD Admission Test
Computer Science and Engineering

Part - I : Mathematical Techniques
Part - II : Computer Science and Engineering

Details of each and every topic is given in the attached file.

What is the syllabus for Ph.D(Electrical Engineering) in IIT?

Hi dear,
syllabus for phd entrance exam im computer science & engg.
is like this way:

Syllabus for PhD Admission Test
Computer Science and Engineering

Part - I : Mathematical Techniques

Linear Algebra: Matrix algebra; Systems of Linear Equations; Eigen Values and Eigenvectors.
Calculus: Functions of Single Variable; Limit, Continuity and Differentiability; Mean value Theorems; Evaluation of Definite and Improper Integrals; Partial derivatives, Total Derivative, Maxima and Minima, Gradient, Divergence and Curl, Vector Identities, Directional Derivatives, Line, Surface and Volume Integrals, Stokes, Gauss and Green’s Theorems.
Differential equations: First Order Equations (Linear and Nonlinear); Higher Order Linear Differential Equations with Constant Coefficients; Initial and Boundary Value Problems, Laplace and Fourier Transforms; Solutions of one Dimensional Diffusion and wave Equations and Laplace Equation.
Complex variables: Analytic Functions; Cauchy’s Integral Theorem; Taylor and Laurent Series; Residue Theorem.
Probability and Statistics: Definitions of Probability and Sampling Theorems; Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Poisson, Normal and Binomial Distributions. Least Squares, Correlation and Regression and Covariance.
Numerical Methods: Numerical Solutions of Linear and Non-Linear Algebraic Equations; Finite Differences, Numerical Integration, Runga – Kutta Methods.


Part - II : Computer Science and Engineering
Data Structures :
Complexity of Algorithm. Algorithm Design Paradigms. Stack. Queues. Hash Table. Binary Search, AVL. Red-black. Splay. Skip. B-Trees. Skip-lists. Priority Queue. Graph: Shortest Path, MST, Depth-first and Breadth-first Algorithms. Advanced Sorting Methods. Multi-Dimensional, Kinetic Data Structures.
Algorithms :
Review of Set theory, Induction, Series Evaluation, and Algorithms. Algorithm Correctness and Efficiency. Growth of Functions. Amortized Analysis. Recurrences. Divide and Conquer. Backtracking. Dynamic Programming. Greedy Algorithm. Sorting. Search Pruning. Matrix Operations. String Matching. Computational Geometry. NP - Completeness. Heuristic Methods. Approximation Algorithm. Linear Programming.
Computation Theory :
Regular Languages and Finite Automata (Mealy, Moore, Hybrid FSM, Exposed FSM, Encapsulated FSM, Static State Instantiation FSM). Context free Languages and Pushdown Automata. Recursively Enumerable sets and Turing Machines. Undecidability.

Operating Systems :
Synchronization Mechanisms. Process Deadlocks. Resource Models. Local and Global states. Distributed Operating Systems. Event Ordering. Timestamps. Distributed Mutual Exclusion. Token and Non-token based Algorithms. Comparative Performance Analysis. Concurrency Control. Shared Memory. File Systems. Agreement Protocols for handling Processor Failures. Coordination of Processes and related Algorithms. Failure Handling and Recovery Mechanisms. Multiprocessor Operating Systems and related Thread Handlings.
Database Systems :
Review of Database Systems. Web-enabled Database Systems. Storage and File Structures. Indexing and Hashing. Concurrency. Recovery. Query Processing. Query Optimization. Object Oriented DBMS. Extended Relational Model. Spatial databases. Multimedia Databases. Distributed Databases. Active Databases. Temporal Databases. Deductive Databases. Mobile Databases.
High Performance Computer Architecture :
Basic Computer architecture. Performance Analysis, Fault Tolerance and Scalability. Modeling Performance. Pipelined Systems. Interconnection Networks. Processor Array. Multi-computers. Multiprocessors. Systolic Array. Vector Processors. Structured Memory Design for Parallel Systems – Symmetric Shared, Distributed Shared and Synchronization. Grid computing.
Software Engineering :
Personal Software Process. Team Software Process. Usability. Agile Methods. Process Models- Iterative, Scrum, XP, and Evo. Requirements Engineering. Advanced UML, Petri net. Domain specific modeling. Systems Modeling Language. Meta modeling. Software architecture and design patterns. Software metrics. Software reliability. Advanced testing techniques. Aspect oriented programming.
Computer Networks :
Seven Layer OSI Model. TCP/IP details. IPv6 Protocols and its Applications. Real Time Communication Protocols. High speed local and wide area networks. Virtual networks. Network security. Broadband networks. Introduction to intelligent networking. Performance analysis of networks.

Thanks

Hi,
I am applying for PhD in Shivaji University, Kolhapur. Do u have papers of PhD Computer Science Entrance exam of Shivaji University?If u have plz send me a softcopy on [email protected].

i am arun kumar , i want to do phd in computer application , could you please send me the reference book name ,or good url to study for the entrance exam
my e mail id : [email protected]

Hi
please give me the exact syllabus for phd entrance exam in computer science in anna university Chennai.

Mail id: [email protected]

Syllabus for PhD Entrace Exam in Electronics and communication engineering for Anna university of technology?

Originally Posted by anuja

U have specified the dat of exam but for which university u want to know not specified plz specify that so it would be easy to answer

[email protected]

could any one please give me the Phd ComputerScience Syllabus,eligibility,oppertunities and duration in Sri Venkateshwara University Tirupati.

Originally Posted by faiyaz

I have that give here your e-mail id so, that i can forward it to you.

[email protected]

Originally Posted by faiyaz

I have that give here your e-mail id so, that i can forward it to you.

Please send me the links or pdf releated to phd entrance exams, i want to do phd in datamining.

syllabus of phd entrance exam in computer science of ignou?

pls give me the syllabus for phd entrance exam in power electronics at anna university

Originally Posted by Mintoo

Mention first about the university which you prefer.........

i wana ph.d from PTU jalandhar...plz send me the syllabus for phd enetrace in cse.My email id is [email protected]