Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User codingo1234
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by codingo1234
0
votes
0
answers
1
#SELF DOUBT(WEAK ENTITY IN DBMS)
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
asked
in
Databases
Apr 8, 2019
243
views
databases
self-doubt
0
votes
0
answers
2
APPLIED AI TEST 2
Consider the following memory Architecture of a Machine in the following Table Virtual Address 54 bits Page size 16K bytes PTE size 4 bytes Assume that there are 8 bits reserved for the Os functions(protection,valid, modified,and Hit/Miss-all overhead bits) other than required by the ... for the application data and code ? 2^26 byte 2^40 bytes 2^38- 2^26 bytes 2^40 - 2^38 bytes
asked
in
Operating System
Jan 9, 2019
388
views
paging
0
votes
0
answers
3
SELF DOUBT GENERATING FUNCTION
Difference between getting closed form of generating function and closed form of the given sequence ,pls someone explain with an example
asked
in
Combinatory
Dec 10, 2018
306
views
generating-functions
recurrence-relation
0
votes
0
answers
4
TESTBOOK TEST ,SET THEORY AND ALGEBRA
If irreflexive relations are represented as directed graphs, then the partitions of an equivalence relation manifest in form of __________. 1.Strongly connected component 2.Unilaterally connected component 3.Clique 4.None of these ans given is clique
asked
in
Set Theory & Algebra
Dec 10, 2018
176
views
discrete-mathematics
set-theory&algebra
0
votes
1
answer
5
BFS TRAVERSAL
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
asked
in
Programming in C
Nov 21, 2018
377
views
breadth-first-search
algorithms
graph-algorithm
1
vote
0
answers
6
signed and unsigned integers
int main() { unsigned int a = 1000; int b = -1; if (a>b) printf("A is BIG! %d\n", a-b); else printf("a is SMALL! %d\n", a-b); return 0; } the answer to this question is "a is small,1001 " ... unsigned integer its value is MAX+ (-MAX+1001)=1001 3.The presence of "%d " in printf has no effect ,the result will be unsigned always
asked
in
Programming in C
Nov 20, 2018
1.2k
views
programming-in-c
1
vote
0
answers
7
BINARY MIN HEAP MADE EASY TEST
Consider a binary min heap given below containing integer in [1, 15]. The maximum number of node movement on 5 successive removal of element are ________.
asked
in
DS
Nov 20, 2018
1.3k
views
min
binary-heap
0
votes
1
answer
8
Context free languages and Regular Languages
Let L be CFL and M a regular language. Language L ⋂ M is always (a) always regular (b) never regular (c) always DCFL (d) always context free language
asked
in
Theory of Computation
Aug 20, 2017
475
views
theory-of-computation
context-free-language
3
votes
1
answer
9
Turing machines and Recursively enumerable languages
If L1 and L2 are Turing-Recognizable then L1 ∪ L2 will be (a) Decidable (b) Turing-recognizable but may not be decidable (c) May not be Turing recognizable (d) None of above
asked
in
Theory of Computation
Aug 20, 2017
2.2k
views
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
2
votes
1
answer
10
regular languages
Given that a language L = L1 ∪ L2, where L1 and L2 are two other languages. If L is known to be a regular language, then which of the following statements is necessarily TRUE? (a) If L1 is regular then L2 will also be regular (b) If L1 is regular and finite then L2 will be regular (c) If L1 is regular and finite the L2 will also be regular and finite (d) None of these
asked
in
Theory of Computation
Aug 20, 2017
429
views
theory-of-computation
regular-language
3
votes
1
answer
11
regular languages
A Language is said to be regular iff (a) There exists a Right Linear Regular Grammar for L (b) There exists a Left Linear Regular Grammar for L (c) There exists a nfa with single final state (d) There exists a dfa with single final state (e) There exists a nfa without ԑ - move Which are true? (i) All are true (b) a, b, c are true (c) a, b, c, e are true (d) a, b, d are true
asked
in
Theory of Computation
Aug 20, 2017
949
views
theory-of-computation
regular-language
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...