DSSSB TGT / PGT · Topic-wise previous year questions

Computer Science Previous Year Questions (page 4)

1995 Computer Science questions asked in DSSSB TGT / PGT previous year papers, each with the correct answer and explanation. Read them free on UTpaper, or attempt the full papers as timed online tests.

  • 1995 questions
  • 19 topics
  • Official answer key
  • Free

Practise by topic

Q151From DSSSB TGT Computer Science Practice Set 4
In virtual memory paging, page size and frame size have which of the following relations?
  1. ABoth are of equal size
  2. BBoth are of unequal size
  3. CThe page size is exactly half of the frame size
  4. DThe page size is twice the frame size
Show answerHide answer

Correct answer: (A) Both are of equal size

Explanation

In paging, logical memory is divided into pages and physical memory into frames of the same size, so any page fits into any frame.

Q152From DSSSB TGT Computer Science Practice Set 4
Which of the following is tautology?
  1. Aa ∨ b → b ∧ c
  2. Ba ∧ b → b ∨ c
  3. Ca ∨ b → (b → c)
  4. DNone of the above
Show answerHide answer

Correct answer: (B) a ∧ b → b ∨ c

Explanation

a ∧ b → b ∨ c is a tautology: whenever a ∧ b is true, b is true, so b ∨ c is true. The other implications can be false, for example when b and c are false.

Q153From DSSSB TGT Computer Science Practice Set 4
From a complete graph by removing maximum ______ edges, we can construct a spanning tree.
  1. Ae − n + 1
  2. Bn − e + 1
  3. Cn + e − 1
  4. De − n − 1
Show answerHide answer

Correct answer: (A) e − n + 1

Explanation

A spanning tree of n vertices keeps exactly n − 1 edges. So from a graph with e edges you remove e − (n − 1) = e − n + 1 edges.

Q154From DSSSB TGT Computer Science Practice Set 4
In how many ways can 8 Indians, 4 Americans and 4 Englishmen be seated in a row so that all persons of same nationality sit together?
  1. A3! 4! 8! 4!
  2. B3! 8!
  3. C4! 4!
  4. D8! 4! 4!
Show answerHide answer

Correct answer: (A) 3! 4! 8! 4!

Explanation

Treat each nationality as one block: the 3 blocks can be arranged in 3! ways. Inside the blocks, Indians arrange in 8!, Americans in 4! and Englishmen in 4!. Total = 3!·8!·4!·4!.

Q155From DSSSB TGT Computer Science Practice Set 4
The total number of words formed by 2 vowels and 3 consonants taken from 4 vowels and 5 consonants is
  1. A60
  2. B120
  3. C7200
  4. DNone of the above
Show answerHide answer

Correct answer: (C) 7200

Explanation

Choose the vowels: C(4,2) = 6. Choose the consonants: C(5,3) = 10. Arrange the 5 letters: 5! = 120. Total = 6 × 10 × 120 = 7200.

Q156From DSSSB TGT Computer Science Practice Set 4
In a positive edge triggered Jk flip-flop, a low J and a low K produces :
  1. ANo change
  2. BLow state
  3. CHigh state
  4. DToggle state
Show answerHide answer

Correct answer: (A) No change

Explanation

In a JK flip-flop, J = 0 and K = 0 is the hold condition, so the output does not change at the clock edge.

Q157From DSSSB TGT Computer Science Practice Set 4
An entity set that does not have sufficient attributes to form a key is termed as :
  1. APrimary entity set
  2. BStrong entity set
  3. CWeak entity set
  4. DSimple entity set
Show answerHide answer

Correct answer: (C) Weak entity set

Explanation

A weak entity set has no primary key of its own. It is identified through a strong (owner) entity set plus its partial key (discriminator).

Q158From DSSSB TGT Computer Science Practice Set 4
How many gate (s) would be required to implement the following boolean expression after simplification? Expression : AC+ABC
  1. A4
  2. B1
  3. C2
  4. D3
Show answerHide answer

Correct answer: (B) 1

Explanation

AC + ABC = AC(1 + B) = AC, so a single 2-input AND gate is enough.

