Most viewed posts in Study Materials

A packet directed to addresses  

(4 addresses were given and in option there were 4 destinations like: r1,r2,r1,p1) 

A)a station can not differntiate between sending and receeiving signals 

B)a station can not send and receive at the same time 

C)signal received is very weak in power 

D)none of the above 

4. if in symmetric key encryption 20 parties want to communicate. What is the total number of keys required? 

5. which is false: 

a)in dvr the count to infinity problem is due to joining of a new node. 

b) in link state only neighbouring topology is known 

c) in dvr full network topology is known 

d) in dvr only packets from neighbours are exchanged 

6. in dvr of A,B,C,D,E,F,G nodes in a network. where from  

7. if a 3-kHz line has a signal to noise ratio of 20dB. Then the maximum data speed is: 

a)around 19kbits 

b)3 kbits 

c)6 kbits 

d)none 

8. ipv6 uses 128 bits address. So, if one million addresses are allocated every picosecond. then after how many time the addresses will exhaust: 

a)in power of 10^18 years 

b)in power of 10^13 years 

c)never 

d)very soon 

9. which of the following digital signatures provide integrity as well as authenticity: 

A)some sha1 based technique 

B) sha1 

C)rsa 

D)none 

 10.  

I.Tcp and UDP have same bits for port numbers. 

II.UDP retransmits damaged packets but not lost packets. 

Correct option: 

A)I true and II true 

B)I true and II false 

C) I false and II true 

D) I false and II false 

maths:6 

1. If laplace transformation of tf(x) is 1/(s-5). Then the laplace transformation of t3f(x) is: 

A)2/(s-5)3 

B)6/(s-5)6 

C)3/(s-5)7 

D)6/(s-5)8 

(please recheck the coefficients in the options as the powers of (s-5), I can remember but not the constants)  

2. if three boys and 4 girls are to be seated in a row, and all the seating arrangements are equally likely, then what is the probability of no boys together.  

3. a matrix 3*3 was given, and an identity matrix I, then which of the equation is correct 

(options like 4M-7I =0) 

4. pnc. all letters of word  BBABCD are allowed maximum as much times as they are in the word. What is the number of all possible words of all possible lengths? 

a)72 

b)74 

c)76 

d)78 

5. If X is the power-set of A and given X is subset of B. then: 

A)2^(|A|)<=|B| 

B)2*|A|=B 

C)2*|A|>B 

D) 2^(|A|)>=|B| 

6.  a lattice is a complete lattice. (assertion reasoning type) 

7.number of spanning tree in connected graph:, n nodes 

A)2*(n*(n-1)/2) 

B)2^(n) 

C)n*(n-1)/2 

D)n 

computer graphics:2 

1. find the matrix which correspons to scaling a 3-D object enlarging twice 

2. vanishing point of a figure consisting of 2 cubes, one is in Ist quadrant rotated some small angle clockwise and other in 2nd quadrant rotated some small same angle anticlockwise. 

artificial intelligence:4 

1. 10 nodes in an cnn with 3*3 transformation function, then the number of parameters  

2. sigmoid function - activation function question 

3. for which of the following job, the clustering algo is used: 

a)using the historic data, some conclusion drawn 

b)e-mails as spam or not 

c)types of customers based on their activity pattern 

d)none of these  

4. for the accurate prediction of digits in converting paper documents to digitl form: 

a).....erosion 

b).....dilution 

c)boundary ....  

d)gaussion …...... 

(….. Are blank spaces, all options had 2 words, I remember only one in each) 

c++:6 

1. a class 

    c{} 

and two lines: 

I. c a1; 

II. c a2=a1; 

then, how many functions are activated by default. options: 

( included different combinations of default constructer, destructer, copy constructer) 

2. c++ question one true,  

3. c++ question including static variable and printing values 

4.  

#include<iostream> 

void main() 

{ 

static int a[]={62,61,9,0}; 

static int b[][]={{1,2,3,4},{5,6,,78,9}}; 

int *i=a; 

printf("%d",i[0][2]); 

} 

output: 

5. best way to reuse composite modules is: 

A) 

B)encapsulation inheritance 

C)encapsulation composition 

D)composition inheritance 

6. which of the following is correct; 

A) ->* operator in c++ can be overloaded 

B) all operator in c++ can be overloaded 

C) both a and b 

D) none 

7. why are abstract class are used over interfaces 

A) to set concrete behaviour by methods that are used as it is like default by the derived classes 

B) to instantiate a class 

C) to have methods that are to be overridden by base classes 

D)none of these 

java:1 

1. output of program simple system.out function related 

c:5 

1. #include<stdio.h> 

int a,b,c; 

print(void); 

int main() 

