Recent questions

0 votes

0 answers

1

Pda regular
pplease expain this statement

asked 6 minutes ago in Theory of Computation by Deepalitrapti (197 points) | 1 view

0 votes

0 answers

2

Semaphore bounded waiting
Does Semaphore satisfy bounded waiting? If so, how?

asked 1 hour ago in Operating System by Parimal Paritosh (215 points) | 4 views

0 votes

0 answers

3

Gate Theory
when any theory question is asked how to attempt them in Gate. Is it required to read the standard text books for these things to answer?

asked 1 hour ago in CO & Architecture by Nihar Ranjan Panda (33 points) | 4 views

0 votes

0 answers

4

array
Consider a three dimensional array A[30][40][50], find the location of the array element A[5][6][7] , if the base address of array A is 150 and each element take 4 byte of memory.

asked 1 hour ago in Programming by turendar (99 points) | 25 views

0 votes

0 answers

5

Self Doubt on Storage of value
unsigned int n = -2; How this is stored in memory let take integer takes 2 Bytes? A) 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 B) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0

asked 2 hours ago in Programming by Shaik Masthan Boss (15.8k points) | 16 views

0 votes

1 answer

6

Geeks - Doubt
What is time complexity of fun()? int fun(int n) { int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } (A) O(n^2) (B) O(nLogn) (C) O(n) (D) O(nLognLogn)

asked 3 hours ago in Algorithms by Sumit Singh Chauhan Junior (931 points) | 41 views

0 votes

0 answers

7

GeeksforGeeks Doubt
Which of the following is not true about comparison based sorting algorithms? (A) The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array (B) Any comparison based sorting algorithm can be made ... (C) Counting Sort is not a comparison based sorting algortihm (D) Heap Sort is not a comparison based sorting algorithm. [closed]

asked 3 hours ago in Algorithms by Sumit Singh Chauhan Junior (931 points) | 7 views

+1 vote

0 answers

8

Binary Search Tree
1) How many ways we can traverse 1,2,3,4 in BST? 2) How many ways we can insert 1,2,3,4 in BST? ______________________________________________________________________ How both are different in calculation of BST?Why they are use different formula?

asked 4 hours ago in DS by srestha Veteran (92k points) | 25 views

0 votes

1 answer

9

addressing modes in coa.
A computer supports one address and two address instructions. All the Addresses are the memory addresses. Memory size is 1Mbyte. How many one address instructions are possible if it has 240 two addresses instructions? (Assume binary instructions code has 48 bits)

asked 4 hours ago in CO & Architecture by ritus (27 points) | 15 views

0 votes

1 answer

10

gate 17 set 1
how the answer is 3 explain??????? [closed]

asked 6 hours ago in Programming by Phalkey (21 points) | 53 views

0 votes

0 answers

11

Countability question

asked 6 hours ago in GATE by Ambikakiran (7 points) | 17 views

0 votes

0 answers

12

GO PDF
A NULL free LL(1) grammar is also SLR(1) WHY?

asked 7 hours ago in Compiler Design by Dik (9 points) | 12 views

0 votes

1 answer

13

madeeasy test series
How many times made easy is printed? #include <stdio.h> int main() { c(4); return 0; } int c(int m){ if (m>0){ for(int i=1;i<3;i++){ c(m-i); c(m-i-1); printf("madeeasy") } } }

asked 8 hours ago in Programming by ck (307 points) | 34 views

0 votes

1 answer

14

digital logic
Explain this question

asked 8 hours ago in Digital Logic by turendar (99 points) | 19 views

0 votes

2 answers

15

doubt toc
wxw ;w,x belongs to {a,b}* this regular or dcfl or cfl??? somewhere it is written as regular but dontknow why??

asked 8 hours ago in Theory of Computation by eyeamgj Active (3.5k points) | 25 views

0 votes

1 answer

16

Ace test series-digital logic
HHow to solve this question [closed]

asked 9 hours ago in Digital Logic by Priyanka Agarwal Active (1.5k points) | 22 views

0 votes

0 answers

17

Heap Sorting
Consider a binary tree, where left and right subtreealready heapified. But we havenot done heapificationfor root yet. Then what is time complexity to convert it in a full heap tree? $A)O(\log n)$ or $o(n)$ $B)\Omega (\log n)$ or $\omega(n)$ $C)\Theta (\log n)$ or $\theta (n)$ $D)\text{None of these}$

asked 10 hours ago in DS by srestha Veteran (92k points) | 60 views

0 votes

0 answers

18

Merge Sort (Code)
why this margeSort program showing time limit exceed ? #include <stdio.h> #include <stdlib.h> #include <time.h> void fillArray(int array[], int n) { time_t t; time(&t);//get current time srand(t);//gives current time as seed ... CLOCKS_PER_SEC; printArray(Array, n); printf("\n \n Time taken for sorting: %f seconds\n\n",cpu_time_used); return 0; }

