Recent questions without answers / GATE Overflow for GATE CSE

0 votes

0 answers

1

#TOC regular expression
what will be the regular expression of this DFA using Arden's theorem

what will be the regular expression of this DFA using Arden's theorem

prabhath challa

11 views

prabhath challa asked 15 hours ago

0 votes

0 answers

2

Andrew S. Tanenbaum (MOS) Edition 5 Exercise 3 Question 16 (Page No. 252)
The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual address space. If memory address space is divided evenly ... virtual address space would be allocated to each process at a minimum, with the maximum number of processes running?

The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual address space. If mem...

sofigenr

7 views

sofigenr asked 15 hours ago

0 votes

0 answers

3

COA : Control Unit
Design a vertical micro programmed control unit to generate 40 signals. Out of first 35 those only 3 signals can be active at a time. And remaining 5, anyone can be active anytime. The micro instruction of the control unit stores control signal information ... 12 bits address field. The size of the control memory required is? I am not able to solve this question please help

Design a vertical micro programmed control unit to generate 40 signals. Out of first 35 those only 3 signals can be active at a time. And remaining 5, anyone can be acti...

ENTJ007

11 views

ENTJ007 asked 17 hours ago

0 votes

0 answers

4

Linear Algebra AX=B
Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly independent columns of B.

Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly in...

Soumya04

29 views

Soumya04 asked 2 days ago

0 votes

0 answers

5

Career Advice
Hello Guys, i am 2018 passed out B.E CSE grad. After my grad, i had started a small business which was doing great until COVID and a big medical bill nearly wiped out my business. I had struggled hard to keep my business alive, but thinking it's not ... i couldn't concentrate). But now i am entirely focused to crack GATE and do M-tech from top colleges. Is it worth it?

Hello Guys, i am 2018 passed out B.E CSE grad. After my grad, i had started a small business which was doing great until COVID and a big medical bill nearly wiped out my ...

shri385

30 views

shri385 asked 2 days ago

0 votes

0 answers

6

Give an appropriate tree-structure diagram for the following relational database: Employee (person_name, street, city) Works (person_name, company_name, salary) Company (company_name, city) Manages (person_name, manager_name)

peter09

22 views

peter09 asked 2 days ago

0 votes

0 answers

7

#CAREER ADVICE
Long story short. I did my btech from a top NIT, and got a FAANG job. I kind of got layed off recently, I have the skills necessery to crack big company but I am out of touch of the DSA and core subjects. I have secured a score of 508 ... score, to prevent career gaps? I am thinking of joining a lower NIT or private colleges like DTU, NSUT. and sit through their college placements.

Long story short. I did my btech from a top NIT, and got a FAANG job. I kind of got layed off recently, I have the skills necessery to crack big company but I am out of t...

MohitSwain

43 views

MohitSwain asked 3 days ago

0 votes

0 answers

8

RBR Normalisation example problem
In on of the examples shown by RBR sir, under Normalization I think he did this problem incorrectly, Given relation R(ABC) and fd: AB->C and C->A, convert it into 2NF For this question, the answer according to RBR sir was that the ... "BC", therefore we need to split the tables into AC and ABC is what my solution. Kindly correct me if I am wrong

In on of the examples shown by RBR sir, under Normalization I think he did this problem incorrectly, Given relation R(ABC) and fd: AB->C and C->A, convert it into 2NFFor ...

nareshit

28 views

nareshit asked 3 days ago

0 votes

0 answers

9

help me in general doubt of iit admission
Hii.. Maine iit 's me GATE CS 2024 ke score se form fill kiya tha and GATE DA 2024 ka score dal ne ka option nahi tha ..... mera GATE DA me acha rank hain and score kum hain. to muje dono score (GATE CS and GATE DA ) se ... Rank 1856 DA Score 574 and Rank 1134 Category: EWS also tell me , in IIT mtech admission they consider gate score or rank ?????

Hii..Maine iit 's me GATE CS 2024 ke score se form fill kiya tha and GATE DA 2024 ka score dal ne ka option nahi tha ..... mera GATE DA me acha rank hain and score kum ...

Enolx.21

33 views

Enolx.21 asked 4 days ago

0 votes

0 answers

10

