Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
46 views
4 pages
Comp SC 21
Uploaded by
Masiur Rahaman
AI-enhanced title
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
Download
Save
Save comp-sc-21 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
0 ratings
0% found this document useful (0 votes)
46 views
4 pages
Comp SC 21
Uploaded by
Masiur Rahaman
AI-enhanced title
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
Carousel Previous
Carousel Next
Download
Save
Save comp-sc-21 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
Download
Save comp-sc-21 For Later
You are on page 1
/ 4
Search
Fullscreen
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 1032BMW(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) ModemeBMW(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 2030BMW(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
MCS-202 2025 PGDCA New GSPH@9891268050
PDF
100% (1)
MCS-202 2025 PGDCA New GSPH@9891268050
52 pages
End Term DA2
PDF
No ratings yet
End Term DA2
75 pages
Examinations,: Nizam College (Autonomous) Semester
PDF
No ratings yet
Examinations,: Nizam College (Autonomous) Semester
33 pages
Edexcel GCSE Paper 1 - Principles of Computer Science
PDF
No ratings yet
Edexcel GCSE Paper 1 - Principles of Computer Science
15 pages
II PUC Computer Science Mock Paper - 2
PDF
No ratings yet
II PUC Computer Science Mock Paper - 2
3 pages
PMSCS
PDF
50% (4)
PMSCS
2 pages
Coursepoint 20221017200206
PDF
No ratings yet
Coursepoint 20221017200206
9 pages
Computer Architecture-2-Marks-Imp-Questions
PDF
No ratings yet
Computer Architecture-2-Marks-Imp-Questions
6 pages
R16 Model Papers CST
PDF
No ratings yet
R16 Model Papers CST
24 pages
CSS Past Papers: Subject: Computer Science
PDF
No ratings yet
CSS Past Papers: Subject: Computer Science
4 pages
Computer Science B.SC - .Prog - .Sem - Nov Dec 2016
PDF
No ratings yet
Computer Science B.SC - .Prog - .Sem - Nov Dec 2016
98 pages
Quespaper Oldpattern
PDF
No ratings yet
Quespaper Oldpattern
77 pages
Question Banks
PDF
No ratings yet
Question Banks
74 pages
Computer Science
PDF
40% (5)
Computer Science
10 pages
B.C.A (Science) 2019 Pattern
PDF
No ratings yet
B.C.A (Science) 2019 Pattern
46 pages
June 2024 0795 Computer Science P1
PDF
No ratings yet
June 2024 0795 Computer Science P1
5 pages
FY Computer-Science Question Paper 2015
PDF
No ratings yet
FY Computer-Science Question Paper 2015
90 pages
M.C.A Engg 2019 - A
PDF
No ratings yet
M.C.A Engg 2019 - A
62 pages
Sem 5 IT 20 19 To 2022 Pyqs
PDF
No ratings yet
Sem 5 IT 20 19 To 2022 Pyqs
99 pages
It PDF
PDF
No ratings yet
It PDF
56 pages
6436-Question Papers of Two Year M. Tech I Semester Supplementary Examinations September - 2012
PDF
No ratings yet
6436-Question Papers of Two Year M. Tech I Semester Supplementary Examinations September - 2012
32 pages
Comp Insem Apr22
PDF
No ratings yet
Comp Insem Apr22
22 pages
II PU Quaterly Test - Sample QP
PDF
No ratings yet
II PU Quaterly Test - Sample QP
2 pages
CS 2013
PDF
No ratings yet
CS 2013
24 pages
Mcoa011 Main Exam Paper 2017
PDF
No ratings yet
Mcoa011 Main Exam Paper 2017
10 pages
Sem 6 Midterm Papers
PDF
No ratings yet
Sem 6 Midterm Papers
25 pages
Merged Pdfs
PDF
No ratings yet
Merged Pdfs
15 pages
2020 Pyq
PDF
No ratings yet
2020 Pyq
8 pages
Group A: SUMMER 2005 Computing and Informatics
PDF
No ratings yet
Group A: SUMMER 2005 Computing and Informatics
37 pages
B.SC (Cyber and Digital Science) 2020 Pattern
PDF
No ratings yet
B.SC (Cyber and Digital Science) 2020 Pattern
10 pages
Comp SC 19
PDF
No ratings yet
Comp SC 19
10 pages
Selfstudys Com File
PDF
No ratings yet
Selfstudys Com File
5 pages
Ii - Puc - Model Papers 2023 - 2024 Read Only
PDF
No ratings yet
Ii - Puc - Model Papers 2023 - 2024 Read Only
16 pages
2023-O-Computer Science 24082112547
PDF
No ratings yet
2023-O-Computer Science 24082112547
5 pages
Computer SC I&II
PDF
No ratings yet
Computer SC I&II
8 pages
Cst308 Comprehensive June 2022
PDF
No ratings yet
Cst308 Comprehensive June 2022
7 pages
5th Sem Paper
PDF
No ratings yet
5th Sem Paper
7 pages
0795 A - LEVEL Computer SC P1
PDF
No ratings yet
0795 A - LEVEL Computer SC P1
5 pages
Wbslet 15798-CompScApp - (X) - 19-Final
PDF
No ratings yet
Wbslet 15798-CompScApp - (X) - 19-Final
20 pages
Comp SC 18
PDF
No ratings yet
Comp SC 18
8 pages
Technical Paper 20220217 194909
PDF
No ratings yet
Technical Paper 20220217 194909
6 pages
Btech Eie 4 Sem Computer Organization and Architecture 2009
PDF
No ratings yet
Btech Eie 4 Sem Computer Organization and Architecture 2009
6 pages
Subject Code: 22: Signature of Invigilator
PDF
No ratings yet
Subject Code: 22: Signature of Invigilator
20 pages
Sem 3 Major
PDF
No ratings yet
Sem 3 Major
5 pages
V Sem Cse Second Sesional
PDF
No ratings yet
V Sem Cse Second Sesional
10 pages
Review CSI104
PDF
No ratings yet
Review CSI104
6 pages
Course Code: IT352 Course Name: COMPREHENSIVE EXAM (IT) : College of Engineering Vadakara
PDF
No ratings yet
Course Code: IT352 Course Name: COMPREHENSIVE EXAM (IT) : College of Engineering Vadakara
7 pages
Review CSI104
PDF
No ratings yet
Review CSI104
6 pages
Gen TH PDF
PDF
No ratings yet
Gen TH PDF
7 pages
Bhaktapur
PDF
No ratings yet
Bhaktapur
4 pages
Cst308 Comprehensive Course Work, June 2022
PDF
No ratings yet
Cst308 Comprehensive Course Work, June 2022
7 pages
June 2009 Ugc Net Computer Science Solved
PDF
No ratings yet
June 2009 Ugc Net Computer Science Solved
21 pages
595 Computer Science 2 North West Regional Mock 2022
PDF
No ratings yet
595 Computer Science 2 North West Regional Mock 2022
2 pages
Prep2 Cs
PDF
No ratings yet
Prep2 Cs
4 pages
3rd Annual Exam 2024
PDF
No ratings yet
3rd Annual Exam 2024
3 pages
XIComp
PDF
No ratings yet
XIComp
2 pages
Cs Kseeb Preboard 24-25
PDF
No ratings yet
Cs Kseeb Preboard 24-25
2 pages