Name of the Organisation : Sri Sathya Sai Institute of Higher Learning
Exam : SSSIHL M.Tech Admission Test
Degree : M.Tech
Subject : Computer Science
Document Type : Model Question Paper
Website : https://www.sssihl.edu.in/
Download Model Question Paper : https://www.pdfquestion.in/uploads/25367-M.TechComputer.pdf
SSSIHL M.Tech Computer Admission Test Question Paper
** Click on any of the above links to download the M.Tech Computer Science Question Paper . You will be able to view and save the file in PDF format on your computer.
Related : SSSIHL MBA Admission Test Model Question Paper : www.pdfquestion.in/25363.html
Instructions To Candidates
Part – A :
** PART–A contains 80 objective type items of one mark each. You must enter your answers in the Response Sheet provided)
** Choose the correct answer from the Question Paper and SHADE THE CORRECT RESPONSE viz., A, B, C, D or E) Only one response must be clearly shaded for each question. More than one entry, unclear entries or wrong entries will be considered as wrong answer.
** Please DO NOT WRITE your name or Applicant Id or the answer in the QUESTION PAPER BOOKLET.
** You can take maximum of 80 minutes to respond to the PART-A.
** At the end of 80 minutes, you must hand over the PART-A booklet along with the response sheet to the invigilator. You will be given Part-B after this.
Part A
Multiple choice Questions (Marks: 80 x 1 = 80)
Sample Questions :
Computer Architecture
1. Which speedup could be achieved according to Amdahl´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel?
A.10
B. 5
C. 25
D. 50
E. 20
2. Instruction pipelining: After which total execution time is the result of the second task entering the pipeline above ready?
A. 38 ns
B.33 ns
C. 36 ns
D. 37 ns
E. None of these
3. A program runs on a 2 GHz computer C1 in 10 seconds. If the same program has to run in 6 seconds on a computer C2 which takes 1.2 times more clock cycles than C1 then what should be the clock rate of C2?
A. 3 GHz
B. 4 GHz
C. 3.6 GHz
D. 4.2 GHz
E. 3.2 GHz
4. Snooping cache protocol: In which case is the main memory not up-to-date?
A. Write-through caches: After writing to shared data
B. Write-back caches: Cache data marked as exclusive
C. Write-back caches: Cache data marked as modified
D. Write-back caches: Cache data marked as shared
E. All the case of C and D.
5. Interrupts can generate (i) when a device or port is ready (ii) when a timer timeouts (iii) on clock inputs in the system (iv) when a software run-time exception condition is detected (v) when a device or port completes its function (vi) when software interrupt instruction to signal execution of ISR is executed (vii) on return from an interrupt service routine (viii) a key is pressed at keypad (ix) a menu is selected from graphic user interface on touch screen.
A. i, ii, iii, iv and v
B. iii, vii and viii
C. all
D. i, iii, v and vii
E. all except iii and vii
Systems
1. Five batch jobs A through E arrive at a computer centre at almost the same time. They have estimated running times of 10, 6, 2, 4 and 8 minutes. Ignoring process switching overhead and assuming a multi programmed system where each job gets its fair share of the CPU, the mean turnaround time by round robin scheduling is
A. 21
B. 22
C. 23
D. 24
E. 25
2. Consider the decimal virtual address 20000. The virtual page number and offset for a 8-KB page is
A. (2, 3615)
B. (4, 3616)
C. (4, 3615)
D. (2, 3616)
E. (3, 3616)
3. OPTAB is generally organized as a
A. Dynamic Hash table
B. Doubly Linked List
C. Static Hash table
D. Binary Search tree
E. Dynamic STACK
4. The only parts of the program that require modification at load time are those that specify — addresses.
A. PC-Relative
B. Base-relative
C. Immediate
D. Direct
E. All of the above
5. One of the following is not machine-independent compiler optimization technique:
A. Elimination of common sub expression
B. Removal of loop invariants
C. “Reduction in strength” strategy
D. Loop unrolling and jamming
E. Re-arranging quadruples before generating machine code.
Computer Networks
1. Which of the following statement is correct? Buffering is:
A. the process of temporarily storing the data for small variation in device speeds
B. a method to reduce cross-talks
C. a method to reduce routing overhead
D. the storage of data within the transmission medium until the receiver is ready to receive.
E. Permanent storage for routing tables
2. Match the following:
P: SMTP 1.Application Layer
Q: BGP 2. Transport Layer
R: TCP 3.Data Link Layer
S: PPP 4. Network Layer
5. Physical Layer
A. P-2,Q-1,R-3,S-5
B. P-1,Q-4,R-2,S-3
C. P-1,Q-4,R-2,S-5
D. P-2,Q-4,R-1,S-3
E. P-1,Q-3,R-2,S-4
3. Consider the a network with 6 routers R1 to R6 connected with links having weights as shown in the table.
R1-R2 = 6, R1-R3=3, R2-R3=2, R2-R4=7, R3-R5=9, R4-R5=1, R4=R6=8, R5-R6=4
All the routers use the distance vector based routing algorithm to update their routing tables. After all the routing tables stabilize, how many links in the networkOne of the header fields in an IP datagram is the Time-to-Live 9TTL) field. Which will never be used for carrying data?
A. 4
B. 3
C. 5
D. 1
E. 2
4. Slotted ALOHA
A. Divides time into discrete intervals
B. Requires global time synchronization.
C. Bath (A) and (B)
D. Collision detection is not present
E. Works efficiently with multiple active nodes.
5. DNS is used to locate
A. MAC address of URL
B. IP address of URL
C. Root domain of URL
D. Domain name of URL
E. IP addresses of all nodes in Tier-1
Data Structures & Algorithms
1. Which of the following data structure is non-linear type?
A. Strings
B. Lists
C. Stacks
D. Trees
E. Queues
2. Which of the following data structure is based on the Last In First Out policy
A. Queue
B. Stack
C. Array
D. Linked List.
E. Vector
3. For which of the following problems is the greedy approach not optimal.
i) Travelling Salesman,
ii) Knapsack,
iii) Single source shortest path,
iv) Minimum spanning tree
A. i only
B. ii only
C. iii only
D. iii and iv
E. i and ii
4. A binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
A. log2n
B. n
C. n-1
D. 2n
E. n2
5. A variable P is called a pointer if
A. P contains the address of an element in DATA
B. P points to the address of the first element in DATA
C. P can store only memory addresses
D. P contains the DATA and the address of the DATA
E. none of the above
Part – B
Note :
** You are required to write your (i) Applicant Id and (ii) Question Paper Code no. and SHADE THE NUMERALS appropriately in the space provided on the RESPONSE SHEET. You are also required to write the (iii) Room number and (iv) Date in the space provided separately.
** PART-B contains 9 short answer questions for a total of 40 marks. Part-B is to be answered within the space provided for in the question paper itself.
** You can take a maximum of 40 minutes for responding to PART-B. At the end of 40 minutes, PART-B booklet should be handed over to the invigilator.
Short Answer Questions
Sample Questions :
1. short answer questions :
1. [4 marks] For each of the following statements about making a change to a cache design, circle True or False and provide a one sentence explanation of your choice. Assume all cache parameters (capacity, associativity, line size) remain fixed except for the single change described in each question. Please provide a one sentence explanation of your answer.
(A). Doubling the line size halves the number of tags in the cache. (T/F)
(B) Doubling the associativity doubles the number of tags in the cache. (T/F)
(C) Doubling cache capacity of a direct-mapped cache usually reduces conflict misses. (T/F)
(D) Doubling cache capacity of a direct-mapped cache usually reduces compulsory misses. (T/F)
2. [4 marks] Give the following results for the given binary tree
a) Preorder traversal
b) Postorder traversal
c) Inorder traversal.
3. [4 marks] Consider the bank database given as:
branch(bran_name, branch_city, assets)
customer (customer_name, customer_street, customer _city)
loan (loan_number, branch_name, amount)
borrower (customer_name, loan_number)
account (account_number, branch_name, balance )
depositor (customer_name, account_number)
Write an SQL trigger to carry out the following action:
On delete of an account, for each owner of the account, check if the owner has any remaining accounts, and if he/she does not, delete him/her from the depositor relation.
4. [4 marks] Write a brief note on CDMA .
5. [4 marks] Consider a 7200-rpm disk with a track-to-track seek time of 1msec. The disk has 200 sectors of 512 bytes each on each track. What is the maximum data rate in MB/sec for the disk?
6. [5 marks] Find the kernel and image of the linear transformation T: R2?R3 given by T (a,b) = (a,b-a,b).
7. [5 marks] For the experiment of rolling a die once, the probability distribution for the random variable, number of dots on the final upward face, is a discrete uniform probability distribution. Determine
a) the probability function
b) the mean
c) the variance
d) the standard deviation
e) the parameter
f) P(3=X<5) [1+1+1+0.5+0.5+1]
8. [5 marks] Is the following argument valid? Justify your reasoning using propositional logic.
I. If it rains, the street will be wet
II. The street is wet.
III. Therefore it rained.
9. [5 marks] Calculate the volume of the surface z=x+2y over the rectangle (limits of integration) given by D= ({x,y}:1=x=2 and 3=y=5).