PSC Computer Operator – KIRTADS Model Questions and Answers
26. Which of the following statement is false?
(A) It is not possible to convert an HTML document into an XML document
(B) Both XML and HTML are subset of SGML
(C) A well formatted XML document need not require DTD
(D) CSS works better with XML than with HTML
Answer: A
27. In a style sheet, the style rule from another CSS file can be loaded using:
(A) @include (B) @import
(C) @attach (D) @load
Answer: B
28. The easiest method for a Web Server program to store the client information in a web browser for future use is:
(A) Applet (B) Cookie
(C) Template (D) Log file
Answer: B
29. A form of address spoofing resulting in denial of service attack:
(A) Session Hijacking (B) Island Hopping
(C) Sniffing (D) War Dialing
Answer: A
30. Which of the following is a JavaScript debugging method?
(A) window.alert (B) console.log
(C) document.write (D) document.getElementById
Answer: B
31. Which of the following statement is false?
(A) Samba can play a number of server roles such as a File Server, Print Server, Primary Domain Controller etc.
(B) Samba allows to share files with windows host.
(C) SWAT requires no web server running
(D) SWAT interface cannot be directly accessed from web browser
Answer: D
32. Simplest way to pass data between two Linux programs running in a system is:
(A) Socket (B) Pipe
(C) Semaphore (D) RPC
Answer: B
33. The Linux command that can be used to search for a pattern matching string in a file:
(A) find (B) which
(C) grep (D) search
Answer: C
34. In Redhat Linux, the powerful and secure method for network configuration is:
(A) NetBios (B) Netstart
(C) IPSec (D) Apache
Answer: B
35. The file system that is the best choice for new installations of Linux is:
(A) NTFS (B) EX2
(C) EX4 (D) JFS
Answer: C
36. In a Linux kernel, two mapping registers are simultaneously used as compatibly mapped buffers for CPU and Peripherals. Then the DMA Mapping is:
(A) Consistent Mapping (B) Buffer Mapping
(C) Streaming Mapping (D) Scatter Mapping
Answer: A
37. A format that can only archive a group related files into a single file and cannot perform any compression by itself:
(A) rar (B) bz2
(C) tar (D) gz
Answer: C
38. GNOME Display Manager can be configured by editing:
(A) gdm.conf (B) GNOME.conf
(C) Xserver.conf (D) XDM.conf
Answer: A
39. The powerful online help system of Linux is:
(A) who (B) man
(C) more (D) how
Answer: B
40. A Linux tool that can be used to create hard disk partitions only at the time of Linux installation:
(A) fdisk (B) cfdisk
(C) Disk Mount (D) DRUID
Answer: D
41. The average time required to perform a successful sequential search for an element in a array with n elements:
(A) n/2 (B) (n+1)/2
(C) (n-1)/2 (D) 2n
Answer: B
42. Each node in a tree has a value greater than all values in the left subtree and has a value less than all values in the right subtree. Then the tree is:
(A) Binary search tree (B) Complete tree
(C) Balanced tree (D) Threaded tree
Answer: A
43. The sort method that switches the adjacent elements, if needed after comparison is:
(A) Heap sort (B) Quick sort
(C) Insertion sort (D) Bubble sort
Answer: D
44. Minimum number of queues needed to implement the priority queue is:
(A) 1 (B) 2
(C) 3 (D) 4
Answer: B
45. After a sequence of steps in an algorithm, a linked list reaches the following step, START=NULL
Then the situation is,
(A) overflow (B) underflow
(C) initialisation (D) saturation
Answer: B
46. The result of following expression in polish notation is
4 3 2 + * 8 4 /-
(A) 13 (B) 12
(C) 18 (D) 34
Answer: C
47. The data structure that can implement a recursive procedure is:
(A) Tree (B) Linked List
(C) Queue (D) Stack
Answer: D
48. For a sorted linked list of length n, the worst case time required to search a given element is:
(A) O(n) (B) O(2n)
(C) O(log2 n) (D) O(log2 2n)
Answer: A
49. The characteristic of the elements that is maximum utilized in binary search is:
(A) Length of the list (B) Number of elements in the list
(C) Order of the list (D) Highest value in the list
Answer: C
50. For a binary tree with nine nodes, the result of inorder traversal is: D B A G E C H F I. And that of postorder traversal is: D B G E H I F C A. Then the result of preorder traversal is:
(A) A B D C E G F H I
(B) A B D E C F G H I
(C) A D B C E F G H I
(D) A D B E F C G H I
Answer: A
