Tuesday, 25 October 2016

HSST Computer Science Solved Paper 01.09.2011 Cat. No.111.2010 - Part 3

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
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
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
51.    Graph having every pair of vertices connected is called:
(A) Cycle graph            (B) Complete graph
(C) Peterson graph     (D) Is a Tree
Answer: B
52.    The Eigen vectors of a real symmetric matrix corresponding to different Eigen values are:
(A) Orthogonal matrix                         (B) Singular matrix
(C) Non-singular matrix          (D) Inverse matrix
Answer: A
53.    The system of equations 4x+6y=8, 3x+2y=1, 7x+8y=9 has:
(A) only one solution              (B) infinite solutions
(C) two solutions                     (D) none of these
Answer: C
54.    The Eigen values of the square matrix are:
(A) positive                    (B) imaginary
(C) real                          (D) negative
Answer: C
55.    The Equations will have:
(A) no unique solution           (B) only one solution
(C) has only two solutions     (D) has infinite
Answer: Question not complete.
56.    Which is fastest?
(A) DTL              (B) TTL
(C) ECL                         (D) CMOS
Answer: C
57.    Which is commutative but not associative?
(A) NOT             (B) NOR
(C) XOR            (D) NAND
Answer: B, D
NAND and NOR operations are commutative, but not associative.
(x↓y)↓z ≠ x↓(y↓z)          (↓ = NOR operation)
(x↑y)↑z ≠ x↑(y↑z)          (↑ = NAND operation)
58.    Which is Universal gate?
(A) AND             (B) NOR
(C) XOR            (D) NOT
Answer: B
A universal gate is one from which all other basic gates can be formed. NAND and NOR are Universal gates.
59.    How many NAND gates are needed to perform X.Y?
(A) 3                   (B) 4
(C) 2                   (D) 1
Answer: B
60.    Which is non-volatile?
(A) RAM            (B) PROM
(C) EPROM      (D) ROM
Answer: D

Monday, 24 October 2016

HSST Computer Science Solved Paper 01.09.2011 Cat. No.111.2010 - Part 2

21.       Full Binary tree with n leaves contain:
(A) n nodes                   (B) 2n-1 nodes
(C) n-1 nodes               (D) log n nodes
Answer: B
22.       Which is not possible in a thread?
(A) Ready                      (B) Wait
(C) Suspended            (D) Running
Answer: B
Thread exists in several states. A thread can be running .It can be ready to run as soon as it gets CPU time. A running state can be suspended.
23.       The margin of a word document can be displayed on the horizontal or vertical ruler with the mouse and the:
(A) FONT SIZE Button            (B) ALT key
(C) DELETE key                      (D) CTRL key
Answer: B
24.       The 2’s complement of the binary value 10 is:
(A) 10                 (B) 11
(C) 01                 (D) 110
Answer: A
25.       The property that the OOPs will permit the same operation to be carried out differently, based on the object is:
(A) inheritance                                     (B) polymorphism
(C) function overloading        (D) data abstraction
Answer: B
26.       The IP address 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
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

Sunday, 23 October 2016

HSST Computer Science Solved Paper 01.09.2011 Cat. No.111.2010 - Part 1

Question Paper Code: 98/2011
Exam: HSST Computer Science
Category No: 111/2010
Date of Test: 01-09-2011
Alpha code: B

1.       Which of the following preposition is a tautology?
(A) p v q-> p                  (B) p->(q-> p)
(C) p v (q-> p)               (D) none of these
Answer: B
2.       p->q->r is equivalent to:
(A) p->q->r                     (B) p->(q->r)
(C) p v (q->r)                 (D) none of these
Answer: A
3.       Why do we go for Normalization of Data Bases?
(A) To avoid the repetitions    (B) To prevent fragmentation
(C) Avoid redundancy            (D) To prevent replication
Answer: C
4.       Name the component carrying the ALU and Control Unit in Digital Computer:
(A) Microprocessors                (B) Nano chips
(C) MEMS                                 (D) Hybrid Computer
Answer: A
5.       Give the name of the Linear list in which elements can be added at ends but not in the middle:
(A) Array                        (B) Queue
(C) Tree                         (D) Circular Queue
Answer: X
Circular queue is a linear data structure. In circular queue the last node is connected back to the first node to make a circle. Circular linked list follow the First In First Out principle. Elements are added at the rear end and the elements are deleted at front end of the queue.
Queue is an abstract data structure. Queue is opened at both ends. One end is always used to insert data and the other is used to remove data. Queue follows First-In-First-Out methodology, i.e., the data item stored first will be accessed first.
A double-ended queue is an abstract data type similar to a simple queue, it allows you to insert and delete from both sides.
6.       The switching devices used in First Generation computer’s were:
(A) Transistors              (B) SSI chips
(C) VLSI chips              (D) Vacuum Tubes
Answer: D
7.       The Automation accepting the regular expression of any number of a’s is:
(A) a*                  (B) ab*
(C) (a/b)*            (D) a*b*c
Answer: A
8.       Flip-flop is the basic structure of the device:
(A) Hard disk    (B) Memory
(C) Cells            (D) Speakers
Answer: B
9.       In C language data type of “3” is:
(A) an integer               (B) a word
(C) a character             (D) a digit
Answer: String
10.    If every node “a” in a graph G is adjacent to every node “b” in G, then the graph is:
(A) Isolated graph        (B) Connected graph
(C) Eulerian graph      (D) Complete graph
Answer: D
11.    In C language an user defined header is identified by the inclusion:
(A) #include "test.h"                (B) #include
(C) include "test.h"                  (D) none of these
Answer: A
12.    Number of locations that could be addressed by a microprocessor with 12 address lines is:
(A) 1024            (B) 64K
(C) 4096            (D) 2048
Answer: C
13.    Number of bit width of any memory chip is:
(A) 16                 (B) 64
(C) 32                 (D) 8
Answer: D
14.    The command that lists the last few lines from a file named “file”:
(A) tail file                      (B) end file
(C) grep file                   (D) cat file -last25
Answer: A
15.    The percentage of time that a computer system is not available for use is:
(A) down time               (B) seek time
(C) delay time               (D) access time
Answer: A
16.    By the thread of the same process, sharing is not allowed in:
(A) queue                      (B) message
(C) stack                        (D) address space
Answer: C
17.    How to declare an interface class in C++?
(A) by declare all methods pure virtual in a class
(B) make all methods abstract in a class
(C) declare the class as interface
(D) none of the above three
Answer: D
18.    Which device translates between data formats?
(A) Hub                          (B) Switch
(C) Bridge                     (D) Gateways
Answer: D
19.    if a relation is in BCNF then it is in:
(A) 2 NF                         (B) 3 NF
(C) 1 NF                        (D) 1 NF and 2 NF
Answer: B
20.    Minimum Hamming distance method is used for correction of:
(A) syntactic errors                  (B) semantic errors
(C) algorithmic errors              (D) programming errors
Answer: A