Bubble sort is the simplest sorting algorithm. In this technique we follow given step to short given elements in increasing order.
http://www.tutorial4us.com/data-structure/c-bubble-sort
This C program concatenates two strings entered by the user. It first allocates memory for the two input strings and a third string to hold the concatenated output. It then uses a for loop to copy the first string into the output string, leaves a space, and copies the second string into the remaining portion using another for loop. The concatenated string is then printed.
The program accepts the order and elements of two matrices as input from the user. It then multiplies the matrices and stores the product in a third matrix. The product matrix is then printed to the screen. The program checks that the matrices can be multiplied by verifying that the number of columns of the first matrix matches the number of rows of the second.
Bubble sort is the simplest sorting algorithm. In this technique we follow given step to short given elements in increasing order.
http://www.tutorial4us.com/data-structure/c-bubble-sort
This C program concatenates two strings entered by the user. It first allocates memory for the two input strings and a third string to hold the concatenated output. It then uses a for loop to copy the first string into the output string, leaves a space, and copies the second string into the remaining portion using another for loop. The concatenated string is then printed.
The program accepts the order and elements of two matrices as input from the user. It then multiplies the matrices and stores the product in a third matrix. The product matrix is then printed to the screen. The program checks that the matrices can be multiplied by verifying that the number of columns of the first matrix matches the number of rows of the second.
This C program accepts two singly linked lists as input and prints a list containing only the elements common to both lists. It contains functions to create and display the lists, as well as a common_elements function that iterates through both lists, comparing elements and printing any matches. The main function calls list_create twice to populate the lists, display_list to output the lists, and common_elements to find and print the common elements.
This C program accepts two strings as input and checks if the second string is a substring of the first string. If it is a substring, the program outputs the starting and ending locations of each occurrence of the substring in the main string. If the substring is not found, the program outputs "Not substring". It uses a while loop to iterate through the strings and compare characters to find substring matches and their positions.
Academic counselling in IGNOU S.Kishoreskishoredr1
This document outlines the roles and responsibilities of counselors in IGNOU study centers. It discusses how counseling differs from lecturing by involving tutoring, discussing, and advising. Key responsibilities of counselors include promoting learning, providing advice and tutoring, being patient and building interpersonal relationships as mentors. Counselors are also expected to provide information to students, help them with their studies, listen to concerns, and organize counseling sessions according to credit hours for different courses. The document provides detailed guidance on counseling activities and expectations for supporting students' learning.
This document provides instructions for an assignment on data and file structures for the MCS-021 course. It outlines four questions to answer for the assignment, which is worth 100 marks total and 25% of the course grade. Students must answer all four questions, with each question worth 20 marks. The assignment should be submitted by October 15th, 2013 for the July 2013 session or April 15th, 2014 for the January 2014 session. Question 1 asks students to write an algorithm for implementing doubly linked lists.
The Bachelor of Computer Applications (BCA) program offered by IGNOU aims to provide students who have completed 10+2 education an opportunity to pursue a career in computing and information technology. The three-year BCA program consists of 39 courses across six semesters covering topics like programming, databases, software engineering, and networks. Upon completing the BCA, students can pursue further education like an MCA or master's degree, or seek entry-level jobs in IT and ITES fields. Assignments make up 30% of the final exam grade for each course, so their completion is compulsory to pass.
This document is a synopsis report for a Bachelor of Computer Application degree submitted by Sunita Joshi to IGNOU University in Delhi. The synopsis proposes developing a banking transaction system to automate a bank's transaction processing and provide information to bank employees and customers. It includes sections on system analysis, design, implementation details using Java programming and JDBC for database connectivity, and testing methodology.
This document discusses IoT data processing topologies and considerations. It begins by explaining the types of structured and unstructured data in IoT. It then discusses the importance of processing based on urgency and describes on-site, remote, and collaborative processing topologies. The document also covers IoT device design factors and processing offloading considerations including location, decision making, and other criteria.
This document discusses IoT sensing and actuation. It defines transduction as the process of energy conversion from one form to another. Sensors convert various forms of energy into electrical signals, while actuators convert electrical signals into various forms of energy, typically mechanical energy. The document describes different types of sensors and their characteristics like resolution, accuracy, and precision. It also discusses sensor errors and deviations. Finally, it categorizes sensing into four types - scalar sensing, multimedia sensing, hybrid sensing, and virtual sensing - based on the nature of the environment being sensed.
The document discusses the emergence of the Internet of Things (IoT). It describes how IoT has evolved from early technologies like automated teller machines and smart meters to modern applications across various domains. It also outlines the key characteristics of IoT and the complex interdependencies between IoT and related technologies like machine-to-machine communication, cyber physical systems, and the web of things. Finally, it explains the four planes that enable IoT - services, local connectivity, global connectivity, and processing - and how technologies like edge/fog computing facilitate IoT implementation.
This C program defines functions to add numbers to a queue and display the numbers in reverse order. The add() function takes user input of up to 5 numbers and stores them in an array. The display() function prints the numbers from the end of the array to the beginning to reverse the order, with front and rear pointers used to track the start and end of the queue. The main() function calls add() to populate the queue, then calls display() to print the numbers in reversed order.
The program implements a deque (double-ended queue) using pointers in C language. It defines a node structure with data and link fields. Functions are written to add elements to both front and rear of the deque, delete from front and rear, and display the deque. The main function tests the implementation by performing sample operations on the deque and displaying the results.
The C program takes a string as input from the user, stores each character in a stack data structure, and then pops the characters off the stack to display the reversed string. It uses functions to push each character onto the stack, and then calls a display function that pops the characters off the stack and prints them, outputting the reversed input string.
This C program accepts a singly linked list of integers as input, sorts the elements in ascending order, then accepts an integer to insert into the sorted list at the appropriate position. It includes functions to create and display the linked list, sort the elements, and insert a new element while maintaining the sorted order.
This C program creates a linked list of student records with name and roll number. It includes functions to create the list by adding elements, display the list, and delete an element from the list by roll number. Pointers are used to link the elements of the list and dynamically allocate memory for new elements. The main function provides a menu to call these functions and manage the list.
The document describes a C program that takes a paragraph of text as input and outputs a list of words and the number of occurrences of each word. The program creates a structure with fields to store each word and its occurrence count. It accepts input character by character, separates words by spaces, counts occurrences by comparing to existing words, and outputs the final word-count list.
This program multiplies two sparse matrices in C. It takes in two matrices from the user and converts them to sparse form by removing all zero values and storing the row, column, and value of non-zero elements. It then performs the multiplication by iterating through each non-zero element in the first matrix and matching columns with row elements in the second matrix, summing the products of the values at matched indices into the result matrix. Finally, it prints out the sparse and result matrices.
This C program accepts student enrollment numbers, names, and aggregate marks. It ranks the students based on their marks, with the highest marks earning rank 1. The program then prints the enrollment number, name, mark, and rank of each student in ascending order of rank.
This document provides an introduction to information security. It outlines the objectives of understanding information security concepts and terms. The document discusses the history of information security beginning with early mainframe computers. It defines information security and explains the critical characteristics of information, including availability, accuracy, authenticity, confidentiality and integrity. The document also outlines approaches to implementing information security and the phases of the security systems development life cycle.
Mcs 012 computer organisation and assemly language programming- ignou assignm...Dr. Loganathan R
The document discusses various computer architecture concepts including:
1. A hypothetical new machine is described with 64 64-bit general purpose registers, 2GB of 32-bit memory, and instructions that are one or two memory words. Four addressing modes are needed: direct, index, base register, and stack to access variables and arrays.
2. Terms related to magnetic disk access are defined, including tracks, sectors, seek time, rotational latency, transfer time, and access time. Calculations are shown to find the average access time of 13.04ms for a 2048 byte sector disk rotating at 3000 RPM with a 64MB/s transfer rate.
3. Input/output techniques like programmed I/O,
Session 9 4 alp to display the current system time using dos int 21 hDr. Loganathan R
This program displays the current system time by using DOS interrupt 21H function 2CH to retrieve the time from the system. It breaks the time value into hours, minutes, seconds and stores each part separately before converting them to ASCII characters and displaying them along with a colon separator between each part to show the time as HH:MM:SS. The program ends by returning control back to DOS.
Session 9 1 alp to compute a grade using proceduresDr. Loganathan R
This program contains two procedures to calculate a student's grade. The first procedure calculates the total marks based on percentages from midterm, final project, quizzes and projects. The second procedure calculates the letter grade based on ranges of the total marks from A+ to F. User input for the marks is taken and overall grade is displayed.
The document appears to be a manual for Assembly Language Programming sessions 3 and 4. It provides 5 examples of Assembly Language programs with explanations. The programs cover topics like adding two numbers, reading and echoing a character, reading 10 characters from the console, exchanging memory variables using XCHG, and finding the sum of two BCD numbers stored in memory.
The document discusses requirements engineering processes. It describes the main activities as feasibility studies to determine if a project is worthwhile, elicitation and analysis to discover requirements, specification to formalize requirements, and validation to check requirements. It discusses techniques for eliciting requirements including interviews, scenarios, use cases and viewpoints to represent different stakeholder perspectives. The goal is to create and maintain requirements documents through these iterative processes.
MCS 012 computer organisation and assembly language programming assignment…Dr. Loganathan R
The document discusses binary arithmetic operations using 2's complement notation, conversion between number systems, UTF-8 encoding, designing logic circuits to count binary inputs, floating point number representation, RAM addressing, and input/output techniques. Examples of interrupt-driven and polling I/O are provided to explain how data can be read from keyboards and files.
يمكن هذا المقطع المتعلّم من اكتساب قاعدة معرفية أساسية لفهم طبيعة المخاطر التي قد تواجه المؤسسات، ويشكل منطلقًا ضروريًا لبناء المهارات اللازمة لتسييرها لاحقًا.