Q159From DSSSB TGT Computer Science Practice Set 4
What do data warehouses support?
  1. AOperational databases
  2. BOLAP
  3. COLTP
  4. DOLAP and OLTP
Show answerHide answer

Correct answer: (B) OLAP

Explanation

Data warehouses store historical, integrated data for analysis, so they support OLAP (Online Analytical Processing). OLTP runs on operational databases.

Q160From DSSSB TGT Computer Science Practice Set 4
The memory which does not loose its content on failure of power supply is known as ______ memory.
  1. AMain memory
  2. BVolatile
  3. CNon-volatile
  4. DRAM
Show answerHide answer

Correct answer: (C) Non-volatile

Explanation

Non-volatile memory, such as ROM or flash, keeps its contents when power is lost. RAM (main memory) is volatile.

Q161From DSSSB TGT Computer Science Practice Set 4
The easiest method in Flash to draw a heptagon, is to use the ______.
  1. APolystar Tool with the "Polygon" style.
  2. BPolygon Tool.
  3. CLasso Tool with the "Create star" option.
  4. DPolystar Tool with the "Star" style.
Show answerHide answer

Correct answer: (A) Polystar Tool with the "Polygon" style.

Explanation

The PolyStar tool with the Polygon style, set to 7 sides in its options, draws a heptagon directly. Flash has no separate Polygon tool.

Q162From DSSSB TGT Computer Science Practice Set 4
Which of the following is a current liability?
  1. AMachinery
  2. BDebtors
  3. COutstanding Salary
  4. DFurniture
Show answerHide answer

Correct answer: (C) Outstanding Salary

Explanation

Outstanding salary is an expense due but not yet paid, payable within the year, so it is a current liability. Machinery and furniture are fixed assets, and debtors are current assets.

Q163From DSSSB TGT Computer Science Practice Set 4
Which financial statement shows the financial position of a business on a particular date?
  1. ATrial Balance
  2. BProfit and Loss Account
  3. CBalance Sheet
  4. DCash Book
Show answerHide answer

Correct answer: (C) Balance Sheet

Explanation

The balance sheet shows the assets, liabilities and capital of a business on a particular date, so it shows the financial position on that date.

Q164From DSSSB TGT Computer Science Practice Set 4
Which of the following is called the magna carta of English education in India ?
  1. AKothari commission
  2. BNational policy on education 1986
  3. CWood's dispatch
  4. DRight to education act, 2009
Show answerHide answer

Correct answer: (C) Wood's dispatch

Explanation

Wood's Despatch (1854) laid down a full plan for English education in India, so it is called the Magna Carta of English education in India.

Q165From DSSSB TGT Computer Science Practice Set 4
Tina understands the concepts of addition in school, on her way back home she buys some refreshments and calculates the expenses herself. Which component of the curriculum has been highlighted in the above statement?
  1. AValues
  2. BConcept
  3. CApplication
  4. DSubject
Show answerHide answer

Correct answer: (C) Application

Explanation

Tina uses the concept of addition in a real-life situation (shopping), which shows the application component of the curriculum.

Q166From DSSSB TGT Computer Science Practice Set 4
Which of the following is not a learning disability ?
  1. AVisual impairment
  2. Bdysgraphia
  3. CDyslexia
  4. DDyscalculia
Show answerHide answer

Correct answer: (A) Visual impairment

Explanation

Visual impairment is a sensory disability, not a learning disability. Dysgraphia (writing), dyslexia (reading) and dyscalculia (mathematics) are learning disabilities.

Q167From DSSSB TGT Computer Science Practice Set 4
Which ministry conducts the sarva shiksha abhiyan?
  1. AMinistry of commerce and industry
  2. BMinistry of women and child development
  3. CMinistry of cooperatives
  4. DHuman resource development ministry
Show answerHide answer

Correct answer: (D) Human resource development ministry

Explanation

Sarva Shiksha Abhiyan was run by the Ministry of Human Resource Development (now the Ministry of Education).

Q168From DSSSB TGT Computer Science Practice Set 4
What do you understand by dysgraphia?
  1. AAttention - deficit
  2. BDifficulties with spelling and /or trouble writing thoughts on paper
  3. CDifficulty in reading
  4. DUnable to perform number based operations
Show answerHide answer

