PSC HSST Computer Science Model Questions and Answers – Part 4

26. The IP address 127.0.0.1 is named as:
(A) Loop back address (B) IP address in a standard network
(C) LAN server address (D) Default router address
Answer: A

27. The Virtual Memory is located logically:
(A) in the CPU
(B) in main memory
(C) in between CPU and primary memory
(D) in the Hard disk
Answer: D

28. The Banker’s algorithm in resource allocation deals with:
(A) Dead lock prevention (B) Dead lock recovery
(C) Deadlock avoidance (D) Mutual exclusion
Answer: C

29. Thrashing occurs in:
(A) large computers
(B) a natural consequence of the virtual memory system
(C) can always be avoided by swapping
(D) poor paging algorithm
Answer: D
Explanation:
A process that is spending more time paging than executing is said to be thrashing. (i.e., page fault occurs frequently). In other words, that the process doesn’t have enough frames to hold all the pages for its execution, so it is swapping pages in and out very frequently to keep executing. As poor paging algorithm is used page fault occurs frequently. So, poor paging algorithms can quickly lead to thrashing.

30. Compilers can identify:
(A) syntax errors (B) semantic errors
(C) logical errors (D) mathematical errors
Answer: A

31. What was the first Scientific Computer Programming Language?
(A) COBOL (B) LISP
(C) ADA (D) FORTRAN
Answer: D

32. Which is the first Object Oriented Language?
(A) ADA (B) COBOL
(C) LISP (D) FORTRAN
Answer: A

33. Producer consumer problem is example for application of:
(A) Monitors (B) For Monitors, Semaphores and Event counters
(C) Semaphores (D) Event counters
Answer: B

34. What was the data transmission method in which bi-directional data flow is allowed?
(A) Simplex (B) Duplex
(C) Analog (D) Single side mode
Answer: B

35. Yahoo was developed by:
(A) Dennis Ritchie and Ken Thompson (B) Vint Cerf and Robert Kahn
(C) David Filo and Jerry Yang (D) Steve Case and Jeff Bezos
Answer: C

36. Resolution of Video display unit does not depend on:
(A) Raster scan rate (B) Band width
(C) Vertical and Horizontal scans (D) Screen size
Answer: D

37. Resolution of Video display unit does not depend on:
(A) Raster scan rate (B) Band width
(C) Vertical and Horizontal scans (D) Screen size
Answer: D

38. The true statement for parallel transmission is:
(A) simultaneous transmission of all bits
(B) speed is specified in bps
(C) slower than serial
(D) micro computers use this
Answer: A

39. Gray code for the decimal number 7 is:
(A) 0111 (B) 0100
(C) 0101 (D) 1011
Answer: B

40. Evaluate the pre-fix expression -*63-41 will result in:
(A) 25 (B) 23
(C) 15 (D) 12
Answer: C

41. Error correction in the data link layer is achieved by:
(A) Equalization (B) Cyclic redundancy codes
(C) Hamming codes (D) Bit stuffing
Answer: C
Explanation:
Cyclic Redundancy Code is an error detection code only. Hamming Code is an error correcting code used in Data link layer.

42. The system program that set up executable program in RAM, ready for execution is:
(A) Loader (B) Linker
(C) Linkage Editor (D) Compiler
Answer: A

43. File transfer protocol that uses UDP is:
(A) FTP (B) TFTP
(C) TELNET (D) NFS
Answer: B

44. To check the presence of a computer in the network, use the command:
(A) ping (B) cmd
(C) check (D) ipconfig
Answer: A

45. In cryptology the code STUDYING is written as RUTEXJMH, then the code for OTHER is:
(A) TOHRE (B) ROHTE
(C) NUGFQ (D) MOTHR
Answer: C

46. The Number of equivalent relations of the set {1,2,3,4} is:
(A) 4 (B) 15
(C) 16 (D) 24
Answer: B

47. Which of the sets are empty?
(A) {x:x=/x} (B) {x:x=x}
(C) {x:x=/x2} (D) {x:x=/xx}
Answer: A

48. In any undirected graph, the sum of the degrees of all nodes is:
(A) must be even (B) is always ODD
(C) need not be even (D) is twice number of edges
Answer: A & D
Explanation:
Option D is true. But it also implies that option A is true. Because twice of any number must be even.

49. An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is:
(A) Same degree (B) ODD degree
(C) Need not be ODD (D) is twice number of edges
Answer: B

50. An undirected graph G has n vertices and n-1 edges then G is:
(A) Cyclic (B) Addition of edge will make it cyclic
(C) Eulerian (D) Is a Tree
Answer: D