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)
13 views
3-1 Question
3-1 all questions
Uploaded by
rafiuljim339
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save 3-1 Question For Later
Download
Save
Save 3-1 Question For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
13 views
3-1 Question
3-1 all questions
Uploaded by
rafiuljim339
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save 3-1 Question For Later
Carousel Previous
Carousel Next
Save
Save 3-1 Question For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 11
Search
Fullscreen
—_—_—_———————__- Final E ‘Course No: CSE 501 ime: 03 (Three) hours * Ty Answer any three questions from each PART {ip Use separave answer seripts for a PART i Marks alloted are indicated in the margin 1 @ (b) © @ Sylhet Engineering College, Sythet (Ghahjalal University of Science & "Technology) Department of Computer Sciences Engineering, mination, 2022 (Gv) Special Instruction (if any) PART-A, (Answer any three questions) Describe different Data Models. Deseribe the fields where database can be used. What does Domain constraint, Referential Integrity, Assertion and Authorization mean’? Describe them. 4 Consider the following relational schema 4x28 ‘employee (empno, name, office, age)» ~ ” books (isbn, tle, authors, publisher) . * : foan(empno, isbn, date)» > Write the following queries in relational algebra i) Find the names of employees who have borrowed «book published by MG- Find the names of employees who have borrowed all books published by MG- Find the names of employees who hi ywed more than five different books published by 846-Hil See ee ee jv) For each publisher, find the names of employees who have borrowed more than five Books of ha panianar "oF onPovem whe bane Porowend mes 2 (b) Summarize various types of Relational Algebra Operators. 3 @ (b) 4. (@) (b) ©), person(driver_id.name,address) © Ax2-6 car(license,model.year) « *_ vaccident(report_number,daie,location) ‘owns (driver_idllicense)@ participated(report_number,license,driver_id,damage_amount) « Write down the following SQL query from the above deseribed scheme. '2) Find the total number of people who owned cars that were involved in accidents in 2022. b)_ Delete the “Mazda” car belonging to “John Smith”. ) Find how many accidents do occur in each location. 4) Get all person name whose name start with “a” and has “bb” in his name as substring. Discuss about Left Outer Join and Full Outer Join with example. 2 Differentiate between static and dynamic Hashing. Discuss about ACID properties of Transaction. Draw a Schema Diagram for SEC Library Management System database as an example, (You can choose entities and relationship as you wish) Page 1 of 2PAR’ Answer any three questions) ‘ sing and current acess A ee shan prides itself 0” having up-to-date information on the P f 5 @ isteach shipped item. ‘To do this, SA PARIBAHAN relies 07 1 yet tracking mn. Shipped items are the heart of the SA PARIBAI 4 weight, tons Shipped items can be chaaceized by item umber (ide) sare information 9ejrance amount, destination, and final delivery date. Shipr’ Simei the SA PARIBAHAN system at single ai mt Reeir way 10 thell receiserized by their type, uniquelD, and address. Shipped items male ets (ie lights characte Done ot more siadard SA PARIBAHAN ransporation 2°85” yoique truck deliveries). These tr portation events are characterized ScheduleNumber, a type (¢-8 flight, truck), and a deliveryRoute. eal. Construct a clean and concise E-R diagram for the SA PARIBAHAN s¥s ooacrrvst all assumptions that You make about the mapping constrain‘ a Explain following Cardinality elationship with figure: i)One-to-Many ii)Many-to-Many I ‘ information SY 6 Given below is the data on Health History Report of SEC PET Center in an = normalized table. Normalize it to 1F. Identify the problems encountered when the ta Pica INF but not in 2NF. Subsequently Normalize to 2NF and 3NF. explaining the proble faced and the solution to it. [pad |PaNdme [Pa [Pa [Ownbr | VaitDate | Procedure oe Ie [ ‘Type. | Age me | RqER | Doc 12 [ORE Tene anns [= Rabies Vaesinaion ‘aR 372005 | 10- Examine And Treat Wound APR b023 [05 Heat Worn Tet 298 POT DOG 2 | Durie JAN 21/2003, ‘08 - Tetanus Vaecination ‘MARi07025 | 05 - Heart Worn Test Sar MORRIS [car [4 [Ta aN 330025 _[ O1- Rabies Vaccination (>) 7. (a) (b) 8. () - (b) © a - 1a [abies sea S19} TWEEDY | BIRD | 2 | Tonshoy "APR 4072023 | 20-- Annual Check Ur . ‘APR 40/2023 ve Wash n 02025, y What are Partial dependency and Transitive dependency How you can measure the performance of a disk? Discuss different techniques to improve the speed of access of blocks. Explains different RAID levels and how they work. What is Block chain Database? Compare between Block chain and Database. Define ETL. What are the Characteristics of Data Warehouse? How Block chain works?LL Sylhet Engineering College, Sylhet (Shahjalal University of Science & "Technology) ys Department of Computer Science and Engineering, 4 yegr 1" semester Course Ne SES se Title: Sloe Graphics Tiere (Tee Coan eu Maths: Fa ears ae aan Fam each PART Ty ose cepa Fipis for eacl 1 Ane ay hee question from etch PART ii apace meres (Ge pec Insreton (i #87 (Answer any three questions) it f jes. 142 <1) Whats tractive Computer Graphics? Write the applications of Computer rapes re 'b) Define Aspect ratio of view por. Discuss about lookup table. 4 ©) Show the different way in which pixels are considered connected. 3 ) Consider raster systems with the resolutions of 640x480, 1280x1024, and 2560 “ath ‘What size frame buffer (in bytes) is needed for each of these systems 16 Bispinel? How much storage is required foreach system if 24 its per xe ae (0 Be 7 stored? 2) a) What do you mean by sean-converting a point? b) What are the benefits of Breseakam's ‘Line Algorithm? Calculate the points v ail 4 the starting point (5, 9) and eating point (12, 16) using Mid Point Line Drawing Algorithm. ; ; I ©) Explain briefly the eightovay symmetry of a circle. A point Pi(3, -5) is given on ® 2 circle whose centre O(0, 0). Show other points that we can calculate Fi - 1 3) a) Whatis transformation? Sail Write the step fo magni an object abou is center C(b, K) Magnify the tian with 1*3 vertices PO, 0), QC, -1) and R(S, 2) o twice its size while keeping RG, 2) xed, ¢). Perform a 4S ration ofa wiangleP (0,0), @ RG, 2) about the point AC, O- 3 =. @, Given a square object with coordinates potits A (0,3), BG, 3},¢ G0) and D (0,0) i Apply te scaling parameter 2 towards X axis and 3 towards Y axis and find out the ‘new coordinates ofthe object. 4) a) Develop a pseudo-code segment to reset every pixel in an image that is in the abit 4 256-enty lookup table representation to its complementary colot . ) Leta rectangular window whose lower left comer is (4, 2) and upper right comer is 4 RQ, 7) Find the clipping categories of the following lines: i) AC4, 8), BC2, 10) i) C(2, 4), DE, 6) ii) EU, 2),F,9). ©) Explain the difference between world coordinate system and viewing coordinate 2 system. PART (Answer any tree questions) 5) a) Whatis clipping? Write the name of Text Clipping Methods. 141 b) Using Cohen Sutherland algorithm assign 4 bit region code to each endpoint of the 4 lines AB, CD, EF, GH and UJ. ° ¢) Consider a polygon with vertices VWXYZ. Apply Weiler-Atherton algorithm to find 4 the clipped polygon.6) a) b) b) °) b) 141 Define anchor nodes, convex hull. = cigina pete cave: 32 Derive the required parametric equation for a cubic Bezier cul aie tye with 4 control Baile —Bol! 0], Bi3 3], Bal6 3], Bal8 1]. Determine any 3 points lying on the curve. Derive segments equation for a B-Spline curve where num order of curve k=3, ber of control point is 7 and 3 Write the difference between lossless and lossy compression. A file contains the following characters with the frequencies as shi ih Coding is used for data compression, determine-Huffiman Code for each character Characters Frequencies 10 15 12 e i ° 3L u s 40 st t 1 Write the steps of JPEG Image Compression. Let a rectangular window whose lower left comer is A(-4, 2) and upper right corner is B(2,7). Find the clipping categories of the following lines: (i) EC4, 8), F(-2, 10) Gi) PC2, 4), RE1,6) ~— Gi) XU. 2), YG, 5) Use the Liang-Barsky algorithm to clip the lines (i)A(II, 6), B(I1, 10) (ii) C@, 7), D(3, 10) (iii) E(2, 3), F(8, 4) (iv) GO, 6), H(8, 9) (v) 1(-1, 7), S11, 1) own. If Huffman 4 ion i : 142 What is Data Compression? Why is Data Compression important? 3 1 5 5———————<—_ ts Sylhet Engineering College, Sylhet (Shahjalal University of Science & T eehnoogy) Department of Computer Sclence& Engineering 44 year Semester ination, 2022 sear tenet Course No: CSE 05 Course Tite: Mleruprocesars and Mlerocontiete ~ times 03 (Three) hours [N84 Ane any thse queton ftom each PART (i) Maks alone are inated inthe margin @ ) @ © ©. @ ® © @ © © @ (b) © @) ) © ps foreach PART “Nihon () Use separate answer et Ais) Speci lnsteeton (If any PART-A (Answer any three questions) Lat two primary differences between the 8086 andthe 8088 microprocessor Draw the Internal Arciteture of 8086 microprocessor and deseribe the operation of BIV and EU in brie. \Write down the difference between Microprocessor and Microcontoler. 3 ‘Write down the pin desritio of MNIMX’, ALE,LOCK'\RQUGTo' and RQUGTY', 4 Determine the addressing mode of following instructions: 3 i, MOV AX{BP*DI+2} i, ADDBX, [BP] SUB AX, [1300H] Dept the procedure of Keyboard interupt acceptance by the Microprocessor? 2 Contrast between the real-mode and protected mode addressing technique. How does the 4 paging technique differ from the segmentation for memory organization? Explain the idea of memory segment in microprocessor. If a mémory location has @ 4 ‘physical address 2A530H, compute the segment number where offset address is 1420H. Define Assembly Language and Paragraph boundary. in) IfDS= 45C3H, St-1241H and IP= 10101 detemine, ee i. Logical address. : ii Physical address. iii, Upper range ofthe segment. iv. Lower range of the segment. ; Write down the basic program structure of assemblylanguage. PART-B (Answer any three questions) ‘What do you mean by DMA? Describe the working procedure of DMA with figure, 1 Describe the functional description of 8254 Programmable Interval Timer with figure. Describe the following Control Word: 4 i) OL0Z0.AAA, ii) 1010 WWBB, ii) 1100CCFA iv) 00001 000 How to declare and initialize a variable inassembly language. Explain with example. 2 Explain the function ofthe following statements: 4 i CREQUODH ii, XCHGAX, BX iii, |. MODEL SMALL iv. INT2IH ‘Translate the following high evel language statement into assembly language using only 4 MOV, ADD, SUB, INC, DEC and NEG op-code. i A=-GA+l) i, B=A-2(B+5) NB. Keep the number of registers as minimum as possible(a) (b) (©) @ (b) (© What is overflow and what is the possible outcome of an arithmetic operation. Explain the status flags of flag register. ADD AH, BH where AH contain EFh and BH contain FFh.Show the value of status flag after the arithmetic operation. Explain conditional jump and unconditional jump. Discuss memory interfacing of 8086 microprocessor. Write a sequence of instructions to put the sum of 3+6+9+.. into a variable. 90+934+96499Sythet Engineering College, Sylhet (Shabjalal University of Science & Technology) Department of Computer Sciences Engineering x Year I"'Semester ing System Full Marks: 60 ih PART Final Examination, 2022 Course No: CSE $07 Time: 03(Three) hours Nass i) Answer any three question from each PART in Use sept anwer ei foe jy Mark alloted are indicated inthe ma {Speci stration (209) PART-A (Answer any three questions) 1. (a) Why cant we Ait all of our dat and progfms into main memory? How can this ise be resolved? (b) What are the difference between Multiprogramming and ‘Time-sharing structure? Oo (©) How do operating systems and hardware relate 0 one another? a oe 2. (a) What advantages do multiprocessor systems ‘have? (b) Given memory partitions of 100 KB, 500 KB, 200 KB, 300KB and 600KB, how each oF storage allocation algorithms place processes of 212KB, 417KB, 112KB, and 426KB? Explain which algorithm makes the most efficient use of memory? (©) Define PCB? What are the attributes of PCB? 6 What categories of scheduling queues exist? What criteria affects te scheduler’s 04 performance? (b)_ Describe the main differences between the short-term, mid-term and long-erm™ schedulers. 4 (@) How do non-preempiive and preemptive algorithms vary from one another? 02 4, (a) Define CPU-bound process and U/0-bound process. 6 : oT (6) Consider the following situation: Process | Arrival Time | Burst Time Pr T 3 P2 0 4 rei cal P53 2 1 | Ps 3 3) Ps : ea 7p seal oe ow draw Gantt chart for Round Robin (ime quantum 3) and SRTP Scheduling Find average waiting time, average response time and average turnaround time PART-B (Answer any three questions) 6,2,1:2.37%6321236 0 5. (@ Consider the given page reference sing: 12. 4, 5, 3.6 How many page faults would occur for the fllowing eparement algorithms assuming 5 frames? i) LRU ii) FIFO iif) Optimal - (b) What do you mean by the term swapping? a 0 (© Define Compaction. Compare between paging and segmentationYe 6 (a) What do you mean by Deadlocks? How to recover from Deadlock? Explain with example, o4 = (+) Consider the following snapshot of a system: 2 oe Process Allocation Max Available A/[B[C]D ayBye p>] [Alaic i? PI Ololilj2}|s3/4]il2 a[4a[1|3 P2 2{1}olo|{s{7]|o]3 Zi aaleaieaslits|:| 3 [3] 5 | 6 Bi) O11] 4/2) fmpeisgh2 (iS ofolis2|foles7|6 i) Determine whether the system is in safe state or not. If yes, write down the safe sequence, ii) If a request from process P3 arrives for (0, 0, 1, 2), can it be granted immediately? 94 7. (a) Draw the resource allocation graph for the following processes. P={D1, Po, Ps}, R={tistosts,ta}, E=(ts PDs, > Pas 2PP2 T1PPD PPT IDA} Is there any Deadlock in above graph? (b) A disk drive has 2000 cylinders (0 ~ 1999). The drive is currently serving at 143 and the previous was at125. The queue of pending requests in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130. What is the total distance for each of the following disk scheduling algorithm? i) FCFS ii) SSTF iii) SCAN iv) LOOK vy) C-SCAN. 0 . What are the differences between logical and physical addresses? * (b) Assume, Size of the user process = 4096KB, Data transfer rate of a hard disk = IMB/Sec. How long it will take time to complete the swapping process? (c)_ What are the differences between user-level and kernel-level thread?Sylhet Engineering College, Sythet (Shahjatal University of Science & Technology) Department of Computer Seience& Engineeri"e J i semester ‘ime: 02 (Two) hours — iy Ue separate answer Seripis for each PART. (Gu) Special Instruction (iFany)--—-NIF a PART-A (Answer any two questions) 1. (a) What is computer Architecture? Discuss the development in Computer Technology over the different generations with example. (b) What is the significance of Amdahl’s law? We are considering an enhancement to the processor of a web server. The new CPU is 20 times faster on search queries than the old processor. The old processor is busy with search queries 70% of the time; what is the speedup gained by integrating the enhanced CPU? 2. (@) IF CS=B4F6H and IP=C3BAH, determine : i) The logical address ii) The offset address iii) The Physical address _ iv) Upper and lower bound (b) | If SP=5FCBH, AX=4CS5DH, BX = 2SCFH, and DX=SFCDH, Show the contents of the stack as each instruction is executed. i) PUSHBX iy) POPDX And v) POPAX ii) PUSHAX vi) POPBX ii) PUSHDX ©) Show how flag register is affected by the following instructions: MOV BX, 23F7H ADD AX, CB7CH v SUB AX.BX 3. a) What is Bus Arbitration? Explain Daisy chaining & pooling with figure. Which one is 5 better? b) Consider the execution of a program that results in the exectition of two million $ instructions on a 400 MHz processor. The program consists of four major types of instructions. The instruction mix and the CPI for each instruction type are given below, based on the result of a program trace experiment: Instruction Type CPL Instruction Mix(%) ‘Arithmetic and logic i 60 Load/store with cache hil 2 18 Branch 4 [vy Memory reference with GB “10 cache miss [Store with cache miss 12 8 Now calculate the corresponding MIPS rate. Page 1 of 2PART-B (Answer any two questions) pwo-stage and snd evaluate both of .¢ instruction pipeline ‘better. : nd upper port-C aS input raw the flow chart of Six Stag ¥ awe instruction pipeline and mates 4 ‘conclusion which is < (b) Construct ‘control word 82550 pe ‘definitions to configure port-A a” strict Cont lower pOrt-C as output ports in mode : (Suppose pore B onto implementations of the same instruction set architecture. computer 3 | Suppots jock evele time of 500 Bs Set of the same ioe gome program, and computer Ey has r Alias t gyole time of 750 ps and 8 nda CPL Of 2-0 fhe same program. Which computer 1S a clock tnis program and by how much? \ (ey _ Briefly desribe the following Stations 4 () HOLD input is placed at a ‘logic 1 level (ii) RESET input is placed at a logic Level. (by Which one technique is ‘hater - the standard 1/O data transfer using 8086 or directly 4 $937 DMA controller? Justify your answer. f the DMA controller. 2 a through the block diagram of Draw the functional 2 What are the main characteristics of CISC © 6. a) What do you mean by Virtual memory’ processors? by Write the key differences between loosely coupled and tightly coupled multiprocessing 3 hit ratio is required to be installed in a memory system to? Calculate the cache memory systems. Cache memory 90% time from 250 ns to 34 ns. c) Consider reduce the average memory access access time required”Sylhet Engineering College, Sylhet + al University of Scienge & Technolony) (Shahjal e . i. Separtment of Computer Sciences Engineering 3rd Year 1"Semester Bioal Beamgeten, 2022 Course Title: Communication = 1 eae tia) Full Marks: 60, Time: 03(Three) hours Sal anes 40) Anowerany three question from each PART ue iy Mars alloted are in PART-A (Answer any three questions) ve down the difference between an analog signal and a digital signal & explain the communication system model. 3 ‘modulation? Why do we need modulation? Gat is amplitude modulation? Derive the instantaneous voltage equation of amplitude 13 jodulated wave. BLPA sinusoidal carrier voltage of frequency 1 MHz and amplitude 100v. If amplitude 24242 =, artier SS modulated by sin jueney 5 KHz producing 50% modulation then determine- (Frequency of sideband (ji) Amplitude of sideband i) width 3. (@)__ Write short note on- ( 6 i) Frequency Domain ii) Time Domain ~ iii) Bandwidth iv) Peak amplitude, (b) Explain how TCP is a connectionless protocol and IP is a ‘connection-oriented protocol. 4 4 (@) Describe'is distortion? Why does distortion occur in amplitude modulation 143 (b) _Iilustrate Transistor Balance modulator with proper diagram. 3 (c) A carrier wave of 500w is subjected to 100% amplitude modulation. Determine the total 3 power of the modulated wave. Draw the figure of Pulse code modulation (PCM) for analog toa digital signal PART-B (Answer any three questions) 5 (@) Distinguish between FM and AM. 3 (b) Convert the following digital data into an analog signal using FSK, ASK, and PSK. 43 ital data: 10010110 (©) State multiplier modulator. 23 6 (a). State the Carson’s rule. 2 (b)_Inan FM system, if the maximum value of deviation is 75 kHz and the maximum 4 modulating frequency is 10 kHz then calculate the deviation ratio and bandwidth with Carson's law. (©) What is Quantization? Deseribe the process of comppanding with proper figures. 13 7. (a) Illustrate Pulse code modulation and describe how it works? (b) Derive the mathematical equation expression of SQNR of a PCM system. 5 8. (@ Given the data word 1001 and the divisor 1011, using CRC encoder and decoder, 6 i) Show the generation of the codeword at the sender sit ii) Show the checking of the codeword at the receiver site. (©) Differentiate between cireuit-switched and packet-switched network. 4
You might also like
BS - CS (Final Papers GCUF)
PDF
No ratings yet
BS - CS (Final Papers GCUF)
61 pages
Ilovepdf Merged
PDF
No ratings yet
Ilovepdf Merged
33 pages
2020 pyq
PDF
No ratings yet
2020 pyq
8 pages
ETE PYP
PDF
No ratings yet
ETE PYP
14 pages
End Term DA2
PDF
No ratings yet
End Term DA2
75 pages
Sem 6 Midterm Papers
PDF
No ratings yet
Sem 6 Midterm Papers
25 pages
Comp SC 21
PDF
No ratings yet
Comp SC 21
4 pages
BCA V Sem QP 2018
PDF
No ratings yet
BCA V Sem QP 2018
9 pages
Fourth Sem Old Question
PDF
No ratings yet
Fourth Sem Old Question
13 pages
H04601 Computing Principles June 2023
PDF
No ratings yet
H04601 Computing Principles June 2023
29 pages
Papers
PDF
No ratings yet
Papers
20 pages
Half p1 Cs
PDF
No ratings yet
Half p1 Cs
8 pages
OCS31704760 Question Paper Computer Systems
PDF
No ratings yet
OCS31704760 Question Paper Computer Systems
16 pages
Sem_3_Major (1)
PDF
No ratings yet
Sem_3_Major (1)
5 pages
Se Pvy Insem Papers
PDF
No ratings yet
Se Pvy Insem Papers
9 pages
Cs Test Paper 22,23 - Edited
PDF
No ratings yet
Cs Test Paper 22,23 - Edited
6 pages
Computer Science-0478
PDF
100% (1)
Computer Science-0478
31 pages
Ugc Net - July 2016 Paper-III
PDF
No ratings yet
Ugc Net - July 2016 Paper-III
14 pages
DBMS IN 2024_merged
PDF
No ratings yet
DBMS IN 2024_merged
5 pages
Compsc III
PDF
No ratings yet
Compsc III
32 pages
2 - 4th Sem CSE and ISE
PDF
No ratings yet
2 - 4th Sem CSE and ISE
9 pages
Bca Sem I University
PDF
No ratings yet
Bca Sem I University
21 pages
Hall Ticket Number:: Answer Question No.1 Compulsorily. Answer ONE Question From Each Unit
PDF
No ratings yet
Hall Ticket Number:: Answer Question No.1 Compulsorily. Answer ONE Question From Each Unit
7 pages
CO1110
PDF
No ratings yet
CO1110
8 pages
MSE 2(4TH SEM) 2
PDF
No ratings yet
MSE 2(4TH SEM) 2
6 pages
PU Affiliated BS CS 5th Semester All Papers
PDF
0% (1)
PU Affiliated BS CS 5th Semester All Papers
6 pages
Practice of Computer Swe
PDF
No ratings yet
Practice of Computer Swe
4 pages
Export
PDF
No ratings yet
Export
29 pages
104 Quiz 2 Solutions
PDF
No ratings yet
104 Quiz 2 Solutions
5 pages
Cambridge International AS & A Level: Computer Science 9618/11
PDF
No ratings yet
Cambridge International AS & A Level: Computer Science 9618/11
20 pages
Final Exam-2021 حلول
PDF
No ratings yet
Final Exam-2021 حلول
8 pages
June 2023 QP - Paper 1 OCR Computer Science GCSE
PDF
No ratings yet
June 2023 QP - Paper 1 OCR Computer Science GCSE
16 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
Allquestionpapers 2022
PDF
No ratings yet
Allquestionpapers 2022
9 pages
Sem 4
PDF
No ratings yet
Sem 4
20 pages
Sem 5 1st Internal Pyqs
PDF
No ratings yet
Sem 5 1st Internal Pyqs
4 pages
IICT - FinalPaper-Final Version
PDF
No ratings yet
IICT - FinalPaper-Final Version
14 pages
Cse Cyber Security May 2022
PDF
No ratings yet
Cse Cyber Security May 2022
14 pages
cs p1 fm 25
PDF
No ratings yet
cs p1 fm 25
12 pages
Assignment 4
PDF
No ratings yet
Assignment 4
7 pages
BCA
PDF
No ratings yet
BCA
76 pages
CG Lab Manual
PDF
No ratings yet
CG Lab Manual
30 pages
OODP All QP Sem 2
PDF
No ratings yet
OODP All QP Sem 2
10 pages
5th Sem Questions
PDF
No ratings yet
5th Sem Questions
10 pages
June 2017 AS Paper 1 (With MS)
PDF
No ratings yet
June 2017 AS Paper 1 (With MS)
34 pages
Computer Science Paper 1 As Level Name
PDF
No ratings yet
Computer Science Paper 1 As Level Name
12 pages
Class 12 Sample Paper
PDF
No ratings yet
Class 12 Sample Paper
6 pages
CSE 8th Semester Question Year 2020
PDF
No ratings yet
CSE 8th Semester Question Year 2020
3 pages
Trial CS A Level
PDF
No ratings yet
Trial CS A Level
12 pages
Computer & Informatics (Winter 2010) Question
PDF
No ratings yet
Computer & Informatics (Winter 2010) Question
3 pages
Past Questions 300lvl
PDF
No ratings yet
Past Questions 300lvl
9 pages
Questionsl Bank and QP
PDF
No ratings yet
Questionsl Bank and QP
14 pages
CSE Winter 2019-2020 Mid Semester Examination
PDF
No ratings yet
CSE Winter 2019-2020 Mid Semester Examination
58 pages
MSE 2(4TH SEM)
PDF
No ratings yet
MSE 2(4TH SEM)
6 pages
III-I
PDF
No ratings yet
III-I
9 pages
Compuer Science Revision Questions
PDF
No ratings yet
Compuer Science Revision Questions
12 pages
5th Sem Question Paper
PDF
No ratings yet
5th Sem Question Paper
24 pages
Sem - V Comp
PDF
No ratings yet
Sem - V Comp
14 pages
4th Comp - SC 2022 (S)
PDF
No ratings yet
4th Comp - SC 2022 (S)
7 pages