2021 2022 Student Forum > Management Forum > Entrance Exams

 
  #1  
25th July 2014, 01:59 PM
Unregistered
Guest
 
M.Tech PGECET syllabus of Computer Science & Information Technology of OU

Will you please share with me the M.Tech PGECET syllabus of Computer Science & Information Technology of OU?
Similar Threads
Thread
M.Tech syllabus for computer science in JNTU
Anna university b tech information technology syllabus
IIT M Tech Computer Science Syllabus
Gate graduate aptitude test in engineering computer science information technology
School of Computer Science and Information Technology Devi Ahilya University
TANCET previous year papers of M.Tech of Computer Science & Engineering & Information
School Of Computer Science And Information Technology RMIT University
Department of Computer Science & Information Technology Rajasthan Vidyapeeth Universi
Syllabus of Andhra Pradesh PGECET of Information Technology
Syllabus of Graduate Aptitude Test in Engineering of Computer Science and Information
Computer Science or Information Technology
Computer Science & Information Technology What Is Difference
ACE Academy Computer Science and Information Technology GATE syllabus
GATE syllabus of Computer Science and Information Technology
GATE previous year question papers of Computer Science and Information Technology
GATE Computer Science and Information Technology study material
TANCET Computer Science & Engineering and Information Technology syllabus
Information Technology and Computer Science Engineering Difference
Computer Science and Information Technology GATE previous year question papers
JNTU Syllabus for M.Tech Computer Networks And Information Security
  #2  
25th July 2014, 02:28 PM
Super Moderator
 
Join Date: Apr 2013
Re: M.Tech PGECET syllabus of Computer Science & Information Technology of OU

As you want to get the M.Tech PGECET syllabus of Computer Science & Information Technology of OU so here it is for you:

Computer Science & Information Technology (CS)
Engineering Mathematics
Probability and Statistics: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random
Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations;
asymptotic.

Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear
algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and
Simpson's rules.

Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of
definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

Computer Science and Information Technology
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets;
Colouring; Planarity; Isomorphism.

Mathematical Logic: Propositional Logic; First Order Logic.
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. Asymptotic analysis (best,
worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NPhard,
NP-complete.

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

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.

Information Systems and Software Engineering: information gathering, requirement and feasibility analysis,
data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the
project, design, coding, testing, implementation, maintenance.

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. Network security basic
concepts of public key and private key cryptography, digital signature, firewalls.

Web technologies: HTML, XML, basic concepts of client-server computing.


Tags
syllabus

Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools Search this Thread



All times are GMT +5. The time now is 08:17 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3