asked 10 hours ago in Programming by srestha Veteran (92k points) | 23 views

0 votes

0 answers

19

Memory Hierarchy
if simply the access time of level-1 meomry and level-2 memory is given and hit ratio is given then for average time access what should be the approach? should i go for hierarchical or simultaneous access?

asked 11 hours ago in CO & Architecture by Nihar Ranjan Panda (33 points) | 19 views

+1 vote

0 answers

20

gate 15 set-2
int fun(int n) { int x=1,k; if(n==1) return x; for(k=1;k<n;++k) x=x+fun(k)*fun(n-k) return x; } return value of fun(5)??? how to solve this using tree method approach??? [closed]

asked 11 hours ago in Programming by Phalkey (21 points) | 22 views

0 votes

0 answers

21

SELF DOUBT
T(1) T(2) R(A) W(A) W(A) SUPPOSE WE HAVE TWO TRANSACTION T1 AND T2. AND ALSO INTIAL VALUE OF A IS 100. THEN WE FIRST READ A AND THEN FROM T(2) WRITE A . SO MY DOUBT IS WHEN I AM WRITING A WITHOUT ANY CONDITION SPECIFYING . WHAT DOES IT MEAN ???? WHETHER A IS GOING TO CHANGE TO ANY VALUE AND WE DONT CONDITION OR IT IS JUST WRITING A VALUE WHICH IS 100. I AM NOT GETTING THIS CONCEPT .

asked 13 hours ago in Databases by Deepanshu Junior (619 points) | 21 views

0 votes

0 answers

22

self doubt
Q. The part of the operating system manages the essential peripherals , such as keyboard , screen , disk drives , and parallel and serial ports . options A . Basic I/O System B. Secondary I/O System C. Peripherals I/O System D. Marginal I/O System

asked 14 hours ago in Operating System by Lokesh Arya (107 points) | 14 views

0 votes

1 answer

23

Carry look ahead adder

asked 14 hours ago in Digital Logic by shweta sah (49 points) | 26 views

0 votes

1 answer

24

Self doubt
Q. This comprises the detailed Machine language necessary to control a specific device and is controlled by the operating system is... options A. Driver B. utility program C. virtual memory D. peripheral device explain properly

asked 14 hours ago in Operating System by Lokesh Arya (107 points) | 9 views

0 votes

1 answer

25

Nested quantifiers
Let domain be set of all fruits. Represent the following English statement into logic. 1)There are exactly 2 apple. S1:∃x∃y[A(x)⋀A(y)⋀(x≠y)⋀∀z(A(z)→(x=z⋁y=z)] S2: ∃x∃y[A(x)⋀A(y)⋀x≠y]⋀~∃x∃y∃z[A(x)⋀A(y)∧A(z)⋀x≠y∧y≠z⋀z≠x] where A(m)= m is an apple Is S1↔S2 ? If yes then how can u convert S2 into S1 using negating quantifier predicates

asked 14 hours ago in Mathematical Logic by Rohit Pandey (197 points) | 11 views

0 votes

3 answers

26

Ugc Net july 2018 paper 2
Can anyone solve the following recurrence relation problem which was asked in this year Ugc net paper 2

asked 15 hours ago in Others by Ammu9682 (45 points) | 37 views

0 votes

1 answer

27

Er model
why we can merge one-one relation in two table despite of partial participation at both end.it is possible of inserting too many null value?

asked 15 hours ago in Databases by shubhgol (17 points) | 26 views

0 votes

0 answers

28

Eigen vector

asked 15 hours ago in Mathematical Logic by Shivangi Parashar 2 (41 points) | 11 views

0 votes

1 answer

29

SELF DOUBT DCFL
SUPPOSE WE HAVE A SITUATION IN BETWEEN LIKE THIS (DCFL) INTERSECTION (REGULAR LANG)..............................SITUATION 1 NOW WE CAN WRITE DCFL IN PLACE OF REGULAR SO IT WILL BECOME DCFL INTERSECTION DCFL AND WE KNOW DCFL IS NOT CLOSED UNDER ... THAT SITUATION 1 CAN BE READ AS DCFL IS CLOSED UNDER REGULAR INTERSECTION HENCE DCFL ...........WHY THIS CONTRADICTION IS ARISING??????

asked 16 hours ago in Theory of Computation by eyeamgj Active (3.5k points) | 19 views

0 votes

1 answer

30

c programming
struct marks{ int p:3; int c:3; int m:2; }; void main(){ struct marks s={2,-6,5}; printf("%d %d %d",s.p,s.c,s.m); } Please explain why result is 221

asked 16 hours ago in Programming by manisha11 (187 points) | 47 views

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 questions

Recent Posts

Recent Blog Comments