Correct answer: (B) Difficulties with spelling and /or trouble writing thoughts on paper

Explanation

Dysgraphia is a learning disability that affects writing: poor handwriting, spelling and difficulty putting thoughts on paper.

Q169From DSSSB TGT Computer Science Practice Set 4
Which amendment of the constitution of India made the right to education a fundamental right ?
  1. A75
  2. B41
  3. C79
  4. D86
Show answerHide answer

Correct answer: (D) 86

Explanation

The 86th Amendment Act, 2002 added Article 21A, making free and compulsory education for children aged 6 to 14 a fundamental right.

Q170From DSSSB TGT Computer Science Practice Set 4
If a child is suffering from dyslexia, the teacher should adopt the following remedial strategy.
  1. Ahelping them to develop their listening skills by tracking the words provided from the audio book / recorded study material / materials
  2. BContinuing the learning process without any modifications
  3. CProviding counting materials such as counters, rulers, etc
  4. DDoing physical exercises showing the directions like left and right
Show answerHide answer

Correct answer: (A) helping them to develop their listening skills by tracking the words provided from the audio book / recorded study material / materials

Explanation

Children with dyslexia struggle with reading text. Audio books and recorded material help them learn by listening while they follow the words.

Q171From DSSSB TGT Computer Science Practice Set 4
In the teaching plan of any subjects, planning lessons according to the timetable using transactional strategies and using appropriate media means-
  1. AImplementation of curriculum
  2. BMeaning of curriculum
  3. CBenefits of curriculum
  4. DAspects of curriculum
Show answerHide answer

Correct answer: (A) Implementation of curriculum

Explanation

Putting the curriculum into practice through timetabled lesson plans, teaching strategies and suitable media is curriculum implementation.

Q172From DSSSB TGT Computer Science Practice Set 4
Which university was established after wood's despatch?
  1. ALucknow
  2. BBihar
  3. CDelhi
  4. DCalcutta
Show answerHide answer

Correct answer: (D) Calcutta

Explanation

Following Wood's Despatch (1854), universities were set up in 1857 at Calcutta, Bombay and Madras.

Q173From DSSSB TGT Computer Science Practice Set 4
A teacher can respond to the interests of children with special needs by following :
  1. ABeing aware of the individual differences of students and creating personalized learning materials
  2. BIgnoring individual differences
  3. CMake them sit separately in the classroom so that they do not mix other children
  4. DAsking other students to address them as underprivileged and express sympathy
Show answerHide answer

Correct answer: (A) Being aware of the individual differences of students and creating personalized learning materials

Explanation

Inclusive teaching means recognising individual differences and adapting or personalising learning materials. It does not mean ignoring, isolating or pitying children with special needs.

Q174From DSSSB TGT Computer Science Practice Set 3
Which of the following is the default scripting language in Active Server Pages (ASP)?
  1. AJavaScript
  2. BPHP
  3. CHTML
  4. DVBScript
Show answerHide answer

Correct answer: (D) VBScript

Explanation

Classic ASP uses VBScript as its default scripting language. JScript can be chosen with a page directive.

Q175From DSSSB TGT Computer Science Practice Set 3
What is the bit rate for transmitting uncompressed 800×600 pixel color frame with 8 bits/pixel at 40 frames/second?
  1. A1536 Mbps
  2. B2.4 Mbps
  3. C15.36 Mbps
  4. D153.6 Mbps
Show answerHide answer

Correct answer: (D) 153.6 Mbps

Explanation

Bits per frame = 800 × 600 × 8 = 3,840,000. At 40 frames/s this is 3,840,000 × 40 = 153,600,000 bits/s = 153.6 Mbps.

Q176From DSSSB TGT Computer Science Practice Set 3
Which of the following algorithms use recursion for sorting an array of integers?
  1. ABubble sort and Insertion sort
  2. BBubble sort and Quick sort
  3. CBubble sort and merge sort
  4. DQuick sort and merge sort
Show answerHide answer

Correct answer: (D) Quick sort and merge sort

Explanation

Quick sort and merge sort are divide-and-conquer algorithms and are normally written recursively. Bubble sort and insertion sort are simple iterative algorithms.

