Bangladesh Army University of Science and Technology Assistant Programmer Exam: 2021প্রশ্ন ও সমাধান
- Set by
- Bangladesh Army University of Science and Technology
- Post
- Assistant Programmer
- Exam date
- 2021
- Questions
- 7 (0 MCQ, 7 written)
- Exam guide
- Defence organisations' IT posts · প্রতিরক্ষা প্রতিষ্ঠানের আইটি পদ
- Networking · নেটওয়ার্কিং 3
- Algorithms · অ্যালগরিদম 1
- Data Structures · ডেটা স্ট্রাকচার 1
- Database · ডেটাবেজ 1
- Operating Systems · অপারেটিং সিস্টেম 1
A file system with 300 GB uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system.
Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন
Construct a full binary tree from the given inorder and preorder traversal is as follows:
Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন
The message 11001001 is to be transmitted using the CRC polynomial x³ + 1 to protect it from the errors. Now find out the message that should be transmitted.
Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন
In serial communication employing 8 data bits, a parity bit and 2 stop bits. What is the minimum band rate requested to sustain a transfer rate of 300 characters per second?
Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন
Host A is sending data to Host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window size are 5 packets each. Data packets (sent only from A to B) are all 1000 bytes long and transmission time for such a packet is 50µs. Acknowledgement packets (sent only from B to A) are very small and require negligible transmission time. The propagation delay over the link is 200 us. What is the maximum achievable throughput in this communication?
Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন
Database table by name Loan Records is given below:
Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন
Consider the following graph: Now find the minimum spanning tree using Kruskal's algorithm.
Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন
Question text is from the public recruitment exam; answers and explanations are written by ARBS Academy. All past papers · Defence organisations' IT posts guide