PGCET exam study material for Computer Science and Engineering

Will you please share with me the PGCET exam study material for Computer Science and Engineering?

[Raman Vij]

As you want to get the PGCET exam study material for Computer Science and Engineering so here it is for you:

Engineering Mathematics:
Mathematical Logic: Propositional Logic, First Order Logic. Probability: 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.

Data Structures and Algorithms:
Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph; Tree and graph traversals, connected components, Spanning trees, shortest paths; Flashing, Sorting, Searching; Design techniques (Greedy, Dynamic Programming, Divide-and-conquer); Asymptotic analysis (best, worst, average case) of time and space, Upper and Lower bounds on the complexity of specific problems, NP-cexipleteriess.

Logic Design and Computer Organization:
Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits; Number representation and Computer Arithmetic (fixed and floating point); Machine instructions and addressing modes, ALU and Data-path, hardwired and micro-programmed control, memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache main and secondary storage.

Formal Languages and Automata Theory:
Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Un-decidability;

System software:
Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, linking (static and dynamic);

Operating Systems:
Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.

Databases:
Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, I34± trees), Transactions and concurrency control;

Computer Networks:
ISO / OS! stack, Data encoding and transmission, data link control, sliding window protocols, LAN architecture, LAN systems, Ethernet, Token ring, routing protocols, Packet switching, Network devices – switches, gateways, TCP / UDP, application layer protocols and systems (http, smtp, dns, ftp), network security.

Web Technologies:
Three tier web based architectures; JSP, ASP, J2EE, .NEET systems; html, XML

Hello Sir, I want to crack the PGCET and I don’t have any material for same. Will you please share the study materials for PGCET Computer Science and Engineering?

[Quick Sam]

The Post Graduate Common Entrance Test (PGCET) is conducted by the Karnataka state.

As per your request, I am sharing with you the study materials for the PGCET computer science and engineering.

PGCET computer science and engineering syllabus

Engineering Mathematics
Probability and Statistics: Probability, Conditional Probability; Probability Density Function, 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.

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
Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotic.

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, NP-hard, 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.

Here, I am giving you books for the PGCET Computer Science and Engineering.
Introduction to Algorithms by T.H Coremen

Theory of computaion by Ullman.

Operating System by G.S Galvin.

Computer Networks by Tanenbaum,Forouzan.

Graph Theory by Katson publication

Database Management system by korth,Navathe

Introduction to compiler Design by Aho & Ullman

Data Structures-Coremen,G.S Balluja

Computer Organisation by Hamacher

Digital logic Design by Morris Mano

Software Engineering by Pressman,Gateforum notes.

Discrete mathematics by Kenneth Rosen

Discrete mathematics by Temblay & Manohar