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)
155 views
12 pages
SYBSC (CS) 3rd Semester
Sybcs 3 Rd semester pdf
Uploaded by
asurana272
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 SYBSC(CS)3rd Semester For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
155 views
12 pages
SYBSC (CS) 3rd Semester
Sybcs 3 Rd semester pdf
Uploaded by
asurana272
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 SYBSC(CS)3rd Semester For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 12
Search
Fullscreen
‘Total No. of Questions : 5] SEAT No. : P5137 [Total No. of Pages : 2 [5823]-301 S.Y. B.Sc. (Computer Science) CS-231 : DATA STRUCTURES AND ALGORITHMS-I (2019 Pattern) (Semester - III) (Paper-I) Time : 2 Hours] [Max. Marks : 35 Instructions to the candidates: 1) All questions are compulsory. 2) Figures to the right indicates full marks. 3) Neat diagrams must be drawn whenever necessary. QJ) Attempt any 8 of the following. [8x1=8] a) Define Data object. b) Define In-place sorting. ©) Whatis circular linked list? d) State the principle used in 4-queen problem. e) Define Queue. f) Whatis time complexity? 2) Whatis best case & worst case time complexity of merge sort algorithm? h) “Linked list can be accessed randomly” state true/false. Justify. i) Round-robin algorithm is example of which type of queue? j) _ List any two applications of stack. 2) Attempt any 4 of the following. [4x2=8] a) Define Big Oh (O) and Big Omega (Q) Notations. b) Define Array. List of an array. c) _ Differentiate between singly linked list and doubly linked list. 4) Convert following expression to equivalent postfix and prefix notation. (A+B)*C_(D-E) a (F+G) ) What are operations performed on dequeue? PIO.3) Attempt any two of the following: [2x4=8] a) Define Data structure and explain types of Data structure. b) Sort the following data using bubble sort method: 30, 40, 10, 50, 25, 35, 15 c) Write a ‘C’ function to create doubly linked list. 4) Attempt any two of the following: [2x4=8] a) Show the stack contents and output while converting following infix expression to postfix expression. A/BAC+D*¥E-A#C ixplain in detail. c) _ List the variants of sequential search. Explain any one with an example. b) Whatis linear queue? How to implement i Q5) Attempt any one of the following: [1x3=3] a) List advantageous & disadvantageous of circular queue. b) Write a short note on generalized linked list. Ry R 9 ge tee [5823]-301 2‘Total No. of Questions : 5] SEAT No. : P5138 [Total No. of Pages : 2 [5823]-302, S.Y. B.Sc. (Computer Science) CS -232 : SOFTWARE ENGINEERING (New CBCS 2019 Pattern) (Semester-II]) (Paper-II) Time : 2 Hours] ‘[Max. Marks : 35 Instructions to the candidates: 1) All questions are compulsory. 2) Figures to the right indicates full marks. 3) Assume suitable data if necessary. QJ) Attempt any Eight of the following. [8x1=8] a) Define process Flow. b) List any two agile principles. c) What are the different building blocks of UML? d) Write any two purposes served by SRS. ©) Define abstraction. f) List the advantages of waterfall model. g) Whatis requirement validation? h) Write the purpose of activity diagram. i) List any two umbrella activities of software process. j) Define Artifacts. Q2) Attempt any Four of the following. [4x2=8] a) What is Functional independance? Which qualitative criteria is applied to assessed independance. b) Define diagrams. Write classification of UML diagrams. c) _ List the elements of Andysis model. d) Write the role of scrum. e) Write advantages of RAD model. 03 Attempt any two of the following. [2x4=8] a) Explains 1 model in detail. b) Explain different approaches for requirements elicitation. c) Draw UML use case diagram for online shopping. (credit card processing) PIO.Q4) Attempt any Two of the following. [2x4=8] a) Explain phases of xp process with suitable diagram. b) Draw UML class diagram for railway reservation system. c) Define unified process. Explain phases of unified process. Q5) Attempt any One of the following [1x3=3] a) Explain types of design patterns. b) Explain the human factors considered during agile software development. oe ms % Bee ake [5823]-302 2Total No. of Questions : 3] SEAT No.: P5139 [5823]-303 [Total No. of Pages : 2 S.Y. B.Sc. (Computer Science) MATHEMATICS MTC - 231: Groups and Coding Theory (2019 Pattern) (Semester - III) (23221) Time : 2 Hours] [Max. Marks : 35 Instructions to the candidates: 1) All questions are compulsory. 2) Figures to the right indicate full marks. 3) Non-programmable scientific calculator is allowed. QI) Attempt any five of the following. [5*2=10] a) Ifajb and alc, then show that al(+c) b) Find all generators of the group (Z,.+,) ©) Check whether the permutation & =(12 5 4 6 3)(7 8) is even or odd Justify? d) Let G=(Z,,+,)be a group and H={0,2} be a subgroup of G Find all right cosets of H in G. e) Find the hamming distance between x and y, where x=1100010, y= 1010001 f) Prepare composition table of addition for (Z,+3) g) State whether the following statement is True or False: “Union of two subgroups is a subgroup.” Justify your answer with proper example. @2) Attempt any three of the following. [3x5=15] a) Let G bea group such that a” =e, Va eG. Then prove that G is abelian PTO.b) Let @=(15 2)(4 3), 7=(6197) be two permutations. Compute oro! c) Let H u cot oO 11 1d 0 0| be a parity check matrix. Determine (2, 5) group 10 ol code ¢,,:B? > B* d) Let Rbearelation on Z defined by xRy if and only if 5x+6y is divisible by 11, for x,7€Z, Show that R is an equivalence relation on Z e) Let a,b,x,y eZ. If a= (mod n), then prove that i) ax=bx (mod 2) i) (a+x)=(b+x)(mod n) Q3) Attempt any one of the following, [1<10=10] a) Find ged of 4999 and 1109 and also find integers m, such that (4999,1109) = m(4999) + (1109) b) i) Forthe set g’ = ¢—{0}. of non-zero rationals, the binary operation + is defined as a + § =22. Show that (g*,*) is an abelian group. 3 ii) Encrypt the message “URD” using f(x)=(3x+7)(mod 26). CES WW [5823]-303 2Total No. of Questions : 3] SEAT No.: P5140 [5823]-304 [Total No. of Pages : 2 S.Y. B.Sc. (Computer Science) MATHEMATICS MTC - 232: NUMERICAL TECHNIQUES (2019 Pattern) (Semester - III) (23222) Time : 2 Hours] [Max. Marks : 35 Instructions to the candidates: 1) All questions are compulsory. 2) Figures to the right indicate full marks. 3) Non-programmable scientific calculator is allowed. QI) Attempt any five of the following. [5*2=10] a) State the trapezoidal rule for numerical integration b) Given that, y * + y? with y(0)=1, Find y(0.1) by Euler's Method c) Prove that, (1+A)(1-V)=1 by usual notation. d) Find relative error of the number 5/7 whose approximate value is 0.714. €) Write the Newton-Raphson formula for square root of any real number. f) Given that, —y(10)=130, »(20) =180, »(30) = 200, (40) =275, (50) = 450. Prepare Newton’s Backward difference table ef g) Write Simpson’s (3) tule for numerical integration. Q2) Attempt any three of the following, [3x5=15] a) Derive divided difference interpolation formula. : 3 b) Evaluate [(1+ log) dx by using Simpson’s G tule (Take f= 1) 1 PTO.©) Given that, y(I)=2, »(2)=4, »(3)=8, v(4)=16, »(5)=32. Obtain (1.5) by using Newton Forward interpolation formula. d) Find real root of equation x° - 4x-9=0 in the interval [2, 3] correct upto 2 decimal places by using Regula - Falsi method. ©) Giventhat y(1)=0, »(3)=1, »(4)=48, »(6) =180, y(10)=900. Obtain Jf (5) by using Lagrange’s interpolation formula. Q3) Attempt any one of the following [1<10=10] a) Given that, BL 43y%,y(0)=1h=0. Find »(0.1),»(0.2)by using Runge - Kutta method of fourth order. b) i) ii) [5823]-304 Find the real root of the equation x-sinx +cosx=0 correct to three decimal places using Newton - Raphson method (Take x) =2.5) Given that, =x +, (0)=1. Obtain y(0.1) by using Euler’s Modified Method. C3 WWTotal No. of Questions : 5] SEAT No. : P5141 [5823] - 305 [Total No. of Pages : 2 B.Sc. (Computer Science) ELECTRONICS ELC 231: Microcontroller Architecture and Programming (2019 Pattern ) (Semester - IID) Time : 2 Hours] [Max. Marks : 35 Instructions to the candidates: 1) Question No.1 is compulsory. 2) Solve any three Questions from Q.No. 02 to Q.No. 05. 3) Figures to the right indicate full marks. 4) Use of calculator is allowed. Q1) Attempt any five of the following. [Sx1=5] a) Which port of 8051 requires external pull up resistors? b) Which registers are used as data pointer in indirect addressing mode. c) What extension is used to save ‘C’ Language program. d) Name the timer register of 8051 microcontroller used as bit addressable. e) Define step angle of stepper motor. f) Inhalf duplex, data is transmitted in only one direction at a time-comment. Q2) Answer the following. [2x5=10] a) Draw and explain interfacing of external 16 kb RAM with 8051 microcontroller? b) Explain function of following instructions. i) CLRA i) NOP ii) RRA iv) SUBB A, #05 H v) SWAP A PTO.3) Answer the following. [2x5=10] a) Explain internal RAM organisation of 8051 microcontroller. b) Write 8051 C program to generate square wave with 2500 Hz frequency on pin 2.7. Use Timer 1 in mode 2. Assume XTAL frequency = 12 MHz. 4) Answer the following. [2x5=10] a) Explain in brief classification of 8051 instructions. (any 5) b) Write C program for LCD interface to 8051 for displaying ‘ELECTRONICS’ Q5) Write short notes (any four) [4x2%=10] a) Difference between LCALL and ACALL (any 2). b) Timer mode 2 of 8051. c) Immediate addressing mode. d) Interrupts in 8051. e) Difference between simplex and full duplex. f) Input output (1/0) ports of 8051. ARR [5823] - 305 2‘Total No. of Questions : 5] SEAT No. : P5142 [Total No. of Pages : 2 [5823]-306 S.Y. B.Sc. (Computer Science) ELECTRONICS ELC -232 : Digital Communication and Networking (2019 Pattern) (Semester-II]) Time : 2 Hours} ‘[Max. Marks : 35 Instructions to the candidates: 1) Q.Lis compulsory. 2) Solve any three questions from Q.2 to 0.5. 3) Figures to the right indicate full marks. 4) Neat diagram must be drawn wherever necessary. 5) Use of calculator is allowed. Q1) Attempt any five [5x1=5] a) Define bitrate. b) What is modulation? c) What is TDMA? d) How many voice channels are multiplexed together in the basic group of FDM. ) What is MAN? f) _ Inwhich topology networking devices connected together at center point. Q2) Answer the following. [2x5=10] a) Explain with block diagram electronic communication system. b) _ Differentiate between Asynchronous and synchronous transmission. Q3) Answer the following. [2x$=10] a) Explain QPSK modulator. b) Give any five features of FDMA. 04) Answer the following. [2x5=10] a) Explain FDM technique used in communication system. b) What is networking devices? Explain router end hub. PIO.@Q5) Write short notes on any four of the following. [4x2%4=10] a) b) ©) d) e) fy Modulation Index DSSS (Direct Sequence Spread Spectrum) Ring topology CSMA protocol Types of noise Networking device switch % [5823]-306 2
You might also like
Oct 2023 B.SC Sem 1
PDF
No ratings yet
Oct 2023 B.SC Sem 1
13 pages
B.SC (COMPUTER SCIENCE) April 2024
PDF
No ratings yet
B.SC (COMPUTER SCIENCE) April 2024
56 pages
B.SC (Computer Science) 2019 Pattern
PDF
No ratings yet
B.SC (Computer Science) 2019 Pattern
55 pages
SY - Sem III 2022 PYQ
PDF
No ratings yet
SY - Sem III 2022 PYQ
15 pages
Nov 2024
PDF
No ratings yet
Nov 2024
66 pages
B.SC (Computer Science) 2019 Pattern
PDF
No ratings yet
B.SC (Computer Science) 2019 Pattern
8 pages
B.C.A (Science) 2019 Pattern
PDF
No ratings yet
B.C.A (Science) 2019 Pattern
46 pages
Iii Cs-It 20251
PDF
No ratings yet
Iii Cs-It 20251
23 pages
(Pyqs) CS
PDF
No ratings yet
(Pyqs) CS
12 pages
B.SC (Computer Science) 2019 Pattern
PDF
No ratings yet
B.SC (Computer Science) 2019 Pattern
114 pages
Iii Sem
PDF
No ratings yet
Iii Sem
20 pages
DSTL, DS, COA, Python Previous Sessional 2 Paper
PDF
No ratings yet
DSTL, DS, COA, Python Previous Sessional 2 Paper
7 pages
Vi Cs-It 2019
PDF
No ratings yet
Vi Cs-It 2019
20 pages
B.SC (Computer Science) 2013 Pattern
PDF
No ratings yet
B.SC (Computer Science) 2013 Pattern
96 pages
Comp Insem Apr22
PDF
No ratings yet
Comp Insem Apr22
22 pages
B.C.A (Science) 2019 Pattern
PDF
No ratings yet
B.C.A (Science) 2019 Pattern
49 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
B.SC (COMPUTER SCIENCE) April 2024 Sem 4
PDF
No ratings yet
B.SC (COMPUTER SCIENCE) April 2024 Sem 4
14 pages
B.SC All Papers
PDF
No ratings yet
B.SC All Papers
16 pages
Cse Aids Dec 2021
PDF
No ratings yet
Cse Aids Dec 2021
14 pages
Se Pvy Insem Papers
PDF
No ratings yet
Se Pvy Insem Papers
9 pages
2023-O-Computer Science 24082112547
PDF
No ratings yet
2023-O-Computer Science 24082112547
5 pages
Question Papers All
PDF
No ratings yet
Question Papers All
64 pages
Bannari Amman Institute of Technology
PDF
No ratings yet
Bannari Amman Institute of Technology
10 pages
Bca 3RD Sem
PDF
No ratings yet
Bca 3RD Sem
44 pages
2019 - November - PG - M. SC., (Computer Science & IT) 2017 Onwards - M. SC., (Computer Science & IT)
PDF
No ratings yet
2019 - November - PG - M. SC., (Computer Science & IT) 2017 Onwards - M. SC., (Computer Science & IT)
92 pages
Cse 3 RD 2020
PDF
No ratings yet
Cse 3 RD 2020
27 pages
Dec 2023
PDF
No ratings yet
Dec 2023
8 pages
M.SC 1st Year 1st Semester Assignment
PDF
No ratings yet
M.SC 1st Year 1st Semester Assignment
6 pages
3 07 Paper Iii
PDF
No ratings yet
3 07 Paper Iii
5 pages
Lund Pyq College Remuna Degree College
PDF
No ratings yet
Lund Pyq College Remuna Degree College
20 pages
Lab
PDF
No ratings yet
Lab
10 pages
B.SC (Computer Science) 2013 Pattern PDF
PDF
No ratings yet
B.SC (Computer Science) 2013 Pattern PDF
129 pages
All Pyq's Entc
PDF
No ratings yet
All Pyq's Entc
32 pages
Sem 3 Major
PDF
No ratings yet
Sem 3 Major
5 pages
Sy Sem 1 PDF
PDF
No ratings yet
Sy Sem 1 PDF
23 pages
B.SC (Computer Science) 2019 Pattern
PDF
No ratings yet
B.SC (Computer Science) 2019 Pattern
101 pages
BSC - Sem Iii
PDF
No ratings yet
BSC - Sem Iii
11 pages
Sem 5 Put 2022-23
PDF
No ratings yet
Sem 5 Put 2022-23
8 pages
B.SC (Computer Science) 2019 Pattern 2
PDF
No ratings yet
B.SC (Computer Science) 2019 Pattern 2
10 pages
Wa0011.
PDF
No ratings yet
Wa0011.
13 pages
Design Algorithm 2009
PDF
No ratings yet
Design Algorithm 2009
2 pages
SSC-II Computer Science (2nd Set)
PDF
No ratings yet
SSC-II Computer Science (2nd Set)
8 pages
Comp SC 19
PDF
No ratings yet
Comp SC 19
10 pages
1 Merge
PDF
No ratings yet
1 Merge
6 pages
2023 Oct Paper
PDF
0% (1)
2023 Oct Paper
58 pages
2019 All Pyq
PDF
No ratings yet
2019 All Pyq
16 pages
Question Papers of Two Year M. Tech I Semester Regular Examinations April - 2012
PDF
No ratings yet
Question Papers of Two Year M. Tech I Semester Regular Examinations April - 2012
29 pages
B.C.A (SCIENCE) Oct 2022-23-25
PDF
No ratings yet
B.C.A (SCIENCE) Oct 2022-23-25
3 pages
Test No 5 Full Syllabus HPSC Subjective - 23271685 - 2 - 230925 - 073953
PDF
No ratings yet
Test No 5 Full Syllabus HPSC Subjective - 23271685 - 2 - 230925 - 073953
8 pages
B.C.A (Science) 2019 Pattern
PDF
No ratings yet
B.C.A (Science) 2019 Pattern
48 pages
Comp SC 18
PDF
No ratings yet
Comp SC 18
8 pages
Past Q
PDF
No ratings yet
Past Q
12 pages