{ 

int a=0,b,c; 

a+=print; 

prinf("%d",a); 

a++; 

print(); 

prinf("%d",a); 

a+=print(); 

prinf("%d",a); 

} 

void print(void) 

{ 

static int a=10; 

prinf("%d",a); 

return a++; 

} 

output: 

2. & unary operator is not applied to which of storage classes 

3.  

#include<stdio.h> 

struct str 

{ 

int a; 

char b; 

union {int x; char y;}t; 

} 

void main() 

{ 

str s1; 

s1.t.x=0; 

si.t.y='a'; 

printf("%d",s1.t.x); 

printf("%c",s1.t.y);} 

output 

4.  

#include<stdio.h> 

void main() 

{int x=5; 

char *c =(char *)&x; 

printf("%d",c); 

} 

5. the condition in (c!='a'&&z<+2=4) can be rewritten as: 

a)!(c!='a'||z+2>4) 

b)!(c=='a'||z+2<=4) 

c)!(c!='a'||z+2>=4) 

d)!(c=='a'||z+2>4) 

computer architecture:4 

1. 4 stage pipeline, with each stage taking 100, 90, 110,70 nanosecond,, with each stage buffer register 5nanosecond. 

if each stage is taking one clock cycle, then after 1000 data processing, what is the time elapsed? 

2. if in a microprogrammed architecture, 24 bit microinstructions, 13 bit is for micro-operation, 8 multiplexer lines, then what is  

x: bits for address in micro-instruction 

y: selection bits 

z: total number of instructions 

3. cao question of 4 instructions asking the time taken by instructions in number of clock cycles: 

R2<-M[4998] 

r1<-M[5000]+r2; 

R3<-r1 

M[5002]<-r3. 

Internal diagram of cpu was shown. 

4. cao question asking address saved in stack when a set of 4 opertions: 

r1<-M[1010] 

r2<-M[1020] 

r1<- r1+r2; 

M[2000]<- r1 

during writing to memory an interrupt occured, then what address is at stack. if the given program is starting from 1000. 

physics:1 

1. reflection and colour of light 

Os:14 

1. file system:256gb, 200 direct blocks, each word address bits given. what is max. file size in this system? 

2. a 2-way small cache of 4 blocks is having a refernece string:    8,0,12,6,8,12 

how many page faults if lru is used. 

3. if 2-level paging system. memory access time 100ns. TLB is used and tlb hit percentage0 80%. Assume tlb access time 0ns. what is effective access time of the system. 

4. if in shortest seek time first the head is at 100 number cylinder. and the requests are 80,85, 90, 100, 105, 110, 134, 155. After how many request services 85 will be served.  

5. semaphore, S=3; 7 up operations and 10 down. What is the current vlue of semaphore S? 

6. If number of disks in raid 1 is _____  as raid 6 if(some data duplication and consistency property given): 

A)same 

B)2 more than 

C)2 less than 

D)1 more than 

7. Bankers algorithm safe state sequence, if 24 instances of a resource is given. 

A)p0p2p1 

B)p1p2p0 

C)p2p0p1 

D)p1p0p2 

8. Deadlock question. Max number of resources needed if 4 processes has need of 4 instances of a resource. 

9. in a two process scenario, deadlock can occur due to: 

A)directly knowing of each other by a shared variable 

B)indirectly dependent on each other 

C)no deadlock 

D) os primitives 

10. Priority scheduling, with 0 as the lowest priority. The processes are 

Using preemptive priority scheduling. Then what is the waiting time of p1: 

A)10 

B)2 

C)12 

D)14 

11. Choose the incorrect one: 

A)paging makes memory access slow 

B)best fit is not really the best algorithm for continuous algorithms in all cases. 

C)paging suffers from internal segmentation 

Choose the correct option: 

A)both true 

B)only I 

C)both false 

D)only II 

13. In a disk system with 64 sectors per track, 8 plates with both sides used, 500 cylinders. The addressing of a sector is (a,b,c), where a is the track number from 0-63, b is the plate surface number from 0-15 and c is the cylinder number from 0-499. So, the address (20,8,31) corresponds to which sector in decimal addressing?  

14. Fork system call 

#include<stdio.h> 

Void main() 

{ 

Int I=1; 

Switch(i) 

{ 
case 1: 

 Printf(“process”); 

Fork(); 

Case 2: 

Printf(“process”); 

Fork(); 

Case 3: 

Printf(“process”); 

} 

} 

How many times will process be printed? 

dbms:6 

1. 1. left natural outer join of R and S. 

R(A,B)={(1,2),(3,1),(2,3),()} 

S(C,D)={(2,3),(2,1),(1,2),(1,3)}. 

 Then which of the following functional dependency is incorrect: 

A)AC->B 

