http://dspace.ewubd.edu:8080/handle/123456789/1938 2026-04-05T23:24:36Z http://dspace.ewubd.edu:8080/handle/2525/3012 Software product Line Feature Tree Analysis Tool Islam, Md. Iearul; Zaman, Hanufa The concept of a software product line (SPL) is to promise about approaching for increasing planned reusability in industry. Feature models are enable for planning and strategic decisions both in architectural and in component development. Feature models contribute to efficiency and structure of various software development activities. Feature models have a tree structure, with features forming nodes of the tree. The arcs and groupings of features represent feature variability. There are six different types of feature groups: mandatory, alternative, or, optional, optional alternative and optional or. The logical representation provides a precise and rigorous formal interpretation of the feature diagrams. Software product lines (PLs) present a solid approach in large scale reuse. Due to the PLs’ inherit complexity, many PL methods use the notion of “features” to support requirements analysis and domain modeling. The approach makes use of extensions in the feature modeling techniques and adopts plug-in architectures as a means of mapping feature structures and at the same time satisfying the demanded PL variability and flexibility. This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh. 2016-01-21T00:00:00Z http://dspace.ewubd.edu:8080/handle/2525/3004 Grade Diffusion and Quantum Inspired Evolutionary Algorithm to Solve Fault Node Recovery Problem in Wireless Sensor Network Nur, Yeasin Muhammad Wireless sensor network (WSN) consists of spatially dispersed and dedicated sensors for monitoring and recording the physical conditions of the environment and organizing the collected data at a central location. In most of the case wireless sensor network (WSN) measure environmental conditions such as temperature, sound, pollution levels, humidity, wind speed and direction, pressure, etc. In this paper we applied fault sensor node recovery algorithm to increase the life time of a WSN when few sensors are damaged or shut down due to technical problem or low level of battery power. This algorithm is based on the Grade diffusion algorithm combined with the quantum inspired evolutionary algorithm. This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh. 2016-02-01T00:00:00Z http://dspace.ewubd.edu:8080/handle/123456789/2116 Investigating Scope of NoSQL Approach Using Hadoop Platform Shuvo, Rohul Amin; Zohora, Fatema Tuz With the current emphasis on huge data storing, NoSQL database have surged in popularity. Big data is used for massive data sets having large and complex structure with difficulties of storing, analyzing and visualizing for further results. These databases are claimed to perform better than SQL databases. The primary purpose of this project is to independently investigate the performance of some NoSQL and SQL-based approach. We used maximum, minimum and average operations on keyvalue stores implemented by NoSQL and SQL databases. In these project we used synthetically generated temperature data for experimental purpose. This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh 0005-01-01T00:00:00Z http://dspace.ewubd.edu:8080/handle/123456789/2115 A Java Based Tool to Monitor Execution Time of Different Sorting Algorithms Chowdhury, Nusrat In computer science, each sorting algorithm is better in some situation and has its own advantages. For example, the insertion sort is preferable to the quick sort for small files and for almost-sorted files. To measure the performance of each sorting algorithm, the most important factor is runtime that a specific sort uses to execute a data. Because the fastest algorithm is the best algorithm, it pays to know which is the sorting algorithm fastest. In this study, we will determine the efficiency of the various sorting algorithms according to the time and number of swaps by using randomized trials. The build environment will be built using the Java language. The research will discuss and implement several sorting algorithms such as bubble sort, selection sort, insertion sort and will also include complexity sort such as quick sort, cocktail sort, and merge sort. I will represent these algorithms as a way to sort an array or integers and run random trails of length. The research will provide the number of swaps and the runtime of each sorting algorithm. To investigate, I create a package called “sorting” which contains two classes. First is called “sorting Algorithms” which contains all sorting algorithms that can be called from any other classes. Another is “sorting Test” which is the class that we will use to test these sorting algorithms. The “sorting Test” class, will provide the amount of swaps of each sorting algorithm and the runtime (in millisecond) to execute a sort. In the experiment we will measure the runtime in millisecond because it can show the different of each algorithm better than using second. Each algorithm takes short time to execute a sort. It takes less than a second for a big size of array (n=50,000). i This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh 0001-01-01T00:00:00Z