Computer Science and Information Technology
2023 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2023 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 61–63 of 65. Imported answers require review unless explicitly marked reviewed.
Question 61
Open questionCSNAT2 marksNeeds review
Consider the following table named Student in a relational database. The primary key of this table is rollNum.
Student
rollNum | name | gender | marks |
|---|---|---|---|
1 | Naman | M | 62 |
2 | Aliya | F | 70 |
3 | Aliya | F | 80 |
4 | James | M | 82 |
5 | Swati | F | 65 |
The SQL query below is executed on this database.
SELECT *
FROM Student
WHERE gender = ‘F’ AND
marks > 65;
The number of rows returned by the query is __________.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 62
Open questionCSNAT2 marksNeeds review
Consider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes, of which the primary key occupies 15 bytes. The data file is block-aligned in that each data record is fully contained within a block. The database is indexed by a primary index file, which is also stored as a block-aligned ordered file. The figure below depicts this indexing scheme.
Suppose the block size of the file system is 1024 bytes, and a pointer to a block occupies 5 bytes. The system uses binary search on the index file to search for a record with a given key. You may assume that a binary search on an index file of
blocks takes
block accesses in the worst case.
Given a key, the number of block accesses required to identify the block in the data file that may contain a record with the key, in the worst case, is ________. 
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 63
Open questionCSNAT2 marksNeeds review
Consider the language
over the alphabet
, given below:
The minimum number of states in a Deterministic Finite-State Automaton (DFA) for
is ________.Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer