Computer Science Questions - August 2007

The complete set of questions appeared in the Computer Science Lecturer Examination held on August 2007 conducted by Kerala Public Service Commission. Please note that the answers are not provided here. I haven't included the answers, if you are confident about the answers please add them as comments.

Examination date : 25th August 2007
Category Number: 207/2007
Post: Lecturer in Computer Science
Basic Qualification: B.Tech (Computer Science)
Department: Department of Technical Education.

1. Which of the following is a protocol for exchanging files over internet
   
   
   
   1. FTP
   
   
   2. SMTP
   
   
   3. HTTP
   
   
   4. NNTP
   
   
   
   


2. How dfast can CAT5 cable transfer data ?
   
   
   
   1. 2 Mbps
   
   
   2. 10 Mbps
   
   
   3. 100 Mbps
   
   
   4. 1000 Mbps
   
   
   
   


3. Into which of the class of address does the IP address 10.0.0.1 belong?
   
   
   
   1. Class A
   
   
   2. Class B
   
   
   3. Class C
   
   
   4. Class D
   
   
   
   


4. A protocol that allows non-ASCII messages to be sent through e-mails in the Internet is
   
   
   
   1. MIME
   
   
   2. SMS
   
   
   3. SOAP
   
   
   4. SMTP
   
   
   
   


5. What sort of network runs with all nodes equal in terms of sharing space and power ?
   
   
   
   1. Star
   
   
   2. Bus
   
   
   3. Equinet
   
   
   4. P2P
   
   
   
   


6. What us DHCP an acronym for ?
   
   
   
   1. Dynamic Hypertext Configuration Protocol
   
   
   2. Dynamic Host Configuration Protocol
   
   
   3. Dynamic Host Control Protocol
   
   
   4. Dynamic Home Configuration Protocol
   
   
   
   


7. One of the following is a false statement about fiber-optic cable. It is:
   
   
   
   1. fiber-optic cable is considerably faster, lighter and more durable than wire media
   
   
   2. fiber-optic cable is well suited to systens requiring transfers of large volumes of data
   
   
   3. fiber-optic is easier to work with and less expensive than coaxial cable
   
   
   4. fiber-optic cable has data transfers rates from 500 kilobits to several billion bits per second
   
   
   
   


8. The part of a network that handles the major traffic and provides the primary path for traffic flowing to or from other networks is called the :
   
   
   
   1. information bus
   
   
   2. gateway
   
   
   3. frontside bus
   
   
   4. backbone
   
   
   
   


9. The transmission medium with the fastest speed among the following is:
   
   
   
   1. twisted pair
   
   
   2. microwave
   
   
   3. fiber-optics
   
   
   4. coaxial cable
   
   
   
   


10. A change in signal from positive to negative or vice versa that is used as a measure of transmission speed defines:
    
    
    
    1. baud
    
    
    2. bit rate
    
    
    3. frequency
    
    
    4. phase
    
    
    
    


11. Which of the following is not normally used as a server-side scripting paradigm?
    
    
    
    1. PHP
    
    
    2. Java Applets
    
    
    3. ASP
    
    
    4. PERL
    
    
    
    


12. An organized listing of all data elements that are pertinent to the system, with precise, definitions so that both user and system analyst will have a common understanding of inputs, outputs, components of stores and intermediate calclations is known as :
    
    
    
    1. documentation system
    
    
    2. software requirements specification
    
    
    3. data dictionary
    
    
    4. user interface specification
    
    
    
    


13. Which of the following is not a user design principle?
    
    
    
    1. should be traceable to the analysis model
    
    
    2. should not reinvent the wheel
    
    
    3. should exhibit uniformity and integration
    
    
    4. should not be structured to accomodate change
    
    
    
    


14. Which of the following is a benefit of MVC pattern?
    
    
    
    1. The MVC pattern minimizes coupling
    
    
    2. The MVC pattern provides abstraction
    
    
    3. The MVC pattern provides reusability
    
    
    4. The MVC pattern provides extensibility
    
    
    
    


