Category: ব্লগ । Blog

ব্লগ । Blog

Can you answer these questions on Data Science Project Development

Can you answer these questions on Data Science Project Development Questions to answer 1. What does a data science project usually involve? What is the common theme across data science projects? 2. Does industry projects and research projects differ? Why and to what extent? 3. What are the some dataset repositories? Where can you get …

Continue reading

In Object Oriented Design: What are Association, Aggregation, Composition, and Generalization?

In Object Oriented Design: What are Association, Aggregation, Composition, and Generalization? How are these represented in Diagrams? Draw the diagrams. Give examples of Association, Aggregation, Composition, and Generalization. Write some example skeleton classes in any OOP language. What is the difference between Aggregation and composition? What is the difference between  Generalization and Specialization? Ref: https://www.visual-paradigm.com/guide/uml-unified-modeling-language/uml-aggregation-vs-composition/ Aggregation and Composition are …

Continue reading

Adapter Design Patterns

Adapter Design Patterns What is a design pattern? What is a Structural Design Pattern? What is an Adapter Design Pattern? What is the purpose of the Adapter Design Pattern? What is the category of the Adapter Design Pattern? Provide use cases where you can use a Adapter design pattern. How do you implement the Adapter …

Continue reading

Shirt Collection and Mongo Queries

MongoDB: Shirts Colection, and Some Mongo Queries

MongoDB: Insert, Collection, Aggregate, Lookup

db.orders.insertMany( [   { “_id” : 1, “item” : “almonds”, “price” : 12, “quantity” : 2 },   { “_id” : 2, “item” : “pecans”, “price” : 20, “quantity” : 1 },   { “_id” : 3  }] ) db.inventory.insertMany( [   { “_id” : 1, “sku” : “almonds”, “description”: “product 1”, “instock” : 120 },   { “_id” : …

Continue reading

MongoDB: Lookup and Aggregate: Reference Model

Binary Tree Traversal using In Order: In C

Binary Tree Traversal in Post Order: In C

Pre Order Traversal of a Binary Tree in C

// pre order traversalvoid preOrder(NodePtr node) { if (node != NULL) { printf(“%s “, node->data.word); preOrder(node->left); preOrder(node->right);} }