Digital Logic
What is the maximum n-bit number in base x ,when represented in decimal(10)?

What is the maximum n-bit number in base x ,when represented in decimal(10)?

deba1014

52 views

deba1014 asked 6 days ago

0 votes

0 answers

11

Bitwise Operator - C Programming
Problem Statement: Class teacher to IX-C wants to store whether a particular student has passed in exams. The class has a strength of $32$ students. Their roll numbers lie in the range: $[1, 32]$. The teacher used bits of an integer to store ... Bitwise OR (|) operator and count number of set bits d. Apply Bitwise AND (&) operator and count number of set bits

Problem Statement: Class teacher to IX-C wants to store whether a particular student has passed in exams. The class has a strength of $32$ students. Their roll numbers li...

Debargha Mitra Roy

111 views

Debargha Mitra Roy asked 6 days ago

0 votes

0 answers

12

Discrete Mathematics | Set Theory | Relation | Equivalance Relation
which if the following statement is True for every set? a. $\exists$ a equivalence class that is also a partition set. b. Every equivalence relation on a set defines a partition of that set. c. $\exists$ a partition of a set that is also equal to equivalence class of the set on some equivalence relation.

which if the following statement is True for every set?a. $\exists$ a equivalence class that is also a partition set.b. Every equivalence relation on a set defines a part...

RahulVerma3

41 views

RahulVerma3 asked 6 days ago

0 votes

0 answers

13

Graph Theory
A vertex colouring with three colours of a graph G = (V, E) is a mapping V → {R, G, B }. So that any two adjacent vertices does not same colour. Consider the below graphs:

A vertex colouring with three colours of a graph G = (V, E) is a mapping V → {R, G, B }. So that any two adjacent vertices does not same colour. Consider the below grap...

alexa16

65 views

alexa16 asked Apr 11

0 votes

0 answers

14

IIT BHUBANESHWAR MTECH WRITTEN EXAM AND INTERVIEW
PLEASE ANYONE GUIDE ME HOW I SHOULD PREPARE FOR MTECH WRITTEN TEST OF IIT BHUBANESHWAR ?

PLEASE ANYONE GUIDE ME HOW I SHOULD PREPARE FOR MTECH WRITTEN TEST OF IIT BHUBANESHWAR ?

Ray Tomlinson

44 views

Ray Tomlinson asked Apr 11

0 votes

0 answers

15

gate 2024
hello,my gate AIR is 645 and my category is OBC-NCL and my brach is CSE so my question is which top iits can i get at this score??

hello,my gate AIR is 645 and my category is OBC-NCL and my brach is CSE so my question is which top iits can i get at this score??

Viraj2412

62 views

Viraj2412 asked Apr 10

0 votes

0 answers

16

A/an ________ algorithm ensures no starvation. a. Altruistic b. Lock-free c.Test and set d.Compare and set

Mujahid s

26 views

Mujahid s asked Apr 10

0 votes

0 answers

17

#unacademyDPP

4nm01_

34 views

4nm01_ asked Apr 9

0 votes

0 answers

18

PGEE exam
What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None

What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None

Himanshu_2211

66 views

Himanshu_2211 asked Apr 8

0 votes

0 answers

19

If P and Q are predicates and P is the relational algebra expression, then which of the following equivalence are valid ? (1) σP(σQ(e)) = σQ(σP(e)). (2) σP(σQ(e)) = σP ∪ Q(e) (3) σP(σP(e)) = σP V Q (4) All of these

SandeepKumar147

47 views

SandeepKumar147 asked Apr 8

0 votes

0 answers

20

Why does the transmission rate in the reserved link gets divided when more concurrent connections are established?

I am reading Kurose Computer Networking book 8e, on page number 57, under 1.3.2 Circuit SwitchingBecause it link has $4$ circuits, for each link used by the end-to-end co...

tbhaxor

41 views

tbhaxor asked Apr 7

0 votes

0 answers

21

Issue for test
Although I have given one test for IIIT PGEE mock yet I am not able to see check the questions and do my test analysis please help me in this regard

Although I have given one test for IIIT PGEE mock yet I am not able to see check the questions and do my test analysis please help me in this regard

Bibaswata Guha

39 views

Bibaswata Guha asked Apr 7

