UTpaper

Free mock tests & test series

FreePractice Set· Practice Sets

DSSSB TGT Computer Science Practice Set 4

Attempt DSSSB TGT Computer Science Practice Set 4 online for free for exam practice: 100 questions, 60 minutes, 1/4 negative marking. Questions with instant score, all-India rank and detailed solutions on UTpaper.

  • 100 Questions
  • 100 Marks
  • 60 Minutes
  • English
  • 6 attempts
Attempt test free →Questions with answers

About DSSSB TGT Computer Science Practice Set 4

This practice set for DSSSB TGT has 100 questions in 60 minutes with 1/4 negative marking. Use it to revise the syllabus topic by topic and compare your rank with other aspirants. It is one of 19 free tests in the DSSSB TGT Computer Science Mock Test & Previous Year Papers.

Sample questions from this test

Q1
The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of lists could be used?
  1. ASingly linked list
  2. BDoubly linked list
  3. CCircular doubly linked list
  4. DArray implementation of list
Show answer
Q2
Match List-I with List-II and select the correct answer using the codes given below the Lists: List-I A. All-pairs shortest path B. Quicksort C. Minimum weight spanning tree D. Connected components List-II 1. Greedy 2. Depth-first search 3. Dynamic programming 4. Divide and conquer Codes: A B C D
  1. A2 4 1 3
  2. B3 4 1 2
  3. C3 4 2 1
  4. D4 1 2 3
Show answer
Q3
Which of the following algorithms solves the all-pairs shortest path problem?
  1. ADijkstra's algorithm
  2. BFloyd's algorithm
  3. CPrim's algorithm
  4. DWarshall's algorithm
Show answer
Q4
Which of the following sorting algorithms has the worst time complexity of nlog(n)?
  1. AHeapsort
  2. BQuicksort
  3. CInsertion sort
  4. DSelection sort
Show answer
Q5
Which of the following topologies gives highest reliability ?
  1. AMesh topology
  2. BBus topology
  3. CStar topology
  4. DRing topology
Show answer

Attempt the full test to answer all 100 questions under the real time limit, or read all 100 questions with answers.

How to attempt

  1. Click “Attempt test free” and sign in with Google or your UTpaper account.
  2. The timer starts at 60 minutes. Use the question palette to move between questions and mark questions for review.
  3. Submit when done. You get your score, accuracy and all-India rank instantly, with the solution for every question.

Frequently asked questions

Is the DSSSB TGT Computer Science Practice Set 4 free to attempt?
Yes. The test is completely free on UTpaper. Sign in with Google or create a free account, click Attempt test, and your score, rank and solutions appear as soon as you submit.
How many questions and how much time does this test have?
The test has 100 questions for 100 marks and must be finished in 60 minutes. Each wrong answer deducts 1/4 mark.
Can I reattempt the test and see solutions?
Yes. After submitting you see the correct answer and explanation for every question, your accuracy, section-wise marks and all-India rank. You can reattempt as many times as you like.

More in this series

Other DSSSB TGT tests

View all 19