0% found this document useful (0 votes)
46 views4 pages

Comp SC 21

Uploaded by

Masiur Rahaman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
46 views4 pages

Comp SC 21

Uploaded by

Masiur Rahaman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
BMW(O)-CS-1/21 2021 = COMPUTER SCIENCE PAPER Time Allowed — 3 Hours Full Marks — 200 2737 (@) (b) @) () @ (by @ by @ (by Ifthe questions attempied are in excess of he prescribed number, only the ‘questions attempted first up to the prescribed nurnber shall be valued and the remaining ones ignored. Answers may be given either in English or in Bengali ‘but all answers must be in one and same language. Answer Question No. 8 and any six questions from the rest. What is divide-and-conquer recurrence relation? Give a divide-and-conquer recurrence relation for binary search for an element in a search sequence of size n, SH10=15 ‘What are meant by O (7) and 1 (n)? Prove that if FM) = ay 0 + chy. 4 yr a then F(A) = O(n). Check whethern € 0 (n?) or not. 54545215 ‘State Trapezoidal rule. Also obtain the error formula. Why is it called Trapezoidal rule? 5410215 Pay py Fide nese of coast mac of he ven [tf] = 3 5 3th) le Gauss-Jordan method with partial pivoting and hence solve the system. 1s 1401 by the Describe a full-adder. Give its truth table. Implement it with 2-input NAND gates, 15 State and prove De Morgan's Laws. Explain how an OR gate may be constructed with AND and NOT gates. 15 State and explain ( Kirehhoft’s laws, (ii) Thevenin’s Theorem, 15 When a circuit is called resonant? Find expression for series-resonant and parallel-resonant reuits. 15 Define Recursion. Write a recursive algorithm for obtaining terms of a Fibonacci sequence F. 10 What is a binary tree? What do you mean by in-order, pre-order and post-order traversal? Explain, Given below the in-order and pre-order traversal strings of a binary tree, reconstruct the binary tree. Inorder sequence D GBH EAFIC Pre-order sequence A BD G EHC FI 84844220 Please Turn Over 1032 BMW(O)-CS-1/21 (2) 6 # (a) A manufacturenproduces two types of models M, and Mz. Each My model requires 4 hours of grinding and 2 hours of polishing, whereas each M, model requires 2 houts of grinding and 5 hours of polishing. ‘The manufacturer has 2 grinders and 3 polishers. Each grinder ‘works for 40 hours a week and each polisher works for 60 hours a week. Profit on an My ‘model is Rs. 3.00 and on an Mz model is Rs. 4.00. Whatever is produced in a week is sold in the market. How should the manufacturer allocate his production capacity to the two types of ‘models so that he may make maximum profit in a week? Formulate Mathematically. 20 (b) Solve graphically the following L.P.P. Max 3x, +2n Subject to the constraints —2x, +e, $1 wy S2 mtn <3 xm, 20 10 w dof diagrams, explain the meaning of the following operational modes of a communication channel. simplex (Gi) half-duplex i) duplex (iv) broadcast (v) multicast (vi) asymmetric and symmetric 20 (b) Exp (@) character stufing, (ii) bit stuffing. 44343210 ‘what is meant by the term ‘data transparency” and how it may be achieved using 8. Write short notes on (any nvoy 10220 (a) Simplex Method (b) Kamaugh Map Method (©) Newton-Raphson’s Method (€) Reciprocity theorem (e) Modeme BMW(0)-CS-II21 2021 = COMPUTER SCIENCE PAPER-I Time Allowed —3 Hours Full Marks — 200 If the questions attempted are in excess of the prescribed number, only the ‘questions attempted first up to the prescribed number shall be Valued and the remaining ones ignored. Answers may be given either in English or in Bengali but all answers must be in one and same language. Answer any five questions. 1. (@) An identifier is defined as a sequence of letters and digits starting with a letter, Draw transition diagram for the identifier 10 (b) Define FIRST and FOLLOW sets. Si Consider the grammar— tate the rules for computing them, ESTE B+ +TEYe Torr Tre F> @)/id where grammar symbols ate conventional Obiain the FIRST and FOLLOW sets. 545410+10=30 2. (a) Draw a flowchart to describe working of Pass-I of a two-pass assembler. Deseribe the data structures used 15+10=25 (b) What do you mean by coupling and cohesion in a modular system? How are they related to good design? 847215 3. (a) What is meant by a friend class? Give an example, 545210 (b) Distinguish between private and public access specifiers with examples. 10 (©) What is a constructor? State the rules for creating a constructor in C++. What is default constructor? 6+10+4=20 4. (a) Describe different addressing modes of Intel 8085. 15 (b) Explain the following: 10 (@ MVI Gi) SHLD (ii) DAA (iv) RLC () PCHL (©) Write an Intel 8085 assembly language program to accomplish the following: 1s Add the two 8-bit numbers 98H and 9AH in the memory location in 250111 and 2502H respectively and store the results in 2503H and 2504H. 2503H contains LSBs of sum and 2504H contains MSBs of sum, Explain the working. 22738 Please Turn Over 2030 BMW(O)-CS-I/21 @ 5. (a) Design an E-R diagram for airline reservation system consisting of flights, aircrafts, airports, fares, reservatiofs, tickets, pilots, crew and passengers. Clearly highlight the entities, the relationship, the primary keys and the mapping constraints, 20 (b) Consider the following database schema: ‘SUPPLIER (Sid, Sname, Saddress) CUSTOMER (Cid, Cname, Cadd, Cbalance) ITEM (Ino, Iname, Ieolour, Iprice) ORDER (Sid, Cid, Ino, Qty. Qao) Answer the following SQL queries: 2 (i) List names of all suppliers who have supplied at least one red item or at least one green item, (Gi) List the supplicr-id, name of all suppliers, who have supplied all items ordered by “ANIL? (©) Explain 3NF, 2NF with suitable example. 8 6. (a) Explain simple paging and simple segmentation, What are the advantages of segmentation over paging? 545510 (b) Give a formal definition of Deadlock. Mention the form necessary conditions for a deadlock to occur, Distinguish between Starvation and Deadlock. (©) Assume a fixed frame allocation for a process of three frames. The execution of the prox requires reference to five distinct pages. The page address stream formed is 232152453252 Determine the number of page faults for the following page replacement algorithms. Explain your answer. ) Optimal policy i) LRU (ii) FIFO 10 7. (a) What is Cache coherence? Explain the coherence protocol. 541015 (b) The access time of Cache memory is 50 ns. and that of the main memory is 500 ns. It is, estimated that 80% of the main memory requests are for read and the remaining are for write ‘The hit ratio for read access only is 0.9 and a write-through policy is used. (i) Determine the average access time considering only the read cycle. (ii) What is the average time if the write requests are also taken into consideration? 10. (©) Describe the OSI network architecture proposed by ISO. Discuss briefly the functions of each layer. 15 8. Write short notes on (any four) 10x4=40 (a) Process control block (b) Spooting (©) Remote procedure call (d) Demand paging (©) Bresenham’s line drawing algorithm (f) Interrupts

You might also like