GATE 2013- CSE - 04 Month Online Live classes + Study material Covers Entire syllabus of GATE 2013 CSE Examination syllabus
class time between 03 pm to 06:00 pm IST
Class Duration- 03 Hours on Weekends( saturday and sunday ) OR 02 Hours Thrice a week- 05 pm to 07 pm
**Also Includes: Live recordings of classes in to student account for revision of topics
New Batch Dates : 01-July-2012, 15-july-2012, 01-Aug-2012, 16-Aug-2012, 01-Sep-2012, 15-Sep-2012
Requirement from students side for Attending Online Live interative classes:
a) A Computer + Internet connection ( Broadband)
b) A Headset ( No additional software required to download
Features of package:
1) Includes GATE 2013 CS Study material Tutorials in Instant download ( pdf format )
2) Online Live interactive classes covering entire syllabus of GATE 2013 CSE
3) View/download Recordings of Live classes at Your Home for revision purpose
Syllabus Covered Computer Science and Information Technology:
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.
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.
Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
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.
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.
HTML, XML, basic concepts of client-server computing.
(GATE 2013 CS Coaching, CEED Online coaching for cse, GATE CE Coaching, online GATE CS Coaching, Online GATE 2013 CS Coaching)