1

Northern Electricity Supply Company Limited (NESCO)

AM(ICT)
Exam: BUET Exam Date: 31/12/2021

1. (a)
(i) Linux command for showing all files including the hidden files inside home directory.
(i) Soln: $ ls –a

(ii) Showing disk size, disk space in human readable format.

(ii) Soln: $ df –h

(b)
(i) Write a JavaScript function for validate a phone number of 10 digits with no comma, no spaces,
no punctuation and there will be no + sign in front the number. Simply the validation will remove
all non-digits and permit only phone numbers with 10 digits.
(i) Soln:
function phonenumber(input){
var phone_no = /^\d{10}$/;
if((input.value.match(phone_no){
alert("Valid Phone No");
return true;
}else{
alert("Invalid Phone No");
return false;
}
}

(ii)Why use CSS in website.

Soln: CSS describe how the page to be displayed.
The HTML attributes are being deprecated. So, for making HTML pages compatible with future
browsers uses css.
Easy to maintenance.
Pages load faster and can be link many pages to one css style sheet so it should be easier to
maintain a consistent appearance.

2. (i) Protocol used for automatically assigns IP address.

(ii) Protocol used for generating IP address from a URL.
(iii) Protocol used to retrieve emails.
(iv) Protocol used to find MAC address from an IP address.
Soln: (i) DHCP
(ii) DNS
(ii) POP3
(IV) ARP

(b) Explain DDOS Attack.

Soln: DDoS Attack means "Distributed Denial-of-Service (DDoS) Attack" and it is a cybercrime in
which the attacker floods a server with internet traffic to prevent users from accessing connected online
services and sites

MD.ATUL KABIR
 2

3. (a) SQL Query for list the dept name whose average salary is greater than the average salary of
the company.[Table structure given; Something Like…]

(b) Design the communication for the user login system for a MVC pattern framework.
Soln:

𝟏 𝟐 𝟑
4.(a) Write a c/c++ program up to series n: 𝟐𝑿𝟑 + 𝟑𝑿𝟒 + 𝟒𝑿𝟓 + ⋯ .
Soln:
#include <iostream>
using namespace std;

int main(){
double i,sum=0,n;
cout<<"Enter value of n: ";
cin>>n;
for(i=0;i<=n;i++){
sum+=i/((i+1)*(i+2));
}
cout<<"Sum is: "<<sum;
return 0;
}
(b) (i) For which data structure operations, Linked List is better than Array?(Insert, Delete,
Search).
Soln: Linked list is faster than Array for insert and delete operation But for search Array is faster than
Linked list.

(ii) Maximum and Minimum no of Nodes for a binary tree of height 7 where root is considered as
height 0.
Soln: Minimum no of Nodes: 20+1 -1 = 1
Maximum no of Nodes: 27+1 -1 = 255

5. Finding bit rate from a TDM network using Nyquist Theorem.[Something like…]

Add FB Group: IT JOB SOLUTION

MD.ATUL KABIR