15. Approximately one trillion bytes is a
    
    
    
    1. kilobyte
    
    
    2. megabyte
    
    
    3. terabyte
    
    
    4. gigabyte
    
    
    
    


16. The father of computer graphics is :
    
    
    
    1. Blaise Pascal
    
    
    2. Gourard
    
    
    3. Dennis Ritchie
    
    
    4. Ivan Sutherland
    
    
    
    


17. The DDA algorithm is used for:
    
    
    
    1. polygon clipping
    
    
    2. line cliping
    
    
    3. polygon filling
    
    
    4. line drawing
    
    
    
    


18. Which of the following algorithms is used for line clipping?
    
    
    
    1. 8-way symmetry
    
    
    2. DDA
    
    
    3. Cohen-Sutherland
    
    
    4. Bresenham
    
    
    
    


19. The Bresenham's (Midpoint) line algorithm in whcih d = 2 ∗ dy - dx works correctly only for lines with slopes
    
    
    
    1. -1 ≤ m ≤ 1
    
    
    2. 0 ≤ m ≤ 1
    
    
    3. -1 ≤ m ≤ 0
    
    
    4. 0 < m < 1
    
    
    
    


20. The transformation matrix [1 0 0 0; 0 1 0 0; 0 0 -1 0; 0 0 0 1](raw major form) represents
    
    
    
    1. scaling by unit x and y direction
    
    
    2. reflection at z
    
    
    3. rotation by unit in x and y about origin
    
    
    4. shearing by unit in x and y
    
    
    
    


21. Viewing co-ordinates in Computer Graphics terminology are also known as :
    
    
    
    1. object co-ordinates
    
    
    2. world co-ordinates
    
    
    3. camera co-ordinates
    
    
    4. screen co-ordinates
    
    
    
    


22. OpenGL is:
    
    
    
    1. a library
    
    
    2. an application programming interface
    
    
    3. a programming language
    
    
    4. a computing platform
    
    
    
    


23. Which red, green and blue values makes the colour cyan?
    
    
    
    1. 0,255,0
    
    
    2. 0,255,255
    
    
    3. 255,255,255
    
    
    4. 255,0,255
    
    
    
    


24. In terms of font size how many points are equivalent to one inch?
    
    
    
    1. 1
    
    
    2. 32
    
    
    3. 72
    
    
    4. 100
    
    
    
    


25. The shading model that computes the intensities for each vertex and then interpolates the compounded intensities across the polygons is:
    
    
    
    1. Flat Shading
    
    
    2. Gourard Shading
    
    
    3. Phong Shading
    
    
    4. Whitted Shading
    
    
    
    


26. Which of the following is not a relational DBMS
    
    
    
    1. SIBAS
    
    
    2. UNIFY
    
    
    3. ORACLE
    
    
    4. INGRES
    
    
    
    


27. Which among the following is an Open Source DBMS?
    
    
    
    1. ORACLE
    
    
    2. DB2
    
    
    3. System R
    
    
    4. Postgres
    
    
    
    


28. The number of attributes in a relation schema is its:
    
    
    
    1. schema
    
    
    2. plan
    
    
    3. arity
    
    
    4. subschema
    
    
    
    


29. QUEL is a :
    
    
    
    1. tuple calculus query language
    
    
    2. domain calculus query language
    
    
    3. a DDL
    
    
    4. a subschema DLL
    
    
    
    


30. If X → Y then XZ → YZ is the ______________ rule of Functional Dependencies.
    
    
    
    1. psuedotransitivity
    
    
    2. augmentation
    
    
    3. union
    
    
    4. transitivity
    
    
    
    


31. Table derived from Entity Relationship Diagrams:
    
    
    
    1. are unnormalized
    
    
    2. are in 1st normal form
    
    
    3. are in 2nd normal form
    
    
    4. None of these
    
    
    
    


32. A table with atleast one candidate key is assured to be in ______ normal form.
    
    
    
    1. 1st
    
    
    2. 2nd
    
    
    3. 3rd
    
    
    4. 4th
    
    
    
    


33. A subordinate entity is also termed as a :
    
    
    
    1. inferior entity
    
    
    2. weak entity
    
    
    3. dominant entity
    
    
    4. peer entity
    
    
    
    


