Global Edge - Paper Pattern (Computer Fundamental)

[devi.naga]

Global Edge - Paper Pattern (Computer Fundamental)


1. Where is the MBR stored?
1. maintained by OS
2. MBR is in Boot.
3 MBR is in First sector of HDD
4. None of the above.

2. Where is the partition table stored?
1. BIOS
2. CMOS Setup
3. MBR
4. stored per partition.

3. Where is the boot record stored?
1. BIOS
2. CMOS Setup
3. MBR
4. stored per partition.

4. How many primary partitions can be created?
1. 1
2. 2
3. 3
4. 4
Ans : 4.

5. What is the difference between primary & extended partion?
1. Both are same
2. Primary and extended are in logical partion
3. primary cannot be subdivided but extended can be.
4. extended cannot be subdivided but primary can be.
ans 3.


6. Can we create 2 primary dos partions?
a)Yes
b)No
c)Depends on the hard Disk.
d)None of the above.
Ans: Yes

7. Can we create 2 extended partitions ?
a)Yes
b)No
c)Depends on the hard Disk.
d)None of the above.
Ans: No.


8. How many partitions can be created on a given harddisk?
a) Depends on the size of Disk.
b) 24
c)4
d)26

9. Can we hide a partition?
a) Yes
b) No
c) Depends on the Hard Disk
d) None.
ans: Yes.

10. Sliding window protocol lies in which layer?
1. Transport Layer
2. network Layer
3. Datalink layer
4. Application Layer
Ans : 3. DAtalink layer

11. Which is the highest priority interrupt .
1. rst5.5
2. rst6.5
3. TRAP
4. HLD

12. 8085 is
1. 16-bit
2. 8-bit
3. 32-bit
4. 20-bit microprocessor.
Ans : 2. 8 bit


13. protected mode is present in which processor
1. 8085
2. 8086
3. 80386
4.8087

14. The no. of address lines required to address 4k of memory
a)11
b)12
c) 14
d) 16
Ans: b

15) Where is CMOS setup stored
a) Hard Disk
b) BIOS
c)CMOS Ram
d) MBR.
Ans : CMOS Ram

1) main(){
int a;
char *p;
a = sizeof(int) * p;
printf("%d
",a);
}
a) compile error
b) run time error
c) 4
d) compiler dependent
ans:a

2)#define SIZE sizeof(int)
main(){ int i=-1;
if( i < SIZE )
printf("True
");
else
printf("False
");
}
a) True
b) False
c) can t predict
d) None of these
ans:b (?)

3) int (*fun())[]
a) function returning a pointer to an array
b) function returning an array of pointers
c) pointer to a funtion which takes array as asrument
d) Compiler error
ans: a

