Date of Examination: 25/10/2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Computer Science and Engineering
Program: B.Sc. in Computer Science and Engineering
Semester Final Examination: Fall 2020
Year: 2nd
Semester: 1st
Course Number: CSE2103
Course Name: Data Structures
Time: 2 (Two) Hours
Full Marks: 50
Use single answer script
Instructions:
i)
Answer script should be hand written and should be written in A4 white paper. You
must submit the hard copy of this answer script to the Department when the university
reopens.
ii)
iii)
You must write the following information at the top page of each answer script:
Department:
Program:
Course no:
Course Title:
Examination:
Semester (Session):
Student ID:
Signature and Date:
Write down Student ID, Course number and put your signature on top of every single
page of the answer script.
iv)
Write down page number at the bottom of every page of the answer script.
v)
Upload the scan copy of your answer script in PDF format through provided google
form at the respective course site (i.e., google classroom) using institutional email
within the allocated time. Uploading clear and readable scan copy (uncorrupted) is
your responsibility and must cover the full page of your answer script. However, for
clear and readable scan copy of the answer script student should use only one side of
a page for answering the questions.
vi)
You must avoid plagiarism, maintain academic integrity, and ethics. You are not
allowed to take any help from another individual and if taken so can result in stern
disciplinary actions from the university authority.
vii)
Marks allotted are indicated in the right margin.
viii)
Necessary charts/tables are attached at the end of the question paper. You may use
graph papers where necessary.
ix)
Assume any reasonable data if needed.
x)
Symbols and characters have their usual meaning.
xi)
Before uploading rename the PDF file as CourseNo_StudentID.pdf
For example, CSE2103_190204001.pdf
xii
The answer script (one single pdf file) must be uploaded at designated location in
the provided google form link available in the google classroom.
Page 1 of 4
There are 6 (Six) Questions. Answer any 4(Four).
Question 1. [Marks: 12.5]
a) Suppose you are given two arrays A and B of integers. Write an algorithm as pseudocode
to check whether the arrays have any elements in common or not.
[3]
b) What are the desirable properties of a good hashing function? Describe any three [5.5]
collision resolution techniques with a suitable example using at least seven values (one
value contains last three digits of your student ID).
c) Mention two algorithm names which use stack and queue respectively. Now, demonstrate [4]
the algorithms using simple example (having at least six elements). Show the instances of
stack and queue respectively in every step of the algorithms.
Question 2. [Marks: 12.5]
a) Modify the standard bubble sort algorithm so that the algorithm stops after the array is
sorted in any pass.
b) Build a max-heap using following data and use heap sort to sort the data.
19, 55, 26, 40, “Last two digits of your Student ID”, 25, 65, 32, 37, 20
c)
Use the schematic diagram of the recursive solution to find the passes for Towers of
Hanoi problem when n=3.
Tower (3, X, Y, Z)
Where, X = beginning peg name will be the first letter of your last name,
Y = Auxiliary peg will be the second letter of your last name,
Z = End peg will be the third letter of your last name (if the third letter is same
as first or second letter, then you can use fourth letter as end peg).
[4]
[6.5]
[2]
Question 3. [Marks: 12.5]
a) If you want to represent a list using a linear array or a linked list, which one will you
prefer and why? Justify your answer.
[2]
b) Transform the following infix expression into its equivalent postfix expression using a
stack.
( ( 2 + 12 / 3 ) * ( ( 13 – “Last digit of your Student ID” ) * 2 ↑ 3 ) ) + 6
Now evaluate the postfix expression using a stack.
[6.5]
Page 2 of 4
c)
In general, a binary search tree is a rooted binary tree in which each node stores a key
and has no more than two distinct sub trees, left and right. Each node's key must be larger
than any key in the left sub tree and less than any key in the right sub tree. The number of
edges on the simple path from the vertex to the root represents the vertex's depth. The
depth of the root is 0. X recently learnt Breadth First Search (BFS) and Binary Search
Tree (BST). X wants to find the height of a binary search tree. Your task is to write an
algorithm to help X in finding the height of a BST using BFS. Refer to the following
figure for better understanding.
[4]
Question 4. [Marks: 12.5]
a) Design an algorithm to insert an element into a sorted doubly linked list keeping the list [4.5]
sorted. Is it possible to apply binary search to find the position of this inserted element?
Briefly describe your answer with a suitable example.
b) Given an undirected graph G and a particular edge (u v) in it, determine whether G has a [3]
cycle containing (u v). Design a linear time algorithm for the above scenario. Briefly
describe the ideas (pseudocode is not needed).
c) Suppose we create a binary search tree by inserting the following values in the given [5]
order:
40, 12, 98, 54, “last three digits of your ID”, 130, 5, 31, 24, 10
Answer the following questions:
i. Draw the binary search tree.
ii. Show the output values if we visit the tree using preorder and inorder traversal
techniques.
iii. Show the resulting trees after we delete 12, 98, and 31. (Each deletion is applied
on the original tree.)
iv.
What will happen if all the nodes in a binary search tree have same values? Explain
with an example.
Question 5. [Marks: 12.5]
a) Show the passes and calculate the number of data movement required to sort the following
elements using Insertion sort technique.
28, 79, “Last three digits of your Student ID”, 21, 71, 18, 34
[4]
b) Write a procedure that removes the first element of a linked list and adds it to the end of [3.5]
the list.
c)
How can you apply binary search algorithm to any unsorted array? Write the algorithm
and show whether the algorithm preserves the benefits of binary search or not.
Page 3 of 4
[5]
Question 6. [Marks: 12.5]
a) Show the different passes of Radix sort algorithm for the following data:
234, 363, 52, 443, “Last three digits of your Student ID”, 128, 302, 674, 477
[3]
b) Tejgaon has N houses numbered from 1 to N. There are M uni-directional roads in [3.5]
Tejgaon for travelling between houses. Each road has a time T that means time required
to go from house A to house B on foot. Mr. Rahim lives in the house with index 1. He
likes to visit his friends (different houses) in every weekend. He also likes to buy fruits
for his friends before going to their house. The fruit shop is located in the house whose
index is X. Mr. Rahim is very lazy and wants to use the path that takes minimum time to
go to his friend’s house. Now your task is to suggest an algorithm that can be used to find
the path that requires minimum time. Briefly describe your ideas (pseudocode is not
needed).
c) Apply the iterative postorder and inorder traversal algorithms on the following tree using [6]
stack and show the intermediate steps in details.
A
B
D
C
F
E
K
H
G
Page 4 of 4
Date: 10.11.21
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Computer Science and Engineering
Program: B.Sc. in Computer Science and Engineering
Semester Final Examination: Fall 2020
Year: 2nd
Semester: 1st
Course Number: CSE 2105
Course Name: Digital Logic Design
Time: 02(Two) Hours
Full Marks: 50
Use single answer script
Instructions:
i)
ii)
Answer script should be hand written and should be written in A4 white paper.
You must submit the hard copy of this answer script to the Department when the
university reopens.
You must write the following information at the top page of each answer script:
Department:
Program:
Course no:
Course Title:
Examination:
Semester (Session):
Student ID:
Signature and Date:
iii) Write down Student ID, Course number and put your signature on top of every
single page of the answer script.
iv) Write down page number at the bottom of every page of the answer script.
v) Upload the scan copy of your answer script in PDF format through provided
google form at the respective course site (i.e., google classroom) using
institutional email within the allocated time. Uploading clear and readable scan
copy (uncorrupted) is your responsibility and must cover the full page of your
answer script. However, for clear and readable scan copy of the answer script
student should use only one side of a page for answering the questions.
vi) You must avoid plagiarism, maintain academic integrity and ethics. You are
not allowed to take any help from another individual and if taken so can result
in stern disciplinary actions from the university authority.
vii) Marks allotted are indicated in the right margin.
viii) Assume any reasonable data if needed.
ix) Symbols and characters have their usual meaning.
x) Before uploading rename the PDF file as CourseNo_StudentID.pdf
For example, CSE 2105_190204001.pdf
xi) The answer script (one single pdf file) must be uploaded at designated location
in the provided google form link available in the google classroom.
Page 1 of 3
There are 6 (Six) Questions. Answer any 4 (Four).
Question 1. [Marks: 12.5]
a)
Using 2 Full Adders and basic gates, implement the ALU functions for two 2- bit numbers
(A1, A0 & B1, B0) for the following conditions:
S3
0
0
0
1
1
1
S2
0
1
1
0
0
1
S1
0
0
1
0
1
1
ALU function
A+B
-B
AUB
A
A-B-1
A ∩B
b)
[4]
Design a 4 X 3 Array Multiplier using Adders and AND gates.
Question 2. [Marks: 12.5]
a)
Design a 3-bit Universal Shift Register with the following options:
Mode Control
[8.5]
Register
Operation
S2
S1
S0
0
0
0
No Change
0
0
1
Shift Right
0
1
1
Parallel Load
1
0
1
Set all bits to 1
1
1
0
Invert all bits
1
1
1
No Change
b)
Draw the block diagrams of SIPO and SISO shift left registers for 3 bits and show the
sequence table using the input 011 for each register.
Question 3. [Marks: 12.5]
a)
[8.5]
Using the tabulation method, determine the prime-implicants of the following function
and then minimize using prime-implicants table.
[4]
[8.5]
F (w, x, y, z) = Σ (0, 2, 6, 10, 13)
d (w, x, y, z) = Σ (1, 4, 5, 7) [Here, d is for don’t care]
b)
A combinational circuit is defined by the following functions:
[4]
F1= Σ(0, 1, 2, 4)
F2= Σ(0, 5, 6, 7)
Implement the circuit with a PLA having three inputs, four product terms and two outputs.
Page 2 of 3
Question 4. [Marks: 12.5]
a)
Design a circuit using a decoder and basic gates that can detect an error in the
representation of 4-bit binary data in BCD.
[4.5]
b)
An 8 to 1 multiplexer has inputs A, B, C and D, where inputs A, B and C are connected
to the selection inputs S2, S1 and S0, respectively. The data inputs I0 through I7 are as
follows:
[4]
II = I2= I4=0,
I3 = I5= 1,
I0= I7 = D and
I6 = D'.
Determine the Boolean function that the multiplexer implements.
c)
A (15,11) hamming code is received as 001011101011010. Determine the correct code
when even parity is there.
Question 5. [Marks: 12.5]
a)
Discover, how the following circuit (Figure. 5.a) works (up/down counter) when we
consider, Q2, Q1, Q0 as output. Here, initial values are 100. Show the timing diagram for
9 pluses. (You must have to follow the clock input to get the correct answer.)
[4]
[6.5]
Figure. 5. a
b)
Design a 4-bit down Johnson Counter using D Flip-Flop.
[6]
Question 6. [Marks: 12.5]
a)
b)
Design a BCD Subtractor Circuit. Describe, how it works for 3-8.
What do you know about the Race Around Condition in JK flip-flop? How can this
problem be solved? Explain with the necessary circuits.
[5]
[5]
c)
Write a truth table for the latch shown in figure-6. c. Is it similar to any other latch with
which you are familiar?
[2.5]
Figure: 6.c
Page 3 of 3
Date of Examination: 07/11/2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Arts and Sciences
Program: B.Sc. in Computer Science and Engineering
Semester Final Examination: Fall-2020
Year: 2nd
Semester: 1st
Course Number: Math 2101
Course Name: Mathematics III
Time: 2 (Two) hours
Full Marks: 50
Use separate answer script for each part
Instructions:
i) Answer script should be hand written and should be written in A4 white paper. You
must submit the hard copy of this answer script to the Department when the
university reopens.
ii) You must write the following information at the top page of each answer script:
Part A / Part B
Department:
Course no:
Examination:
Student ID:
Program:
Course Title:
Semester (Session):
Signature and Date:
iii) Write down Student ID, Course number, and put your signature on top of every
single page of the answer script.
iv) Write down page number at the bottom of every page of the answer script.
v) Upload the scan copy of your answer script in PDF format through provided
google format the respective course site (i.e., google classroom) using
institutional email within the allocated time. Uploading clear and readable scan
copy(uncorrupted) is your responsibility and must cover the full page of
your answer script. However, for clear and readable scan copy of the answer
script student should use only one side of a page for answering the questions.
vi) You must avoid plagiarism, maintain academic integrity, and ethics. You are not
allowed to take any help from another individual and if taken so can result in stern
disciplinary actions from the university authority.
vii) Marks allotted are indicated in the right margin.
viii) Necessary charts/tables (if needed) are attached at the end of the question paper or
in a separate pdf file in the same google stream along with the question paper. You
mayuse graph papers where necessary.
ix) Assume any reasonable data if needed.
x) Symbols and characters have their usual meaning.
xi) Before uploading rename the PDF file as CourseNo_StudentID.pdf
e.g., MATH2101_190204001_PartA
MATH2101_190204001_PartB
Page 1 of 4
PART- A
The answer script (one single pdf file) of this part (Part A) must be uploaded at
designated location in the provided googleform link available in the google classroom.
There are 03 (Three) questions. Answer any 02 (Two) including Question no. 3
Question 1. [Marks: 16]
z −1
in a Laurent series in the region 2  | z |  3.
( z + 2 )( z + 3)
a)
Find f ( z ) =
b)
Compute Laplace transformation of the functions e −3t (2cos5t − 3sin5t ) .
c)
Apply Cauchy integral formula to evaluate the integral ∮𝑐
𝑒 3𝑧
(𝑧−𝑖)4
𝑑𝑧
[6]
[4]
[6]
where C = ( x, y ) :| x | 2, | y | 2 is positively oriented.
Question 2. [Marks: 16]
a)
b)
c)
Show that 𝑣(𝑥, 𝑦) = 2𝑥(1 − 𝑦) is a harmonic function. Find an analytic function 𝑓(𝑧) and
express 𝑓(𝑧) in terms of 𝑧.
Find Laplace transformation of the function t 3e −2t sin ( 5t ) .
[6]