34. All candidate keys excluding the primary key are known as :
    
    
    
    1. super key
    
    
    2. auxiliary key
    
    
    3. foreign key
    
    
    4. alternate key
    
    
    
    


35. Which of the following query languages is of domain calculus type
    
    
    
    1. QBE
    
    
    2. SQL
    
    
    3. QUEL
    
    
    4. SEQUEL
    
    
    
    


36. When n, k and T represent the number of tasks, number of pipeline stages and the clock period of linear pipeline, the pipeline efficiency is given by:
    
    
    
    1. n/(k ∗ (n+1))
    
    
    2. n/(k + (n-1))
    
    
    3. n/((k-1) ∗ (n-1))
    
    
    4. n*k/(n-1)
    
    
    
    


37. When the simultaneous instructions are of store type, which of the following hazards can occur?
    
    
    
    1. WAR
    
    
    2. RAW
    
    
    3. WAW
    
    
    4. None of these
    
    
    
    


38. How many bits are needed tos tore the value 32768 in 2's complement form?
    
    
    
    1. 14
    
    
    2. 15
    
    
    3. 16
    
    
    4. 17
    
    
    
    


39. Which of the following is a sequential device?
    
    
    
    1. Floppy Disk
    
    
    2. Magnetic Tape
    
    
    3. Magnetic Drum
    
    
    4. Hard Disk
    
    
    
    


40. One statement among the following set is true. Which one?
    
    
    
    1. An instruction cycle consists of many machine cycles
    
    
    2. Machine cycle consists of amny instruction cycles
    
    
    3. Machine and instruction cycle are equivalent in time quanta
    
    
    4. Machine cycle is always occuring in union with an instruction cycle during start
    
    
    
    


41. A patch table in a one pass assembler holds:
    
    
    
    1. symbol table
    
    
    2. address offsets of subroutines
    
    
    3. address of instructions with unresolved references
    
    
    4. address of functions in a different module
    
    
    
    


42. Which among the following is not a function of the loader
    
    
    
    1. relocates the code
    
    
    2. fetches code from disk to memory
    
    
    3. resolves symbols to libraries
    
    
    4. resoves symbols across modules
    
    
    
    


43. In an activation record, you can never find one of the following.
    
    
    
    1. return value
    
    
    2. space for global variables
    
    
    3. return addresses
    
    
    4. arguments to function
    
    
    
    


44. In some programming langauge, an identifier is defined to be a letter followed by any number of letters or digits. If L and D denote the sets of letters and digits respectively, them which of the following regular expressions define the identifier.
    
    
    
    1. (L ∪ D)^*
    
    
    2. L . (L ∪ D)^*
    
    
    3. (L . D)^*
    
    
    4. L . (L . D)^*
    
    
    
    


45. One among the following is a top-down parsing method.
    
    
    
    1. LALR
    
    
    2. SLR
    
    
    3. LR(1)
    
    
    4. LL(1)
    
    
    
    


46. FORTRAN implementations do not permit recursion because:
    
    
    
    1. they use static allocation for variables
    
    
    2. they use dynamic allocation for variables
    
    
    3. stacks are not available on all machines
    
    
    4. it is not possible to implement recursion on all machines
    
    
    
    


47. Type checking is normally done during:
    
    
    
    1. lexical analysis
    
    
    2. syntax analysis
    
    
    3. syntax durected translation
    
    
    4. code optimizations
    
    
    
    


48. The number of tokens in the C statement print("i=%d,&i=%x",i,&i); is:
    
    
    
    1. 3
    
    
    2. 21
    
    
    3. 10
    
    
    4. 26
    
    
    
    


49. In bottom up evaluation of a syntax directed definition, inherited attributes can:
    
    
    
    1. be evaluated only if the definition is L-attributed
    
    
    2. always be evaluated
    
    
    3. be evaluated only if the definition has synthesised attributes
    
    
    4. never be evaluated
    
    
    
    


