For the following questions answer them individually
A byte addressable computer has a memory capacity of $$2^m$$ KB( kbytes ) and can perform $$2^n$$ operations. An instruction involving 3 operands and one operator needs maximum of
Any set of Boolean operatorsthat is sufficient to represent all Boolean expressions is said to be complete. Which ofthe following is not complete?
Consider a singly linked list of the form where F is a pointer to the first element in the linked list and is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
A particular BNF definition for a โwordโ is given by the following rules.
<word> :: = <letter> $$\mid$$ <letter><charpair> $$\mid$$ <letter><intpair>
<charpair> :: =<letter><letter> $$\mid$$ <charpair><letter><letter>
<intpair> :: = <integer><integer> $$\mid$$ <intpair><integer><integer>
<letter> :: = a $$\mid$$ b $$\mid$$ c $$\mid$$ .... $$\mid$$ y $$\mid$$ z
<integer> :: = 0 $$\mid$$ 1 $$\mid$$ 2 $$\mid$$ ....$$\mid$$ 9
Which of the following lexical entries can be derived from < word > ?
I. pick
II. picks
III. c44