Skip to main content

Home
Learn
Computer Science

Database Management System

Programming Language

Computer Networks

Theory of Computation

Digital Electronics

Algorithms

Compiler Design

Computer Organization and Architecture

Data Science

Data Structures

Operating System

Software Engineering

Web Technologies

Machine Learning

Search Engine Optimization

Information Security
General

Mathematics

Aptitude
Courses
Practise
Doubts

Solved Examples

Virtual GATE
Blog
More
Reach to us

Contact Us

Request a Topic

Join us

Internship

Teach with Techtud

GATE 2018 Feedback

Your Interview

Professor's Interview

Research Scholar's Interview

Exam topper's interview
About

About Techtud

The Team

User Levels and Credentials

Benefits

Earn Techtud Tee
Quiz

Search Courses, Topics, Classroom and Educators
Login / Register

Solved Examples

Branch

Topic

Exam

Booth's coding in for the decimal number -43 is (A) +1-1+1-1+1-1+1-1 (B) -1+1-1+1-1+1-1+1 (C) 0+1-1+1-1+1-1 (D) None of the above
- Techtud Admin
- 7 months 5 days ago
- Computer Science and Information Technology

- 0
- Views
- 114
- Likes

Match the following: Protocols Port Number a) DNS 1) 80 b) HTTP 2) 53 c) FTP 3) 21 d) SMTP 4) 25 (A) a-2, b-1, c-3, d-4 (B) a-3, b-2, c-4, d-1 (C) a-2, b-1, c-4, d-3 (D) a-3, b-2, c-1, d-4
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 257
- Likes

How many minimum bits are required to represent -16 in 2’s complement form ?
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 122
- Likes

Match the following: (P) Lexical analysis (i) Leftmost derivation (Q) Lexical analysis (ii) Type checking (R) Lexical analysis (iii) Regular expressions (S) Lexical analysis (iv) Activation records (A) P ↔ i, Q ↔ ii, R ↔ iv, S ↔ iii (B) P ↔ iii, Q ↔ i, R
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 85
- Likes

Match the following: (P) Lexical analysis (i) Leftmost derivation (Q) Lexical analysis (ii) Type checking (R) Lexical analysis (iii) Regular expressions (S) Lexical analysis (iv) Activation records (A) P ↔ i, Q ↔ ii, R ↔ iv, S ↔ iii (B) P ↔ iii, Q ↔ i, R
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 75
- Likes

In a process, the number of cycles to failure decreases exponentially with an increase in load. At a load of 80 units, it takes 100 cycles for failure. When the load is halved, it takes 10000 cycles for failure. The load for which the failure will happen
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 91
- Likes

If she _______________ how to calibrate the instrument, she done the experiment. (A) knows, will have (B) knew, had (C) had known, could have (D) should have known, would have
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 83
- Likes

How many distinct words can be formed by permuting the letters of the word ABRACADABRA? (A) 11! / 5! 2! 2! (B) 11! / 5! 4! (C) 11! 5! 2! 2! (D) 11! 5! 4!
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 64
- Likes

The solution of an = 2an-1 +1, a0 = 0 is (A) $2^{n-1}$ (B) $2^{n}-1$ (C) $2^{n+1}$ (D) $2^{n}+1$
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 93
- Likes

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable. (A) r1(x); r2(x); w1(x); r3(x); w2(x) (
- Techtud Admin
- 7 months 6 days ago
- Computer Science and Information Technology

- 0
- Views
- 102
- Likes

Match the following : a. Inure p. One of two equal parts. b. Leisure q. Slender and flexible. c. Lithe r. Free time. d. Moiety s.To become jaded. (A) a-p,b-q,c-r,d-s (B) a-s,b-r,c-q,d-p (C) a-p,b-r,c-q,d-s (D) a-s,b-q,c-r,d-p
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 115
- Likes

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable. (A) r1(x); r2(x); w1(x); r3(x); w2(x) (
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 94
- Likes

The minimised expression to convert a T flip flop to JK flip flop is (A) T=JQ’+KQ (B) T=JQ’+K’Q (C) T=KQ (D) T=JQ+KQ’
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 107
- Likes

If L1, L2 be two arbitrary language, Choose incorrect statement(s) (i) If L1.L2 is regular, then L2.L1 is also regular. (ii) L1 = L2 iﬀ L1 \ L2 = ∅ and L2 \ L1 = ∅. (iii) If L ⊆ Σ∗ and L is ﬁnite, then Σ∗ \ L is regular.(\=set difference) (A) Only (i) (
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 134
- Likes

Consider a 256K 4-way set associative cache with block size 64 Bytes. Main memory is 2GB. The number of bits used for tag, set and word will be respectively (A) 15,10, 6 (B) 9, 16, 6 (C) 8, 17, 6 (D) 7, 18, 6
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 96
- Likes

Consider two possible page-replacement strategies: LRU (the least recently used page is replaced) and FIFO (the page that has been in memory longest is replaced). Assume that, after space has been reserved for the page table, the interrupt service routine
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 104
- Likes

Which of the following is closest to the maximum number of keys that can be stored in a B-tree of height 2 and minimum degree t = 512? (A) 1, 000, 000 (B) 1, 000, 000, 000 (C) 1, 000, 000, 000, 000 (D) All of the above
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 74
- Likes

54
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 147
- Likes

Consider the polynomial p(x) = a0 + a1x + a2x^2 +a3x^3, where ai != 0, for all i. The minimum number of multiplications needed to evaluate p on an input x is:
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 118
- Likes

Which of phrases given below the sentence should replace the phrase printed in bold type to make the grammatically correct? They were all shocked at his failure in the competition. (A) had all shocked at (B) had all shocked by (C) had been all shocked o
- Techtud Admin
- 7 months 1 week ago
- Computer Science and Information Technology

- 0
- Views
- 280
- Likes

Pages

« first
‹ previous
…
2
3
4
5
6
7
8
9
10
…
next ›
last »

Quick Links

Doubts

About

The Team
User Levels & Credentials

Reach to Us

Contact Us
Join Us
Request a Topic

Media Coverage

Subscribe

Proudly supported by OpenSense Labs