Q177From DSSSB TGT Computer Science Practice Set 3
In which of the topology, each device has a dedicated point-to-point link to a central controller?
  1. AMesh
  2. BBus
  3. CRing
  4. DStar
Show answerHide answer

Correct answer: (D) Star

Explanation

In a star topology every device has its own point-to-point link to a central hub or controller. In a mesh, every device links directly to every other device.

Q178From DSSSB TGT Computer Science Practice Set 3
In single-precision, double precision and extended-precision representation of floating point numbers, as defined by ANSI/IEEE standard 754-1985, the no. of bits used are ______ respectively.
  1. A32, 64 and 80
  2. B32, 64 and 128
  3. C16, 32 and 64
  4. D16, 32 and 80
Show answerHide answer

Correct answer: (A) 32, 64 and 80

Explanation

IEEE 754 uses 32 bits for single precision, 64 bits for double precision and 80 bits for the x87 extended-precision format.

Q179From DSSSB TGT Computer Science Practice Set 3
Additional information sent when an exception is thrown may be placed in ______.
  1. AThe throw keyword
  2. BThe function that caused the error
  3. CThe catch block
  4. DAn object of the exception class
Show answerHide answer

Correct answer: (D) An object of the exception class

Explanation

Corrected: the book's key says (c). The additional information is carried by the exception object that is thrown.

Q180From DSSSB TGT Computer Science Practice Set 3
Consider the following three binary trees, each with 7 nodes. Tree A: root has a left child that is a leaf and a right child X; X has a left child Y and a right child that is a leaf; Y has two leaf children. Tree B: root has a left child L and a right child R; L has only a left child (a leaf); R has only a left child Z; Z has two leaf children. Tree C: root has two children, and each of them has two leaf children (a full tree of height 2). Then A is ______ binary tree, B is ______ binary tree and C is ______ binary tree.
  1. AStrictly, strictly, complete
  2. BComplete, not strictly, strictly
  3. CStrictly, not strictly, strictly
  4. DStrictly, not strictly, complete
Show answerHide answer

Correct answer: (D) Strictly, not strictly, complete

Explanation

Tree A is strictly binary because every node has 0 or 2 children. Tree B is not, because L and R each have only one child. Tree C is a full tree of height 2 with every level filled, so it is complete.

Q181From DSSSB TGT Computer Science Practice Set 3
An interface that provides I/O transfer of data directly to and from the memory unit and the peripheral, is termed as ______.
  1. ADDA
  2. BSerial Interface
  3. CBR
  4. DDMA
Show answerHide answer

Correct answer: (D) DMA

Explanation

DMA (Direct Memory Access) lets a peripheral transfer data directly to or from main memory without the CPU handling each word. The CPU only starts the transfer and is told when it ends.

Q182From DSSSB TGT Computer Science Practice Set 3
The elements of the triangular array are stored as a vector in the order A[1, 1], A[2, 1], A[2, 2], A[3, 1], A[3, 2], A[3, 3] ......... A[n, n]. Assuming that A[1, 1] is stored at location 1, addressing function for A[i, j] is given by:
  1. A(i−1)/2 + j
  2. B((i−1)*i)/2 + j
  3. C(i×i)/2 + j
  4. D(i*j−1)/2
Show answerHide answer

Correct answer: (B) ((i−1)*i)/2 + j

Explanation

Rows 1 to i−1 hold 1 + 2 + … + (i−1) = i(i−1)/2 elements. A[i, j] is the j-th element of row i, so its location is i(i−1)/2 + j. Check: A[1,1] gives 0 + 1 = 1.

Q183From DSSSB TGT Computer Science Practice Set 3
Consider the code segment written below in C++ : if (count < 10)//if#1 if ((count%4) ==2)//if#2 cout<<" condition;white/n"; else//(Indentation is wrong) cout<<" condition is:tan/n"; There are 2 if statements and one else. To which if, the else statement belong?
  1. AIt belongs to if # 1
  2. BIt belongs to if # 2
  3. CIt belongs to both the if statements.
  4. DIt is independent.
Show answerHide answer

Correct answer: (B) It belongs to if # 2

Explanation

In C++ an else pairs with the nearest preceding unmatched if (the dangling-else rule), whatever the indentation. So the else belongs to if#2.

