GATE Computer Science Quiz

Le test GATE Computer Science comporte plus de 10 000 questions et réponses à choix multiples.

This application has been developed for testing your GATE Computer Science skills. This is a latest and fantastic new education application which has been fueled with lots and lots of interesting questions that test you intelligence in the subject. It has more than 10,000 multiple choice questions and answers and these cover a wide range of varieties of topics. General knowledge starting from basic to high level GATE Computer Science can be found in this app.

This is a complete GATE Computer Science study app which covers from the base to the highest level and this is one of the very few best learning apps and most useful apps that can be found online for free.

This GATE Computer Science testing app has been designed in the best possible manner so that the user can constantly improve his/her knowledge about the subject. This GATE Computer Science testing application suits for all lower, intermediate and higher levels as this application carries a combination of questions for testing the user from the basic level to the highest level. The questions in each level will be displayed randomly.

By going through the tests and attempting the questions, the user can improve his/her GATE Computer Science knowledge and can score well in college level and competitive level exams.

The application is very easy to use and has been designed very carefully keeping in mind the needs of the students. When a student/user makes a mistake the application indicates and also shows the correct answer. Take the GATE Computer Science tests repeatedly and analyze your improved results each time.

This is a free version and this can be used in both offline mode and online mode.

Some of the most important categories covered under the GATE Computer Science tests are:

- Machine instructions and addressing modes

- ALU, data-path and control unit

- Instruction pipelining

- Memory hierarchy -

- Cache

- Dynamic programming

- Divide-and-conquer

- Graph search, minimum spanning trees, shortest paths

- Theory of Computation

- Regular expressions and finite automata

- Context-free grammars and push-down automata

- Regular and contex-free languages, pumping lemma

- Turing machines and undecidability

- Compiler Design

- Lexical analysis, parsing, syntax-directed translation

- Main memory and secondary storage

- I/O interface (interrupt and DMA mode)

- Programming and Data Structures

- Programming in C

- Recursion

- Tuple calculus

- SQL

- Asymptotic worst case time and space complexity

- Algorithm design techniques -

- Greedy

- Relational model

- Relational algebra

- Application layer protocols (DNS, SMTP, POP, FTP, HTTP)

- Basics of Wi-Fi

- Network security

- Authentication

- Basics of public key and private key cryptography

- Digital signatures and certificates

- Firewalls

- Integrity constraints, normal forms

- File organization, indexing (e.g., B and B+ trees)

- Transactions and concurrency control

- Computer Networks

- Concept of layering

- LAN technologies (Ethernet)

- Flow and error control techniques, switching

- IPv4/IPv6, routers and routing algorithms (distance vector, link state)

- TCP/UDP and sockets, congestion control

- Runtime environments

- Intermediate code generation

- Operating System

- Processes, threads, inter-process communication, concurrency and synchronization

- Deadlock

- CPU scheduling

- Memory management and virtual memory

- File systems

- Databases

- ER-model

- Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs

- Algorithms

- Searching, sorting, hashing