Advanced Computer Architecture(MS1101

Explain the characterstics of high performance computing

Why is hardware security important?Explain with an example

Hardware security protects the machine and peripheral hardware from theft and from electronic
intrusion and damage. This comes in the form of a physical device rather than software that's installed
on the hardware of a computer system.

Some of the most common examples of hardware security are hardware firewalls, scanning devices,
proxy servers, etc

One of the primary importance of hardware security is, less accessibility compared to software that
might be vulnerable to the entire world of hackers. The attackers may not easily understand the security
built on the premise.

Below are other importance of handware security

 Security in hardware offers performance and power consumption advantages over its software
equivalents.

◼ Increasing amounts of data being processed and the complexity of encryption algorithms slows down
security implementations severely.

◼ Often times these same encryption algorithms can be implemented in hardware.

Design and Analysis of Algorithms(MS1103)

How is an algorithm’s time efficiency measured?

Firstly, an algorithm is defined as a collection of unambiguous instructions occurring in some specific

sequence and such an algorithm should produce for given input in finite amount of time.

Time efficiency is one of the factors considered while analyzing the algorithm. It determines the amount
of time taken by an algorithm to run.

The efficiency can be measured by computing time complexity of each algorithm and this can be well
represented by using asymptotic notations.

There are mainly three asymptotic notations:

1. Big-O notation

This document has been classified as CONFIDENTIAL-EXTERNAL by Centenary Bank.

 The big-o notation is denoted by ‘O’ .It is a method of representing the upper bound of algorithm’s
running time. Thus, it gives the worst-case complexity of an algorithm.

For a given function g(n), O(g(n)) is denoted by:

O(g(n)) = { f(n): there exist positive constants c and n 0

such that 0 ≤ f(n) ≤ cg(n) for all n ≥ n 0 }

The above expression can be described as a function f(n) belongs to the set O(g(n)) if there exists a
positive constant c such that it lies between 0 and cg(n), for sufficiently large n.

For any value of n, the running time of an algorithm does not cross the time provided by O(g(n)).

Since it gives the worst-case running time of an algorithm, it is widely used to analyze an algorithm as
we are always interested in the worst-case scenario.

2. Omega notation

It is denoted by Ω.This notation is used to represent the lower bound of algorithm’s running time.
Thus, it provides the best case complexity of an algorithm.

For a function g(n), Θ(g(n)) is given by the relation:

Ω(g(n)) = { f(n): there exist positive constants c and n 0

such that 0 ≤ cg(n) ≤ f(n) for all n ≥ n 0 }

The above expression can be described as a function f(n) belongs to the set Ω(g(n)) if there exists a
positive constant c such that it lies above cg(n), for sufficiently large n.

For any value of n, the minimum time required by the algorithm is given by Omega Ω(g(n)).

3. Theta Notation
It is denoted by Θ. This method represents the upper bound and the lower bound of the running
time. It is used for analyzing the average-case complexity of an algorithm.

For a function g(n), Θ(g(n)) is given by the relation:

Θ(g(n)) = { f(n): there exist positive constants c1, c2 and n0

such that 0 ≤ c 1g(n) ≤ f(n) ≤ c2g(n) for all n ≥ n0 }

The above expression can be described as a function f(n) belongs to the set Θ(g(n)) if there exist positive
constants c1 and c2 such that it can be sandwiched between c1g(n) and c2g(n), for sufficiently large n.

If a function f(n) lies anywhere in between c1g(n) and c2g(n) for all n ≥ n0, then f(n) is said to be
asymptotically tight bound.

This document has been classified as CONFIDENTIAL-EXTERNAL by Centenary Bank.

 Data Modelling and Design(MS1102)

What Are the Three Types of Data Models?

What Does a Data Modeler Use Normalization For?

Normalization is a technique that systematically eliminates data redundancies in a relational database

by eliminating undesirable characteristics like Insertion, Update and Deletion anomalies. Failure to
eliminate anomalies leads to data redundancy and can cause data integrity and other problems as the
database grows.

1. It is used to remove the duplicate data and database anomalies from the relational table.
2. Normalization helps to reduce redundancy and complexity by examining new data types
used in the table.
3. It is helpful to divide the large database table into smaller tables and link them using
relationship.
4. It avoids duplicate data or no repeating groups into a table.
5. It reduces the chances for anomalies to occur in a database.

Advanced Java Programming - Theory & Practical(MS1104)

Explain with implementation about Inheritance and usage of Super keyword

Explain steps in JDBC and different types of statements in JDBC

Technical Communication for Business Leaders(MS1106)

Briefly explain why your appearance is important in communication?

You have been selected to educate a group officials regarding learning how to listen whenever there is
any communication on the current economic criss. Briefly explain why it is important to be a good
listener?

This document has been classified as CONFIDENTIAL-EXTERNAL by Centenary Bank.