Q184From DSSSB TGT Computer Science Practice Set 3
The number of layers in ISO-OSI reference model is
  1. A5
  2. B7
  3. C9
  4. D6
Show answerHide answer

Correct answer: (B) 7

Explanation

The OSI model has 7 layers: Physical, Data Link, Network, Transport, Session, Presentation and Application.

Q185From DSSSB TGT Computer Science Practice Set 3
In the following pairs of OSI reference layers/sublayers and their functionality, the incorrect pair is
  1. ANetwork layer and routing
  2. BData link layer and bit synchronization
  3. CTransport layer and end-to-end process communication
  4. DMedium access control sublayer and channel sharing
Show answerHide answer

Correct answer: (B) Data link layer and bit synchronization

Explanation

Bit synchronization is done by the Physical layer, not the Data Link layer. Data Link handles framing, error control and flow control. The other pairs are correct.

Q186From DSSSB TGT Computer Science Practice Set 3
What is the maximum number of characters (7 bits + parity) that can be transmitted in a second on a 19.2 kbps line? This asynchronous transmission requires 1 start bit and 1 stop bit.
  1. A192
  2. B240
  3. C1920
  4. D1966
Show answerHide answer

Correct answer: (C) 1920

Explanation

Each character needs 1 start + 7 data + 1 parity + 1 stop = 10 bits. So 19,200 bps ÷ 10 = 1920 characters per second.

Q187From DSSSB TGT Computer Science Practice Set 3
In which layer of network architecture, the secured socket layer (SSL) is used?
  1. APhysical layer
  2. BSession layer
  3. CApplication layer
  4. DPresentation layer
Show answerHide answer

Correct answer: (D) Presentation layer

Explanation

SSL encrypts data and is traditionally placed at the Presentation layer in OSI terms, because encryption and decryption are presentation-layer jobs. It sits between the application and transport layers.

Q188From DSSSB TGT Computer Science Practice Set 3
Which of the following is not a primitive data type?
  1. ABoolean
  2. BByte
  3. CString
  4. DDouble
Show answerHide answer

Correct answer: (C) String

Explanation

In Java, String is a class (a reference type), not a primitive type. boolean, byte and double are primitives.

Q189From DSSSB TGT Computer Science Practice Set 3
The statements string var1[ ]; var1 = new string[3]; system.out.println (var1[1]); print
  1. AAn empty string
  2. BNull
  3. C0
  4. DA garbage character
Show answerHide answer

Correct answer: (B) Null

Explanation

new String[3] creates an array of references, and each element starts with the default value null. So printing var1[1] prints null.

Q190From DSSSB TGT Computer Science Practice Set 3
Every EJB class file has
  1. AOne accompanying interface and one XML file
  2. BOne accompanying interface and two XML files
  3. CTwo accompanying interfaces and one XML file
  4. DTwo accompanying interfaces and two XML files
Show answerHide answer

Correct answer: (C) Two accompanying interfaces and one XML file

Explanation

An EJB (EJB 2.x) bean class comes with two interfaces, the home interface and the remote (or component) interface, plus one XML deployment descriptor (ejb-jar.xml).

Q191From DSSSB TGT Computer Science Practice Set 3
In unit testing of a model, it is found that for a set of test data, at the maximum 90% of the code alone were tested with the probability of success 0.9. Then the reliability of the model is
  1. AGreater than 0.9
  2. BEqual to 0.9
  3. CAt most 0.81
  4. DAt least 1/0.81
Show answerHide answer

Correct answer: (C) At most 0.81

Explanation

Only 90% of the code was tested, and the success probability is 0.9. So reliability is at most 0.9 × 0.9 = 0.81.

Q192From DSSSB TGT Computer Science Practice Set 3
What is the meaning of the following declaration in C programming language? int (*p) [5];
  1. AIt will result in compile error because there should not be any parenthesis, i.e., "int*p[5]" is valid
  2. Bp is a pointer to 5 integers
  3. Cp is a pointer to integer array
  4. Dp is a pointer to an array of 5 integers
Show answerHide answer

Correct answer: (D) p is a pointer to an array of 5 integers

Explanation