50. Which of the following derivatives does a top-down parser use while parsing an input string? The input is assumed to be scanned from left to right.
    
    
    
    1. leftmost derivation
    
    
    2. leftmost derivation traced out in reverse
    
    
    3. rightmost derivation
    
    
    4. rightmost derivation traced out in reverse
    
    
    
    


51. Which of the following ivolves a context switch?
    
    
    
    1. system call
    
    
    2. privileged instruction
    
    
    3. all of the above
    
    
    4. None of these
    
    
    
    


52. Semaphores are used for:
    
    
    
    1. synchronization
    
    
    2. deadlock prevention
    
    
    3. deadlock avoidance
    
    
    4. None of these
    
    
    
    


53. Every file and directory in the UNIX system has a unique ______ assigned to it, used to keep track of information about the file
    
    
    
    1. sector
    
    
    2. block
    
    
    3. cluster
    
    
    4. inode
    
    
    
    


54. In a batch system the time defined as the time from which a job is submitted until the job is returned to the user is called the _____ time.
    
    
    
    1. Run time
    
    
    2. Burst time
    
    
    3. Idle Time
    
    
    4. Turnaround time
    
    
    
    


55. P, V, and initialize are the only operations permitted on
    
    
    
    1. Condition Variables
    
    
    2. Semaphores
    
    
    3. Signals
    
    
    4. Critical regions
    
    
    
    


56. The process-scheduling algorithm used in UNIX systems is:
    
    
    
    1. Shortest Job First
    
    
    2. Round Robin
    
    
    3. Multi-level queues with feedback
    
    
    4. Just-In-Time Scheduling
    
    
    
    


57. Paged virtual memory systems free us from the problem of ________ fragmentation.
    
    
    
    1. Internal
    
    
    2. External
    
    
    3. Table
    
    
    4. None of these
    
    
    
    


58. The principle of locality of reference justifies the use of :
    
    
    
    1. Interrupts
    
    
    2. DMA
    
    
    3. Polling
    
    
    4. Cache Memory
    
    
    
    


59. In a virtual memory computer system, when a virtual address is translated which is not currently mapped to real storage , we call this a :
    
    
    
    1. page fault
    
    
    2. segmentation violation
    
    
    3. out of bounds memory access violation
    
    
    4. bus error
    
    
    
    


60. The simplest form of pre-emptive procesor scheduling is :
    
    
    
    1. Shortest Job First
    
    
    2. Shortest Remaining Time First
    
    
    3. First Come First Served
    
    
    4. Multi-level Queues with Feedback
    
    
    
    


61. Which of the following is a network topology that links a number of computers by a single circuit with all messages broadcast to the entire network ?
    
    
    
    1. ring
    
    
    2. bus
    
    
    3. hierarchical
    
    
    4. star
    
    
    
    


62. Which of the following is a system for digitizing a spoken message and transmitting it over a network ?
    
    
    
    1. frame relay
    
    
    2. groupware
    
    
    3. computer conferencing
    
    
    4. voicemail
    
    
    
    


63. A communication processor that connects dissimilar networks by providing the translation from one set of protocols to another defines :
    
    
    
    1. bridge
    
    
    2. router
    
    
    3. gateway
    
    
    4. modem
    
    
    
    


64. Which HTTP Connection method transacts the connection to the connected state?
    
    
    
    1. openInputStream
    
    
    2. setRequestMethod
    
    
    3. setContentType
    
    
    4. None of these
    
    
    
    


65. Which method of JApplet is called after destroy ?
    
    
    
    1. predestroy
    
    
    2. finalize
    
    
    3. quit
    
    
    4. stop
    
    
    
    


66. Which among the following protocols is ised for translating from Internet address to physical address
    
    
    
    1. ICMP
    
    
    2. IGRP
    
    
    3. RARP
    
    
    4. ARP
    
    
    
    


67. One among the following protocols is not conected with e-mail. It is:
    
    
    
    1. SMTP
    
    
    2. MIME
    
    
    3. NNTP
    
    
    4. POP
    
    
    
    


68. A hostile applet is one that is:
    
    
    
    1. a downloadable applet that can cause some damage on a client
    
    
    2. an applet generated by another one
    
    
    3. a downloadable applet that attached itself onto an existing one
    
    
    4. an applet that resides on a virus infected system
    
    
    
    


