Recent questions

0 votes

0 answers

1

Assymetric relation
Whether relation { } is assymetric or not??? [closed]

asked 3 hours ago in Mathematical Logic by saumya mishra Active (1.4k points) | 8 views

0 votes

0 answers

2

Full Adder
The Cout function of a 3-bit adder is as follows: AB + Cin (A ⊕ B) ----- i It, being a majority function, can also be written as: AB+BCin+CinA which is equivalent to AB + Cin (A+B) ------- ii So, if we consider eqn i and ii, doesn't it show that (A ⊕ B) = (A+B). What am I missing here?

asked 3 hours ago in Digital Logic by superak96 (73 points) | 10 views

0 votes

0 answers

3

GATE 2017 (EC) Eigen Value
For the given matrix $A$, one of the Eigenvalue is real $A=\begin{bmatrix} 1 &2 &3 &4 &5 \\ 5 &1 &2 &3 &4 \\ 4&5 &1 &2 &3 \\ 3&4 &5 &1 &2 \\ 2 &3 &4 &5 &1 \end{bmatrix}$ The real Eigen value is: $A)2.5$ $B)0$ $C)15$ $D)25$

asked 3 hours ago in Linear Algebra by Lakshman Patel RJIT Loyal (9.6k points) | 11 views

0 votes

1 answer

4

Self Study
What is the output of given program? main() { char g[] = "iamsahilraza"; printf("%s", g + g[8] - g[10]); }

asked 4 hours ago in Programming by Sahil Raza (55 points) | 20 views

0 votes

0 answers

5

Context Free Grammar
Consider the following CFG 'G' S--> aA/bSS/SS A--> aAb/bAa/AA/ε The language generated by G is: a)Set of all strings with atleast one 'a' b)Set of all strings with atleast two a's c)Set of all strings with atleast one more 'a' than number of b's d)None of these

asked 4 hours ago in Theory of Computation by Sambhrant Maurya Junior (755 points) | 8 views

0 votes

0 answers

6

made easy
Consider the following solution for critical section problem with 'n' processes P0,P1,P2,......P(n-1).For all i,number[i] is an integer array initialized to zero, and for all j,choosing[j] is a binary array initialized to false. CODE FOR Pi : Repeat { choose[i]=true ... )S1 only. b)S1 and S2 only. c)S2 and S3 only. d)S1 , S2 and S3 (please anyone elaborate this solution.thanks in advance) [closed]

asked 5 hours ago in Operating System by talha hashim Active (3.4k points) | 11 views

0 votes

0 answers

7

Digital test
given ans is Inverted D flip flop ..is it correct i think given ans is not correct ..

asked 5 hours ago in Digital Logic by SHUBHAM SHASTRI Boss (10.1k points) | 45 views

0 votes

0 answers

8

Finite Automata
[closed]

asked 5 hours ago in Theory of Computation by Sambhrant Maurya Junior (755 points) | 13 views

0 votes

1 answer

9

MUX conversion to a function
F(A,B,C,D)=$\Sigma$(0,2,3,5,8,10,11,12,15) Realize it using 8:1 MUX . what is the logic behind?

asked 6 hours ago in Digital Logic by hitendra singh Junior (885 points) | 10 views

0 votes

0 answers

10

How to know which type of join shall I apply in dbms relational algebra?

asked 6 hours ago in Databases by Fida (13 points) | 11 views

0 votes

0 answers

11

I-node

asked 6 hours ago in Operating System by Balaji Jegan Active (2.2k points) | 7 views

0 votes

0 answers

12

made easy
Consider a paged virtual memory management system having 32-bit virtual addresses with page size 1KB.Each page table entry requires 32 bits.it is desired to limit the page table size to one page.if Suresh uses smaller page size at the first level of the page table heirarchy,then the number of pages needed are._______

asked 7 hours ago in Operating System by talha hashim Active (3.4k points) | 13 views

0 votes

0 answers

13

LRU and FIFO Page replacement.
Consider two possible page-replacement strategies: LRU (the least recently used page is replaced) and FIFO (the page that has been in memory longest is replaced). Assume that, after space has been reserved for the page table, the interrupt service routines, ... 2 and 4, 2, 8, 3 respectively (D) None of these https://www.techtud.com/example/page-replacement-algorithms

asked 7 hours ago in Operating System by arya_stark (367 points) | 6 views

0 votes

0 answers

14

made easy
Consider the organization of a UNIX file as represented by the i-NODE in which there are 12 direct block pointers ,a singly, doubly,and triply indirect pointers in each i-NODE.Assume that the system block size and the disk sector size both are 8KB.It is given ... the file i-NODE is already in main memory.then the disk accesses are required to access the byte in position 13,423,956.______