The parentheses bind * to p first, so p is a pointer, and that pointer points to an array of 5 ints. Without parentheses, int *p[5] would be an array of 5 pointers to int.

Q193From DSSSB TGT Computer Science Practice Set 3
In the relation R = {(1,2), (2,3)}, the minimum number of ordered pairs that must be added to this set, so that the enlarged relation is reflexive, symmetric and transitive, is
  1. A4
  2. B5
  3. C6
  4. D7
Show answerHide answer

Correct answer: (D) 7

Explanation

Since 1~2 and 2~3, all of 1, 2 and 3 fall into one equivalence class. That needs all 3 × 3 = 9 ordered pairs. R already has 2, so 9 − 2 = 7 pairs must be added.

Q194From DSSSB TGT Computer Science Practice Set 3
The range of the function f(x) = x²/(1+x²) is
  1. A(−∞, +∞)
  2. B(0, ∞)
  3. C(−∞, 0]
  4. D[0, 1)
Show answerHide answer

Correct answer: (D) [0, 1)

Explanation

x²/(1+x²) is 0 at x = 0 and approaches 1 as x grows, but never reaches 1 because x² < 1 + x². So the range is [0, 1).

Q195From DSSSB TGT Computer Science Practice Set 3
A and B are two 8-bit numbers such that A + B ≤ 2⁸. The number of possible combination of A and B is
  1. A2⁹
  2. B2⁸
  3. C2¹⁶
  4. D2⁴ −1
Show answerHide answer

Correct answer: (C) 2¹⁶

Explanation

Answer as per the book's key (c) 2¹⁶ (the original exam key).

Q196From DSSSB TGT Computer Science Practice Set 3
______ is an intermediate storage area used for data processing during the extract, transform and load process of data warehousing.
  1. AInter-storage area
  2. BBuffer
  3. CStaging area
  4. DVirtual memory
Show answerHide answer

Correct answer: (C) Staging area

Explanation

In ETL, the staging area is the intermediate storage where extracted data is cleaned and transformed before it is loaded into the data warehouse.

Q197From DSSSB TGT Computer Science Practice Set 3
______ refers to the amount of time required to position the read – write head of a hard disk on appropriate sector.
  1. ALoad time
  2. BSeek time
  3. CAccess time
  4. DRotational latency
Show answerHide answer

Correct answer: (B) Seek time

Explanation

Seek time is the time to move the read/write head to the correct track. Rotational latency is the wait for the sector to rotate under the head, and access time is the two combined.

Q198From DSSSB TGT Computer Science Practice Set 3
The logic circuit of binary adder which is used to add two 4-bits binary numbers, requires ______ half adder (s) and ______ full adder (s).
  1. A4 , 0
  2. B1 , 3
  3. C2 , 2
  4. D3 , 1
Show answerHide answer

Correct answer: (B) 1 , 3

Explanation

A 4-bit parallel (ripple-carry) adder uses one half adder for the least significant bit, which has no carry-in, and three full adders for the other three bits.

Q199From DSSSB TGT Computer Science Practice Set 3
The 10Base5 cabling is also known as ______.
  1. AFast Ethernet
  2. BThick Ethernet
  3. CThin Ethernet
  4. DGigabit Ethernet
Show answerHide answer

Correct answer: (B) Thick Ethernet

Explanation

10Base5 is the original Thick Ethernet (thicknet): 10 Mbps, baseband, 500 m segments on thick coaxial cable. 10Base2 is Thin Ethernet.

Q200From DSSSB TGT Computer Science Practice Set 3
Which of the following memory improves the speed of execution of a program?
  1. AVirtual memory
  2. BPrimary memory
  3. CSecondary memory
  4. DCache memory
Show answerHide answer

Correct answer: (D) Cache memory

Explanation

Cache memory is a small, very fast memory between the CPU and main memory. It holds frequently used data and instructions, so programs run faster.

How to use these DSSSB TGT / PGT Computer Science questions

Every question here was asked in a real DSSSB TGT / PGT paper; the paper and shift are shown on the card, and the number opens the question on its own page. Try each one before tapping Show answer, then attempt the full DSSSB TGT / PGT papers as timed tests to check your speed under exam conditions.

More DSSSB TGT / PGT subjects