B)C-.D 

C)B->D 

D)C-.>A 

web-technology:1 

1. which one of the following is true: 

a) to prevent sql injection predefined queries are used..... 

b) user validation ensures buffer not overflow 

c) forgery of digital signatures is called cross-site..... 

d)(something related to keys) 

algorithms:9 

1. if out of n elements, k- elements are inserted to form a max-heap,and out of the remaining elements each is first replacing the root and then the heap again rearranges to be a max-heap. What is the time complexity in big -oh terms? 

2. by definition of asymptotic notations if f(x)=n^(1/2) and g(x)=log(n). then which of the following is true: 

a)f=big-oh(g(x)) only 

b)f=big-omega(g(x)) only 

c)f=theta(g(x)) only 

d)f=big-oh(g(x)) and f=big-omega(g(x)) 

3. if f=big-oh of g(x) then: 

a) f is increasing for a large x, never faster than g(x) 

 A)I &II 

B)II & IV 

C)II & III 

D)all of the above 

data structure:6 

1. if 1.2.3.4 are inserted in that order than which of the following pop sequence is wrong: 

2. if there are two stacks with X, having 1,2,3 with 1 on top. There is on eother stack Y. If a value is popped from X, it can either be printed or be pushed to Y. But if a value is popped from Y, then it is printed. Then which of the following print sequence is not possible? 

3. B+ tree 

4. a binary search tree having 3 internal keyed nodes, then how many ways to represent it? 

a)6 

b)1 

c)5 

d)4 

5. what is the inorder traversal if postorder and preorder is given 

6.  an expression x= (a+b)*(c-d). Is given and in the syntax tree, which of the following options do not corresponds to either postorder, preorder or inorder traversal of the tree: 

A)(inorder traversal given) 

B) (preorder traversal given) 

C) (postorder traversal given) 

D)(incorrect one) 

digital electronics:10 

1. if the symbol * means 

A        B        output 

F        F        T 

F        T        T 

T        F        F 

T        F        F 

then AUB can be represented as: 

a)A*~B 

b)~A*B 

c)~A*~B 

d)none 

2. in the given circuit diagram if s1s2s3=001 and s2s3s4=010 then the output is:(the circuit was a combination of 4 one select line MUX i.e. 2*1 MUX. ) 

3. which of the folllowing is correct: 

a)the range of representation in mantissa and exponent is larger than floating values 

b)(gray code and excess-3 BCD something..) 

c)0 has two representations in 2s complement 

d)none 

4. input lines A,B,C,D are applied, what is the output if: 

I. 

II.  

III. 

II.A is always 1 if C is 1 

III. A is in always 0 if B is 1 

Iv. A is always 1 if D is 0. 

6. given f(x)=Pie(0,1,2,3,4,5,6,7,8,10,12,13,14,15) 

A)A’B’CD+A’BCD’ 

B)AB’C’D’+A’B’C’D 

C) AB’CD+AB’C’D 

D)A’B’CD+ABC’D’ 

7. The circuit for ((~A.~B)+(~A.B))+A  is: 

8. which circuit is same as AUB using only NAND gate, if the inputs A and B in OR gate and X and Y in NAND: 

A)x=~A & y =~B 

B) x=~A & y =B 

C) x=A & y =~B 

D)none of these 

(though the options was in symbol of logic gates but I have given the equivalent expressions) 

9. in a serial input parallel output shift register three bit, if the input is 00011011, then the output after 4 clock cycles is: 

A)101 

B)001 

B)sequential 

C)both a and b 

D)none 

toc:4 

1. the transition table is given as  

current state        input        next state 

A            0        B     

A            1        C 

B            0        A 

B            1        D 

C            0        D 

C            1        A 

D            0        C 

D            1        B 

If A is the initial as well as final state, then what is the above finite machine doing: 

a)accepting languages with odd 0s and even 1s 

b)accepting languages with odd 0s and odd 1s 

c)accepting languages with even 0s and even 1s 

d)accepting languages with even 0s and odd 1s 

2. r= 1(1+0)*  , s=11*0  , t=1*0 

then which of the following options is correct: 

a)r is subset of s, r is subset of t 

b)r is subset of s, t is subset of r 

c)s is subset of r, s is subset of t 

d)t is subset of r, r is subset of s 

3. l= (0+1).(0+1).(0+1).(0+1).(0+1)...n times. then what is the number of states in the miniimal dfa accepting it. 

a)n-1 

b)n 

c)n+1 

d) cant say 

4. a finite automata on E={0,1} was given accepting the multiples of 3. options: 

A)all multiples of 3 

B)all odd numbers 

C)all multiples of 4 

D)all even numbers 

T->F    (T.value=F.value) 

F->num    (F.value=num)