Recent activity
Register

Recent activity

0 votes
0 answers 14 views
T(n)=T(n/2)+logn How to solve this without using masters theorem?
neel19 edited in Algorithms 4 days ago
by neel19
7 points
14 views
0 votes
0 answers 10 views
#MadeEasyTextBook #Permutation&Combinations
In the below shown question I am getting answer as 70 but the given answer in book is 35. Can anyone help me solving this question?
sarthakdarji asked in Mathematical Logic 6 days ago
by sarthakdarji
11 points
10 views
0 votes
0 answers 49 views
Applied gate test series
Suppose a router receives a 1500Byte ipv4 packet with a 20 B IP header, ip id X, MF = 1 and DF=0 .it needs to forward it out a link with a 1000 bytes MTU .what should be the length and flegs fields(ie. MF and DF) of the header of the 2nd fragment contain.
Enolx.21 commented in Computer Networks Oct 5
by Enolx.21
53 points
49 views
0 votes
0 answers 47 views
DS from MADEEASY postal book package 2022 page number 12
palashbehra5 commented in Programming Sep 25
by palashbehra5
5 points
47 views
0 votes
0 answers 34 views
Doubt about dynamic memory allocation
#include <stdio.h> #include<stdlib.h> int main() { int *x=NULL; x=(int*)malloc(sizeof(int)); *x=37; free(x); int *y=(int*)malloc(sizeof(int)); *y=40; printf("%d %d",*y,*x); return 0; } Output is 40 40 How this is coming?
Shaik Masthan commented in Programming Sep 25
by Shaik Masthan
1.6k points
34 views
0 votes
0 answers 21 views
Topic : Digital Logic - Adders
I am very much confused while solving the questions involving adder circuits like Half Adder, Full Adder, Ripple Carry Adder, Carry Look Ahead Adder, etc. I can solve none of the questions, and leave almost all questions involving them. My concept ... me some good source from where I can learn them and practice questions on them. It would be really helpful for me.
palashbehra5 commented in Digital Logic Sep 25
by palashbehra5
5 points
21 views
1 vote
0 answers 146 views
Is Token Ring access control method in GATE 2021 CSE syllabus?
RohanJha commented in Computer Networks Sep 25
by RohanJha
5 points
146 views
0 votes
0 answers 20 views
Eigen value question from Linear algebra and its applications [closed]
kirtipurohit closed in Linear Algebra Sep 24
by kirtipurohit
15 points
20 views
0 votes
0 answers 65 views
paging self-doubt
If page table size is greater than frame size then each entry in the page table occupy one total frame .Is this correct?
jayadev asked in Operating System Sep 13
by jayadev
5 points
65 views
0 votes
0 answers 38 views
#TOC NPTEL ASSIGNMENT Question about reducibility
Please help me understand this question. I have searched on internet, but no avail.
iarnav asked in Theory of Computation Sep 7
by iarnav
291 points
38 views
0 votes
0 answers 27 views
Kenneth h rosen Q29. Chapter 1 section 1.3 Predicate logic
Sahiltam asked in Mathematical Logic Sep 7
by Sahiltam
5 points
27 views
0 votes
0 answers 36 views
Madeeasy postal course 2022 DS and Programming page 12
kishanrajput asked in DS Sep 5
by kishanrajput
5 points
36 views
0 votes
0 answers 24 views
Made Easy 2022 test series, CD-1 question
Consider the following syntax directed definition: What type of SDT is this? S-attributed L-attributed Neither Both Due to production #2 and #3, it should not be L-attributed as parent is taking value from its child. Also, as semantic rules are written anywhere in the RHS of the production, it is not S-attributed. Given answer in test series : L-attributed
Naman9495 asked in Compiler Design Sep 5
by Naman9495
5 points
24 views
0 votes
0 answers 12 views
#COA #TEST-SERIES
A particular parallel program computation require 200 seconds when it is executed on a single processor. If 40% of this computation is “inherently sequential” then what are the theoretically best elapsed time for this program running with 2 and 4 processors respectively? A.80 and 120 seconds B.90 and 60 seconds C.140 and 110 seconds D.100 and 80 seconds
Abhishek tarpara asked in CO & Architecture Sep 4
by Abhishek tarpara
13 points
12 views
0 votes
0 answers 16 views
#Madeeasy #COA #page-replacement #cache-memory
Consider a direct mapped cache with 16 blocks with block size of 16 bytes. Initially the cache is empty. The following sequence of access of memory blocks: Ox80000, Ox80008, Ox80010, Ox80018, Ox30010 is repeated 10 times. Which of the following represents ... = 3 and conflict = 18 C.Compulsory = 4 and conflict = 16 D.Compulsory = 2 and conflict = 20
Abhishek tarpara asked in CO & Architecture Sep 4
by Abhishek tarpara
13 points
16 views
0 votes
0 answers 35 views
Trishna Knowledge Systems. GATE Computer Science and Information Technology , Chapter - Digital Electronics ,Unit-1 ,
Bishes asked in Digital Logic Sep 2
by Bishes
5 points
35 views
0 votes
0 answers 18 views
Introduction to logic circuits and logic design using VHDL, chapter combinational logic design, pg-111.
Noob coder asked in Digital Logic Sep 2
by Noob coder
5 points
18 views
0 votes
0 answers 18 views
pipeline-Hazard
Our system has single memory port, but a separate port is available dedicated to the stack.Note that out instruction uses an I/O port isolated from the memory. We need to find the type of hazards possible in the following . SOLUTION: Instruction 2, 3 has data ... dependency hazard because of bx I came up with this answer, please can you guide me if i am wrong or missed something.
Autumn asked in CO & Architecture Sep 1
by Autumn
71 points
18 views
0 votes
0 answers 18 views
Pipeline-hazard
Question: Consider the code sequence shown below running on the basic 5-stage instruction pipeline. Each stage takes 1 cycle without hazards. The pipeline stalls on data dependencies that cannot be fully resolved by forwarding. Load instructions do not have delay slots ... of cycle it take to complete ANSWER: Can you please guide me with the below solution, where it goes wrong.
Autumn asked in CO & Architecture Sep 1
by Autumn
71 points
18 views
0 votes
0 answers 39 views
COA gate 2022
Do we need to learn both x86 and ARM architecture for gate 2022? Or only x86?
Shivam_j commented in CO & Architecture Aug 30
by Shivam_j
5 points
39 views
0 votes
0 answers 19 views
applied gate test
how many states are in smallest possible DFA {0,1} * {$1^{10}$}
Nilabja Sarkar asked in Theory of Computation Aug 30
by Nilabja Sarkar
5 points
19 views
0 votes
0 answers 13 views
Query regarding admission in MNIT Jaipur
Anyone joining MNIT Jaipur for M.Tech Computer Science and Information Security this year? Is there any Whatsapp/Telegram group where I can ask queries related to admission? I need to know the admission process after submitting the final fee through CCMT portal and what documents will be needed to submit if any.
Vipul372 asked in NITs Aug 30
by Vipul372
5 points
13 views
0 votes
0 answers 33 views
kenneth rosen chapter 8 section 8.4 exercise question 5 option (f)
pcnsb asked in Mathematical Logic Aug 30
by pcnsb
7 points
33 views
0 votes
0 answers 29 views
DRDO exam query: Sir please tell how many marks out of 600 required in CSE to get a call of interview.
Amankumar265 asked in Job Queries Aug 26
by Amankumar265
5 points
29 views
1 vote
0 answers 18 views
#Theory of computation(DFA)
Construct DFA with ∑ = {0, 1} accepts the strings with an even number of 0's followed by single 1.
Urvesh asked in Theory of Computation Aug 24
by Urvesh
9 points
18 views
0 votes
0 answers 12 views
#SelfDoubt #First and Follow
Hi guys can anyone help me to find that what will be the First and Follow set for this production? {A->BaA|epsilon, B->bB|ABC|epsilon, C->B}
arnab2022 asked in Compiler Design Aug 24
by arnab2022
5 points
12 views
0 votes
0 answers 28 views
automata theory & formal language
Instructions: Create an FA for the RE ((0+1) (0+1))* + ((0+1) 0
arce asked in Algorithms Aug 24
by arce
5 points
28 views
0 votes
0 answers 11 views
Operating system
Some computer systems do not provide a privileged mode of operation in hardware. Is it possible to construct a secure operating system for these computer systems? Give arguments both that it is and that it is not possible.
Abubakar787 asked in Operating System Aug 24
by Abubakar787
5 points
11 views
0 votes
0 answers 23 views
automata theory & formal language
write a regular expressions for each of the following languages over the alphabet {0, 1}; the set of all strings containing 101 as a substring. Instructions: construct a finite automata equivalent to the following regular expressions: 10+ (0+11) 0*1 (11+0)* (00+1)* [ 00+11+(01+10) (00 + 11)* (01 + 10)*
arce asked in Algorithms Aug 24
by arce
5 points
23 views
0 votes
0 answers 22 views
automata theory & formal language
A DFA for all sets that contains even 0's and even 1's. Instruction: Convert the following DFA into NFA. https://sg.docworkspace.com/d/sIMr0gbhniu7AhwY Instruction: Minimize the following DFA. https://sg.docworkspace.com/d/sIB_0gbhnq_TAhwY Instruction: Give the ... 00. the set of all strings with three consecutive 0's. the set of all string that contains odd 1's.
arce asked in Algorithms Aug 24
by arce
5 points
22 views
0 votes
0 answers 21 views
automata theory & formal language
A DFA for all sets that contains even 0's and even 1's. Instruction: Convert the following DFA into NFA. https://sg.docworkspace.com/d/sIMr0gbhniu7AhwY Instruction: Minimize the following DFA. https://sg.docworkspace.com/d/sIB_0gbhnq_TAhwY Instruction: Give the ... 00. the set of all strings with three consecutive 0's. the set of all string that contains odd 1's.
arce asked in Algorithms Aug 24
by arce
5 points
21 views
0 votes
0 answers 36 views
class excercise
Write a regular expression for all strings of 0’s and 1’s that are of odd length
brightborn asked in Theory of Computation Aug 24
by brightborn
5 points
36 views
To see more, click for the full list of questions or popular tags.
Ask
Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent activity
Developed by Chun