Computer Architecture Important Questions for UGC NET | GATE | PGT Computer Science

 

Software Engineering for UGC NET & GATE CS(All Important Study Material and MCQs in one Video Only)

 

Rescheduling of the Examination dates for UGC-NET December 2020 and June 2021 cycles

 

Expected Questions Series 9

1) What is the maximum length of a field name? 
a. 10 characters 
b. 30 characters
c. 50 characters
d. 20 characters

2) Which command permanently deletes the record from database?
a. PACK 
b. ZAP
c. SEEK
d. SKIP

3) How is the failure node represented by replacing each empty subtree in an Extended Binary Tree ?

a. *
b. Δ
c. o
d. □

4) Which of the following statements is / are related to a stub network?

a. A network with only one entry and exit point.
b. A network with only one entry and no exit point.
c. A network with more than one exit and entry point
d. A network with more than one exit point.

5) What kind of task does VLAN do in a network?

a. It provides multiple broadcast domains within a single collision domain.
b. It breaks up the broadcast domains in a layer 2 switch internetwork. 
c. It acts as the fastest port to all servers.
d. It provides multiple collision domains.

6) Which layer of TCP / IP stack is equivalent to the transport layer of the OSI model?

a. Network Access
b. Internet
c. Host - to - Host 
d. Application

Answers:

1) a

2) a

3) d

4) a

5) b

6) c 

Expected Questions Series 8

1) We have an operating system, which is capable of loading and executing a single sequential user process at a time. If the disk head scheduling algorithm which is initially First Come First Served (FCFS) is replaced by Shortest Seek Time First (SSTF) claimed by the vendor to give 50% better benchmark results then what is the expected improvement in the I / O performance of the user programs? 
a. 0% 
b. 25%
c. 50%
d. 75%

2) What is the effect of using a larger block size in a fixed block size file system?

a. It leads to poorer disk throughput and poorer disk space utilization
b. It leads to poorer disk throughput but better disk space utilization
c. It leads to better disk throughput and better disk space utilization
d. It leads to better disk throughput and poorer disk space utilization

3) Consider the following statements:

a. With the use of kernel supported threads context switch is faster.
b. The entire process can be blocked by the system for user - level threads.
c. Kernel supported threads can be scheduled independently.
d. User level threads are transparent to the kernel.

Which of the above statements are true?

a. a and d
b. a and b
c. b and c 
d. a and c

4)  Which protocol is mostly used to send unknown messages back from a destination network to an originating host?

a. TCP
b. UDP
c. BootP
d. ICMP 

5) In a 12 - port switch, when a network is segmented, how many broadcast domains are created?

a. 5
b. 1
c. 12
d. 2

6) Which operation does the following command allow you to perform?

' router A(config)#line cons 0 '

a. Shut down the router
b. Disable console connections
c. Set the telnet password
d. Set your console password 

7) The concept of topological sorting significantly deals with an ordering of Vertices in  _________.

a. A Directed Cyclic Graph 
b. An Undirected Cyclic Graph
c. A Directed Linear Graph
d. An Undirected Linear Graph

8) Which is the most suitable construct utilized for traversing in a Circular Linked List?

a. do - while 
b. while
c. if
d. for

9) What is a transparent DBMS?

a. Keeps its logical structure hidden from users
b. Keeps its physical structure hidden from users
c. Cannot hide sensitive information from users.
d. Both A and B.

10) How can a tuple be divided in a relational schema?

a. Domains 
b. Queries
c. Relations
d. Joins

Answers:

1) a

2) d

3) c

4) d

5) b

6) d

7) a

8) a

9) c

10) a

Expected Questions Series 7

1) What are the following types of?

SERIALIZABLE
REPEATABLE READ
READ COMMITTED

a. Locks
b. Logs
c. Isolation level 
d. Latch types

2) State the main difference between a latch and a lock.

a. Locks are more restrictive than Latches in that they are always exclusive.
b. Latches are more restrictive than locks in that they are always exclusive.
c. Latch is used to protect data while lock is not.
d. Lock is used to protect data while latch is not.

3) What is a report generator used for?

a. Update Files
b. Print Files 
c. Alter files
d. All the above

4)  What is the timing complexity of Prim's Algorithm for a graph comprising ' n ' vertices? 

a. O(n)
b. O(n²) 
c. O(n³)
d. O(n-1)² 

5) How many nested loops are present in Prim's Algorithm?