69. SNMP is a protocol used for
    
    
    
    1. File Transfer
    
    
    2. Network Management
    
    
    3. E-mail
    
    
    4. Messaging
    
    
    
    


70. A dedicated telephone connection comprising 24 cahnnels that can support a data transamission rate of 1.544 megabits per second defines:
    
    
    
    1. T1 line
    
    
    2. Cable modem
    
    
    3. Digital Subscriber line
    
    
    4. ISDN
    
    
    
    


71. A lattice is a poset in which
    
    
    
    1. there may be elements not related by the ≤ relation
    
    
    2. any two elements have an infimum and a supremum
    
    
    3. all pairs of elements have unique infimum and supremum
    
    
    4. None of these
    
    
    
    


72. In an lattice, the meet of two elements a and b is defined as :
    
    
    
    1. if a∧b≤a, a∨b≤b and if c≤a and c≤b, then c≤a∧
    
    
    2. if a∨b≤a, a∧b≤b and if c≤a and c≤b, then c≤a∨
    
    
    3. if a∨b≤a∧b and if c≤a and c≤b, then c≤a∨
    
    
    4. if a∧b≤a∧b and if c≤a and c≤b, then c≤a∧
    
    
    
    


73. The set E = {..., -6, -4, -2, 0, 2, 4, 6, ...} is the set of even numbers. It has all the properties of a ring except :
    
    
    
    1. It does not have the * operator
       
    2. Does not have the identity element for *
       
    3. It does not have the + operator
       
    4. Does not have the identity element for +
    
    
    
    


74. A binary relation between two sets X and Y in which for all y in Y there exists an x in X such that xRy :
    
    
    
    1. is a functional relation
    
    
    2. is an injective relation
    
    
    3. is a surhective relation
    
    
    4. is a bijective relation
    
    
    
    


75. A partial ordering relation divides a set into :
    
    
    
    1. a set of equivalence classes
    
    
    2. a set of non-empty sets once contained within the other in a sequence
    
    
    3. a finite set of non-empty non-disjunct sets
    
    
    4. lattice
    
    
    
    


76. One among the following data structures cannot be stored effciently using arrays. Which one is it?
    
    
    
    1. Linked lists
    
    
    2. Stacks
    
    
    3. Graphs
    
    
    4. Queues
    
    
    
    


77. In a left skewed binary of depth n, how many modes can be found?
    
    
    
    1. n
    
    
    2. n-1
    
    
    3. 2n
    
    
    4. 2ⁿ
    
    
    
    


78. The mathematical fucntion computed by thr definition ƒ(1)=1, ƒ(n)=n²+ƒ(n-1) is :
    
    
    
    1. n²>
    
    
    2. 2ⁿ
    
    
    3. n(n+1)(2n+1)/6
    
    
    4. 2ⁿ-n
    
    
    
    


79. A hashing fucntion which stores colliding items together in linked lists is :
    
    
    
    1. linear hashing
    
    
    2. linear hashing with collission detection
    
    
    3. universal hashing
    
    
    4. separate chaining
    
    
    
    


80. The binary tree representation of an arithmetic infix expression is available. A postorder traversal of the expression produces its:
    
    
    
    1. postfix equivalent
    
    
    2. prefix equivalent
    
    
    3. infix equivalent
    
    
    4. None of these
    
    
    
    


81. The number of ditinct binary trees that can be constructed used in n nodes is :
    
    
    
    1. 2ⁿ
    
    
    2. n²
    
    
    3. n²+n
    
    
    4. 2ⁿ-n
    
    
    
    


82. Kruskal's algorithm on a graph finds out:
    
    
    
    1. A Eulerian path
    
    
    2. A Hamilton path
    
    
    3. A Minimum cost spanning tree
    
    
    4. The degree of each vertex
    
    
    
    


83. The worst case complexity of the heap sort algorithm is
    
    
    
    1. Ο(n)
    
    
    2. Ο(n log n)
    
    
    3. Ο(n²)
    
    
    4. Ο(n² log n)
    
    
    
    