4) main(){
int a=8,d;
int *p;
p=&a;
d=a/*p;
print("%d
",d);
}
a) 1
b) 0
c) compiler error
d) run time error
ans: c

5) main(){
char *a="Hello";
*a++ = h ;
printf("%s
",a);
}
a) hello
b) ello
c) runtime error
d) compiler error
ans:b

6) main(){
char p[]="Hello";
p[0]= h ;
printf("%s
", p);
}
a) hello
b) Hello
c) compiler error
d) run time error
ans:a

7) #define mysizeof(a) (&a+1) - &a
main(
float d;
printf("%d
", mysizeof(d) );
}
note: assume sizeof float is 8 bytes
a) 8
b) 4
c) 1
d) compiler error
ans:c

main()
{ int *p=10;
printf("%d
",*p);
}
a) 10
b) run time error
c) compiler error
d) 5
ans:b (?)

9)main(){
int i=-1;
i<<=2;
printf("%d
",i);
}
a) -1
b) -2
c) -4
d) 0
ans:c

10) main(){
int i= 0xffffffff;
printf("%d
",i);
}
note: size of int is 4 bytes
a) -1
b) 65635
c) 100
d) error
ans:a

C questions

1>
int A=1,B=2;
if(A==B < printf("Hello "))
printf("world
");
else
printf("Bangalore
");

What is the o/p?

a> world b> Hello bangalore c> bangalore d> Hello world.

ans > d> Hello world.


2>

main()
{
int i;
for(i=0; i< 10; i++)
{
int j=10;
j++;
printf("j= %d
", j);
}
}

what is o/p ?

a> 10 to 19
b> error j undeclared
c> 10 times 11
d> 10 - 18
ans> c> 10 times 11.


3>
union test{
int a;
union test *p;
};
main(){
union test q;
printf(" a= %d
", q.a);
}
what is o/p?

a> 0
b> syntax error
c> garbage value
d>run time error
ans > c

4>
register int a,b;
main(){
for(a=0 ; a<5 ; a++)
b++;
}

a> 5
b> 4
c> 0
d> error
ans > d


5> # define dprint(expr) printf(" expr= %d
", expr)

main(){

int i=10,j=2;

dprint(i / j) ;
}

a> 5 b > expr= 5 c> i / j= 5 d> error.

ans > b.

Operating system concepts

1> Virtual memory is

a> Infinite, user is not constrained while writing program.
b> Finite it is limited by main memory + swap memory.
c> Infinite ,Yes As the process needs memory it is allocated by demand paging.
d> Finite ,It is limited by machines addressing capacity.

ans> d


2> Find the correct sentence

a> UNIX is monolithic MS-DOS is Microkernel
b> UNIX & MS-DOS are both monolithic.
c> UNIX & MS-DOS are both Microkernel.
d> All are wrong.
ans> b

3> In which OSI layer packet sequencing is checked

a> Physical layer
b> Data link layer
c> Network layer
d> Transport layer

ans> d


4> In General purpose OS user cannot change which state of process.

a> premption
b> sleep
c> creation
d> ready

ans> a

5> Which addressing scheme is not common for 8085 & 8086

a> Register addressing
b> Indexed addressing
c> Register Indirect addressing
d> Direct addressing.

Ans: b


C What is the output of the following :

1. main()
{
int *p ;
p=(int *)malloc(-10);
}

a) allocates 0 bytes
b) allocates memory, if available
c) compilation error
d) Runtime error

Ans) b

2. main()
{
for( printf("a") ; printf("b") ; printf("c") ) ;
}

a) abc
b) abc abc abc .....(infinite times)
c) a bc bc bc ....(infinite times)
d) Error

Ans) c

3. main()
{
int i= 10 * fun() ;
printf("%d",i);
}


fun()
{
return 10 ;
}

a) 0
b) 10
c) 100
d) Error

Ans) c

4.
int i= 10 * fun() ;
main()
{
printf("%d",i) ;
}

fun()
{
return 10 ;
}

a) 0
b) 10
c) 100
d) Error

Ans) d


5. Assume size of int to be 2 bytes :

main()
{
int i = 100 ;
printf("%d ", sizeof(i++));
printf("%d ",i) ;
}

a) 2 100
b) 2 101
c) 100 101
d) 101 100

Ans) a


Computer Fundamentals :

1. Which one of the following always resides in the memory ?

a) Linker
b) Loader
c) Compiler
d) All of the Above

Ans) b


2. Which of these is not a layer in OSI model ?

a) Application layer
b) Network Layer
c) Internet Layer
d) Data Link Layer

Ans) c


3. Which one of the following data structures is best suited for searching ?

a) Arrays
b) Singly Linked List
c) Doubly Linked List
d) Hash Table

Ans) d


4. Which of the following data structures is best suited for Deletion ?

a) Arrays
b) Singly Linked List
c) Doubly Linked List
d) Hash Table

Ans) c


5.Which one of these is not a scheduling technique in Operating System?

a) Last-Come-First-Serve Scheduling
b) First-Come-First-Serve Scheduling
c) Preemptive Scheduling
d) Round Robin Scheduling

Ans) a


6. Demand Paging is

a) All the pages of a process is loaded at the start
b) When a single page is demanded then all other pages are also loaded
c) When a page is required then only it is loaded
d) None of the Above

Ans) c


7. Page Fault is

a) A page is referenced that is not in the memory .
b) A page is referenced that is not in the Disk.
c) A page being added to the process.
d) None of the above

Ans) a


8. If the number of internal nodes in a binary tree is n , then what is the number of external nodes ?

a) n -1
b) n
c) n + 1
d) 2n

Ans) c


9. "Banker s Algorithm" is used for :

a) Deadlock Detection
b) Deadlock Avoidance
c) Deadlock Prevention
d) All of the above

Ans) b


10. Which of the following is used fro designing a lexical analyser of a compiler ?

a) Finite Automata
b) Push Down Automata
c) Turing Machine
d) None of the above

Ans) a


11. Which layer in the OSI model is responsible for End to End connectivity ?

a) Data Link Layer
b) Network Layer
c) Transport Layer
d) Session Layer

Ans) c