#1
8th December 2014, 10:13 AM
| |||
| |||
To Become a Computer Teacher in Graduate Level Eligibility Criteria
I want to become a computer teacher in graduate level for that will you please provide me eligibility criteria ?
|
#2
8th December 2014, 12:22 PM
| |||
| |||
Re: To Become a Computer Teacher in Graduate Level Eligibility Criteria
For becoming a graduate level computer teacher firstly you will have to appear for NET examination, and then after qualifying this exam you can become a graduate level lecturer of Computers. Here I am giving you eligibility Criteria for NET: Qualification: Candidate must have a master degree in same relevant subject with minimum 55% of marks from a recognized university. Age Limit: There is no age limit for applying NET exam. Here I am giving you some questions of NET computer science and applications question paper: 1. Infrared signals can be used for short range communication in a closed area using _______ propagation. (A) ground (B) sky (C) line of sight (D) space 2. A bridge has access to _______ address in the same network. (A) Physical (B) Network (C) Datalink (D) Application 3. The minimum frame length for 10 Mbps Ethernet is _______ bytes and maximum is _______ bytes. (A) 64 & 128 (B) 128 & 1518 (C) 1518 & 3036 (D) 64 & 1518 4. The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is _______. (A) 500 baud/sec (B) 1000 baud/sec (C) 3000 baud/sec (D) 18000 baud/sec. 5. Match the following : List – I List – II a. Physical layer i. Allow resources to network access b. Datalink layer ii. Move packets from one destination to other c. Network layer iii. Process to process message delivery d. Transport layer iv. Transmission of bit stream e. Application Layer v. Formation of frames Codes : a b c d e (A) iv v ii iii i (B) v iv i ii iii (C) i iii ii v iv (D) i ii iv iii v 6. A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A ® a | b I. First (a) Ç First (b) {a} where a is some terminal symbol of the grammar. II. First (a) Ç First (b) l III. First (a) Ç Follow (A) = f if l Î First (b) (A) I and II (B) I and III (C) II and III (D) I, II and III 7. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ? (A) Removing left recursion alone (B) Removing the grammar alone (C) Removing left recursion and factoring the grammar (D) None of the above 8. A shift reduce parser suffers from (A) shift reduce conflict only (B) reduce reduce conflict only (C) both shift reduce conflict and reduce reduce conflict (D) shift handle and reduce handle conflicts ![]() ![]() ![]() ![]() ![]() ![]() |
|