84. The breadth first traversal of a binary tree for the arithmetic infix expression a+b*c+d produces the sequence :
    
    
    
    1. ++da*bc
    
    
    2. ++a*bcd
    
    
    3. a+b*c+d
    
    
    4. abc*+d+
    
    
    
    


85. If two functions ƒ(n) and g(n) are related by the relation |g(n)|≤C|fnof;(n), for all n≥n₀ where C and n₀ are postive interger constants , we can say:
    
    
    
    1. ƒ= Ο(g)
    
    
    2. g = Ο(ƒ)
    
    
    3. ƒ= Θ(g)
    
    
    4. g = Θ(ƒ)
    
    
    
    


86. Adjacency matrix representation of a graph of n edges required space of :
    
    
    
    1. Ο(n)
    
    
    2. Ο(log n)
    
    
    3. Ο(n²)
    
    
    4. Ο(2ⁿ)
    
    
    
    


87. Which of the following relations about time complexity functions is true?
    
    
    
    1. Ο(n²) < Ο(n log n)
    
    
    2. Ο(n²) < Ο(log n)
    
    
    3. Ο(n²) < Ο(n² log n)
    
    
    4. Ο(n log n) < Ο(log n)
    
    
    
    


88. A language L is NP-complete if L ε NP and L is :
    
    
    
    1. Recursively enumerable
    
    
    2. Recursive
    
    
    3. NP-hard
    
    
    4. in Co-NP
    
    
    
    


89. The data structure ideally suited for solving the Keonigsberg problem is
    
    
    
    1. Arrays
    
    
    2. Queues
    
    
    3. Linked LIsts
    
    
    4. Graphs
    
    
    
    


90. Compaction of storage for efficiency is required when data is stored in
    
    
    
    1. Stacks
    
    
    2. Arrays
    
    
    3. Circularly Queue
    
    
    4. Linear Queue
    
    
    
    


91. Hit ratio is a charecteristic of
    
    
    
    1. Primary Memory
    
    
    2. Secondary Memory
    
    
    3. Cache Memory
    
    
    4. None of these
    
    
    
    


92. which among the following addressing methids require the largest number of memry accesses ?
    
    
    
    1. Memory Indirect
    
    
    2. Relative addressing
    
    
    3. Register Direct
    
    
    4. Register Indirect
    
    
    
    


93. The virtual memory management scheme among the following that is most common in current operating systems is:
    
    
    
    1. Paging
    
    
    2. Segmentation
    
    
    3. Paged Segmentation
    
    
    4. Segmented Paging
    
    
    
    


94. LRU is an algorithm used for:
    
    
    
    1. Memory Scheduling
    
    
    2. Disk Scheduling
    
    
    3. Processor Scheduling
    
    
    4. None of these
    
    
    
    


95. DMA cucles are used by the external devices for:
    
    
    
    1. Requesting CPU's attention
    
    
    2. Shutting down the interface
    
    
    3. Interrupting data transfer
    
    
    4. Doing data transfer
    
    
    
    


96. An array processor is an example of:
    
    
    
    1. SISD
    
    
    2. SIMD
    
    
    3. MISD
    
    
    4. MIMD
    
    
    
    


97. One of the following is not a property of the Cray-1 supercomputer, Which one?
    
    
    
    1. has 64-bit word length
    
    
    2. use 2's complement arithmetic
    
    
    3. has 12.5 ns clock period
    
    
    4. has 256 instruction codes
    
    
    
    


98. MM2I networks have ________ architecture
    
    
    
    1. SISD
    
    
    2. SIMD
    
    
    3. MISD
    
    
    4. MIMD
    
    
    
    


99. A component not found in associative memories is:
    
    
    
    1. Comparand register
    
    
    2. Indicator
    
    
    3. Index register
    
    
    4. Masking register
    
    
    
    


100. OCCAM is :
     
     
     
     1. A Parallel processing language
     
     
     2. A Transputer
     
     
     3. A Parallel Architecture
     
     
     4. A Parallel processing machine
     
     
     
     

Blog for net4u@googlegroups.com

This is the unofficial blog for net4u@googlegroups.com.