# 14
| |||

| |||

Re: BPUT Previous Year Question Papers
The previous year question paper of Biju Patnaik University of Technology (BPUT) for preparation of B.Tech Computer Science Examination is as follows: Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? (A) O (1) (B) O(log n) (C) O(n) (D) O(n log n) A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero? (A) This algorithm is equivalent to the first-come-first-serve algorithm. (B) This algorithm is equivalent to the round-robin algorithm. (C) This algorithm is equivalent to the shortest-job-first algorithm. (D) This algorithm is equivalent to the shortest-remaining-time-first algorithm. 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 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. Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. 2. Turing recognizable languages are closed under union and complementation. 3. Turing decidable languages are closed under intersection and complementation. 4. Turing recognizable languages are closed under union and intersection. (A) 1 and 4 only (B) 1 and 3 only (C) 2 only (D) 3 only Question Paper BPUT for B.Tech Computer Science Examination
__________________ Answered By StudyChaCha Member |

# 16
| |||

| |||

Re: BPUT Previous Year Question Papers
Biju Patnaik University of Technology was created by an act of the Odisha state legislature in November 2002. It is the state technical university of Odisha. Please find the below attached file for the BPUT Civil engineering 3rd semester question papers: BPUT Civil engineering 3rd semester question paper1BPUT Civil engineering 3rd semester question paper2Contact:Biju Patnaik University of Technology (BPUT) Chhend Colony, Rourkela, Odisha-769004, Phone : (0661) 2482556, Fax : (0661) 2482562, Email: students[at]bput[dot]ac[dot]in (for Students Enquiry), Email: bput@bput[dot]ac[dot]in (for Colleges Communication) |