1.Recursion is similar to which of the following?
Switch Case
Loop
If-else
if elif else
2.In recursion, the condition for which the function will stop calling itself is ____________
Best case
Worst case
Base case
There is no such condition
3.Consider the following code snippet:
void my_recursive_function()
{
my_recursive_function();
}
int main()
{
my_recursive_function();
return 0;
}
What will happen when the above snippet is executed?
The code will be executed successfully and no output will be generated
The code will be executed successfully and random output will be generated
The code will show a compile-time error
The code will run for some time and stop when the stack overflows
4.What is the output of the following code?
void my_recursive_function(int n)
{
if(n == 0)
return;
printf("%d ",n);
my_recursive_function(n-1);
}
int main()
{
my_recursive_function(10);
return 0;
}
10
1
10 9 8 ... 1 0
10 9 8 ... 1
5.What is the base case for the following code?
void my_recursive_function(int n)
{
if(n == 0)
return;
printf("%d ",n);
my_recursive_function(n-1);
}
int main()
{
my_recursive_function(10);
return 0;
}
Return
printf(“%d “, n)
if(n == 0)
My_recursive_function(n-1)
6.How many times is the recursive function called, when the following code is executed?
void my_recursive_function(int n)
{
if(n == 0)
return;
printf("%d ",n);
my_recursive_function(n-1);
}
int main()
{
my_recursive_function(10);
return 0;
}
9
10
11
12
7.Which of the following statements is true?
Recursion is always better than iteration
Recursion uses more memory compared to iteration
Recursion uses less memory compared to iteration
Iteration is always better and simpler than recursion
8.What will be the output of the following code?
int cnt=0;
void my_recursive_function(int n)
{
if(n == 0)
return;
cnt++;
my_recursive_function(n/10);
}
int main()
{
my_recursive_function(123456789);
printf("%d",cnt);
return 0;
}
123456789
10
0
9
9.
void my_recursive_function(int n)
{
if(n == 0)
{
printf("False");
return;
}
if(n == 1)
{
printf("True");
return;
}
if(n%2==0)
my_recursive_function(n/2);
else
{
printf("False");
return;
}
}
int main()
{
my_recursive_function(100);
return 0;
}
True
False
10.What is the output of the following code?
int cnt = 0;
void my_recursive_function(char *s, int i)
{
if(s[i] == '\0')
return;
if(s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u')
cnt++;
my_recursive_function(s,i+1);
}
int main()
{
my_recursive_function("thisisrecursion",0);
printf("%d",cnt);
return 0;
}
6
9
5
10
11.What is the output of the following code?
void my_recursive_function(int *arr, int val, int idx, int len)
{
if(idx == len)
{
printf("-1");
return ;
}
if(arr[idx] == val)
{
printf("%d",idx);
return;
}
my_recursive_function(arr,val,idx+1,len);
}
int main()
{
int array[10] = {7, 6, 4, 3, 2, 1, 9, 5, 0, 8};
int value = 2;
int len = 10;
my_recursive_function(array, value, 0, len);
return 0;
}
3
4
5
6
12.______is the first step in solving the problem
Understanding the Problem
Identify the Problem
Evaluate the Solution
None of these
13.______is the last step in solving the problem
Understanding the Problem
Identify the Problem
Evaluate the Solution
None of these
14.Following is true for understanding of a problem
Knowing the knowledgebase
Understanding the subject on which the problem is based
Communication with the client
All of the above
15.The six-step solution for the problem can be applied to
I. Problems with Algorithmic Solution
II. Problems with Heuristic Solution
Only I
Only II
Both I and II
Neither I nor II
16.______ solution requires reasoning built on knowledge and experience
Algorithmic Solution
Heuristic Solution
Random Solution
None of these
17.The correctness and appropriateness of ___________solution can be checked very easily.
Algorithmic solution
Heuristic solution
Random solution
None of these
18.The branch of computer that deals with heuristic types of problem is called _________________.
System software
Real time software
Artificial intelligence
None of these
19.Artificial Intelligence makes use of following prominently
Database
Data Warehouse
Knowledge base
None of these
20.Naming convention for variable is followed in company because ____________.
It enhances readability
It allows to work without conflicts
It enhances the efficiency
All of the above
Saturday, October 10, 2020
Analysis and Design of Algorithms Multiple choice questions
Friday, October 09, 2020
Operating System multiple choice questions
Linux
Oracle
DOS
Explanation: Oracle is an RDBMS (Relational Database Management System). It is known as Oracle Database, Oracle DB, or Oracle Only. The first database for enterprise grid computing is the Oracle database.
2) What is the maximum length of the filename in DOS?
4
5
8
12
Answer: (c) 8
Explanation: The maximum length of the filename is 8 characters in the DOS operating system. It is commonly known as an 8.3 filename.
3) When was the first operating system developed?
1948
1949
1950
1951
Answer: (c) 1950
Explanation: The first operating system was developed in the early 1950's. It was also called a single-stream batch processing system because it presented data in groups.
4) When were MS windows operating systems proposed?
1994
1990
1992
1985
Answer: (d) 1985
Explanation: The first MS Windows operating system was introduced in early 1985.
5) Which of the following is the extension of Notepad?
.txt
.xls
.ppt
.bmp
Answer: (a) .txt
Explanation: The .txt file extension is a standard text document extension that contains the unformatted text. It is the default file extension for the notepad.
6) What else is a command interpreter called?
prompt
kernel
shell
command
Answer: (c) shell
Explanation: The command interpreter is also called the shell.
7) What is the full name of FAT?
File attribute table
File allocation table
Font attribute table
Format allocation table
Answer: (b) File allocation table.
Explanation: The FAT stands for File allocation table. The FAT is a file system architecture. It is used in computer systems and memory cards. A FAT of the contents of a computer disk indicates which field is used for which file.
8) BIOS is used?
By operating system
By compiler
By interpreter
By application software
Answer: (a) By operating system
Explanation: BIOS is used by the operating system. It is used to configure and identify the hardware in a system such as the hard drive, floppy drive, optical drive, CPU, and memory.
9) What is the mean of the Booting in the operating system?
Restarting computer
Install the program
To scan
To turn off
Answer: (a) Restarting computer
Explanation: Booting is a process of the restart the computer. After restarting it, there is no software in the computer's main memory.
10) When does page fault occur?
The page is present in memory.
The deadlock occurs.
The page does not present in memory.
The buffering occurs.
Answer: (c) The page does not present in memory.
Explanation: Page faults occur when a process tries to access a block page of the memory and that page is not stored in RAM (Read only memory) or memory.
11) Banker's algorithm is used?
To prevent deadlock
To deadlock recovery
To solve the deadlock
None of these
Answer: (a) To prevent deadlock
Explanation: Banker's algorithm is used to prevent the deadlock condition. The banker algorithm is sometimes called the detection algorithm. It is named the banker algorithm because it is used to determine whether a loan can be granted in the banking system or not.
12) When you delete a file in your computer, where does it go?
Recycle bin
Hard disk
Taskbar
None of these
Answer: (a) Recycle bin
Explanation: When you delete a file on your computer device, it is transferred to your computer system's recycle bin or trash.
13) Which is the Linux operating system?
Private operating system
Windows operating system
Open-source operating system
None of these
Answer: (c) Open-source operating system
Explanation: The Linux operating system is an open-source operating system made up of a kernel. It is a very safe operating system.
14) What is the full name of the DSM?
Direct system module
Direct system memory
Demoralized system memory
Distributed shared memory
Answer: (d) Distributed shared memory
Explanation: The DSM stands for Distributed Shared Memory.
15) What is the full name of the IDL?
Interface definition language
Interface direct language
Interface data library
None of these
Answer: (a) Interface definition language
Explanation: The IDL stands for Interface Definition Language. It is used to establish communications between clients and servers in RPC (Remote Procedure Call).
16) What is bootstrapping called?
Cold boot
Cold hot boot
Cold hot strap
Hot boot
Answer: (a) Cold boot
Explanation: Bootstrapping is also known as the cool boot.
17) What is the fence register used for?
To disk protection
To CPU protection
To memory protection
None of these
Answer: (c) To memory protection
Explanation: The fence register is used for memory protection on the computer. It is a way to access the memory in the computer.
18) If the page size increases, the internal fragmentation is also?..?
Decreases
Increases
Remains constant
None of these
Answer: (b) Increases
Explanation: None
19) Which of the following is a single-user operating system?
Windows
MAC
Ms-Dos
None of these
Answer: (c) Ms-Dos
Explanation: The single-user operating system is the operating system in which only one user can access the computer system at a time, and Ms-DOS is the best example of a single-user operating system.
20) The size of virtual memory is based on which of the following?
CPU
RAM
Address bus
Data bus
Answer: (c) Address bus
Explanation: The size of virtual memory is based on the address bus.
21) If a page number is not found in the translation lookaside buffer, then it is known as a?
Translation Lookaside Buffer miss
Buffer miss
Translation Lookaside Buffer hit
All of the mentioned
Answer: (a) Translation Lookaside Buffer miss
Explanation: A Translation Lookaside Buffer miss arises when the page table entry needed to translate a virtual address to a physical address is not available in the translation lookaside buffer.
22) Which of the following is not application software?
Windows 7
WordPad
Photoshop
MS-excel
Answer: (a) Windows 7
Explanation: Windows 7 is not an application software because it is a operating system.
23) Which of the following supports Windows 64 bit?
Window XP
Window 2000
Window 1998
None of these
Answer: (a) Window XP
Explanation: Windows XP supports the 64-bits. Windows XP is designed to expand the memory address space. Its original name is Microsoft Windows XP Professional x64 and it is based on the x86-64 architecture.
24) Which of the following windows does not have a start button?
Windows 7
Windows 8
Windows XP
None of these
Answer: (b) Windows 8
Explanation: Windows 8 does not have a start button because it uses the tablet mode, but windows 8.1 has a start button.
25) Which of the following operating systems does not support more than one program at a time?
Linux
Windows
MAC
DOS
Answer: (d) DOS
Explanation: DOS stands for Disk operating system. Disk operating system is a single-user operating system that does not support more than one program at a time.
26) Which of the following is a condition that causes deadlock?
Mutual exclusion
Hold and wait
Circular wait
No preemption
All of these
Answer: (e) All of these
Explanation: None
27) Who provides the interface to access the services of the operating system?
API
System call
Library
Assembly instruction
Answer: (b) System call
Explanation: The system call provides an interface for user programs to access the services of the operating system through the API (Application Program Interface).
28) Where are placed the list of processes that are prepared to be executed and waiting?
Job queue
Ready queue
Execution queue
Process queue
Answer: (b) Ready queue
Explanation: The ready queue is a set of all the processes that processes are ready to execute and wait.
29) Who among the following can block the running process?
Fork
Read
Down
All of these
Answer: (d) All of these
Explanation: None
30) Which of the following does not interrupt the running process?
Timer interrupt
Device
Power failure
Scheduler process
Answer: (b) Scheduler process
Explanation: Scheduler process does not interrupt in any running process. Its job is to select the processes for long-term, short-term, and short-term scheduler.
31) What is Microsoft window?
Operating system
Graphics program
Word Processing
Database program
Answer: (a) Operating system
Explanation: Microsoft Windows is an operating system that was developed by Microsoft company. The Microsoft Windows is available in 32-bits and 64-bits in the market.
32) Which of the following is group of programs?
Accessories
Paint
Word
All of above
Answer: (a) Accessories
Explanation: The windows accessories are a group of programs in the operating system. Windows XP offers many accessories or software that you can use to help with your work. The accessories are not full features programs, but it is useful for a specific task in the operating systems. It provides many programs such as a painting program, a calculator, a word processor, a notepad, and Internet software.
33) Which of the following is an example of a Real Time Operating System?
MAC
MS-DOS
Windows 10
Process Control
Answer: (d) Process Control
Explanation: Process control is a best example of a Real time operating system.
34) Which of the following operating systems do you use for a client-server network?
MAC
Linux
Windows XP
Windows 2000
Answer: (d) Windows 2000
Explanation: Windows 2002 operating systems were used to implement a client Server Network. It is a server OS that was developed by Microsoft in April 24, 2002. It includes some features of Windows XP.
35) Which windows was introduced to My Computer?
Windows 10
Windows XP
Windows 95
Windows 98
Answer: (c) Windows 95
Explanation: Windows 95 was first window to introduced the My Computer.
36) What type of commands are required to perform various tasks in DOS?
Internal commands
External commands
Valuable commands
Primary commands
Answer: (b) External commands
Explanation: External commands are required to perform various tasks in DOS.
37) What is the number of characters contained in the primary name of the file of MS-DOS?
Up to 8 characters
3 characters
Up to 10 characters
None of the above
Answer: (a) Up to 8 characters
Explanation: MS-DOS operating system uses the file system that supports the 8.3 characters. The eight characters are used to the filename, and three characters are used to the extension.
38) Which command is used to fetch a group (.doc) of files that have just been deleted?
Undelete
Undelete/all
Undelete *.doc
All of above
Answer: (c) Undelete *.doc
Explanation: Undelete *.doc command is used to fetch a group (.doc) of files that have just been deleted.
39) Which of the following is system software?
Operating system
Compiler
Utilities
All of the above
Answer: (d) All of the above
Explanation: The system software is a type of computer program designed to run hardware and software programs on a computer. According to some definitions, system software also includes system utilities, system restore, development tools, compilers, and debuggers.
40) Which program runs first after booting the computer and loading the GUI?
Desktop Manager
File Manager
Windows Explorer
Authentication
Answer: (d) Authentication
Explanation: The authentication program is run first after booting the computer and loading the GUI. Authentication is a process of verifying the person or device. For example, when you log in to Facebook, you enter a username and password.
Database Management System Multiple choice questions
a) tuple
b) attribute
c) metadata
d) teradata
2) Which of the following normal form deals with the anomaly of multivalue dependency?
a) 1NF
b) 2NF
c) 4NF
d) 5NF
3) Which of the following normal form deals with the repeating group anomaly?
a) 1NF
b) 2NF
c) 4NF
d) 5NF
4) …………… is a database language used to define data structures in SQL?
a) Sybase
b) Oracle
c) DDL
d) MySQL
5) The ………………… is a database file that contains metadata.
a) data index
b) data repository
c) data dictionary
d) none
6)Which of the following is not the state of a transaction in the database?
a) Active
b) Committed
c) Terminated
d) Nullified
7) The …………… file saves the recovery scenario in Quick Test Professional (QTP) environment
a) QRS
b) JPEG
c) DOC
d) TSR
8) Which of the following is not a command is SQL?
a) WHERE
b) ORDER BY
c) REMOVE
d) SELECT
9) How should we traverse an oracle database to retrieve a row in the quickest possible time?
a) Full table scan
b) Unique index
c) Primary key
d) Table access by row id
10) Which of the following is a concurrency control protocol?
a) Locked-based protocol
b) two-phase locking protocol
c) Timestamp ordering protocol
d) all
11) Which of the following normal forms deals with the anomaly of partial functional dependency on the composite key?
a) 1NF
b) 2NF
c) 4NF
d) 5NF
12) ………………… represents the structure of the database in a formal language acceptable by the DBMS.
a) Database schema
b) ER diagram
c) Database table
d) None
13) Which of the following statements are used to create indexes in the database?
a) CREATE INDEX
b) BUILD INDEX
c) WRITE INDEX
d) None’
14)Which of the following is a database recovery technique?
a) Check-pointing
b) Transaction rollback
c) Shadow paging
d) All
15)Which of the following is a foreing key constraint?
a)Referential integrity
b) Domain integrity
c) Entity integrity
d) All
16) Which of the following trains are important to select a primary key?
a) Unique
b) Not Null
c) Fully functional dependency
d) Indexed
e) All
17) What are various types of DBMS?
a) ORBDMS
b) Client server DBMS
c) Distributed DBMS
d) OODBMS
e) All
18) Which of the following are the types of integrity constraints enforced by RDBMS?
a) Entity integrity
b) Domain integrity
c) Referential integrity
d) All
19) The data model which describes how the data is actually stored is :
a) internal model
b) external model
c) logical model
d) none of these
20) Data about data is normally termed as :
a) directory
b) data bank
c) meta data
d) none of the above
21. In an object-oriented model, one object can access data of another object by passing:
a. Instance variable
b. Message
c. Variable
d. None of these
22. A view of database that appears to an application program is known as:
a. Schema
b. Subschema
c. virtual table
d. none of the above
23. An abstraction concept for building composite object from their component object is called:
a. Specialization
b. Normalization
c. Generalization
d. Aggregation
24. A set of objects that share a common structure and
a common behavior is called:
a. Object
b. Class
c. Entity
d. None of these
25. Every weak entity set can be converted into a strong entity set by:
a. using generalization
b. adding appropriate attributes
c. using aggregation
d. none of the above
26. The number of entities to which another entity can be associated via a relationship set is expressed as:
a. Entity
b. Cardinality
c. Schema
d. Attributes
27. Relations produced from an E-R model will always be in:
a. First normal form
b. Second normal form
c. Third normal form
d. Fourth normal form
28. In ER model the details of the entities are hidden from the user. This process is called:
a. Generalization
b. Specialization
c. Abstraction
d. none of these above
29. The file organization that provides very fast access to any arbitrary record of a file is:
a. Ordered file
b. Unordered file
c. Hashed file
d. B-tree
30. What is not true about a view?
a. It is a definition of a restricted portion of the database
b. It is a security mechanism
c. It is always updatable like any other table
d. All are true
31. In a relational database a referential integrity constraint can be specified with the help of
a. primary key
b. foreign key
c. secondary key
d. none of the above
32. A super key is a set of one or more attributes that, taken collectively, allow us
a. to identify uniquely an entity in the entityset
b. to make the key most powerful for fasterretrieval
c. to increase effectiveness of database access
d. none of the above
33. 4NF is designed to cope with:
a. Transitive dependency
b. Join dependency
c. Multi valued dependency
d. None of these
34. Every Boyee-Codd normal form is in
a. First normal form
b. Second normal form
c. Third normal form
d. All of the above
35. Which command is used to remove all rows from a table?
a. Delete
b. Remove
c. Truncate
d. Both [A] and [B]
36. Which of the following is an aggregate function in SQL?
a. Union
b. Like
c. Group By
d. Max
37. Which command is used to add a column to an existing table?
a. Create
b. Update
c.Alter
d. None of these
38. A deadlock exists in the system if and only if the wait for graph:
a. has a cycle in it
b. has a path from first node to last node
c. is a tree
d. none of the above
39. Rollback of transactions is normally used to:
a. recover from transaction failure
b. update the transaction
c. retrieve old records
d. repeat a transaction
40. Prevention of access to the database by unauthorized users is referred to as:
a. Integrity
b. Productivity
c. Security
d. Reliability
Algorithms Multiple choice questions
1.Algorithm is a ________________.
Processing of problem
Step by Step method to solve a problem
Graphical method
None of the above
2.Algorithm should have _______________ or more output.
Zero
One
Two
Three
3.Which is correct according to increasing order of growth rate
n, n! , nlogn , n^2 , n^3 , n^5 , 2^n
nlogn , n^2 , n^3 , n^5 , 2^n , n!
n , nlogn , n^2 , n^3 , n^5 , 2^n , n!
n , nlogn , n^2 , n^3 , n^5 , n!, 2^n
4.Big Oh! notation looks for____________ value.
Maximum
Minimum
Average
Mean
5.Omega (Ω) notation looks for ___________ value.
Maximum
Minimum
Average
Mean
6.A function which calls itself is called __________ function.
Null
Default
Recursive
Non recursive
7. _____________ method is used to solve recurrence.
Main
Major
Divide
Master
8.Time complexity of binary search is _____________.
O(n)
O(logn)
O(nlogn)
None of the above
9.The condition for applying binary search is _______________.
Elements should be sorted
Elements should be unsorted
Elements should have priority
None of the above
10.best case of binary search, the searching element is at _______________ position.
First
Second
Last
Middle
11.The __________________of an algorithm is the amount of computer time it needs to run to completion.
Time complexity
Space complexity
Time period
None of the above
12.The minimum number of comparisons required finding the minimum and maximum of 100 numbers is ________
99
100
101
None of the above
13.Divide and Merge operation is done in ____________.
Binary search
Merge sort
Quicksort
Heap sort
14.Which sort takes an extra array.
Binary search
Merge sort
Quicksort
Heap sort
15.Recurrence equation of merge sort is _______________.
T(n) = T(n/2) + O(n)
T(n) = 2T(n/2) + O(n)
T(n) = 3T(n/2) + O(n)
None of the above
16.Pivot element is used in ___________ sort.
Binary search
Mergesort
Quick sort
Heap sort
17.Partition operation is done in _____________ sort.
Binary search
Mergesort
Quick sort
Heap sort
18.Quick sort algorithm is an example of
Greedy
Improved search
Dynamic Programming
Divide and Conquer
19.Time complexity of merge sort is ___________.
O(n)
O(logn)
O(nlogn)
None of the above
20.Time complexity of quick sort is depends on _____________.
O(n)
O(logn)
O(nlogn)
None of the above
21.Merge sort uses which of the following technique to implement sorting?
Backtracking
Greedy algorithm
Divide and conquer
Dynamic programming
22.What is the average case time complexity of merge sort ?
O(n log n)
O(n^2)
O(n^2log n)
O(n log n2)
23.What is the auxiliary space complexity of merge sort?
O(1)
O(log n)
O(n)
O(n log n)
24.Merge sort can be implemented using O(1) auxiliary space.
True
False
25.What is the worst case time complexity of merge sort?
O(n log n)
O(n^2)
O(n^2 log n)
O(n logn2 )
26.Which of the following method is used for sorting in merge sort?
Merging
Partitioning
Selection
Exchanging
27.What will be the best case time complexity of merge sort ?
O(n log n)
O(n2)
O(n2 logn)
O(n logn2)
28. Which of the following is not a variant of merge sort ?
In-place merge sort
Bottom up merge sort
Top down merge sort
Linear merge sort
29.Choose the incorrect statement about merge sort from the following?
It is a comparison based sort
It is an adaptive algorithm
It is not an in place algorithm
It is stable algorithm
30.Which of the following is not in place sorting algorithm?
Merge sort
Quick sort
Heap sort
Insertion sort
31.Which of the following is not a stable sorting algorithm?
Quick sort
Cocktail sort
Bubble sort
Merge sort
32.Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array?
Quick sort
Insertion sort
Selection sort
Merge sort
33.Merge sort is preferred for arrays over linked lists.
True
False
34.Which of the following sorting algorithm makes use of merge sort?
Tim sort
Intro sort
Bogo sort
Quick sort
35.Choose the correct code for merge sort.
void merge_sort(int arr[], int left, int right) { if (left > right) { int mid = (right-left)/2; merge_sort(arr, left, mid); merge_sort(arr, mid+1, right); merge(arr, left, mid, right); //function to merge sorted arrays } }
void merge_sort(int arr[], int left, int right) { if (left < right) { int mid = left+(right-left)/2; merge_sort(arr, left, mid); merge_sort(arr, mid+1, right); merge(arr, left, mid, right); //function to merge sorted arrays } }
void merge_sort(int arr[], int left, int right) { if (left < right) { int mid = left+(right-left)/2; merge(arr, left, mid, right); //function to merge sorted arrays merge_sort(arr, left, mid); merge_sort(arr, mid+1, right); } }
void merge_sort(int arr[], int left, int right) { if (left < right) { int mid = (right-left)/2; merge(arr, left, mid, right); //function to merge sorted arrays merge_sort(arr, left, mid); merge_sort(arr, mid+1, right); } }
36. Which of the following sorting algorithm does not use recursion?
Quick sort
Merge sort
Heap sort
Bottom up merge sort
37.Which of the following sorting algorithms is the fastest ?
Merge sort
Quick sort
Insertion sort
Shell sort
38.Quick sort follows Divide-and-Conquer strategy.
True
False
39.What is the worst case time complexity of a quick sort algorithm?
O(N)
O(N log N)
O(N^2 )
O(log N)
40.Which of the following methods is the most effective for picking the pivot element ?
First element
Last element
Median-of-three partitioning
Random element
41.Find the pivot element from the given input using median-of-three partitioning method. 8, 1, 4, 9, 6, 3, 5, 2, 7, 0.
8
7
9
6
42.Which is the safest method to choose a pivot element ?
Choosing a random element as pivot
Choosing the first element as pivot
Choosing the last element as pivot
Median-of-three partitioning method
43.What is the average running time of a quick sort algorithm ?
O(N^2 )
O(N)
O(N log N)
O(log N)
44.Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
Merge sort
Shell sort
Insertion sort
Bubble sort
45.Quick sort uses join operation rather than merge operation.
True
False
46.How many sub arrays does the quick sort algorithm divide the entire array into?
One
Two
Three
Four
47.Which is the worst method of choosing a pivot element ?
First element as pivot
Last element as pivot
Median-of-three partitioning
Random element as pivot
48.Which among the following is the best cut-off range to perform insertion sort within a quick sort ?
N=0-5
N=5-20
N=20-30
N>30
49.Recursion is a method in which the solution of a problem depends on ____________
Larger instances of different problems
Larger instances of the same problem
Smaller instances of the same problem
Smaller instances of different problems
50.Which of the following problems can’t be solved using recursion?
Factorial of a number
Nth fibonacci number
Length of a string
Problems without base case
Tuesday, October 06, 2020
GATE 2021 - IIT BOMBAY
GATE 2021 - Important Dates
|
Activity |
Day |
Date |
|
GATE Online Application Processing System (GOAPS) Website Opens |
Monday |
14th September 2020 |
|
Closing Date of REGULAR online registration / application portal |
Wednesday |
30th September 2020 |
|
Extended closing date of REGULAR online registration / application portal |
Wednesday |
7th October 2020 |
|
End
of EXTENDED period for online registration / application |
Monday |
12th October 2020 |
|
Last date of intimation to Registered Candidates after Scrutiny |
Wednesday |
21st October 2020 |
|
Re-opening
of GOAPS Portal for Successfully Registered Candidates to change Category /
City / Exam paper |
Wednesday |
28th October 2020 |
|
Last Date for change of Category, City & Exam Paper |
Friday |
13th November 2020 |
|
Availability
of Admit Card on the Online Application Portal |
Friday |
8th January 2021 |
|
GATE
2021 Examination |
Friday |
5th February
2021 |
|
Announcement of results in the Online Application Portal |
Monday |
22nd March 2021 |
Important Note
The health
and safety of the candidates are of utmost priority. Due to current COVID-19
pandemic situation, dates mentioned here are subject to change.
In rare cases, it may be necessary to postpone the GATE 2021 examination
because of situations beyond the control of GATE committee.
All updates will be available on this website.
GATE 2021 - Tentative List of Examination Cities
|
Zone No. |
Zonal GATE Office |
Tentative List of Examination Cities/Towns |
|
Zone-1 |
Chairperson, GATE, |
Ananthapuramu (AP), Angamaly (KL), Bagalkot (KA), Belagavi (Belgaum) (KA), Ballari (Bellary) (KA), Bengaluru South (KA), Bengaluru North (KA), Bidar (KA), Chikkamagaluru (KA), Davanagere (KA), Hasaan (KA), Hubballi (Hubli) (KA), Hyderabad (TS), Kalaburagi (Gulbarga) (KA), Kannur (KL), Kasaragod (KL), Kolar (KA), Kozhikode (KL), Kurnool (AP), Malappuram (KL), Mangaluru (KA), Manipal (KA), Mysuru (Mysore) (KA), Palakkad (KL), Payyanur (KL), Port Blair (AN), Shivamogga (Shimoga)(KA), Thrissur (KL), Tumakuru (KA), Vatakara (KL) - (30 Cities). |
|
Zone-2 |
Chairperson, GATE, |
Ahmedabad (GJ), Ahmednagar (MH), Amravati (MH), Anand (GJ), Aurangabad (MH), Baramati (MH), Bhavnagar (GJ), Bhuj (GJ), Chandrapur (MH), Gandhinagar (GJ), Goa (GA), Jalgaon (MH), Kolhapur (MH), Mehsana (GJ), Mumbai-Navi Mumbai-Thane (MH), Nagpur (MH), Nanded (MH), Nashik (MH), Pune (MH), Raigad (MH), Rajkot (GJ), Ratnagiri (MH), Sangli (MH), Satara (MH), Solapur (MH), Surat (GJ), Vadodara (GJ) - (27 Cities). |
|
Zone-3 |
Chairperson, GATE, |
Ajmer (RJ), Alwar (RJ), Bikaner (RJ), Faridabad (HR), Greater NOIDA (UP), Gurugram (HR), Hisar (HR), Indore (MP), Jaipur (RJ), Jammu-Samba (JK), Jodhpur (RJ), Kota (RJ), Mathura (UP), New Delhi (DL), Rohtak (HR), Sikar (RJ), Sonepat (HR), Srinagar (JK), Udaipur (RJ), Ujjain (MP) - (20 Cities). |
|
Zone-4 |
Chairperson, GATE, |
Agartala (TR), Aizawl (MZ), Asansol-Durgapur (WB), Bokaro Steel City (JH), Burdwan (WB), Dhanbad (JH), Dibrugarh (AS), Dimapur-Kohima (NL), Gangtok (SK), Guwahati (AS), Imphal (MN), Itanagar (AR), Jorhat (AS), Kalyani (WB), Muzaffarpur (BR), Patna (BR), Purnea (BR), Shillong (ML), Silchar (AS), Siliguri (WB), Tezpur (AS) - (21 Cities). |
|
Zone-5 |
Chairperson, GATE, |
Agra (UP), Aligarh (UP), Allahabad (UP), Bareilly (UP), Bhopal (MP), Gorakhpur (UP), Gwalior (MP), Jabalpur (MP), Jhansi (UP), Kanpur (UP), Lucknow (UP), Varanasi (UP) - (12 Cities). |
|
Zone-6 |
Chairperson, GATE, |
Balasore (OR), Berhampur (Odisha) (OR), Bhilai (CH), Bhubaneswar (OR), Bilaspur (CG) (CH), Cuttack (OR), Dhenkanal (OR), Eluru (AP), Hooghly (WB), Jamshedpur (JH), Kakinada (AP), Kharagpur (WB), Kolkata (WB), Raipur (CH), Rajamahendravaram (Rajahmundry) (AP), Ranchi (JH), Rourkela (OR), Sambalpur (OR), Srikakulam (AP), Tadepalligudem (AP), Vijayawada (AP), Visakhapatnam (AP), Vizianagaram (AP) - (23 Cities). |
|
Zone-7 |
Chairperson, GATE, |
Alappuzha (KL), Aluva-Ernakulam (KL), Attingal (KL), Chengannur (KL), Chennai South (TN), Chennai West (TN), Chirala (AP), Chittoor (AP), Coimbatore (TN), Cuddalore (TN), Dindigul (TN), Gudur (AP), Guntur (AP), Idukki (KL), Kadapa (AP), Kanjirapally (KL), Kanyakumari-Nagercoil (TN), Karimnagar (TS), Khammam (TS), Kodad (TS), Kollam (KL), Kothamangalam (KL), Kottayam (KL), Madurai (TN), Muvattupuzha (KL), Namakkal (TN), Nellore (AP), Ongole (AP), Puducherry (PY), Salem (TN), Thanjavur (TN), Thiruvananthapuram (KL), Thoothukudi (TN), Tiruchirapalli (TN), Tirunelveli (TN), Tirupati (AP), Vellore (TN), Villupuram (TN), Virudhunagar (TN), Warangal (TS) - (40 Cities). |
|
Zone-8 |
Chairperson, GATE, |
Ambala (HR), Amritsar (PB), Bathinda (PB), Dehradun (UK), Ghaziabad (UP), Haldwani (UK), Hamirpur-Una (HP), Jalandhar (PB), Karnal (HR), Kurukshetra (HR), Ludhiana (PB), Meerut (UP), Mohali-Chandigarh (PB), Moradabad (UP), Muzaffarnagar (UP), NOIDA (UP), Panipat (HR), Pathankot (PB), Patiala-Sangrur (PB), Roorkee (UK), Shimla-Solan (HP), Yamunanagar (HR) - (22 Cities). |
|
Zone-2 |
GATE International* |
Addis Ababa [Ethiopia], Colombo [Sri Lanka], Dhaka [Bangladesh], Dubai [UAE], Kathmandu [Nepal], Singapore (6 International Cities). |
Note: Words in (round bracket)
denote states in India and those in [square bracket] denote foreign countries
of International cities.
*IMPORTANT - GATE International to
continue only IF the travel and other infrastructural issues normalize by
November 2020 from the present COVID-19 pandemic situation, else GATE-2021
International Centers will be "CANCELLED".
This is a tentative list of
examination cities, and any change will be updated on the website.
Choice
of Examination City: The
candidate can choose FOUR cities from the list of
examination cities given in the above table. The first, second and third
choices must be from the same GATE zone and fourth choice can be from any GATE
zone.
If a candidate chooses a
particular city (in a particular zone) as the first choice, then he/she will be
able to choose the city of second and third choice ONLY from that particular
zone. However, the fourth choice can be from any one of the listed cities in India
(i.e., no restriction on the zone for the fourth-choice city). Note that,
because of the operational constraints, the GATE Committee reserves the right
to add a new city or remove an existing one, and allot a city that may not be
from any of the choices selected by the candidate.
Details of Application Fee for GATE-2021 (Per Subject Paper)
|
For Examination Centres in India |
Regular Period |
During the Extended Period |
|
Female candidates (per paper) |
750 |
1250 |
|
SC / ST / PwD* category candidates (per paper) |
750 |
1250 |
|
All other candidates (per paper) |
1500 |
2000 |