Answer Posted / vignesh1988i

dear sir ,
your logic might be incorrect , AND GIVE THE FULL PROGRAM SIR

sir you have told that TEMP pointer which point to the last
node.... ok ,for first you can swap the data.... ie STARTING
to TEMP. but how will you arrive at next pair of node for
swapping by decrementing the TEMP , ... a single linked
lists can travel only in one direction from HEAD till NULL
......


THANK U

Explain high-order bytes.

1076

---

How to explain the final year project as a fresher please answer with sample project

923

---

Write a program to print fibonacci series without using recursion?

1080

---

main() { int i = 10; printf(" %d %d %d ", ++i, i++, ++i); }

1102

---

What is multidimensional arrays

1082

---

What do you mean by recursion in c?

1069

---

What does c value mean?

1129

---

Explain what are linked list?

1005

---

What are the 3 types of structures?

1002

---

In cryptography, you could often break the algorithm if you know what was the original (plain) text that was encoded into the current ciphertext. This is called the plain text attack. In this simple problem, we illustrate the plain text attack on a simple substitution cipher encryption, where you know each letter has been substituted with a different letter from the alphabet but you don’t know what that letter is. You are given the cipherText as the input string to the function getwordSets(). You know that a plain text "AMMUNITION" occurs somewhere in this cipher text. Now, you have to find out which sets of characters corresponds to the encrypted form of the "AMMUNITION". You can assume that the encryption follows simple substitution only. [Hint: You could use the pattern in the "AMMUNITION" like MM occurring twice together to identify this]

2434

---

Explain the difference between malloc() and calloc() function?

1003

---

Why string is used in c?

962

---

What is the heap in c?

1040

---

What is pass by value in c?

1032

---

to find the closest pair

2300

---