PPSC Lecturer Computer Science Mock Test 14 A.J. Bhatti November 2, 2020 Welcome to your PPSC Lecturer Computer Science Mock Test 14....past Papers & Theory of Autometa Name Email Bit Means Binary Digit Binary unit Binary Number Binary score 1 byte = 18 bits 28 bits 38 bits 8 bits 1 worksheet contains 156 columns 356 columns 256 columns 254 columns In "G.W.Basic" G.W stands for Firewall bug Gate Way Security Gate Super Computer was created by J.H.Van Tassel Charless Babbage Seymour Cray Bilgates Abbreviation of CORBA is Common Object Request Broker Architecture Common Object Request Booker Architecture Common Object Request Broker aquarium Both A & B URL is Universal Resource Locator Uniform Unity Resource Locator Both A & B 1 mega byte = 1048579 bytes 1048576 bytes 1048572 bytes 1 kilo byte = 1000 bytes 1020 bytes 1024 bytes 1026 bytes 1 mega byte = 1024 bytes 1024 Kilo bytes 1024 mega bytes 1024 gega bytes 1 GegaByte = 1024 kilo bytes 1024 bytes 1024 Mega bytes 1024 Tera bytes 1 Tera Byte = 1024 bytes 1024 Mega bytes 1024 Gega bytes 1024 Kilo bytes A terabyte = 1 Million bytes 1 trillion bytes 1 Thousand bytes 100 thousand bytes Fred Cohen coined the word computer virus computer Worm computer Malware All of these First computer virus was created in ....... at Bell laboratories 1971 1972 1973 1970 WORM means Write Once Read Many Write Once Read once Write Many Read Many Both B & C Power of a super computer is measured in Flops Speed Bit per second Byte per second Information stored on disk as series of bumps on its shiny side Blank side Dark side Painted side In .......... mainframe was built 1060 1967 1968 1990 In ......... first supercomputer the Cray-1 was developed 1976 1977 1978 1979 In ........... IBM produce the IBM PC In 1982 In 1981 In 1983 In 1985 In ....... IBM made quantum computer 1995 1996 1997 1998 In ........, computer games were introduced 1974 1975 1978 1979 What was the world’s first high level programming language 1957: C C++ Java IBM FORTRAN PROM is the abbreviation of read only memory programmable read only memory random Access memory All of these 2. Given Language: L= {ab U aba}* If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA, |X-Y|=? a) 2 b) 3 c) 4 d) 1 3. An automaton that presents output based on previous state or current input: a) Acceptor b) Classifier c) Transducer d) None of the mentioned. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ? a) 64 b) 32 c) 128 d) 127 NFA, in its name has ’non-deterministic’ because of : a) The result is undetermined b) The choice of path is non-deterministic c) The state to be transited next is non-deterministic d) All of the mentioned Which of the following is correct proposition? Statement 1: Non determinism is a generalization of Determinism. Statement 2: Every DFA is automatically an NFA a) Statement 1 is correct because Statement 2 is correct b) Statement 2 is correct because Statement 2 is correct c) Statement 2 is false and Statement 1 is false d) Statement 1 is false because Statement 2 is false Given Language L= {xϵ {a, b}*|x contains aba as its substring} Find the difference of transitions made in constructing a DFA and an equivalent NFA? a) 2 b) 3 c) 4 d) Cannot be determined. The construction time for DFA from an equivalent NFA (m number of node)is: a) O(m2) b) O(2m) c) O(m) d) O(log m) Which of the following option is correct? a) NFA is slower to process and its representation uses more memory than DFA b) DFA is faster to process and its representation uses less memory than NFA c) NFA is slower to process and its representation uses less memory than DFA d) DFA is slower to process and its representation uses less memory than NFA For a given input, it provides the compliment of Boolean AND output. NAND box (NOT AND) DELAY box OR box AND box It delays the transmission of signal along the wire by one step (clock pulse). NAND box (NOT AND) DELAY box OR box AND box For the given input, it provides the Boolean OR output NAND box (NOT AND) DELAY box OR box AND box For the given input, AND box provides the Boolean AND output. True False The current in the wire is indicated by 1 and 0 indicates the absence of the current. True False Any language that can not be expressed by a RE is said to be regular language. True False If L1 and L2 are regular languages is/are also regular language(s). L1 + L2 L1L2 L1 All of above Let L be a language defined over an alphabet Σ, then the language of strings, defined over Σ, not belonging to L, is called Complement of the language L, denoted by Lc or L’. True False To describe the complement of a language, it is very important to describe the ----------- of that language over which the language is defined. Alphabet Regular Expression String Word For a certain language L, the complement of Lc is the given language L i.e. (Lc)c = Lc True False If L is a regular language then, --------- is also a regular language. Lm Ls Lx Lc Converting each of the final states of F to non-final states and old non-final states of F to final states, FA thus obtained will reject every string belonging to L and will accept every string, defined over Σ, not belonging to L. is called Transition Graph of L Regular expression of L Complement of L Finite Automata of L If L1 and L2 are two regular languages, then L1 U L2 is not a regular. True False L= language of words containing even number of a’s. Regular Expression is (a+b)aa(a+b) (b+aba) a+bbaaba (a+b)ab(a+b) The regular expression defining the language L1 U L2 can be obtained, converting and reducing the previous ------------- into a ------------ as after eliminating states. GTG, TG FA, GTG FA, TG TG, RE The language that can be expressed by any regular expression is called a Non regular language. True False The languages -------------- are the examples of non regular languages. PALINDROME and PRIME PALINDROME and EVEN-EVEN EVEN-EVEN and PRIME FACTORIAL and SQURE Languages are proved to be regular or non regular using pumping lemma. True False Let Q = {aa, abaaabb, bbaaaaa, bbbbbbbbbb} and R = {b, bbbb, bbbaaa, bbbaaaaa} Pref (Q in R) is equal to, {b,bbba,bbbaaa} {b,bba,bbaaa} {ab,bba,bbbaa} {b,bba,bbba} If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is ---------. Non-regular Equal Regular Infinite "CFG" stands for _________ Context Free Graph Context Free Grammar Context Finite Graph Context Finite Grammar ___________ states are called the halt states. ACCEPT and REJECT ACCEPT and READ ACCEPT AND START ACCEPT AND WRITE The part of an FA, where the input string is placed before it is run, is called _______ State Transition Input Tape Output Tape In pumping lemma theorem (x y^n z) the range of n is n=1, 2, 3, 4………. n=0, 1, 2, 3, 4………. n=…….-3,-2,-1, 0, 1, 2, 3, 4…… n=…….-3,-2,-1, 1, 2, 3, 4…… 49) Σ = {a,b} Productions S→XaaX X→aX X→bX X→Λ This grammar defines the language expressed by___________ (a+b)aa(a+b) (a+b)a(a+b)a (a+b)aa(a+b)aa (a+b)aba+b) There are ________ tuples in finite state machine. a) 4 b) 5 c) 6 d) unlimited L is a regular Language if and only If the set of __________ classes of IL is finite. a) Equivalence b) Reflexive c) Myhill d) Nerode A language can be generated from simple primitive language in a simple way if and only if a) It is recognized by a device of infinite states b) It takes no auxiliary memory c) Both are correct d) Both are wrong Which of the following does not represents the given language? Language: {0,01} a) 0+01 b) {0} U {01} c) {0} U {0}{1} d) {0} ^ {01} According to the given language, which among the following expressions does it corresponds to? Language L={xϵ{0,1}|x is of length 4 or less} a) (0+1+0+1+0+1+0+1)4 b) (0+1)4 c) (01)4 d) (0+1+ε)4 Concatenation Operation refers to which of the following set operations: a) Union b) Dot c) Kleene d) Two of the options are correct Concatenation of R with Ф outputs: a) R b) Ф c) R.Ф d) None of the mentioned A finite automaton accepts which type of language: a) Type 0 b) Type 1 c) Type 2 d) Type 3 (Regular Languages) Regular Expression denote precisely the ________ of Regular Language. a) Class b) Power Set c) Super Set d) None of the mentioned Which of the following option is correct? A= {{abc, aaba}. {ε, a, bb}} a) abcbb ₵ A b) ε₵A c) ε may not belong to A d) abca ₵ A A Language for which no DFA exist is a________ a) Regular Language b) Non-Regular Language c) May be Regular d) Cannot be said A DFA cannot be represented in the following format a) Transition graph b) Transition Table c) C code d) None of the mentioned When are 2 finite states equivalent? a) Same number of transitions b) Same number of states c) Same number of states as well as transitions d) Both are final states A Language for which no DFA exist is a________ a) Regular Language b) Non-Regular Language c) May be Regular d) Cannot be said The B-programming language was developed by J F Kennedy Charles Babbage Ken Thompson None of the above World Wide Web was invented in 1993 by Bilgates Mark Zukker Berg Tim Bareness Lee None of these The world’s most powerful super computer is called ASCI white ASCI Black ASCI Blue ASCI Red Name the first web browser publicly available Yaho Msn Hottmail Google NCSA Mosaic What company introduced the first commercial minicomputer Miocrosoft Intel Dell 65 DEC What is the common name for an integrated circuit a circuit a memory register A Chip A collection of bits is called byte Kilo byte Mega byte All of these The first home computer (1977), which was sold in millions of units was Apple V Apple IV Apple Il Apple IIl A person can live without food for about a month, but only about a week without ......... water rest sleep walk The smallest bird in the world is the Sparrow Hummingbird owl fly The highest kangaroo leap recorded is 10 ft and the longest is 100ft 40ft 70ft 42 ft Dolphins sleep with ........ open both eye one eye left eye right eye Many spiders have seven eyes four eyes five eyes eight eyes About 10% of the world’s population is right handed left-handed right and left both a and b A chimpanzee can learn to recognize itself in a mirror, but ......... can’t rat monkey cat dog Hazrat Usman was chosen by: Haxzrat Ali Hazrat Umer Abdur Rahman bin Auf. Hazrat Usman The British government announced the annulment of partition of Bengal in........ 1910 1911 1912 1926 Habsha is the old name of ethopia Kenya Tanzania Uganda Amnesia is related to : sleeping sickness loss of Sight loss of hearing loss of memory Sharm-el-Sheikh is the name of? Airport Iran Egyptian -seaport A Mountain none of these You have "Caries" then which Dr should be confused? Dermatologist orthopedist dentist Neurologist An example of a hereditary disease is polio hemophilia cholera typhoid What is the height of K2? 6611 metres 8611 7611 9611 HujjatUllah-il-Baligha was written by? Shah Ismail Haji shariatullah Syed Ahmad Shahid Shah waliullah . Most powerful hurricane to hit the Caribbean in September 2017 was? Maria Katrina IRMA none of these Malabar is the old name of : chennai Madras Mumbai Kolkata Only Hindu state in the world is? Nepal Bhutan India Pakistan The national bird of Pakistan is : Chakor pigeon parrot eagle Author: A.J. Bhatti
