GATE CS IT Answer Key 2015 Download of 7th February Forenoon Afternoon Session: Computer Science and Information Technology in gate examination the code is CS. GATE examination is very important and dream for many students to pursue their M.Tech IIT’s and NIT’s. Some students wil be preparing for the one year completely for this. Is the paper easy or tough in other students view. What would be the cutoff marks for this paper now?. Am I going qualify in this GATE?. You can get your questions get clarified once you go through this. Students or aspirants completed their exam on 7th February 2015 Forenoon Session here we providing the information about the exam Review, Analysis, Answer key and Cutoff Marks.
GATE Computer Science and Information Technology (CS) 7th February 2015 Forenoon Session Review :
Candidates completed their exam on 7th morning are in search of Computer Science and Information Technology review the questions paper. Comming to the review the questions are mainly based on the basics if you have concentrated on basics you would do good. You could attempt for 60% in the paper, other questions are relatively tough.
Digital Logic : Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).
Number of questions asked : 1
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.
Number of questions asked : 4
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.
Number of questions asked : 6
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.
Number of questions asked : 5
Theory of Computation : Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
Number of questions asked : 3
Compiler Design : Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
Number of questions asked : 3
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.
Number of questions asked : 6
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.
Number of questions asked : 2
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.
Number of questions asked : 2
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.
Number of questions asked : 6
Web technologies : HTML, XML, basic concepts of client-server computing.
Number of questions asked : 5
GATE Computer Science and Information Technology (CS) 7th February 2015 Forenoon Session Analysis :
Candidates appeared for the exam want to know about the number question appeared from each subject. All that information will be updates soon. Here we have provided the information about the percentage of marks for each section. Total No. of Questions 65: Five 1 mark questions, five 2 mark questions for General Aptitude, Twenty-five (25) 1 mark questions and thirty (30) 2 mark questions for Engineering Math and Subject of Paper.
The analysis for GATE CS 7th February 2015 Forenoon Session will be updates soon….
Computer Science and Information Technology :
| GATE 2014 | ||||||
| Total Marks-100 | Paper-1 | Paper-2 | Paper-3 | |||
| 1 Mark | 2 Marks | 1 Mark | 2 Marks | 1 Mark | 2 Marks | |
| Engineering Mathematics | 5 | 3 | 5 | 4 | 5 | 3 |
| Discrete Mathematics | 5 | 7 | 2 | 4 | 3 | 5 |
| Digital Logic | 0 | 1 | 0 | 1 | 1 | 1 |
| Computer Organization | 1 | 3 | 2 | 3 | 1 | 3 |
| Theory of Computation | 2 | 1 | 2 | 2 | 2 | 2 |
| Data Structures and Algorithms | 5 | 4 | 5 | 5 | 4 | 6 |
| Compiler Design | 0 | 3 | 3 | 2 | 3 | 1 |
| Operating Systems | 2 | 4 | 1 | 5 | 1 | 4 |
| DBMS | 1 | 1 | 2 | 1 | 2 | 2 |
| Computer Networks | 3 | 3 | 3 | 3 | 3 | 3 |
| SEWT | 1 | 0 | 0 | 0 | 0 | 0 |
| Verbal Ability | 3 | 2 | 3 | 2 | 3 | 2 |
| Numerical Ability | 2 | 3 | 2 | 3 | 2 | 3 |
| 30 | 35 | 30 | 35 | 30 | 35 | |
| GATE 2013 | GATE 2012 | GATE 2011 | ||||
| Section | No.of Questions | Marks | No.of Questions | Marks | No.of Questions | Marks |
| Engineering Mathematics | 10 | 13 | 11 | 16 | 11 | 19 |
| Digital Logic | 4 | 5 | 3 | 4 | 5 | 7 |
| Computer Organization | 4 | 7 | 4 | 6 | 6 | 10 |
| Theory of Computation | 7 | 10 | 4 | 5 | 6 | 9 |
| Data Structures and Algorithms | 10 | 17 | 13 | 21 | 7 | 11 |
| Compiler Design | 3 | 6 | 2 | 4 | 2 | 3 |
| Operating Systems | 6 | 10 | 5 | 9 | 5 | 7 |
| DBMS | 4 | 7 | 7 | 11 | 4 | 7 |
| Computer Networks | 5 | 7 | 6 | 9 | 4 | 6 |
| Software Engineering & Web Technology | 2 | 3 | 0 | 0 | 5 | 6 |
| General Ability | 10 | 15 | 10 | 15 | 10 | 15 |
GATE Computer Science and Information Technology (CS) 7th February 2015 Forenoon Session Cutoff Marks :
The Graduate Aptitude Test in Engineering 2014 Cutoff differs the qualifying marks for General Class are kept high comparatively to other categories. The CS Cutoff for GATE 2014 is dependent on the previous years cutoff, number of applicants, difficulty levels of the GATE exam. Candidates appeared for 2015 GATE Exam must check and analyze the cutoff marks of previous year so that they can estimate their year cutoff marks. Here we provided you the marks for 2014.
The Cutoff Marks for GATE CS 7th February 2015 Forenoon Session will be updates soon…
No of Candidates Appeared for Gate CS : 1,5,5190
Qualifying Marks (General) : 25
Qualifying Marks (OBCNCL) : 22.5
Qualifying Marks (SC/ST/PwD) : 16.67
GATE Computer Science and Information Technology (CS) 7th February 2015 Forenoon Session Answer Key :
Candidates eagerly waiting for gate CS 7th February 2015 answer key. They can know the correct answers to the questions asked in the GATE examination for Computer Science and Information Technology so that they can estimate the scores which helps them to know their estimated score. In this paper the General Aptitude section will carry 15% of the total marks and the remaining 85% of the total marks is devoted to the subject of the paper. There will be a total of 65 questions carrying 100 marks, out of which 10 questions carrying a total of 15 marks are in General Aptitude (GA). Here we have provided you the GATE CS 2014 Question paper with Answer key.
GATE CS 2014 Question paper with Answer key
We will update the GATE CS 7th February 2015 Forenoon Session Answer key as soon the key released in the official website.
Click Here : For the Made Easy Answer key for GATE CS 7th February 2015 Forenoon Session
Click Here : For the ACE academy Answer key for GATE CS 7th February 2015 Forenoon Session
Click Here : For the IES academy Answer key for GATE CS 7th February 2015 Forenoon Session