Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Durgesh_7979
0
votes
1
Explain the properties of B-Tree Also Construct B+ tree with order P=4 10,5,30,40,20,17,90,45,93,60,20,50,29
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
923
views
answered
Jun 13, 2023
Databases
data-structures
+
–
0
votes
2
In QuickSort algorithm, which of the following statements is NOT true regarding the partition process?
In QuickSort algorithm, which of the following statements is NOT true regarding the partition process?a) Partition always divides the array into two non-empty subsets.b) ...
1.0k
views
answered
Jun 7, 2023
Algorithms
algorithms
quick-sort
time-complexity
array
+
–
0
votes
3
Design a Moore machine, which takes as input a binary stream and generates an output of 1 only when a sequence of the pattern 01011 is found in the input stream. Convert the Moore machine that you have got into a Mealy machine. Check whether the mealy machine you obtained is a minimal one or not. Give proper justification to your answer.
1.2k
views
answered
Jun 3, 2023
Theory of Computation
theory-of-computation
+
–
1
votes
4
Find R.E for a FA when these are the equations of the states(q1 = initial state, q4 = final state) q4 = q3 1 q3 = q2 0 q2 = q1 1 + q2 1 + q4 1 q1 = ε + q1 0+ q3 0 + q4 0
316
views
answered
May 31, 2023
Theory of Computation
theory-of-computation
+
–
0
votes
5
GO Classes Set Theory And Algebra Practice Set 1 | Question: 3
The following table describes a binary relation. Find the set of ordered pairs that is this relation, as in the definition of a binary relation. ...
The following table describes a binary relation. Find the set of ordered pairs that is this relation, as in the definition of a binary relation.$$\begin{array}{c|c|c|c|c|...
405
views
answered
May 31, 2023
Set Theory & Algebra
goclasses-practice-set1
set-theory&algebra
relations
descriptive
+
–
2
votes
6
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given b...
448
views
answered
May 31, 2023
Algorithms
algorithms
time-complexity
divide-and-conquer
+
–
0
votes
7
TOC
Could anyone confirm is this a part of TOC gate syllabus or not? Thank you!
Could anyone confirm is this a part of TOC gate syllabus or not? Thank you!
400
views
answered
May 24, 2023
0
votes
8
UGC NET CSE OCTOBER 2022
Which of the following are the products of grounded theory? A. Experimental framework B. Concepts C. Hypotheses D. Attributes of a category E. Theoretical dilution
Which of the following are the products of grounded theory?A. Experimental frameworkB. ConceptsC. HypothesesD. Attributes of a categoryE. Theoretical dilution
326
views
answered
May 23, 2023
IS&Software Engineering
is&software-engineering
+
–
0
votes
9
Sort the following array using quicksort algorithm. [40,11,4,72,17,2,49]
Sort the following array using quicksort algorithm. [40,11,4,72,17,2,49]
Sort the following array using quicksort algorithm. [40,11,4,72,17,2,49]
555
views
answered
May 23, 2023
Algorithms
algorithms
quick-sort
+
–
0
votes
10
Assignment from college
Consider a disk with N tracks numbered from 0 to (N - 1) and assume that requested sectors are distributed randomly and evenly over the disk. We want to calculate the average number of tracks traversed by a seek. a) Calculate the probability of a seek of length ... )(2n+1)/6. d) Show that for large values of N, the average number of tracks traversed by a seek approaches N/3
Consider a disk with N tracks numbered from 0 to (N – 1) and assume that requested sectors are distributed randomly and evenly over the disk. We want to calculate the a...
463
views
answered
May 23, 2023
Operating System
operating-system
+
–
0
votes
11
UGCNET CSE December 2022: 7
Simplify the following using K-Map $\mathrm{F}(\mathrm{A}, \mathrm{B}, \mathrm{C}, \mathrm{D})=\sum(0,2,5,7,8,10,13,15)$ $\mathrm{BD}+\mathrm{B}^{\prime} \mathrm{D}^{\prime}$ $\mathrm{AC}+\mathrm{A}^{\prime} \mathrm{C}^{\prime}$ ... $2 [39326]) 2$ (Option $3 [39327]) 3$ (Option } $4 [39328]) 4$ $\text { Answer Given by Candidate : } 1$
Simplify the following using K-Map$\mathrm{F}(\mathrm{A}, \mathrm{B}, \mathrm{C}, \mathrm{D})=\sum(0,2,5,7,8,10,13,15)$$\mathrm{BD}+\mathrm{B}^{\prime} \mathrm{D}^{\prime...
293
views
answered
May 23, 2023
Others
ugcnetcse-dec2022
+
–
0
votes
12
Database : Minimal cover How to approch this type of questions?
2.3k
views
answered
May 23, 2023
Databases
databases
canonical-cover
+
–
1
votes
13
Computer Organization
Under what category does Universal Serial Bus fall: System Bus or a Network connection or something else?
Under what category does Universal Serial Bus fall: System Bus or a Network connection or something else?
195
views
answered
May 23, 2023
CO and Architecture
co-and-architecture
+
–
0
votes
14
data structure tree
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
865
views
answered
May 20, 2023
Programming in C
binary-tree
height
+
–
0
votes
15
explain floating point representation with example
1.1k
views
answered
May 20, 2023
1
votes
16
C Programming Recursion
#include<stdio.h> void print(int n) { printf("Hello "); if(n++ == 0) return ; print(n); n++; } int main() { void print(); print(-4); } How many times printf execute?? And How ??
#include<stdio.h void print(int n) { printf("Hello "); if(n++ == 0) return ; print(n); n++; } int main() { void print(); print(-4); }How many times printf execute?? And H...
1.2k
views
answered
May 20, 2023
Programming in C
programming-in-c
programming
recursion
+
–
0
votes
17
Proposition Logic doubt
Given: (p$ \vee$ q) is True. Find the truth value of statements, 1. p is false or q is true. (Can't determine) 2. If p is false then q is true. (True) is my answer correct?????
Given: (p$ \vee$ q) is True. Find the truth value of statements, 1. p is false or q is true. (Can't determine) 2. If p is false then q is true. (True) is my answer correc...
708
views
answered
May 7, 2023
Mathematical Logic
discrete-mathematics
propositional-logic
mathematical-logic
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register