asked 7 hours ago in Operating System by talha hashim Active (3.4k points) | 2 views

0 votes

0 answers

15

test question
We wish to implement a double ended queue using link list. The double ended queue must support , the operations of (i) struct node *push_back(struct node*,struct node * ,int ) - pushing at the end of the list (ii) struct node *pop_back(struct node* ) -popping ... rear; S3:front==NULL S4:front=front->next S1:rear->next=temp; S2:rear=temp; S3:front==NULL S4:front=front->next

asked 8 hours ago in Programming by Prince Sindhiya Active (3.6k points) | 12 views

0 votes

1 answer

16

test series question
(int *) a means the base address of the array a ,(int *) a+1 means the address of 2nd element in the array. or base address of 2nd row of the array ? please clear this doubt i am facing problems in these type of question or if anyone knows basics of these types problems please explain that one. 1, 1, 1, 1 ... , 4 1, 1, 1, 1 2, 4, 2, 4 3, 0, 3, 0 4, 2, 4, 2 5, 5, 5, 5 6, 0, 6, 0

asked 8 hours ago in Programming by Prince Sindhiya Active (3.6k points) | 12 views

0 votes

0 answers

17

doubt

asked 8 hours ago in Operating System by Vegeta (369 points) | 21 views

0 votes

1 answer

18

Morris Mano
Simplify the following Boolean function F together with the don't-care conditions d; then express the simplified function in sum of minterms. F(A, B, C, D) = $\sum$(0, 6, 8, 13, 14) d(A, B, C, D) = $\sum$ (2, 4, 10)

asked 8 hours ago in Digital Logic by aditi19 Junior (863 points) | 31 views

0 votes

1 answer

19

Topological Sort
How many Topological Orderings possible?

asked 9 hours ago in DS by Lakshman Patel RJIT Loyal (9.6k points) | 23 views

0 votes

0 answers

20

DOUBT: isn't this is a pipelining question

asked 10 hours ago in CO & Architecture by Ashwani Yadav (173 points) | 9 views

0 votes

1 answer

21

#questions
R(ABCDEF) FD={AB$\rightarrow$C,C$\rightarrow$D,D$\rightarrow$E,E$\rightarrow$F,F$\rightarrow$A} FIND NUMBER OF SUPERKEY

asked 10 hours ago in Databases by amit166 (233 points) | 25 views

0 votes

0 answers

22

Circular Queue
II possible but Why not I also(When direction of queue is opposite of previous one)?

asked 10 hours ago in Programming by Abhisek Tiwari 4 Junior (925 points) | 8 views

0 votes

0 answers

23

Programming

asked 12 hours ago in Programming by Abhisek Tiwari 4 Junior (925 points) | 24 views

0 votes

1 answer

24

Theory of Computation
$L1= \left \{ a^m b^n c^n d^m | m \neq n \right \}$ $L2= \left \{a^i b^j c^k | (i<=j)or (j<=i), j=k \right \}$ $L3= \left \{a^i b^j c^k| i=j, j<k \right \}$ The number of the above languages that are context free are ?

asked 12 hours ago in Theory of Computation by Priyam Pandey (57 points) | 60 views

0 votes

0 answers

25

SEMI GROUP
(Z,*) X*Y=X HOW TO CHECK IDENTITY

asked 13 hours ago in Set Theory & Algebra by eyeamgj Active (5.1k points) | 13 views

0 votes

0 answers

26

#OS Fork () tell the O/P?
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); fork (); The number of new processes created is

asked 13 hours ago in Operating System by iarnav Loyal (8.6k points) | 15 views

0 votes

0 answers

27

Test Series

asked 13 hours ago in Compiler Design by Gupta731 (283 points) | 8 views

0 votes

0 answers

28

Syllabus of operating system
Are following part of gate syllabus? 1- Thread scheduling 2- multiple processor scheduling 3- real time scheduling like earliest deadline first scheduling

asked 13 hours ago in Operating System by bts1jimin (99 points) | 5 views

0 votes

1 answer

29

Acebook
Consider the following code: co-begin-end X=2; co begin X=X+3; X=X+1; co end The final possible values of 'X' are: a)3,5 b)3,4,5 c)3,5,6 d)5,3,2

asked 13 hours ago in Operating System by abhishek1995_cse (131 points) | 8 views

0 votes

0 answers

30

Gateforum Test Series

asked 13 hours ago in Compiler Design by Gupta731 (283 points) | 5 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