0 votes

0 answers

22

Link vs Channel in computer networking
While reading computer networking, I am confused between link and channel and seen people using this interchangeably (which often bugs me). Language written in books and forums A link refers to the most basic physical or logical connection between two devices. ... A can connect to B via Ethernet, and A can connect to C via RF. What do you think about this?

While reading computer networking, I am confused between link and channel and seen people using this interchangeably (which often bugs me).Language written in books and f...

tbhaxor

58 views

tbhaxor asked Apr 5

0 votes

0 answers

23

Convert the following decimal numbers to 8-bit two’s complement numbers or indicate that the number would overflow the range.

lolok

58 views

lolok asked Apr 4

0 votes

0 answers

24

Can a candidate key for a composite attribute be called a composite key?
Let's take an example of student entity type Name Class Section Address (Line1, Line2, City, State, Country, PinCode) Since composite attribute holds multiple atomic attributes, such that the group is treated as ... (ignoring the semantics) the combinations like {Class, Section} {Class, Address} {Name, Class, Section}

Let's take an example of student entity typeNameClassSectionAddress (Line1, Line2, City, State, Country, PinCode)Since composite attribute holds multiple atomic attribute...

tbhaxor

49 views

tbhaxor asked Apr 4

0 votes

0 answers

25

Algorithms notes from Go classes
can anyone have the algorithm notes from go classes (PDF or material)

can anyone have the algorithm notes from go classes (PDF or material)

aravindhz

61 views

aravindhz asked Apr 4

0 votes

0 answers

26

Operating system concepts 9th edition Abdraham Silberschatz
Write a monitor to solve the consumer-producer problem. The basic program structure is shown as follows. monitor ProducerConsumer { int in, out, count; Item buffer[BUFFER_SIZE]; condition empty, full; // To add anything ... } Process Consumer: while(true) { ProducerConsumer.get(next_consumed); /* consume the item in next_consumed */ }

Write a monitor to solve the consumer-producer problem. Thebasic program structure is shown as follows.monitor ProducerConsumer {int in, out, count;Item buffer[BUFFER_SIZ...

Maxine

48 views

Maxine asked Apr 3

0 votes

0 answers

27

Context Free language sample question
Give a context-free grammar for each of the following languages. Consider, Σ={0,1}. A. The language of strings that start with 1 B. The language of strings of the form WWR C. The language of strings that contain the substring 001 D. The language {0n10n where n ≥ 0} E. ... i, j ≥ 0} J. The language {1i01j | j is a multiple of four or i = 3 + 2j where i, j ≥ 0}

Give a context-free grammar for each of the following languages. Consider, Σ={0,1}.A. The language of strings that start with 1B. The language of strings of the form WWR...

dazeeee

54 views

dazeeee asked Apr 3

0 votes

0 answers

28

BME entrance exam
A data file of 1,000,000 records must be stored using bucket hashing. Record length is 350 bytes, the net capacity of a block is 2000 bytes. Keys occupy 32 bytes, while pointers need 8 bytes. Each bucket consists of 2 blocks. How many blocks are needed at least to store the whole structure (i.e. data file + hash table) on disc? Select one:

A data file of 1,000,000 records must be stored using bucket hashing. Record length is 350 bytes, the net capacity of a block is 2000 bytes. Keys occupy 32 bytes, while p...

Ilqar

64 views

Ilqar asked Apr 2

0 votes

0 answers

29

#Doubt #GO+Gateoverflow test series
Anyone have taken two consecutive years of combine (GO+Go classes )Test series ? I wanted to know if question are repeated or all new question will be in 2025 test series of go classes ? Actually I purchased combine test series of go ... I will get All repeated question then my money will be lost ..So please help me in this regard @DeepakPoonia @SachinMittal 1

Anyone have taken two consecutive years of combine (GO+Go classes )Test series ? I wanted to know if question are repeated or all new question will be in 2025 test series...

ENTJ007

46 views

ENTJ007 asked Apr 2

0 votes

0 answers

30

Theory of Computation | design of Turing Machine
Is this the correct Turing machine for the language $0^n 1^n0^n$? assuming $ at the end and begining of the input tape

Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape

RahulVerma3

46 views

RahulVerma3 asked Apr 2

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true