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)
58 views
25 pages
Sem 6 Midterm Papers
Uploaded by
Anushree kumawat
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 Sem 6 midterm papers For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
58 views
25 pages
Sem 6 Midterm Papers
Uploaded by
Anushree kumawat
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 Sem 6 midterm papers For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 25
Search
Fullscreen
Qn wo o +02, @ ENT OF COMPUTER SCIENCE & ENGINEERING College af Tech nlogy & engineering Mrua't, Vdaipar Mid-term examination (2018-19) 324: Computer Networks TIONS ARK COMPULSORY ime duration: thr Maxinnint ms Ivan 11% datagram, the ME Dili the value uf HLF is IU, the value of total tenth Is 400, (2.5) he position of the datagram, the sequence numbers anid the fragment offset yulue ix 300, oF the Frxt ad the Last bytes nf the py iytom, reapectively will be A ronter header of 20 bytes, The vnlue AF MF and affset of the 3rd fragment is Consider n network with five nudes, NI to NS, ns shown below. uctwork uses a Distnnee Veetor Routing protocol, Once the routes have stabil nce veetars at different moides are as following, . NS: (43.6.4,0) ‘The cost of link N2-N3 reduces to 2(in hnth directions), After the nex what will be the new distaneo veetor at node, N3? How ICMP packet will help the sourec tn know about the bottlenes used withia the predefined path/nctwurk so that fragmentation reduced/climinated? address is 10.6.7.2, destination IP uddress is 12.15.64, datagram, Compute the value of the header checksum, Scanned with CamScanner ih MTU of 1924 bytes has veceived an I" packed of size 4240 bytes with an IP (2.8) 7 iof the Aaamination 2007, "he Four Ve gfe Begoce Ce Esato 207-48 Date ising | (Campoter Science), MID TERM time: 1 Hour CS 322 microprocessors, inioyfacing and applications Maxinvun Marks: 20 ‘Attempt any 4 questions i Q.1 Explain the architecture of 8086 microprocessor with the help of block diagram Q.2 why segmentation is necessary in higher processors? Explain the generation of physical address in each segment of 8086 microprocessor. ! Q.3 Explain any 5 addressing modes supported by 8086 with suitable examples, Q.4 Compare 8088 microprocessor with 8086 [ain 9.5 List and explain various types of data tran} fer instructions in B86 ___ ASS a, Scanned with CamScanner‘Time duration: thr Marks Cos Qt. Explain rs of OSI model with thei Covered devices and protects ateery ages Seaton, Sor Q2. For IP address 156.17.23.15, construct 8 sub 17.23.15, construct 8 subnets, 5 Give subnet id, broadcast address and range of sy oe ress and range ofeach subnet ) + Q3. Differentiate hub, routers and switches on\basis of broadcast tb a onasis of brow 25 cot ©), domain and clision domain. r a iat Is subnet mask and wh (ey nask is given as 25 eos Qa ual cireuit and datagram network. 5 cor Q5. (a) Host A (on TCPAP v4 network A) sends an 3 03 @TTL (ii) Checksum (iii) Fragment Offset (b) What is the difference between record route and trace 2 co3 Toute? lustrate it with example. Scanned with CamScannery HP TERA EN aan PON (Max Marks 20) U1 year SUHIECT Operate A2OUT-ED), parr, a en _ (col) ciference between mulliprogeamoing and | © Q2 5. finan . jeration for an operating syste 5 | «coy ee erating syst 6) Qs Evplain the term system a (COL) | emieetsinediaivp nil. Explain tt proces of how system eas ne 6 | shed i “the OS with the help of appropriate block diagrams PART H (@ question out of 3 arg required to be done in pxet 11 \ va with the help ofan example (ue 8) (OS. | baplain the Shortest nt ¢ olive stesso AB (COL. seheduling) with the help of an sxembe Obs typlain tie use ut busy salting ga reking pe of semaphores, ais epIAIN We SOAK | GY ve (EOI) ok wait & sig non thesdtyp® ot alQ) operat Scanned with CamScannerrath mds (a+b te nd Wlst-ale the ouipat of eas | ~~} Describe the error recovery sehen descent parser Tor the flowing grammar wing] recursive funetions: a "This question coneeras the following Bra addresses: jeer ; Air — Name @ Name it a 4 aa For example, this could generate the addresses | idiid taidaieiaiaid Name» Pp iad This grammar, as w climinate all LL(1) conficts. - Gi) Construct the FIRST and FOLLOW¢ts for all nonterminals in ‘your rewritten grammar. cor Scanned with CamScannerDEPARTMENT OF comput ER Se College of Technology & MPUAT, CS 323: DESIGN ND ANA YSIS ga 2. AND ANALYSIS OF ALG. ‘Time: One hour Marine ORTH Cr Attempt any)4 questions itz 340) co Satisfied Marks | Compare the functions: 5 cor he fin) = nie" and g(a) =n log n 2. fin)=Vlogn and a(n) = tog then Find out the complexity of the following: 5 cor 4. for (i=n2; ten; +4) Sor(j=lzj
TE BO TEE ror Po eppye Pa Scanned with CamScannerQs Verify the following grammar is LI SAB A> abibcied'ng B— bbcd/bd the following grammar is L1,(1) oF not, LR(O) or not, SLA(1) or not, 05 CCLRC) oF nol, LALR(I) or not, S™ AabAcBeBa Bh Ard ot Bod ea by Also find no, of states in LR(O) parsing table, SLR(1), LALR() & CLR(I) and how many number of confit states are there in each parsing tabic. 33 Scanned with CamScanner“et Sek AUD TERM FXAMIN ATION HA sear (VE Semester Weck CSP 2018.17) DATE: Toxo “ What ts the difference between process & _ ehate me difference between preemptite & sun preemptive scheduling as =F aptain the Rownd Retin procers scheduling math the help of am example s) What information rs coptained in process 6 Haptann tiiefly the proces st Scanned with CamScanner“Thind Year B.Tech, of the Four Year Integrated Degree Course Examination 201617 ce & Engineering and Information Technology MID TERM: C5326 SOFTWARE ENGINEERING, Date: 6/03/2017 ‘Time: 1 Hours “Answer any four questions, Hach of $ marks ‘Maximum Mark: 20 ] Explain Extreme Programming agile process model and pair programming: _ Lak why it is difficult to gain a clear understanding of what the customer wants in requirement engineering phase, Tiow to determine whether a potenti 7 What is component level design, discuss the guidelines 5] Compare the prescriptive process model ia tabular form, ‘lass should. in [act become an analysis class < as each software component is developed Scanned with CamScannerAT Sean a BEI Vracst Mid Term ¥saminatian Yow Marka: 20 B.L. Third Year Computer Science & Unginecring, 2016-17 Design ane Analysis of Algorithms (C5323) Attempt any four questions, Al questions carry equok marks =O) ine the perfor ace oo atch sth a Best Q2 Wate akgorthm for Ineapy sit ane expLin 403 Desuttbe Strassctt's istating maallplay tt i QS Explain dynanny prop QE Construct a recursion t Ten Tint sen Scanned with CamScannerRall No incering ), Semester-I Principles of Campiler Design (CS-321) Tin : One hour Maximum Marks: 20 Aticmpt any FOUR questions Name the input scheme which is useful when look ahead on input is necessary to identify tokens. Explain the fook- ahead code with sentinels to advance the forward pointer. Why this code is preferred’? Explain analysis-synthesis model of compilation with the help of diagram. Show the outcome after cach phase for the statement ToX*V*RNO0+A-B Note: 2, %, Ye, A, are flost variables, Considet Grammar G 5 S-MejDe Babies Dodie (a) Construct FIRST and PO1.1OW Sets. (b) Apply algorithm to implement parse table ‘Consider the Grammar G given below x S—>AsAb S-+ hE Ase noe Construct canonical collection of sets of LR (0) iteme for G" Write the al for constructing precedence functions. Apply this algorithm to create th table. (Cperator precedence reletion is piven) precedence graph and s Scanned with CamScannerScanned with CamScanner4 Third Vear B.Tech of the Four Year Integrated Degree Course Examination 201 (Computer Science & Engineering), MID TERM Time: I Hour C8322 Microprocessors, Interfacing And Applications Maximum M: Attempt any 4 questions, All questions carry equal marks. + Q.1 Explain CPU Architecture of 8086 and also explain formation of Physical Address by suitable cumple. + Q2 What do you mean by Addressing Mode? Calculate Fflective Address and Physical Address for all the data related addressing modes where (BX) = 0188 (DI)=10AS—_ Displacement = BST (DS)= 2100 __ 3 Fxplain 8088 and compare it with S086 microprocessor, Q.4 What are the advantayes of Segmented Memory in 8086 and also give the difference when first Instruction has an even address or an odd address, Q.§ Perform Packed HCD Addition on 9 and 6 and also explain Flag Manipulation Instructions. $0.6 Write short note on Shift and Rotate Instructions, Scanned with CamScannerMID-TERM EXAMINATION COMPUTER NETWORKS €3224 | "| Expiain tink state routing "| Explain orobiem of Routing Loop in Distance vector routing. |_ How Solithoricon method is different from Split horizon with poison reverse? "Explain virtuat Cur through and Wormhole Switching, i | Fapiain any traffic shaping method U© AT An address ina block is given as 73.22.1725, Hind the nuriber of addresses in Hi block, the first address, and the last address : What 1s Retwork mask and what is the use of it for router 5 [cf Describe three tovel addressing. a i Fp ipa1a7 14.24.24 Form 12 subnets give network address, broadcast address and 2 ranges of each subnet block why OSPF [LOR uh Sue parm Rolin doo, Trellanm é€ Scanned with CamScannerua“ 3. 4 5 Third Year B.E. of the Four- ¥¢ (Com Desi Time: One hour Use Strassen’s algorithm to compute the matris Anl3. B=68 15 42 Midterm Examination uter Science and Wand Analysis of Algorithn Attempt any FOUR questions. ix product. Mustrate the operation of Heap sort on the array{4,1,3,2.16,9,10,148,7} Explain substitution method for solving recurrence. Do analyses of Merge sort, Solve the recurrence T(n) = 3T(w/4) +n? usin 1g Fecursion tree, ‘car Integrated Degree Course Examination, 2018-2019. igineering) Semester-IT (CS-323) Maximum Marks: 20 Scanned with CamScanner-Q!_ Explain architecture of $086 microprocessor ©) (on QF Explain difterent :ypes of addres 3 Explain modes of operation of 8086 microprocessor Also draw timing diagram for maximum mode 18 mode of 8086 microprocessor (Cor h operation (8) (C03) \% Explain instruction format of 8086 microprocessor. () (Coa) 05 @) Difference b/w 8088 and 8086 microprocessor. 25) (Co2) (®) Short note on 80286 and 80386 microprocessor 25) (Cos) Scanned with CamScannerMID TERM EXAMINATION (Max Marks=20) ILL year (V1) Semester — B.Teeh-CSE (2018-19) SUBJECT ; Operating System (C8325) ‘ach Part is of 1) marks each —_ PARTI . | Explain the significance of dual made of uperaiion for an operating system, ® (Co) ees a Q2 Explain sve term system call. Explain the process of how syslem calls are ® |_(CO1) | eatertsinediispatched by the OS with the help of appropriate block diagrams. | PART IT \ it the help of an example ® pe of semaphores, also exp! semaphores. Scanned with CamScanneran ee - SS grated Degree Course Examination 2018-19 in Technology ‘Third Vear B.Tech. of the Four Year Int ‘Computer Science & Engineering and Inform: SGINEERING, Date: 6/03/2019 MID TERM: CS326 SOFTW RE ED ‘Timer 1 Hours ‘Answer any four questions. Each of 5 marks ximum Mark: 20 1 [Daline Software Engineering, Mention at least two reasons as to why classical waterfall model can be considered impractical and cannot be used in real projects Explain the sieps of initiating the requirement engineering process. 7 [Explain the Sequence diagram and Class diagram with an example. — JA | Explain Extreme Programming agile process model and pair programming. OR What is Agile model — advantages, disadvantages and when to use it? 5 | Identify at least two activities carried out during each phase ofa spiral model. Scanned with CamScannerRoll No. -_#2— Course No. : CSE321 Third year of the Four Year Integrated Degree Course, 2019-20 Semester I CSE-321 Principles of Compiler Design ‘Time: 1 Hour Maximum Marks: 20 “Do not write anything on question paper except Roll Number Attempt all questions Qi What are the phases of a compiler? Explain the function of each phase in 05 brief. Q2 Identify number of tokens generated by Lexical Analyzer for the following 02 C-program. nt min {int a, int b) > ib ? while(a>by . a n t A 7 primf.(“a is greater "J; + 5 printh(i%%d, a);- Q3_ a) Calculate First and Follow of each Non-Terminal corresponding to the 03 following grammar. E> TE E> TEE T> Fr TS serve FF id Q4 Construct operator precedence parsing table for the following grammar , 02 - Scanned with CamScannerQ5 a) b) S>T*P TO T*U/U P+ Q+P/Q Q> id U+ id Verify the following grammar is LL(1) or not, LR(0) or not, SLR(1) or not, 05 CLR(1) or not, LALR(1) or not. S—> Aa/bAc/Bc/bBa Ard . Bod et oy) a) 13/0 Also find no. of states in LR(0) parsing table, SLR(1), LALR(1) &CLR(1) gg and how many number of conflict states are there in each parsing table. Scanned with CamScannerDEPARTMENT OF COMPUTER SCIENCE & ENGINEERING College of Technology & engineering MPUAT, Udaipur ‘Mid-term examination (2019-20) CS 324: Computer Networks ‘Time duration: br Maximum marks: 20 QU. a) In the network 143.128.67.235/20 if x represent the decimal value of 3% octet and y represent the (2.5) decimal value of 4” octet of last IP address assign to any host ,than value of x * y is_49%284 -* p) How ICMP is being used for MTU Path Discovery? (2.5) 2. State True/False to the following statements with valid reasons: @ 1) In IPv4-fragmentation is done by intermediate router while in IPv6, fragmentation is done by sender only. \ 2) When an IP router between two Ethernet segments forward an IP packet, it does not modify the destination IP address. 3) In IPv4, Checksum is used as error detecting technique, where as in IPv6, CRC is used. 4) Packet switching requires more per-packet processing than circuit switching. Q3. .a) In IPv4 fragmentation has been performed. Datagram HLEN is 5 and total length is 200, then the (1) position of datagram ? b) Consider a TCP message that contains 1024 bytes of data and 20 bytes of TCP header is passed to (3) IP for delivery across two network interconnected by router (i.e. it travels from the source host to a router to the destination host) .the first network has an MTU of 1024 bytes and second network has MTU of 576 bytes. if all packet are correctly delivered , the no. of bytes , including headers,are deliver to IP layer at the destination for the TCP message in the best case is bytes.(assume all IP address are 20 bytes) \.<" Q4. a) Let the size of congestion window of a TCP connection be 32KB when a timeout occurs. The round trip time of the connection is 100msec and the maximum segment size used is 2KB. The time taken(in msec)by the TCP connection to get back to 32KB congestion window is b) ICMP has error reporting messages. Which of the following error reporting message describes the given statement S, S: The packet is discarded due to the processing problem observing a change in the header format of the IP datagram, * 5°" Consider a network with B routers A to H connected with links having weights as shown in the following diagram: fe All the routers use the distance vector based routing algorithm to update their routing tables. Each router startss with its routing table initialized to contain an entry for each neighbor with the weight of the respective connecting link. After all the routing tables stabilize, the number of links in the network will never be used for carrying any data are Scanned with CamScanner @ a (4)BE (III Yr.)CSE, Mid Term Examination ‘Max Marks: -20 Design and Analysis of Algorithms(CS323) Attempt any four questions.All questions carry equal marks. QE. Solve the following using Master method:- T(n) =9 T(W3) +n Q2. Write algorithm for heap sort and explain its complexity. .Q3. Explain process of designing an algorithm, Q#: Prove that counting sort is Stable. .Q5-Use Strassen’s algorithm to compute the matrix product 1, 3, , 6, 8, Scanned with CamScannerMID TERM EXAMINATION (Max Marks = 20) IIL year (VI Semester — B.Tech-CSE ~(2019-20) SUBJECT : Operating System (CS325) DATE : 05/03/2020 Each Part is of 10 marks each PARTI Qi. ] Explain the significaice of dual mode of operation for an operating system. ©, (cor ‘Q2__| Explain the Race Condition with the help of a suitable example. @ (con PART I @3._| Explain the Round Robin process scheduling with the help of an example ® (CO?) ‘Q4. | Explain the shortest job first scheduling with the help of an example © (C02) Se a Scanned with CamScannerMidterm Examinatio Qi | [col Q2| (con @3 | [cory Q4 | {cory Q5 | Ico2} 02] 6 | I }Q7 | [cozy Third Year B.Tech Computer Science and Engineering All Questions are compulsory Part List the difference between process model wrt as sted below : | Processmodel | Diagram | Advantage only 2) | Disadvantageitany | Why is it difficult to gain a clear understanding of What the customer wants? What is SRS and write its template Explain use of swim lane diagram with example Part Explain the quality parameters FURPS for good sofiware Design What is the right number of modules for a given system, with a graph costeffort versus no of modules? ae ‘What is an architectural style and its categorization only name and figure. Scanned with CamScanner CS326 Sofiware Engineering Max marks:20 Date: 6 march 2020
You might also like
6 Semester Question Paper
PDF
No ratings yet
6 Semester Question Paper
26 pages
CompSci U1 P2 2024
PDF
No ratings yet
CompSci U1 P2 2024
16 pages
BS - CS (Final Papers GCUF)
PDF
No ratings yet
BS - CS (Final Papers GCUF)
61 pages
Programming in C University QP
PDF
No ratings yet
Programming in C University QP
51 pages
ETC Raisoni Endsem Paper
PDF
100% (1)
ETC Raisoni Endsem Paper
14 pages
OS Previous Year
PDF
No ratings yet
OS Previous Year
6 pages
7th Sem Cse 2010 Scheme - Question Paper
PDF
67% (3)
7th Sem Cse 2010 Scheme - Question Paper
8 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
B.C.A (Science) 2019 Pattern
PDF
No ratings yet
B.C.A (Science) 2019 Pattern
46 pages
M.C.A Engg 2019 - A
PDF
No ratings yet
M.C.A Engg 2019 - A
62 pages
6TH Sem End B.tech - CS, It2019
PDF
No ratings yet
6TH Sem End B.tech - CS, It2019
33 pages
6th Sem Mid Term April May B.tech CS IT
PDF
No ratings yet
6th Sem Mid Term April May B.tech CS IT
32 pages
Modified Syllabus
PDF
No ratings yet
Modified Syllabus
13 pages
DocScanner 12 Jan 2024 12-36
PDF
No ratings yet
DocScanner 12 Jan 2024 12-36
43 pages
6th Semester Previous Year Question
PDF
No ratings yet
6th Semester Previous Year Question
24 pages
Vi Cs-It 2019
PDF
No ratings yet
Vi Cs-It 2019
20 pages
Comp Insem Apr22
PDF
No ratings yet
Comp Insem Apr22
22 pages
Dec 2020
PDF
No ratings yet
Dec 2020
9 pages
B.SC (Computer Science) 2013 Pattern PDF
PDF
No ratings yet
B.SC (Computer Science) 2013 Pattern PDF
129 pages
5th (CSE) 2021 End
PDF
No ratings yet
5th (CSE) 2021 End
42 pages
Semester Paper
PDF
No ratings yet
Semester Paper
15 pages
PDF Merged
PDF
No ratings yet
PDF Merged
13 pages
Mypdf 2
PDF
No ratings yet
Mypdf 2
17 pages
Seat No.: All Questions Are Compulsory
PDF
No ratings yet
Seat No.: All Questions Are Compulsory
35 pages
TY BSC Computer Sci Sem IV
PDF
No ratings yet
TY BSC Computer Sci Sem IV
16 pages
TYBSC - Computer Sci
PDF
No ratings yet
TYBSC - Computer Sci
36 pages
3rd Sem Papers
PDF
No ratings yet
3rd Sem Papers
14 pages
(Pyqs) CS
PDF
No ratings yet
(Pyqs) CS
12 pages
Ty Bcs 2016 April
PDF
No ratings yet
Ty Bcs 2016 April
31 pages
Previous Year's Question Papers
PDF
No ratings yet
Previous Year's Question Papers
12 pages
TE Regular May 22 23 Compressed
PDF
No ratings yet
TE Regular May 22 23 Compressed
11 pages
Cape Computer Science 2012 Unit 2 P2
PDF
No ratings yet
Cape Computer Science 2012 Unit 2 P2
6 pages
6th Sem Papers
PDF
No ratings yet
6th Sem Papers
27 pages
2023-O-Computer Science 24082112547
PDF
No ratings yet
2023-O-Computer Science 24082112547
5 pages
5th - Midsem (2023)
PDF
No ratings yet
5th - Midsem (2023)
7 pages
Ii-I Cse
PDF
No ratings yet
Ii-I Cse
9 pages
2 - 4th Sem CSE and ISE
PDF
No ratings yet
2 - 4th Sem CSE and ISE
9 pages
TY BSC Computer Sci Sem III PDF
PDF
No ratings yet
TY BSC Computer Sci Sem III PDF
19 pages
5th Sem Paper
PDF
No ratings yet
5th Sem Paper
7 pages
Computer Question Paper
PDF
No ratings yet
Computer Question Paper
6 pages
System Software Compiler Design Question Papers
PDF
No ratings yet
System Software Compiler Design Question Papers
8 pages
Be Sem 5 Comp CBCGS CBGS Dec 2018 PDF
PDF
No ratings yet
Be Sem 5 Comp CBCGS CBGS Dec 2018 PDF
12 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
Ce 419
PDF
No ratings yet
Ce 419
4 pages
Ce 419
PDF
No ratings yet
Ce 419
4 pages
End Semester Examination, May 2 EC Microprocesso: 008 /COEIIC-311: RS
PDF
No ratings yet
End Semester Examination, May 2 EC Microprocesso: 008 /COEIIC-311: RS
10 pages
Data Structure
PDF
No ratings yet
Data Structure
4 pages
CPDS Nov Dec 2024 1
PDF
No ratings yet
CPDS Nov Dec 2024 1
3 pages
Comp SC 21
PDF
No ratings yet
Comp SC 21
4 pages
System Programming Exam Paper TE Comp
PDF
No ratings yet
System Programming Exam Paper TE Comp
4 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
Computer Science and Applications: Paper-Iii
PDF
No ratings yet
Computer Science and Applications: Paper-Iii
8 pages
Compre 2023 B
PDF
No ratings yet
Compre 2023 B
2 pages
6th Sem Syllabus PDF
PDF
No ratings yet
6th Sem Syllabus PDF
6 pages