Answer Posted / swati sinha

Linked list is a datastructure which consist of many nodes
linked wit each other.Each node is divided in to
2parts.one has the data and the other has address which
points to the next node.the last node has null pointer.

Why do we use oop?

1041

---

What is an interface in oop?

984

---

Get me an image implementation program.

1939

---

Objective The objective of this problem is to test the understanding of Object-Oriented Programming (OOP) concepts, in particular, on encapsulation. Problem Description Create a program for managing customer’s bank accounts. A bank customer can do the following operations: 1. Create a new bank account with an initial balance. 2. Deposit money into his/her account. 3. Withdraw money from his/her account. For this operation, you need to output “Transaction successful” if the intended amount of money can be withdrawn, otherwise output “Transaction unsuccessful” and no money will be withdrawn from his/her account. Input The input contains several operations and is terminated by “0”. The operations will be “Create name amount”, “Deposit name amount”, or “Withdraw name amount”, where name is the customer’s name and amount is an integer indicating the amount of money. There will be at most 100 bank accounts and they are all created on the first month when the bank is opening. You may assume that all account holders have unique names and the names consist of only a single word. Output The output contains the transaction result of withdrawal operations and the final balance of all customers after some withdrawal and deposit operations (same order as the input). Sample Input Create Billy 2500 Create Charlie 1000 Create John 100 Withdraw Charlie 500 Deposit John 899 Withdraw Charlie 1000 0

2177

---

Why oops is important?

1029

---

What is class in oop with example?

1040

---

What does oop mean in snapchat?

1153

---

Why do we use oops?

961

---

What do you mean by Encapsulation?

1022

---

Can you inherit a private class?

1058

---

#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2564

---

Please send ford technologies placement paper 2 my mail id

2057

---

What is encapsulation and abstraction? How are they implemented in C++?

1066

---

Give an example where we have to specifically use C programming language and C++ programming language cannot be used?

1571

---

How oops is better than procedural?

1027

---