4s
Use Convolution theorem to evaluate L−1 
.
2
2
 ( s − 1)( s + 1) 
[5]
[5]
Question 3. [Marks: 16]
a)
Apply Laplace transform to solve the initial value problem
given y (0) = 0 , y (0) = 1 .
d2y
dy
+
2
+ 5 y = e − x sin x ,
2
dx
dx
[7]
/
b)
Use contour integration to evaluate the following integral:
2𝜋
∫
0
cos 3𝜃
𝑑𝜃.
5 − 4 cos 𝜃
Page 2 of 4
[9]
PART- B
The answer script (one single pdf file) of this part (Part B) must be uploaded at
designated location in the provided googleform link available in the google classroom.
There are 03 (Three) questions. Answer any 02 (Two)
Question 4. [Marks: 9]
a)
b)
A production process with three different machines produces motherboards and their daily
output units are 300, 250 and 450 from the first, second and third machines respectively. The
quality records taken by the management revealed that 0.85% of the motherboards produced by
the first machine are with error. The corresponding percentages of errors for the other two
machines are 0.9% and 1.1% respectively. A motherboard is chosen at random from a lot and
was discovered with an error. Find which machine is most likely to be the one for producing
this faulty motherboard?
A controlled satellite is known to have an error (distance from target) that is symmetrically
distributed with mean one and standard deviation 4 feet. Once a target is aimed, estimate the
percentage of chance that, (i) the target will stay within 10 feet, (ii) the target will stay over 5
feet away but not more than 11 feet.
[5]
[4]
Question 5. [Marks: 9]
a)
b)
A home security system is designed to have a 5% unreliability rate. Suppose that seven homes
equipped with this system experience an attempted burglary. Find the probabilities that, (i) At
least three of the alarms were triggered, (ii) Six or fewer alarms were triggered, (iii) More than
three but not more than five alarms were not triggered.
Represent the following data through a proper pictorial method.
[6]
[3]
Sold items of the brands
Gigabyte Biostar Asus MSI ASRock
Weekly sales (in thousand tk.)
68
27
48
38
28
Question 6. [Marks: 9]
a)
The time to failure (in minutes) of a machine component is related to the motor speed in
revolution per minute (rpm). A design experiment is run in the research and development
laboratory, and the following data are obtained.
Failure time
2145 2155 2220 2225 2260 2266 2334 2212
Revolution per minute
750
850
1000 1100 750
850
1000 840
Apply regression method to estimate the parameters and hence explain them.
Page 3 of 4
[5]
b)
In a windmill power project field thirty windmills were tested for their capabilities of power
production and the following data have been revealed from the records of a certain week.
Power produced ( KWh.)
1 – 3 3 – 5 5 – 7 7 – 9 9 – 11 11 – 13 13 – 15
Sample number of windmills
4
9
10
3
1
2
1
Use any two suitable methods to obtain the mean power production from the project field.
Page 4 of 4
[4]
Appendix B: Tables
TABLE 1
CUMULATIVE PROBABILITIES FOR THE STANDARD NORMAL
DISTRIBUTION
Entries in the table
give the area under the
curve to the left of the
z value. For example, for
z = –.85, the cumulative
probability is .1977.
Cumulative
probability
0
z
z
.00
.01
.02
.03
.04
.05
.06
.07
.08
.09
⫺3.0
.0013
.0013
.0013
.0012
.0012
.0011
.0011
.0011
.0010
.0010
⫺2.9
⫺2.8
⫺2.7
⫺2.6
⫺2.5
.0019
.0026
.0035
.0047
.0062
.0018
.0025
.0034
.0045
.0060
.0018
.0024
.0033
.0044
.0059
.0017
.0023
.0032
.0043
.0057
.0016
.0023
.0031
.0041
.0055
.0016
.0022
.0030
.0040
.0054
.0015
.0021
.0029
.0039
.0052
.0015
.0021
.0028
.0038
.0051
.0014
.0020
.0027
.0037
.0049
.0014
.0019
.0026
.0036
.0048
⫺2.4
⫺2.3
⫺2.2
⫺2.1
⫺2.0
.0082
.0107
.0139
.0179
.0228
.0080
.0104
.0136
.0174
.0222
.0078
.0102
.0132
.0170
.0217
.0075
.0099
.0129
.0166
.0212
.0073
.0096
.0125
.0162
.0207
.0071
.0094
.0122
.0158
.0202
.0069
.0091
.0119
.0154
.0197
.0068
.0089
.0116
.0150
.0192
.0066
.0087
.0113
.0146
.0188
.0064
.0084
.0110
.0143
.0183
⫺1.9
⫺1.8
⫺1.7
⫺1.6
⫺1.5
.0287
.0359
.0446
.0548
.0668
.0281
.0351
.0436
.0537
.0655
.0274
.0344
.0427
.0526
.0643
.0268
.0336
.0418
.0516
.0630
.0262
.0329
.0409
.0505
.0618
.0256
.0322
.0401
.0495
.0606
.0250
.0314
.0392
.0485
.0594
.0244
.0307
.0384
.0475
.0582
.0239
.0301
.0375
.0465
.0571
.0233
.0294
.0367
.0455
.0559
⫺1.4
⫺1.3
⫺1.2
⫺1.1
⫺1.0
.0808
.0968
.1151
.1357
.1587
.0793
.0951
.1131
.1335
.1562
.0778
.0934
.1112
.1314
.1539
.0764
.0918
.1093
.1292
.1515
.0749
.0901
.1075
.1271
.1492
.0735
.0885
.1056
.1251
.1469
.0721
.0869
.1038
.1230
.1446
.0708
.0853
.1020
.1210
.1423
.0694
.0838
.1003
.1190
.1401
.0681
.0823
.0985
.1170
.1379
⫺.9
⫺.8
⫺.7
⫺.6
⫺.5
.1841
.2119
.2420
.2743
.3085
.1814
.2090
.2389
.2709
.3050
.1788
.2061
.2358
.2676
.3015
.1762
.2033
.2327
.2643
.2981
.1736
.2005
.2296
.2611
.2946
.1711
.1977
.2266
.2578
.2912
.1685
.1949
.2236
.2546
.2877
.1660
.1922
.2206
.2514
.2843
.1635
.1894
.2177
.2483
.2810
.1611
.1867
.2148
.2451
.2776
⫺.4
⫺.3
⫺.2
⫺.1
⫺.0
.3446
.3821
.4207
.4602
.5000
.3409
.3783
.4168
.4562
.4960
.3372
.3745
.4129
.4522
.4920
.3336
.3707
.4090
.4483
.4880
.3300
.3669
.4052
.4443
.4840
.3264
.3632
.4013
.4404
.4801
.3228
.3594
.3974
.4364
.4761
.3192
.3557
.3936
.4325
.4721
.3156
.3520
.3897
.4286
.4681
.3121
.3483
.3859
.4247
.4641
Copyright 2014 Nelson Education Ltd. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content
may be suppressed from the eBook and/or eChapter(s). Nelson Education reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Appendix B
TABLE 1
975
Tables
CUMULATIVE PROBABILITIES FOR THE STANDARD NORMAL
DISTRIBUTION (Continued )
Cumulative
probability
0
Entries in the table
give the area under the
curve to the left of the
z value. For example, for
z = 1.25, the cumulative
probability is .8944.
z
z
.00
.01
.02
.03
.04
.05
.06
.07
.08
.09
.0
.1
.2
.3
.4
.5000
.5398
.5793
.6179
.6554
.5040
.5438
.5832
.6217
.6591
.5080
.5478
.5871
.6255
.6628
.5120
.5517
.5910
.6293
.6664
.5160
.5557
.5948
.6331
.6700
.5199
.5596
.5987
.6368
.6736
.5239
.5636
.6026
.6406
.6772
.5279
.5675
.6064
.6443
.6808
.5319
.5714
.6103
.6480
.6844
.5359
.5753
.6141
.6517
.6879
.5
.6
.7
.8
.9
.6915
.7257
.7580
.7881
.8159
.6950
.7291
.7611
.7910
.8186
.6985
.7324
.7642
.7939
.8212
.7019
.7357
.7673
.7967
.8238
.7054
.7389
.7704
.7995
.8264
.7088
.7422
.7734
.8023
.8289
.7123
.7454
.7764
.8051
.8315
.7157
.7486
.7794
.8078
.8340
.7190
.7517
.7823
.8106
.8365
.7224
.7549
.7852
.8133
.8389
1.0
1.1
1.2
1.3
1.4
.8413
.8643
.8849
.9032
.9192
.8438
.8665
.8869
.9049
.9207
.8461
.8686
.8888
.9066
.9222
.8485
.8708
.8907
.9082
.9236
.8508
.8729
.8925
.9099
.9251
.8531
.8749
.8944
.9115
.9265
.8554
.8770
.8962
.9131
.9279
.8577
.8790
.8980
.9147
.9292
.8599
.8810
.8997
.9162
.9306
.8621
.8830
.9015
.9177
.9319
1.5
1.6
1.7
1.8
1.9
.9332
.9452
.9554
.9641
.9713
.9345
.9463
.9564
.9649
.9719
.9357
.9474
.9573
.9656
.9726
.9370
.9484
.9582
.9664
.9732
.9382
.9495
.9591
.9671
.9738
.9394
.9505
.9599
.9678
.9744
.9406
.9515
.9608
.9686
.9750
.9418
.9525
.9616
.9693
.9756
.9429
.9535
.9625
.9699
.9761
.9441
.9545
.9633
.9706
.9767
2.0
2.1
2.2
2.3
2.4
.9772
.9821
.9861
.9893
.9918
.9778
.9826
.9864
.9896
.9920
.9783
.9830
.9868
.9898
.9922
.9788
.9834
.9871
.9901
.9925
.9793
.9838
.9875
.9904
.9927
.9798
.9842
.9878
.9906
.9929
.9803
.9846
.9881
.9909
.9931
.9808
.9850
.9884
.9911
.9932
.9812
.9854
.9887
.9913
.9934
.9817
.9857
.9890
.9916
.9936
2.5
2.6
2.7
2.8
2.9
.9938
.9953
.9965
.9974
.9981
.9940
.9955
.9966
.9975
.9982
.9941
.9956
.9967
.9976
.9982
.9943
.9957
.9968
.9977
.9983
.9945
.9959
.9969
.9977
.9984
.9946
.9960
.9970
.9978
.9984
.9948
.9961
.9971
.9979
.9985
.9949
.9962
.9972
.9979
.9985
.9951
.9963
.9973
.9980
.9986
.9952
.9964
.9974
.9981
.9986
3.0
.9987
.9987
.9987
.9988
.9988
.9989
.9989
.9989
.9990
.9990
Copyright 2014 Nelson Education Ltd. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content
may be suppressed from the eBook and/or eChapter(s). Nelson Education reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Date of Examination:
02-11-2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Electrical and Electronic Engineering
Program: Bachelor of Science in Computer Science & Engineering
Semester Final Examination: Fall 2020
Year: 2nd
Semester: 1st
Course Number: EEE 2141
Course Name: Electronic Devices and Circuits
Time: 2:00 Hours [Excluding the 1:00 hour time for uploading]
Full Marks: 50
Instructions
i. Answer script should be handwritten and should be written on A4 white paper.
You must submit the hard copy of this answer script to the Department when the university reopens.
ii. You must write the following information on the top page of each answer script:
Department:
Course no:
Examination:
Student ID:
Program:
Course Title:
Semester (Session):
Signature and Date:
iii. Write down your Student ID, Course number, and put your signature on top of every single page of the
answer script.
iv. Write down the page number at the bottom of every page of the answer script.
v. Upload the scan copy of your answer script in PDF format through provided google form at the respective
course site (i.e., google classroom) using institutional email within the allocated time. Uploading a clear
and readable scan copy (uncorrupted) is your responsibility and must cover the full page of your answer
script. However, for a clear and readable scan copy of the answer script, students should use only one side
of a page for answering the questions.
vi. You must avoid plagiarism, maintain academic integrity, and ethics. You are not allowed to take any
help from another individual and if taken so can result in stern disciplinary actions from the university
authority.
vii. Marks allotted are indicated in the right margin.
viii. Necessary charts/tables are attached at the end of the question paper. You may use graph papers where
necessary.
ix. Assume any reasonable data if needed.
x. Symbols and characters have their usual meaning.
xi. Before uploading rename the PDF file as CourseNo_StudentID.pdf
e.g., EEE2141_180103001.pdf
The answer script (one single pdf file) must be uploaded at a designated location in the provided
google form link available in the google classroom.
There are 5 (Five) questions. Answer any 4 (Four) questions.
Question-5 is compulsory.
Question 1. [Marks: 12.5]
a)
Discuss different regions of SCR’s characteristics curve. Also, briefly describe the steps
required for IC fabrication.
b) For the network in figure 1 (b), if RL = 180Ω
●
●
●
●
Determine VL, IL, IZ, and IR.
Calculate again if RL = 470Ω .
Determine the value of RL that will establish maximum power conditions for the Zener
diode.
Determine the minimum value of RL to ensure that the Zener diode is in the “on” state.
[6]
[6.5]
Figure 1 (b)
Question 2. [Marks: 12.5]
a)
Discuss the construction and working principle of a BJT.
b) Given the information appearing in figure 2 (b), determine:
a. IC b. VE c. VCC d. VCE e. VB f. R1
Figure 2 (b)
[6]
[6.5]
Question 3. [Marks: 12.5]
a)
Describe the construction, operating principle of junction field-effect transistors, and
illustrate its characteristics curve and transfer function.
b) Determine vo in figure 3 (b).
[6]
[6.5]
Figure 3 (b)
Question 4. [Marks: 12.5]
a)
Formulate the equation of a subtractor using a difference amplifier.
b)
[6]
[6.5]
Use difference amplifier with inputs V1, V2, and V3 such that
V0 = -10V1 + 12V2 + 25V3
Question 5. [Marks: 12.5]
a)
Build a 4V level crossing detector using op-amp and a triangular input voltage having a [6]
peak value of 10V and frequency of 50Hz. Illustrate your answer with necessary
diagrams and waveshapes, and compute the duty cycle of the output voltage.
b) Build a logic circuit with CMOS that gives output based on the following equation. [6.5]
Also, sketch the timing diagram.
𝑌 = (𝐴𝐵 + 𝐷)𝐴𝐶
Date of Examination: 28/10/2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department of Arts and Sciences
Program: Bachelor of Science in Computer Science and Engineering
Semester Final Examination: Fall 2020
Year: Second
Semester: First
Course Number: Hum 2109
Course Name: Society, Ethics and Technology
Time: 2 (Two) hours
Full Marks: 50
Use single answer script
Instructions:
i)
Answer script should be hand written and should be written in A4 white paper.
You must submit the hard copy of this answer script to the Department when the
university reopens.
ii)
You must write the following information at the top page of each answer script
Department:
Program:
Course no:
Course Title:
Examination:
Semester(Session):
Student ID:
Signature and Date:
iii)
Write down Student ID, Course number, and put your signature on top of every
single page of the answer script.
iv)
Write down page number at the bottom of every page of the answer script.
v)
Upload the scan copy of your answer script in PDF format through provided
google format the respective course site (i,e., google classroom) using
institutional email within the allocated time. Uploading clear and readable scan
copy (uncorrupted) is your responsibility and must cover the full page of your
answer script. However, for clear and readable scan copy of the answer script
student should use only one side of a page for answering the questions.
You must avoid plagiarism; maintain academic integrity, and ethics. You are
vi)
not allowed to take any help from another individual and if taken so can result in
stern disciplinary actions from the university authority.
vii)
Marks allotted are indicated in the right margin.
viii)
Necessary charts/tables are attached at the end of the question paper. You may
use graph papers where necessay.
ix)
Assume any reasonable data if needed.
x)
Symbols and characters have their usual meaning.
xi)
Before uploading rename the PDF file as Course No_StudentID.pdf
e.g., Hum 2109_190204001.pdf
Page 1 of 2
The answer script (one single pdf file) must be uploaded at designated location in the
provided google form link available in the Google classroom.
Question: 1.
a) Explain how war played a crucial role in the development of science and
technology.
b) Briefly discuss any two of the problems arising out of the lack of
systematic social control over scientific and technological innovations.
6.5
6
Question: 2.
Sketch the code of ethics for engineers according to National Society of
Professional Engineers (NSPE).
12.5
Question: 3. [Marks: 12]
Describe the advantages and disadvantages of telework from the
employee and employer perspective.
12.5
Question: 4.
a) Summarize the factors those have caused the tragedy in Bhopal.
b) Evaluate the demographic transition model of human population and
level of technological development.
6.5
6
Question: 5.
Show evidence that IT workers and employers have a critical,
multifaceted ethical relationship that requires ongoing effort by both
parties to keep it strong.
Question: 6.
a) Describe the responsibilities of the engineer to the environment.
b) Determine the goals of sustainable development.
Page 2 of 2
12.5
6.5
6
Date of Examination: 05/06/2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Computer Science and Engineering
Program: B.Sc. in Computer Science and Engineering
Semester Final Examination: Spring 2020
Year: 2nd
Semester: 1st
Course Number: CSE2103
Course Name: Data Structures
Time: 3 (Three) Hours
Full Marks: 60
Use single answer script
Instructions:
i)
Answer script should be hand written and should be written in A4 white paper.
You must submit the hard copy of this answer script to the Department when
the university reopens.
ii)
You must write the following information at the top page of each answer script:
Department:
Course no:
Examination:
Student ID:
iii)
Program:
Course Title:
Semester (Session):
Signature and Date:
Write down Student ID, Course number and put your signature on top of every
single page of the answer script.
iv)
Write down page number at the bottom of every page of the answer script.
v)
Upload the scan copy of your answer script in PDF format through provided
google form at the respective course site (i.e., google classroom) using
institutional email within the allocated time. Uploading clear and readable scan
copy (uncorrupted) is your responsibility and you must cover all the pages of
your answer script. However, for clear and readable scan copy of the answer
script student should use only one side of a page for answering the questions.
vi)
You must avoid plagiarism, maintain academic integrity, and ethics. You are
not allowed to take any help from another individual and if taken so can result
in stern disciplinary actions from the university authority.
vii)
Marks allotted are indicated in the right margin.
viii) Necessary charts/tables are attached at the end of the question paper. You may
use graph papers where necessary.
ix)
Assume any reasonable data if needed.
x)
Symbols and characters have their usual meaning.
xi)
Before uploading, rename the PDF file as CourseNo_StudentID.pdf
e.g., CSE2103_190104001.pdf
Page 1 of 5
The answer script (one single PDF file) must be uploaded at designated location in the provided Google
Form link available in the Google classroom.
There are 7 (Seven) Questions. Answer any 5(Five).
Question 1. [Marks: 12]
Show the passes to place the pivot in its right position using quick sort technique. If the last
two digits of your ID is less than 100 then use the last element as the pivot, otherwise use
the first element as the pivot.
12, 3, 17, 6, 25, “last two digits of your ID”, 8, 19, 7, 11
Which sorting algorithm works better among all the sorting algorithms you have studied in
this course and why? Justify your answer.
b) Suppose there are two sorted stacks S and T (sorted in descending order, min on top). You
are asked to write a method to create one sorted stack Q (sorted in descending order, min
on top) by combining S and T. You are allowed to use only the stack operations such as
pop, push, size and top. Any other data structures such as arrays are not allowed.
c) You are given five different trees with 18, 15, 13, 14, and 31 nodes. You are asked to find
the full binary trees among these five trees. How will you decide that which one is a full
binary tree? Explain your answer.
a)
[5]
[5]
[2]
Question 2. [Marks: 12]
You are given a one-way linked list and a two-way linked list and asked to perform the
following operations.
i.
Traversing the list to process each node.
ii.
Deleting a node whose location Loc is given.
iii. Searching an unsorted list for a given element ITEM.
iv.
Searching a sorted list for a given element ITEM.
v. Inserting a node before the node with a given location LOC.
Which linked list will you use for which operation? You can focus on the advantages of a
list over another for different operations. Explain your answer.
b) Build a minheap using following data and use heap sort to sort the data in descending order.
30, 50, 22, 33, 40, “last two digits of your ID”, 11, 60, 22, 55
[4]
“Given a directed graph G, both BFS and DFS from a particular starting vertex s will
traverse the same set of vertices.” Do you agree with this statement? Justify your answer.
[3]
a)
c)
[5]
Question 3. [Marks: 12]
In selection sort, we find the minimum value in an array and place it in the first position of [6]
the array for ascending order sorting. We use a loop to find the minimum value of the array.
We can also find the maximum value of the array in the same loop. So, if we find both the
minimum and maximum value in the same loop and place them in their right positions,
minimum in the first and maximum in the last, then we can make the algorithm more
efficient.
i.
Devise the algorithm mentioned above.
ii.
Compare the complexity of the conventional selection sort algorithm and the new
algorithm.
b) Design a sequential memory allocation technique for a ternary tree and explain the [3]
drawbacks of this allocation, if any.
a)
Page 2 of 5
c)
Suppose that a message is to be sent through the computer network from A to F (shown in [3]
figure). The message must be sent through as few computers as possible. Name a general
graph algorithm that can be adapted to solve this problem and implement the algorithm to
find the path from A to F.
Question 4. [Marks: 12]
Transform the following infix expression into its equivalent postfix expression using stack.
21 + ( ( 2 – 50 / 5 ↑ 2 ) * “last two digits of your ID”) * 4 - 8
Now evaluate the postfix expression using stack.
b) Use the schematic diagram of the recursive solution to find the passes for Towers of Hanoi
problem when n=3.
Tower (3, X, Y, Z)
Where, X = beginning peg name will be the last letter of your name,
Y = Auxiliary peg will be the letter before the last letter of your name,
Z = End peg will be the letter before Y of your name (if the Z is same as X or
Y letter, then you can use letter before Z as end peg).
c) Assume a water pipe system as in the following figure shows with weighted graph. Each
edge represents a pipe and the number above each edge represents the time to transfer water
from one node to another. The nodes represent points at which pipes are joined and water
is transferred from one pipe to another. Two nodes s and e are designated as a source of
water and an end user of water respectively. Describe how would you like to minimize the
time of water flowing from the source to the user. Name a general graph algorithm that can
be adapted to solve this problem and implement the algorithm on the following graph to
find the minimum time required for water flowing from the source to the sink.
a)
[6]
[2]
[4]
Question 5. [Marks: 12]
a)
In case of binary search, we divide the search space into two equal parts and then select one
space to search further. Let’s assume, we want to divide the search space into three equal
parts and then select one space to search further.
i.
Devise the algorithm mentioned above.
ii.
What will be the time complexity of the newly derived algorithm?
Page 3 of 5
[6]
iii.
Compare the Binary search complexity and the complexity of the new search
algorithm based on best, average and worst cases with proper examples.
b) Show the different passes of Radix sort algorithm for the following data:
183, 318, 361, “last three digits of your ID”, 658, 107, 366, 543, 321
c)
Traverse the following binary tree using iterative preorder traversal algorithm. Show the
contents of stack at each step.
[3]
[3]
A
B
D
E
C
F
J
H
G
K
L
Question 6. [Marks: 12]
Suppose we create a binary search tree by inserting the following values in the given order:
50, 10, 103, 45, “last three digits of your ID”, 110, 5, 131, 64, 107
Answer the following questions:
i.
Draw the binary search tree.
ii.
Show the output values if we visit the tree using postorder and inorder traversal
techniques.
iii. Show the resulting trees after we delete 45, 110, and 50. (Each deletion is applied
on the original tree.)
iv.
Write an algorithm to count the occurrences of a number in a binary search tree.
b) Design an algorithm to find out the first node which is a prime number in a linked list and
insert a new node after that node. If there is no prime number in the list then insert the new
node after the last node.
c) Show the instances of stack and queue to traverse the graph using DFS and BFS techniques
where starting node X = last digit of your ID % 6.
a)
0
2
3
5
1
4
Page 4 of 5
[4]
[5]
[3]
Question 7. [Marks: 12]
Given a hash table of size 10, and following hash function
h(n) = n%10
Show the resulting hash tables after inserting the following values with separate chaining,
linear probing and coalesced hashing strategies.
43, 52, 20, 30, 45, “last two digits of your ID”, 11, 60, 22, 55
Which method works better for these values and why? Justify your answer with the
advantages of the better method and disadvantages of other methods.
b) Suppose you are given a queue which contains some integer values. Write a function that
will find the minimum value in the queue. Only the queue operations such as eneque,
dequeue, size etc. are allowed to be used. Any other data structures such as arrays can not
be used other than queues. Queue must remain intact after finding the minimum value.
c) What will be the total degree of a complete graph with n vertices? Explain your answer.
a)
Page 5 of 5
[5]
[5]
[2]
Date of Examination: 30.05.2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Computer Science and Engineering
Program: B.Sc. in Computer Science and Engineering
Semester Final Examination: Spring 2020
Year: 2nd
Semester: 1st
Course Number: CSE 2105
Course Name: Digital Logic Design
Time: 3 (Three) Hours
Full Marks: 60
Use single answer script
Instructions:
i)
Answer script should be hand written and should be written in A4 white paper.
You must submit the hard copy of this answer script to the Department when
the university reopens.
ii)
You must write the following information at the top page of each answer script:
Department:
Course no:
Examination:
Student ID:
iii)
Program:
Course Title:
Semester (Session):
Signature and Date:
Write down Student ID, Course number and put your signature on top of every
single page of the answer script.
iv)
Write down page number at the bottom of every page of the answer script.
v)
Upload the scan copy of your answer script in PDF format through provided
google form at the respective course site (i.e., google classroom) using
institutional email within the allocated time. Uploading clear and readable scan
copy (uncorrupted) is your responsibility and you must cover all the pages of
your answer script. However, for clear and readable scan copy of the answer
script student should use only one side of a page for answering the questions.
vi)
You must avoid plagiarism, maintain academic integrity, and ethics. You are
not allowed to take any help from another individual and if taken so can result
in stern disciplinary actions from the university authority.
vii)
Marks allotted are indicated in the right margin.
viii) Necessary charts/tables are attached at the end of the question paper. You may
use graph papers where necessary.
ix)
Assume any reasonable data if needed.
x)
Symbols and characters have their usual meaning.
xi)
Before uploading, rename the PDF file as CourseNo_StudentID.pdf
e.g., CSE2105_180104001.pdf
Page 1 of 4
The answer script (one single PDF file) must be uploaded at designated location in the provided Google
Form link available in the Google classroom.
There are 7 (Seven) Questions. Answer any 5(Five).
Question 1. [Marks: 12]
a) Design a 3-bit universal shift register with the following options:
Mode Control
b)
[8]
Register Operation
S2
0
S1
0
S0
0
Invert all bits
0
0
1
1
1
0
0
1
0
Shift Left
Parallel Load
Set all bits to 1
1
1
0
1
1
0
Set all bits to 0
No Change
1
1
1
Shift Right
Determine the characteristic table and the equation of Clocked RS NOR Latch.
[4]
Question 2. [Marks: 12]
a) Design a block diagram of the BCD adder-subtractor for the two BCD input A and B.
Subtraction and Addition are selected by a selector bit x, such that if x is given 0, the circuit
operates A-B, otherwise, the circuit operates A+B. Explain the operation 8-3 and 8+3 with
your designed circuit.
[8]
b) Implement the Boolean function F (A, B, C, D) = Σ (1,3,6,8,10,12) using 2 to 4-Line
Decoders.
[4]
Question 3. [Marks: 12]
a) Using 2 Full Adders, implement the ALU functions for two 2- bit numbers (A1, A0 & B1,
B0) for the following conditions:
S3
S2
S1
ALU function
0
0
0
A+B+1
0
1
0
-A
0
1
1
AUB
1
0
0
B
1
0
1
A-B-1
1
1
1
A ∩B
Page 2 of 4
[8]
b) Design a 2M X 16 internal memory chip organization.
[4]
Question 4. [Marks: 12]
a) A sequential circuit has two JK flip-flops named A and B, two inputs x and y, and one [10]
output z. The flip-flop input equations and the circuit output equation are J_A =Bx+B'y'
J_B =A'x + Bxy
K_A =B'xy'
K_B =A+xy'
z = Ax'y' + Bx'y'
(Output lines for A-JK flipflop are A and A', similarly for B-JK flipflop are B and B')
(i) Draw the logic diagram of the circuit.
(ii)Tabulate the state table using the following header.
Present sate
A
B
Inputs
x
y
Next States
A(t+1)
Output
B(t+1)
z
FF Inputs
J_A K_A
J_B
K_B
(iii) Derive the state equations for A(t+1) and B(t+1).
b) Design a 4-bit Johnson Counter. What is the disadvantage of Johnson Counter?
[2]
Question 5. [Marks: 12]
a) Design a 4-bit comparator using basic gates to compare two 4 bits numbers P and Q. The
circuit should provide 3 output lines to indicate P>Q, P=Q, P<Q.
[8]
b) Design a 16x1 MUX using 2x1 MUXs only. Use a block diagram construction.
[4]
Question 6. [Marks: 12]
a) Design an up/down Random Asynchronous Counter for the following state table using T
flip-flops. (Consider x=0 for up counter and x=1 for down counter)
Next State
Present
State
x =0
x =1
0
2
5
2
3
0
3
5
2
5
0
3
Page 3 of 4
[7]
b) The contents of a 4‐bit register are initially 1011. The register is shifted six times to the
right with the serial input being 101111. What is the content of the register after each shift?
Describe briefly.
[5]
Question 7. [Marks: 12]
a) A 7-segment display device (fig. 7.a) is capable to display both alphabets and decimal
digits. You need to design a combinational circuit which will show the active segments for
0,1,3,5,7,9 (decimal).
[7]
Fig.: 7.a
The following table represents the active segments for each decimal digit.
Digit
Segments Activated
0
a,b,c,d,e,f
1
b,c
2
a,b,d,e,g
3
a,b,c,d,g
4
b,c,f,g
5
a,c,d,f,g
6
a,c,d,e,f,g
7
a,b,c
8
a,b,c,d,e,f,g
9
a,b,c,d,f,g
b) Design a BCD to Excess-4 code converter circuit.
Page 4 of 4
[5]
Date: 24.05.2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department of Arts and Sciences
Program: B.Sc. in Computer Science and Engineering
Semester Final Examination, Spring-2020
Year: 2nd
Course No: Math 2101
Semester: 1st
Course Name: Mathematics III
Time: 3 (Three) hours
Instructions:
Full Marks: 60
i) Answer script should be hand written and should be written in A4 white paper.
You must submit the hard copy of this answer script to the Department when the
university reopens.
ii) Write down Student ID, Course number, and put your signature on top of every
single page of the answer script
iii) Write down page number at the bottom of every page of the answer script.
iv) Upload the scan copy of your answer script in PDF format at the respective site of the
course at google from using institutional email within the allocated time. Uploading
clear and readable scan copy is your responsibility and must be covered the full page
of your answer script.
v) You must avoid plagiarism, maintain academic integrity, and ethics. You are not
allowed to take any help from another individual and if taken so can result in stern
disciplinary actions from the university authority
vi) Marks allotted are indicated in the right margin
vii) Necessary charts/tables are attached at the end of the question paper
viii) Assume any reasonable data if needed
ix) Symbols and characters have their usual meaning
Page 1 of 4
Use separate answer script for each part
Part-A
Instructions:
i) Before uploading rename the PDF file as CourseNo_StudentID_partA.pdf
e.g. Math2101_180107001_partA.pdf
ii) There are 4 (Four) Questions. Answer any 3 (Three).
Question 1. [Marks: 12]
a)
Write down the history of Complex Numbers. Find all the fifth roots of −16 + 16√3𝑖 and [6]
locate them in the complex plane.
b) Define Riemann surface? Suppose 𝑓(𝑧) = 1⁄𝑧 = 𝑢 + 𝑖𝑣. Construct several members of the [6]
families 𝑢(𝑥, 𝑦) = 𝛼, 𝑣(𝑥, 𝑦) = 𝛽 where 𝛼 and 𝛽 are constants. Show them in a graph.
Question 2. [Marks: 12]
a)
Discuss about the continuity and differentiability of complex functions. Find the orthogonal
trajectories of the family of curves 𝑒 −𝑥 cos 𝑦 + 𝑥𝑦 = 𝛼.
b) Let 𝐶 be the circle |𝑧 − 2| = 5 .
[6]
[6]
𝑑𝑧
= 0,
(i)
Determine whether ∮𝐶
(ii)
Verify whether your answer to (i) contradict Cauchy’s theorem?
𝑧−3
Question 3. [Marks: 12]
a)
𝑧2
[6]
Find a Laurent series expansion of 𝑓(𝑧) = (𝑧−1)(2−𝑧) valid for 0 < |𝑧 − 2| < 1 .
2𝜋 cos 3𝜃
b) Discuss about Cauchy’s Integral formulas and related theorems. Evaluate ∫0
5+4 cos 𝜃
𝑑𝜃 .
[6]
Question 4. [Marks: 12]
a)
Define Laplace Transform. Prove that 𝐿{𝑓(𝑡)𝑈(𝑡 − 𝑎)} = 𝑒 −𝑎𝑠 𝐿{𝑓(𝑡 + 𝑎)}. Hence [6]
determine {𝑈(𝑡 − 𝑎)} .
b) Solve the differential equation: 𝑦 ′′ − 4𝑦 ′ + 4𝑦 = 𝑒 5𝑡 𝑡 5 , 𝑦(0) = 0, 𝑦 ′ (0) = 0 by using [6]
Laplace Transform. Hence verify your answer.
Page 2 of 4
Part-B
Instructions:
i) Before uploading rename the PDF file as
CourseNo_StudentID _PartNo.pdf
e.g. Math2101_180107001_PartB.pdf
ii) There are 3 (Three) Questions, Answer any 2 (Two)
Question 5. [Marks: 12]
a)
The following data represent the lifetimes in hours of a sample of 40 transistors:
112,121,126,108,141,104,136,134,121,118,143,116,108,122,127,140,113,
117,126,130,134,120,131,133,118,125,151,147,137,140,132,119,110,124,
132,152,135,130,136,128
Apply a proper method to classify the data.
[7]
b) An electrical system consists of four components as illustrated in the following figure. The [5]
system works if components A and B work and either of the component C or D work. The
reliability (probability of working) of each component is also shown in the following figure.
Find the probability that (i) the entire system works (ii) The component C does not work,
given that the entire system works.
Assume that four components work independently.
C
A
B
.65
0.85
0.8
500
.6
D
Figure:1
Question 6. [Marks: 12]
a)
Ecommerce.com, a large internet service retailer, is studying the lead time (elapsed time [5]
between when an order is replaced and when it is filled) for a sample of recent orders. The
lead times are reported in days.
Lead time (days) 0-5 5-10 10-15 15-20 20-25
Frequency
6
7
12
8
7
Determine the median lead time. Also show the median value graphically.
Page 3 of 4
b) In a study, the steel rod supplied by two different companies were compared. Ten sample [7]
springs were made out of steel rods supplied by two companies and the bounciness was
studied. The data are as follows:
Company A:
9.3, 8.8, 6.8, 8.7, 8.5, 6.7, 8.0, 6.5, 9.2, 7.0
Company B:
11.0, 9.8, 9.9, 10.2, 10.1, 9.7, 11.0, 11.1, 10.2, 9.6
Compare the variations in the two data set using an appropriate measure.
Question 7. [Marks: 12]
a)
A study of the amount of rainfall and the quantity of air pollution removed from the following [8]
data:
Daily Rainfall,
4.3
4.5
5.9
5.6
6.1
5.5
3.8
2.1
7.5
0.01 cm
Particulate
126
121
116
118
114
118
132
141
108
removed(mcg/cum)
Determine the equation of the regression line to predict the particulate removed from the
amount of daily rainfall. Also estimate the amount of particulate removed when daily rainfall
is 4.8 units.
b) (i) Explain dependent and independent events with example.
[4]
(ii) One bag contains 8 white balls and 5 black balls, and a second bag contains 6 white balls
and 5 black balls. If one ball is drawn from the 1st bag and place unseen in the second bag,
Find the probability that a ball now drawn from the second bag is black?
Page 4 of 4
Date of Examination
: 27-05-2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Electrical and Electronic Engineering
Program: Bachelor of Science in Computer Science & Engineering
Semester Final Examination: Spring 2020
Year: 2nd
Semester: 1st
Course Number: EEE 2141
Course Name: Electronic Devices and Circuits
Time: 3 (Three) Hours
Full Marks: 60
Use a separate answer script for each part
Instructions
i) Answer script should be handwritten and should be written on A4 white paper.
You must submit the hard copy of this answer script to the Department when the university
reopens.
ii) You must write the following information on the top page of each answer script:
Part A/Part B
Department:
Course no:
Examination:
Student ID:
Program:
Course Title:
Semester (Session):
Signature and Date:
iii) Write down Student ID, Course number and put your signature on top of every single page
of the answer script.
iv) Write down the page number at the bottom of every page of the answer script.
v) Upload the scan copy of your answer script in PDF format through provided google form at
the respective course site (i.e., google classroom) using institutional email within the
allocated time. Uploading a clear and readable scan copy (uncorrupted) is your
responsibility and must cover the full page of your answer script. However, for a clear and
readable scan copy of the answer script student should use only one side of a page for
answering the questions.
vi) You must avoid plagiarism, maintain academic integrity, and ethics. You are not allowed
to take any help from another individual and if taken so can result in stern disciplinary
actions from the university authority.
vii) Marks allotted are indicated in the right margin.
viii) Necessary charts/tables are attached at the end of the question paper. You may use graph
papers where necessary.
ix) Assume any reasonable data if needed.
x) Symbols and characters have their usual meaning.
xi) Before uploading rename the PDF file as CourseNo_StudentID_PartNo.pdf
e.g., EEE2141_180103001_PartA.pdf
EEE2141_180103001_PartB.pdf
PART A
The answer script (one single pdf file) of this part (Part A) must be uploaded at a designated location
in the provided google form link available in the google classroom.
There are 4 (Four) questions in Part-A. Answer any 3 (Three) questions.
Question-4 is compulsory.
Question 1. [Marks: 10]
a)
Describe the forward and reverse bias operation of a diode, and illustrate the I-V [3+2]
characteristics curve indicating different regions.
b) Show v0 for each network of Fig. 1(b) for the input shown.
[3+2]
Fig. 1 (b)
Question 2. [Marks: 10]
a)
Describe the working principle of a full-wave bridge rectifier, and estimate the [3+2]
maximum possible rectification efficiency.
b) Compute the range of values of Vi that will maintain the Zener diode in the “on” state.
[5]
Fig. 2 (b)
Question 3. [Marks: 10]
a)
Use difference amplifier with inputs V1, V2, and V3 such that
V0 = -8V1 + 2V2 +5V3
b) Build a 3V level crossing detector using an op-amp and a triangular input voltage
source.
Page 2 of 5
[5]
[5]
Question 4. [Marks: 10]
a)
Discuss different regions of SCR’s characteristics curve. Also, give a list of steps [3+2]
required for IC fabrication.
b) Build a logic circuit with CMOS that gives output based on the following equation.
𝑌 = 𝐴𝐵 + 𝐶𝐷
Page 3 of 5
[5]
PART B
The answer script (one single pdf file) of this part (Part B) must be uploaded at a designated location
in the provided google form link available in the google classroom.
There are 4(Four) questions in Part-B. Answer any 3 (Three) questions.
Question-8 is compulsory.
Question 5. [Marks: 10]
a) Explain the reason for stating BJT as a bipolar device. Describe the output [1+4]
characteristics of a common emitter configuration of BJT.
b) Compute the following parameters from the voltage divider bias circuit in Fig. 5 (b).
i) IC ii)VE iii) VCC iv) VCE.
v) R1.
[5]
Fig. 5(b)
Question 6. [Marks: 10]
a) Compare between FET and BJT. Explain the working principle of a depletion type
MOSFET with necessary illustrations
[1+4]
b) Sketch the approximate hybrid model of the following circuit in Fig. 6 (b) and compute
the following parameters:
i) Zi
ii) Zo.
iii) Av.
iv) A i.
[1+4]
Fig. 6(b)
Page 4 of 5
Question 7. [Marks: 10]
a) For the op-amp circuit in Fig. 7 (a), calculate the value of v2 to make vo 16.5 V.
[5]
Fig. 7(a)
b) Build a square wave generator using an operational amplifier that has oscillation
frequency f=5 kHz and duty ratio D=33%.
[5]
Question 8. [Marks: 10]
a) Explain the operation of an active Band Pass filter using the cascaded configuration of [4+1]
low pass and high pass filter. Also, find the corner frequency and bandwidth of that
filter.
b) Construct a first-order active high pass filter with a high-frequency gain of 5 and a [4+1]
corner frequency of 200 Hz. Also, derive the transfer function of that filter.
Page 5 of 5
Date of Examination: 08.06.2021
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Arts and Sciences
Program: B. Sc. in Computer Science and Engineering
Semester Final Examination: Spring 2020
Year: Second Semester: First
Course Number: HUM 2109
Course Name: Society, Ethics and Technology
Time: 3 (Three) Hours
Instructions:
Full Marks: 60
i) Answer script should be hand written and should be written in A4 white
paper. You must submit the hard copy of this answer script to the
Department when the university reopens.
ii) Write down Student ID, Course number and put your signature on top of
every single page of the answer script.
iii) Write down page number at the bottom of every page of the answer script.
iv) Upload the scan copy of your answer script in PDF format at the respective
site of the course at Googleformusing institutional email within the
allocated time. Uploading clear and readable scan copy is your
responsibility and must be covered the full page of your answer script.
v) Before uploading rename the PDF file as CourseNo_StudentID.pdf
e.g. HUM 2109_190105001.pdf
vi) You must avoid plagiarism; maintain academic integrity, and ethics.
You are not allowed to take any help from another individual and if taken
so can result in stern disciplinary actions from the university authority.
vii) Marks allotted are indicated in the right margin.
viii) Necessary charts/tables are attached at the end of the question paper.
xi) Assume any reasonable data if needed.
x) Symbols and characters have their usual meaning.
xi) There are7 (Seven) Questions.Answer any 5 (Five) Questions.
Page 1 of 2
Question 1. [Marks: 12]
a) Demonstrate the senses of engineering ethics.
b) Differentiate the concepts of ethics and morality with relevant examples.
[5]
[7]
Question 2. [Marks: 12]
a)
Identify the basic features of Rights Theory.
b) Justify the importance of ethical theories in engineering profession.
[5]
[7]
Question 3. [Marks: 12]
a) Make a debate whether switching job is ethical or not from your view point.
[5]
b) Explain the concept of confidentiality based on moral principles.
[7]
Question 4. [Marks: 12]
a) Justify the features of globalizationwith relevant examples.
[5]
b) Evaluate the relationship between the concept of globalization and human rights.
[7]
Question 5. [Marks: 12]
a) Make a reflection of the importance of engineering ethics.
[5]
b) Critically assess the impact of technology on environment.
[7]
Question 6. [Marks: 12]
a) Analyze thecrucial characteristics of technology.
[4]
b) Compare the evolution of technology based on the evolutionary phases of society.
[8]
Question 7. [Marks: 12]
a) Analytically discuss the conflict of interest.
[6]
b) Categorize different types of occupational crimes.
[6]
Page 2 of 2
Date: 11/10/2020
AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY
Department: Computer Science and Engineering
Program: B.Sc. in Computer Science and Engineering
Semester Final Examination, Fall-2019
Year: 2nd
Course No: CSE2105
Semester: 1st
Course Name: Digital Logic Design
Instructions:
i) Answer script should be hand written and should be written in A4 white paper.
You must submit the hard copy of this answer script to the Department when the
university reopens.
ii) Write down Student ID, Course number, and put your signature on top of every
single page of the answer script.
iii) Write down page number at the bottom of every page of the answer script.
iv) Upload the scan copy of your answer script in PDF format at the respective site of
the course at google classroom using institutional email within the allocated time.
Uploading clear and readable scan copy is your responsibility and must be covered
the full page of your answer script.
v) You must avoid plagiarism, maintain academic integrity, and ethics. You are not
allowed to take any help from another individual and if taken so can result in stern
disciplinary actions from the university authority.
Page 1 of 5
Part A
Time: 2 (Two) hours
Full marks: 40
Use Single answer script
Instructions:
i) Before uploading rename the PDF file as
CourseNo_StudentID_PartNo
e.g.CSE2105_180204001_partA.pdf
ii) There are 5 (Five) Questions, Answer any 4 (Four)
iii) Marks allotted are indicated in the right margin
iv) Assume any reasonable data if needed
v) Symbols and characters have their usual meaning
Question 1. [Marks: 10]
a)
Using the tabulation method, determine the prime-implicants of the following function and then [7]
minimize using prime-implicants table.
F (w, x, y, z) = Σ (0, 2, 6, 10, 12)
d (w, x, y, z) = Σ (1, 3, 5, 7) [Here, d for don’t care]
b)
An 8 to 1 multiplexer has inputs A, B, C and D, where inputs A, B and C are connected to the [3]
selection inputs S2, S1 and S0, respectively. The data inputs I0 through I7 are as follows:
II = I2= 0;
I3 = I7= 1;
I4= I5 = D; and
I0= I6 = D'.
Determine the Boolean function that the multiplexer implements.
Question 2. [Marks: 10]
a)
Design a code converter using basic gates which will convert the 8, 4, 2, 1 BCD code to 5, 2, 1, [7]
1 BCD code.
b)
Obtain the output expression for an 8 to 3-line priority encoder where the priorities are as follows: [3]
I7 > I5 > I3 >I1 > I0 > I2 > I4 > I6
Question 3. [Marks: 10]
a)
Design a MOD-6 asynchronous counter using the JK flip-flops and briefly describe its operation. [5]
Page 2 of 5
b)
What do you know about the Race Around Condition in the JK flip-flop? How can this problem [5]
be solved? Explain with the necessary circuits.
Question 4. [Marks: 10]
a)
What are the advantages of the CLA (Carry Look Ahead) over normal binary four-bit adders? [7]
Assume that the exclusive-OR gate has a propagation delay of 10 ns and the AND or OR gate
have a propagation delay of 5 ns. What is the total propagation delay time in the four-bit CLA
adder?
b)
Determine whether the following circuit works for the ring counter or Johnson counter. Assume, [3]
the initial inputs are Q3=1, Q2=0 and Q1= 0. Justify your answer with sequence table and
definition of counter (ring counter / Johnson counter).
Figure: 4.b
Question 5. [Marks: 10]
a)
Using 3 Full Adders and basic gates (if needed), implement the ALU functions for two 2- bit [10]
numbers (A2, A1, A0 & B2, B1, B0) for the following conditions:
S1
S2
S3
ALU
function
0
0
0
A-1
0
0
1
A -B-1
0
1
0
A+B
0
1
1
A ∩B
1
0
1
-B
1
1
0
AUB
1
1
1
A XOR B
Page 3 of 5
Date: 11/10/2020
Part-B (Open book exam)
Submission deadline: Next day 6.30 pm
Full marks: 20
Use Single answer script
Instructions:
i) Before uploading rename the PDF file as
CourseNo_StudentID_PartNo
e.g.CSE2105_180204001_partB.pdf
ii) Answer all the Questions
iii) Marks allotted are indicated in the right margin
iv) Assume any reasonable data if needed
v) Symbols and characters have their usual meaning
Question 1. [Marks: 10]
Design a 3-bit universal shift register with the following options:
Mode Control
[10]
Register Operation
S2
S1
S0
0
0
0
No Change
0
0
1
Shift Right
0
1
0
Shift Left
0
1
1
Parallel Load
1
0
0
Set all bits to 0
1
0
1
Set all bits to 1
1
1
0
Invert all bits
1
1
1
No Change
Page 4 of 5
Question 2. [Marks: 10]
Design a block diagram of the BCD adder-subtractor for the two BCD input A and B. Addition [10]
and subtraction is selected by a selector bit x, such that if x is given 0, the circuit operates A+B,
otherwise, the circuit operates A-B. Explain the operation 9+7 and 9-7 with your designed circuit.
Page 5 of 5