a. Two
b. Three
c. Four
d. Infinite

6) Which command allows to set a Telnet password on a Cisco router?

a. line con 0 4
b. line vty 0 4
c. line telnet 0 4
d. line aux 0 4

7) What command is used to take backup on IOS?

a. copy flash tftp
b. copy ios tftp
c. backup IOS disk
d. copy tftp flash

8)We have a CPU that generates virtual addresses of 32 bits and the page size is of 4 kbyte. Transition Lookaside Buffer ( TLB ) of the processor can hold a total of 128 page table entries and 4 - way set associative. What is the minimum size of the TLB tag?

a. 16 bit
b. 20 bit
c. 11 bit
d. 15 bit 

9) Consider a virtual memory system that uses First In First Out (FIFO) page replacement policy and it allocates a fixed number of frames to a process. Consider the following two statements,

1: Sometimes the page fault rate is increased if the number of page frames allocated is increased.
2: Some programs do not exhibit Locality of reference.

Which of the following is true?

a. 1 is false and 2 is true
b. both 1 and 2 are false
c. both 1 and 2 are true but 2 is not the reason for 1
d. both 1 and 2 are true and 2 is the reason for 1

10) Why do we translate a virtual address to physical address where a multilevel page table is preferred in comparison to a single level page table?

a. It is required by the translation look-aside buffer
b. It helps to reduce the memory access time to read or write a memory location
c. It helps to reduce the number of page faults in page replacement algorithm
d. It helps to reduce the size of a page table needed to implement the virtual address space of a process

11) An application loads 100 libraries at startup and loading each library exactly one disk access is required. 10ms is the seek time of the disk to a random location and 6000rpm is the rotational speed of the disk. Neglect the time to transfer data from the disk block once the head has been positioned at the start of the block. What will be the time taken by the application to load all the libraries, if all 100 libraries are loaded from random location on the disk?

a. 1.50s
b. 1.00s
c. 1.87s
d. 0.74s

Answers

1) c

2) d

3) b

4) b

5) a

6) b

7) a

8) d

9) c

10) d

11) a

Expected Questions Series 6

1) A machine has a physical memory of 64 Mbyte and a virtual address space of 32 - bit. The page size is 4kbyte, What is the approximate size of the page table?
a. 24 Mbyte
b. 16 Mbyte
c. 2 Mbyte 
d. 8 Mbyte

2) We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process : 

1, 2, 1, 3, 7, 4, 5, 6, 3, 1
If Optimal Page Replacement policy is used,  _______ page faults will occur for the above reference string.
a. 7
b. 8
c. 9
d. 6

3) Which of the following statements is not true for the deadlock prevention and deadlock avoidance schemes? 

a. Deadlock avoidance is less restrictive than deadlock prevention.
b. In deadlock prevention, the request for resources is always granted, if the resulting state is safe.
c. It is the priority to have the knowledge of resource requirements for deadlock avoidance. 
d. In deadlock avoidance, the request for resources is always granted, if the resulting state is safe. 

4) What does the Cryptographic hash function return when it takes an arbitrary block of data?

a. Variable size bit string
b. Fixed size bit string
c. All of the Above
d. None of the Above

5)  If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m '  where n <= m . What is the expected number of collisions involving a particular key ' x ' ?

a. less than 1. 
b. less than n.
c. less than m. 
d. less than n / 2.

6) Which of the following is the depth of a Complete Binary Tree?

a. Dn = n log2n
b. Dn = n log2n + 1 
c. Dn = log2n
d. Dn = log2n + 1 

7)  In graphs, A hyperedge is an edge that is allowed to take on any number of _____________.

a. vertices
b. edges 
c. both a and b
d. labels

8) What is degree 0 isolation?

a. Transaction does not read dirty data from other transactions.
b. Transaction does not commit any writes until it completes all its writes.
c. Transactions do not dirty data read by a transaction before the transaction commits.
d. A transaction does not overwrite data updated by another user or process.

9) What is a degree of relation?

a. It is the number of attributes of its relation schema.
b. The number of relationships with other tables
c. Number of association among two or more entities
d. Number of foreign key dependencies

10) Which of the following is / are known as a minimal superkey?

a. Primary key
b. Foreign key
c. Unique key
d. Candidate key 

Answers:

1) c

2) a

3) d

4) b

5) a

6) d

7) a

8) d

9) a

10) d