SESSION
FEB/MAR 2021
PROGRAMME
MASTER OF
COMPUTER APPLICATION (MCA)
SEMESTER
I
COURSE CODE
& NAME
DCA6105 -
COMPUTER ARCHITECTURE
1. What do you understand by parallelism in computer
architecture? Discuss the different classes of parallelism and parallel architectures?
Ans
1.
Parallel
Computing:
It is the use of multiple processing elements simultaneously for solving
any problem. Problems are broken down into instructions and are solved
concurrently as each resource that has been applied to work is working at the
same time.
1. It can be impractical to solve larger problems
on Serial Computing.
Its Half solved only
Buy Complete from
our online store
Fully solved
assignment available for session Feb/March 2021,
your last date is 31th July 2021.
Lowest price guarantee with
quality.
Charges INR 150 only per assignment. For more information
you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.aapkieducation.com
After mail, we will reply you
instant or maximum
1 hour.
Otherwise you can also
contact on our
whatsapp no
8791490301.
Contact no is +91
87-55555-879
2.
What do you understand by process and threads?
Differentiate between them?
Answer:
Process:
Process means any program is in execution. Process control block controls the
operation of any process. Process control block contains information about
processes for example Process priority, process id, process state, CPU,
register, etc. A process can create other processes which are known as Child Processes. Process takes
more time to terminate and it
3.
Explain Amdahl’s Law of computer design.
Answer:
Amdahl’s
Law:
In computer architecture, Amdahl's law (or Amdahl's argument) is a formula which
gives the theoretical speedup in latency of the execution of a
task at fixed workload that can be expected of a system whose resources are
improved.
In computer architecture, Amdahl's law is a formula which It is named after computer
SESSION
FEB/MAR 2021
PROGRAMME
MASTER OF COMPUTER APPLICATION (MCA)
SEMESTER
I
COURSE CODE & NAME
DCA6104 – ADAVANCED DATABASE MANAGEMENT
SYSTEMS
1.
Consider two tables named ‘Student’ and
‘Course’ as follows
Table: Student
(a) Find the Cartesian Product of Tables
‘Student’ and ‘Course’.
(b)
What will be the result after the successful execution of the following
Relational Algebra Expressions?
•
σ age> 18(Student)
|
|
||
Reg-No |
Name |
Age |
|
|
|
|
|
R1 |
A |
18 |
|
R2 |
B |
20 |
|
R3 |
C |
19 |
|
R4 |
D |
17 |
|
Table: Course |
|
||
Course_No |
Course_Name |
Credits |
|
DCA6104 |
ADBMS |
4 |
|
DCA6103 |
CSA |
3 |
|
DCA6101 |
Programing in C |
4 |
|
Its Half solved only
Buy Complete from
our online store
Fully solved
assignment available for session Feb/March 2021,
your last date is 31th July 2021.
Lowest price guarantee with
quality.
Charges INR 150 only per assignment. For more information
you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.aapkieducation.com
After mail, we will reply you
instant or maximum
1 hour.
Otherwise you can also
contact on our
whatsapp no
8791490301.
Contact no is +91
87-55555-879
Answer:
(a) Find the Cartesian Product of Tables ‘Student’ and ‘Course’.
Reg-No. |
Name |
Age |
Course_No |
Course_Name |
Credits |
R1 |
A |
18 |
DCA6104 |
ADBMS |
4 |
R1 |
A |
18 |
DCA6103 |
CSA |
3 |
R1 |
A |
18 |
DCA6101 |
Programing
in C |
4 |
R2 |
B |
20 |
DCA6104 |
ADBMS |
4 |
R2 |
B |
20 |
DCA6103 |
CSA |
3 |
R2 |
B |
20 |
DCA6101 |
Programing
in C |
4 |
R3 |
C |
19 |
DCA6104 |
ADBMS |
4 |
R3 |
C |
19 |
DCA6103 |
CSA |
3 |
R3 |
C |
19 |
DCA6101 |
Programing
in C |
4 |
R4 |
D |
17 |
DCA6104 |
ADBMS |
4 |
R4 |
D |
17 |
DCA6103 |
CSA |
3 |
R4 |
D |
17 |
DCA6101 |
Programing
in C |
4 |
(b) What will be the result after
the successful execution of the following Relational Algebra Expressions?
• σ age> 18(Student)
Reg-No. |
Name |
Age |
Course_No |
Course_Name |
Credits |
|||||
R2 |
B |
20 |
DCA6104 |
ADBMS |
4 |
|||||
R2 |
B |
20 |
DCA6103 |
CSA |
3 |
|||||
R2 |
B |
20 |
DCA6101 |
Programing
in C |
4 |
|||||
R3 |
C |
19 |
DCA6104 |
ADBMS |
4 |
|||||
R3 |
C |
19 |
DCA6103 |
CSA |
3 |
|||||
R3 |
C |
19 |
DCA6101 |
Programing
in C |
4 |
|||||
• πName(σ age> 18(Student))
B |
C |
2. What do
you mean by Primary Key, Composite Key and Foreign Key Attributes/Fields?
Explain by taking a suitable example of each.
Answer:
Primary
Key
PRIMARY KEY in DBMS is a column or group of columns in a table that uniquely identify
every row in that table. The Primary Key can't be a duplicate meaning the same
value can't appear more than once in the table. A table cannot have more than
one primary key.
Rules
for defining Primary key:
- Two rows can't have the same
primary key value
3. Assume all the relations/tables as mentioned in Q1 are available for
this question. Suppose we defined a new third relation named ‘ Registration’ as
follows:
Table: Course |
||
Course_No |
Course_Name |
Credits |
DCA6104 |
ADBMS |
4 |
DCA6103 |
CSA |
3 |
DCA6101 |
Programing in C |
4 |
Table: Registration |
|
||
Reg-No |
Course No |
Room |
|
R1 |
DCA6104 |
1 |
|
R1 |
DCA6103 |
2 |
|
R2 |
DCA6104 |
1 |
|
R2 |
DCA6103 |
2 |
|
Explain all forms of ‘join’
operator (such as ‘natural join’, ‘left outer join’ , ‘ right outer join’ and
‘full outer join’) of Relational Algebra using ‘Registration’ and ‘Course’
tables/relations as examples.
Answer:
1. Natural Join:
Natural
Join joins two tables based on same attribute name and datatypes. The resulting
table will contain all the attributes of both the table but keep only one copy
of each common column.
INTERNAL ASSIGNMENT SET-I
SESSION
FEB/MAR 2021
PROGRAMME
MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER
I
COURSE CODE & NAME
DCA6103 – FOUNDATION OF MATHEMATICS
1. a) Out of 30 students in dormitory, 15 take an art course, 8 take a
biology course of 6 take a chemistry course. It is known that 3 students take
all the three courses. Show that 7 or more students take none of the courses.
Ans 1.
There are total 30 students.
Out of which 3 took all the three courses. So,
students remained = 30 - 27.
Students who took arts course = 15, out of these
15 students, 3 students are also included who took all the three courses.
Students who took biology course = 8, out of
these 8 students, 3 students are also included
Its Half solved only
Buy Complete from
our online store
Fully solved
assignment available for session Feb/March 2021,
your last date is 31th July 2021.
Lowest price guarantee with
quality.
Charges INR 150 only per assignment. For more information
you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.aapkieducation.com
After mail, we will reply you
instant or maximum
1 hour.
Otherwise you can also
contact on our
whatsapp no
8791490301.
Contact no is +91
87-55555-879
2. a) Simplify the following
statements:
Answer:
(Using
by DeMorgan's Double Negation Laws)
= ~p ˄ q
= p ˅ ~q
3. a) Find the nth derivative of 𝒆𝒙(𝟐𝒙+𝟑)𝟑
Answer:
𝒆𝒙(𝟐𝒙+𝟑)𝟑= y
b) Evaluate: ∫ (𝟑𝒕 + 𝟓)co𝒔
(𝒕/𝟒) dt
∫udv = uv - ∫vdu
u = 3t+5 ⇒ du = 3dt
SESSION
FEB/MAR 2021
PROGRAMME
MASTER OF
COMPUTER APPLICATION (MCA)
SEMESTER
I
COURSE CODE
& NAME
DCA6102 – PROGRAMMING IN C
Q1. a)
Explain Structure of a C Program.
b) Explain various constants used in C Programming with
example.
Ans 1.
1.
a) Explain the Structure of
a C Program.
The structure is a
group of variables of different data types represented by a single name.
Basically structure of the C program is
divided into six different sections,
i. Documentation section: The Documentation section consists of a set
of comment lines.
ii. Link section: The link section provides instruction to the
compiler to link the header files or functions from the system library. Its Half solved only
Buy Complete from
our online store
Fully solved
assignment available for session Feb/March 2021,
your last date is 31th July 2021.
Lowest price guarantee with
quality.
Charges INR 150 only per assignment. For more information
you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.aapkieducation.com
After mail, we will reply you
instant or maximum
1 hour.
Otherwise you can also
contact on our
whatsapp no
8791490301.
Contact no is +91 87-55555-879
Q2. a) Explain bitwise operators with
example.
b) What do you understand by precedence and
associativity of an operator. Explain with example.
Ans 2.
a) Explain bitwise operators with examples.
The following table lists
the Bitwise operators supported by C. Assume variable 'A' holds 60 and variable
'B' holds 13, then −
b) What do you understand
by precedence and associativity of an operator? Explain with example.
Operator
precedence:
It determines which operator is performed first in an expression with
more than one operators with different precedence.
For
example: Solve
10
+ 20 * 30
Q3 a) What do
you understand by type casting. Explain with example.
b) Explain
unformatted and formatted input and output functions with example.
Answer:
3. a) What do you understand by type casting?
Explain with example.
A type cast is basically a conversion from one type to another. There
are two types of type conversion:
1. Implicit Type Conversion
Also known as ‘automatic type conversion’.
·
Done
by the compiler on its own, without any external trigger from the user.
No comments:
Post a Comment