GATE Computer Science CS / IT Preparation Course

ব্রাउটে সুন্দর সংকলন হৃদের জন্য GATE পরীক্ষার প্রশ্নপত্রের একটি উদাহরণ আচরণ দিতে পারবে। এড়ে সম্পর্কিত বিষয়গুলিতে ভিত্তি করা এবং প্রশ্নটি আলোচনা করা উচিত।

Section 1: Engineering Mathematics

Example Question: Prove that the function ( f(x) = \frac{1}{1+e^{-x}} ) is a continuous and differentiable function over its domain and find its derivative.

Section 2: Digital Logic

Example Question: Explain the difference between Complement and Complement with Save Carry (CASCade) operations in digital logic design, and provide a Boolean expression for both cases given a 4-bit binary adder.

Section 3: Computer Organization and Architecture

Example Question: Consider a simple computer with a single core that uses a five-stage pipeline (fetch, decode, execute, memory access, write back). Explain how a branch misprediction is handled in this architecture. Is it possible to detect such mispredictions during the fetch or decode stages? Justify your answer.

Section 4: Programming and Data Structures

Example Question: Write a C program that uses recursion to perform a reverse in-order traversal of a binary search tree, and explain how this traversal differs from the standard in-order traversal.

Section 5: Algorithms

Example Question: Given an unsorted array of integers, describe an algorithm that sorts the array using the insertion sort algorithm and provide its time complexity analysis.

Section 6: Theory of Computation

Example Question: Consider a context-free grammar for expressions over the alphabet {+, *, (, )} with terminal and non-terminal symbols defined accordingly. Provide the production rules for the non-terminals that generate the strings representing the expression ( (a + b) \times (c - d) ).

Section 7: Compiler Design

Example Question: Describe the process of lexical analysis and provide an example of a regular expression that matches all valid identifier names in C, which must start with a letter and followed by zero or more letters, digits, or underscores.

Section 8: Operating System

Example Question: Explain the difference between preemptive and non-preemptive scheduling algorithms. Given a scenario where a CPU has four processes P1, P2, P3, and P4 with respective burst times of 10, 2, 5, and 8 units, describe how you would implement a Round Robin (RR) scheduling algorithm and calculate the average wait time for these processes if the time quantum is set to 4 units.

Section 9: Databases

Example Question: Given an ER diagram with entities 'Employee' and 'Department', where an employee can work in only one department, and a department can have many employees, but a department can be headed by at most one employee (entity 'Manager' is introduced to represent the head of a department), explain how you would model this scenario using the relational model, and provide the SQL statement to create the necessary tables.

Section 10: Computer Networks

Example Question: Describe the role of TCP headers in ensuring reliable data transmission over the network. Specifically, identify which fields within the TCP header are crucial for the implementation of congestion control algorithms like Reno and Cubic, and explain how these algorithms work at a high level.

এই প্রশ্নের ফ্রোয়ার ব্রাउটে অনুসরণ করতে পারেন এবং কোন বিষয়ক Topic সম্পর্কে সাবশইকেল প্রশ্ন তৈরী করতে পারেন। GATE পরীক্ষার জন্য এই ফ্রোয়ারের আবিগত হলেও, তোমার শিক্ষার সাহায্য হতে পারে যদি আপনি এড়া বিষয়ক তৈরি প্রশ্ন সম্পর্কিত জ্ঞান অর্থাৃত এবং বর্তমান সাফল্যের ভিত্তি করি।