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 skywalker_19
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by skywalker_19
3
answers
1
GATE CSE 2018 | Question: 28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$
commented
in
Mathematical Logic
Aug 5, 2019
22.4k
views
gatecse-2018
mathematical-logic
normal
first-order-logic
2-marks
1
answer
2
Indexing
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree
answer selected
in
Databases
Feb 23, 2019
672
views
indexing
databases
b-tree
bplustrees
0
answers
3
Operating Systems
To check that a mutual exclusion algorithm is not free from deadlock,is it necessary to check if the entire processes in the system are in deadlock- If there are 5 processes in the system- P0,P1,P2,P3,P4 and if we have to prove that the ... definitely in deadlock- This means it is not necessary for all processes in the system to be in deadlock to say deadlock has occurred?
asked
in
Operating System
Oct 23, 2018
288
views
deadlock-prevention-avoidance-detection
process-synchronization
operating-system
1
answer
4
Korth
In a self referential relationship many to many relationship set, how minimum many tables are required to store in case of partial participation. Example: If an employee can report to several managers and manager can supervise any number of employees- Shouldn't it be 1 table with compose candidate key as Eid,Supid
commented
in
Databases
Oct 3, 2018
1.0k
views
er-diagram
3
answers
5
GATE CSE 2000 | Question: 15
Suppose you are given arrays $p [1......N]$ and $q [1......N]$ both uninitialized, that is, each location may contain an arbitrary value), and a variable count, initialized to $0$. Consider the following procedures $set$ and $is\_set$: set(i) { count ... $set(i)$ has not been called for some $i$, then regardless of what $p[i]$ contains, $is\_set(i)$ will return false.
commented
in
DS
Apr 23, 2018
4.8k
views
gatecse-2000
data-structures
array
easy
descriptive
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:...