My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2013 [Session 4]

Review the key details, then start the test when you are ready. You can also open the full package to see related papers.

Questions 65
Duration 180 mins
Package Computer Science & Information Technology (CS) - Previous Year Papers

Paper pattern & analysis

Filter this paper by subject, topic or subtopic. Every graph updates from the selected questions.

Explore previous papers
Showing all 65 questions in this paper.

Subject distribution

No subject classification is available.

Topic distribution

No topic classification is available.

Subtopic distribution

No subtopic classification is available.

Difficulty distribution

Easy 65 100%

Question type distribution

Multiple Choices 65 100%

Instructions

Computer Science & Information Technology (CS) 2013 [Session 4] – Instructions
  • Total number of questions: 65
  • 30 questions carry one mark each
  • 35 questions carry two marks each
  • Negative marking: 1/3 of the marks allotted to the question
  • Use of calculator is allowed
  • This is a proctored examination
  • All other browser applications will be automatically closed
  • After three warnings, the examination window will close automatically

Syllabus

Full Syllabus

Sample questions from this paper

Questions are selected across the paper subjects wherever the paper contains that variety.

1
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 4]
Q.1 – Q.25 carry one mark each.

The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are

A
TCP, UDP, UDP and TCP
B
UDP, TCP, TCP and UDP
C
UDP, TCP, UDP and TCP
D
TCP, UDP, TCP and UDP
2
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 4]

Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.

Question diagram

A
Network layer – 4 times and Data link layer – 4 times
B
Network layer – 4 times and Data link layer – 3 times
C
Network layer – 4 times and Data link layer – 6 times
D
Network layer – 2 times and Data link layer – 6 times
3
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 4]

An index is clustered, if

A
it is on a set of fields that form a candidate key.
B
it is on a set of fields that include the primary key.
C
the data records of the file are organized in the same order as the data entries of the index.
D
the data records of the file are organized not in the same order as the data entries of the index.
4
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 4]

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b, and c; process Y executes the P operation on semaphores b, c, and d; process Z executes the P operation on semaphores c, d, and a before executing the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on these three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?

A
X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
B
X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
C
X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
D
X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(c)P(a)P(d)
5
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 4]

Which of the following statements is/are FALSE?

A
For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
B
Turing recognizable languages are closed under union and complementation.
C
Turing decidable languages are closed under intersection and complementation.
D
Turing recognizable languages are closed under union and intersection.
6
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 4]

Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirected graph is in P. 2. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

A
1, 2 and 3
B
1 and 2 only
C
2 and 3 only
D
1 and 3 only