Register
Filter

Questions by Meenakshi Sharma

0 votes
0 answers
21
conversion of excess 3 code to bcd code is implemented by which circuit
conversion of excess 3 code to bcd code is implemented by which circuit a) 4x16 decoder b) 4x16 mux c)4 bit full adder d) 4 bit half adder
conversion of excess 3 code to bcd code is implemented by which circuita) 4x16 decoderb) 4x16 muxc)4 bit full adderd) 4 bit half adder
0 votes
1 answer
23
up or down counter
2 votes
0 answers
24
normalization and decomposition
0 votes
2 answers
25
when an inverter is placed in both inputs of SR flip flop
When an inverter is placed between both inputs of an SR flip-flop, the resulting flip-flop is [A]. JK flip-flop [B]. D flip-flop [C]. T flip-flop [D]. Master slave JK flip-flop ans given is B but how
When an inverter is placed between both inputs of an SR flip-flop, the resulting flip-flop is[A].JK flip-flop[B].D flip-flop [C].T flip-flop[D].Master slave JK flip-flopa...
1 votes
0 answers
26
essential hazards
0 votes
1 answer
27
4 channel are using a link. Length of input slot is 2 bits
4 channel are using a link. Length of input slot is 2 bits and length of 1 frame is 0.5 ms.Now find out bandwidth of link
4 channel are using a link. Length of input slot is 2 bits and length of 1 frame is 0.5 ms.Now find out bandwidth of link
1 votes
1 answer
28
Page Table is divided into 8K pages and each page contain 2k entries.
Page Table is divided into 8K pages and each page contain 2k entries. Page table entry size is 4 bytes and page size is 1 K words Q find out a)Logical address b)no of pages in LAS c)1st level page table size d)2nd level page table size
Page Table is divided into 8K pages and each page contain 2k entries. Page table entry size is 4 bytes and page size is 1 K wordsQ find outa)Logical addressb)no of pages ...
2 votes
0 answers
29
is the language L={a^nb^n : n>=1} U {b} is determinstic
is the language L={a^nb^n : n>=1} U {b} deterministic
is the language L={a^nb^n : n>=1} U {b} deterministic
2 votes
1 answer
30
total keys in cryptography
For n users , how many total keys are needed by using pvt key cryptography and public key cryptography respectively a) 2n ,2n b) n(n-1)/2 , n(n+1)/2 c)2n+2 , 2n d) n(n-1)/2 , 2n
For n users , how many total keys are needed by using pvt key cryptography and public key cryptography respectivelya) 2n ,2n b) n(n-1)/2 , n(n+1)/2 c)2n+2 , 2n ...
1 votes
1 answer
31
The process of accessing data stored in a serial access memory is similar to manipulating data on a
The process of accessing data stored in a serial access memory is similar to manipulating data on a (A) heap (B) queue (C) stack (D) binary tree
The process of accessing data stored in a serial access memory is similar to manipulating data on a(A) heap (B) queue(C) stack ...
2 votes
2 answers
32
are following langauges CFL
How to check whether following language are context free 1)L= {a^nb^m ; n<=m<=3n} 2)L={w:2na(w) <=nb(w)<=3na(w) making NPDA or DPDA is not easy/convenient perhaps
How to check whether following language are context free1)L= {a^nb^m ; n<=m<=3n}2)L={w:2na(w) <=nb(w)<=3na(w) making NPDA or DPDA is not easy/convenient perhaps
1 votes
0 answers
33
recurrence relation by recursion tree
How to solve the recurrence relation either by recursion tree or back substitution T(n)= O(1) , if n<=80 = T(n/5)+T(7/10n +6) + O(n) if n>80
How to solve the recurrence relation either by recursion tree or back substitutionT(n)= O(1) , if n<=80 = T(n/5)+T(7/10n +6) + O(n) if n>80
1 votes
1 answer
34
corman ex
out of these how many can be solved by master method and how to solve questions in which master theorems cant be applied
out of these how many can be solved by master method and how to solve questions in which master theorems cant be applied
1 votes
0 answers
35
recursion tree mehod
how to solve 4.4.4 by tree method and can tree method be applied for all types of recurrence relations or there is some restriction
how to solve 4.4.4 by tree method and can tree method be applied for all types of recurrence relations or there is some restriction
4 votes
2 answers
36
peter linz ex
2 votes
1 answer
37
peter linz ex. (regular languages)
0 votes
0 answers
38
linkedlist_made easy question
ans givn in B but i think it should be D
ans givn in B but i think it should be D
0 votes
1 answer
39
NET aug 16 paper 2 q19
official ans given is 1) but i think it should be 2) as table 2 violates P :S relationship of many to one
official ans given is 1) but i think it should be 2) as table 2 violates P :S relationship of many to one
0 votes
1 answer
40
NULL * 0 = 0 or NULL
1) NULL * 0 = 0 or NULL ? 2) CAN UNIQUE KEY CONTAIN MULTIPLE NULL VALUES
1) NULL * 0 = 0 or NULL ? 2) CAN UNIQUE KEY CONTAIN MULTIPLE NULL VALUES
Page: