01 odd even
•
0 likes•333 views
The document describes an assignment to write a program that reads an integer, checks if it is odd or even, and prints the number along with its sign. It provides examples of sample inputs and outputs, such as printing "4 is positive even number" for an input of 4. It also lists prerequisites of arithmetic operators and nested if-else statements and the objective of understanding nested if-else concepts.
Report
Share
Report
Share
Download to read offline
Recommended
08_pyramid_pattern.pdf
The document provides instructions for writing a program to print a pyramid pattern based on a user-provided integer input. It explains that the program should take a number as input, then output a pyramid shape with that number of columns by printing numbers row by row, with each row containing the relevant numbers spaced appropriately. It provides examples for input numbers 4 and 5 to illustrate the expected output format. It also lists prerequisites of loops and notes the objective is to understand nested looping.
Write a program that accepts percentage from the user and displays its grade ...
This document provides instructions for writing a program that accepts a percentage from the user and displays the corresponding grade using if conditions. It explains that the program should include header files, define the main function as the entry point, use a function to input the percentage into a variable, and then use if statements to output the grade based on the following ranges: 80 and above is A+, 70-79 is A, 60-69 is B, 50-59 is C, and below 50 is Fail. It also provides brief descriptions of key concepts like floating-point constants, functions and variables, input/output statements, and the if statement syntax.
Devry cis-170-c-i lab-4-of-7-functions
devry cis 170 c ilab 4 of 7 functions,devry cis 170week 4,devry cis 170week 4,devry cis 170,devry cis 170week 4 tutorial,devry cis 170week 4 assignment,devry cis 170week 4 help
04_perfect_number.pdf
This document discusses ways to check if a number is a perfect number in Python. It defines a perfect number as one where the sum of its positive divisors (excluding the number itself) equals the number. Two methods are presented: 1) excluding the number as a factor, and 2) including it. Examples are provided testing numbers 6, 21, and 28. The document also provides sample code execution and lists prerequisites of loops and arithmetic operators. The objective is to understand if-else constructs.
07_triangle_pattern.pdf
The document describes a programming assignment to print a triangle pattern based on a user-input integer. It provides examples of input/output for different numbers, explaining that the pattern consists of consecutive integers printed in triangular rows with the appropriate number of spaces between values in each row. The number of spaces decreases by one for each subsequent row. Pre-requisites and the objective of understanding nested looping are also stated.
17_positive_fibonacci.pdf
This document provides an assignment to write a program to generate positive Fibonacci numbers using recursion. The program takes a number as input and outputs the Fibonacci sequence up to that number. It includes examples of running the program with different input values and the expected output. It also lists pre-requisites of arithmetic operators and recursion, and the objective of understanding recursive functions.
06_x_pattern.pdf
The document provides examples and instructions for writing a program to print numbers in an X pattern based on a given input number. It explains that the program should read an integer as input, then output an X pattern with that number of rows. It includes two examples - one with an input of 4 and output of 4 rows in an X pattern, and another example with an input of 5 and output of 5 rows in an X pattern. It also lists loops as a prerequisite for the task and the objective to understand nested looping.
05_print_bits.pdf
The document discusses a C program to print the last n bits of a given integer number. It provides the input, which is an integer num and number of bits n, and the output, which prints the last n bits of num in binary format. It includes some example inputs and outputs, such as for num=10, n=12, the output is 0000001000. It also lists prerequisites of bitwise operators and functions. The objective is to understand bitwise operations.
Recommended
08_pyramid_pattern.pdf
The document provides instructions for writing a program to print a pyramid pattern based on a user-provided integer input. It explains that the program should take a number as input, then output a pyramid shape with that number of columns by printing numbers row by row, with each row containing the relevant numbers spaced appropriately. It provides examples for input numbers 4 and 5 to illustrate the expected output format. It also lists prerequisites of loops and notes the objective is to understand nested looping.
Write a program that accepts percentage from the user and displays its grade ...
This document provides instructions for writing a program that accepts a percentage from the user and displays the corresponding grade using if conditions. It explains that the program should include header files, define the main function as the entry point, use a function to input the percentage into a variable, and then use if statements to output the grade based on the following ranges: 80 and above is A+, 70-79 is A, 60-69 is B, 50-59 is C, and below 50 is Fail. It also provides brief descriptions of key concepts like floating-point constants, functions and variables, input/output statements, and the if statement syntax.
Devry cis-170-c-i lab-4-of-7-functions
devry cis 170 c ilab 4 of 7 functions,devry cis 170week 4,devry cis 170week 4,devry cis 170,devry cis 170week 4 tutorial,devry cis 170week 4 assignment,devry cis 170week 4 help
04_perfect_number.pdf
This document discusses ways to check if a number is a perfect number in Python. It defines a perfect number as one where the sum of its positive divisors (excluding the number itself) equals the number. Two methods are presented: 1) excluding the number as a factor, and 2) including it. Examples are provided testing numbers 6, 21, and 28. The document also provides sample code execution and lists prerequisites of loops and arithmetic operators. The objective is to understand if-else constructs.
07_triangle_pattern.pdf
The document describes a programming assignment to print a triangle pattern based on a user-input integer. It provides examples of input/output for different numbers, explaining that the pattern consists of consecutive integers printed in triangular rows with the appropriate number of spaces between values in each row. The number of spaces decreases by one for each subsequent row. Pre-requisites and the objective of understanding nested looping are also stated.
17_positive_fibonacci.pdf
This document provides an assignment to write a program to generate positive Fibonacci numbers using recursion. The program takes a number as input and outputs the Fibonacci sequence up to that number. It includes examples of running the program with different input values and the expected output. It also lists pre-requisites of arithmetic operators and recursion, and the objective of understanding recursive functions.
06_x_pattern.pdf
The document provides examples and instructions for writing a program to print numbers in an X pattern based on a given input number. It explains that the program should read an integer as input, then output an X pattern with that number of rows. It includes two examples - one with an input of 4 and output of 4 rows in an X pattern, and another example with an input of 5 and output of 5 rows in an X pattern. It also lists loops as a prerequisite for the task and the objective to understand nested looping.
05_print_bits.pdf
The document discusses a C program to print the last n bits of a given integer number. It provides the input, which is an integer num and number of bits n, and the output, which prints the last n bits of num in binary format. It includes some example inputs and outputs, such as for num=10, n=12, the output is 0000001000. It also lists prerequisites of bitwise operators and functions. The objective is to understand bitwise operations.
01_get_n_bits.pdf
This document provides an assignment to write a program to get 'n' bits from a given number. It includes examples of inputting a number and number of bits, showing the binary representation and extracting the bits. It demonstrates getting 1, 2, 3, and 4 bits from sample numbers. Pre-requisites of bitwise operators and functions are listed. The objective is to understand bitwise operations.
16_factorial.pdf
The document discusses writing a program to calculate the factorial of a given number using recursion without additional functions. It explains that recursion involves a function calling itself and describes using the static keyword to retain the value of the variable between recursive calls. The document provides examples of calculating factorials for different input numbers and describes sample execution and prerequisites for recursion and storage classes.
10_parity.pdf
This document discusses a C program to count the number of set bits in a given number and determine its parity. It explains that the program takes an integer as input, calculates its binary representation, counts the number of 1 bits, and determines if that count is even or odd to print the parity as even or odd. Examples are provided with sample outputs. Pre-requisites of bitwise operators are listed. The objective is to understand the concept of bitwise operators.
04_toggle_n_bits_from_pos.pdf
This document provides examples and instructions for writing a program to toggle a given number of bits from a specified position in a number. It explains that the program should take in an integer, the number of bits to toggle, and the bit position. It then provides sample inputs and outputs, showing the before and after binary representations when toggling bits from different positions in numbers. It also lists bitwise operators and functions as prerequisites and the objective of understanding bitwise operations.
18_negative_fibonacci.pdf
This document provides an assignment to write a program using recursion to generate negative Fibonacci numbers. It gives the input and output requirements, which are to read an integer and print the Fibonacci numbers up to that value. It provides examples of sample runs with different inputs and expected outputs. It also gives some pre-requisites of arithmetic operators and recursions and the objective of understanding recursive functions.
04 Absolute Value of Integers.pptx
This document provides an overview of absolute value and integers. It defines integers as whole numbers including positive, negative, and zero. Absolute value is defined as the distance of a number from zero on the number line. Examples are provided to illustrate finding the absolute value of positive and negative integers. Key points are that the absolute value of a number is always positive, and that the placement of signs can affect whether expressions with absolute values are positive or negative.
Python if_else_loop_Control_Flow_Statement
The document provides information on various decision making and looping constructs in Python like if, else, elif, for, while loops. It explains the syntax and usage of these statements with examples. Key decision making constructs covered include if-else, if-elif-else statements. Looping constructs covered include for loops over sequences, range function to generate sequences, while loops, break and continue keywords in loops. Nested if statements and usage of else block with for and while loops are also discussed.
10_isxdigit.pdf
The document discusses implementing a function to check if a character is a hexadecimal digit. It explains that a hexadecimal digit ranges from 0-9, A-F, a-f in the ASCII table. It provides examples of inputting different characters and checking if they are hexadecimal digits or not. The sample execution section is empty. It lists functions as the prerequisite for understanding how to create a custom function to check for hexadecimal digits.
01_student_record.pdf
The document provides an example program to implement a student record system using an array of structures. It involves reading the number of students and subjects, student names and marks for each subject, calculating averages and grades. The program displays menus to view all student details or a particular student's details based on roll number or name. It demonstrates declaring a structure for student records, reading input into an array of structures, calculating averages and grades, and printing the student records with options to search by roll number or name.
02_swap.pdf
This document discusses writing a macro called swap(t,x,y) that swaps two arguments of any data type t. It asks the user to input a data type and two values of that type, then swaps the values and displays the output. It explains how to swap two integers by using a temporary variable and applying the same concept to arguments of any type t by using macros. The objective is to understand macro preprocessing in C.
01_sizeof.pdf
This document discusses defining a macro called SIZEOF to return the size of a data type without using the sizeof operator. It explains that by taking the difference of the addresses of a variable and the variable plus one, cast to char pointers, you can get the size in bytes. An example is provided using an integer variable x, showing how taking the difference of (&x+1) and &x after casting to char pointers returns the size of an int, which is 4 bytes. Background on macros and pointers is provided. The objective is stated as understanding macro usage in preprocessing.
07_product_matrix.pdf
The document describes a C program to multiply two matrices. It explains that the program takes input of rows and columns for Matrix A and B, reads in the element values, and checks that the column of the first matrix equals the row of the second before calculating the product. An example is provided where the matrices can be multiplied, producing the output matrix, and another where they cannot due to mismatched dimensions. Requirements for the program include pointers, 2D arrays, and dynamic memory allocation.
06_sort_names.pdf
The document describes an assignment to read in an unspecified number (n) of names of up to 20 characters each, sort the names alphabetically, and print the sorted list. It provides examples of reading in 3 names ("Arunachal", "Bengaluru", "Agra"), sorting them using a custom string comparison function, and printing the sorted list ("Agra", "Arunachal", "Bengaluru"). Pre-requisites for the assignment include functions, dynamic arrays, and pointers. The objective is to understand how to use functions, arrays and pointers to complete the task.
05_fragments.pdf
This document provides instructions for an assignment to implement fragments using an array of pointers. It asks the student to write a program that reads the number of rows and columns for each row, reads the elements for each row, calculates the average for each row, sorts the rows based on average, and prints the results. It includes examples that show reading input values, storing them in an array using pointers, calculating averages, sorting rows, and sample output. The prerequisites are listed as pointers, functions, and dynamic memory allocation, and the objective is stated as understanding dynamic memory allocation and arrays of pointers.
04_magic_square.pdf
The document describes an algorithm to generate a magic square of size n×n. It takes the integer n as input from the user and outputs the n×n magic square. A magic square is an arrangement of distinct numbers in a square grid where the sum of each row, column and diagonal is equal. The algorithm uses steps like starting from the middle of the grid and moving element by element in a pattern, wrapping around when reaching the boundaries.
03_endianess.pdf
This document discusses endianness and provides an example program to convert between little endian and big endian formats. It defines endianness as the order of bytes in memory, and describes little endian as having the least significant byte at the lowest memory address and big endian as the opposite. An example shows inputting a 2-byte number in little endian format and outputting it in big endian. Pre-requisites of pointers and the objective of understanding endianness representations are also stated.
02_variance.pdf
The document provides steps to calculate variance of an array using dynamic memory allocation in C. It explains what variance is, shows an example to calculate variance of a sample array by finding the mean, deviations from mean, squaring the deviations and calculating the average of squared deviations. The key steps are: 1) Read array size and elements, 2) Calculate mean, 3) Find deviations from mean, 4) Square the deviations and store in another array, 5) Calculate average of squared deviations to get variance.
01_memory_manager.pdf
This document provides examples for an assignment to create a menu-driven program that stores and manipulates different data types (char, int, float, double) in dynamically allocated memory. It allocates 8 consecutive bytes to store the variables and uses flags to track which data types are stored. The menu allows the user to add, display, and remove elements as well as exit the program. Examples demonstrate initializing the flags, adding/removing elements, updating the flags, and displaying only elements whose flags are set. The objective is to understand dynamic memory allocation using pointers.
09_nrps.pdf
The document discusses generating non-repetitive pattern strings (NRPS) of length n using k distinct characters. It explains that an NRPS has a pattern that is not repeated consecutively. It provides steps to check if a string is an NRPS, including comparing characters and resetting a count if characters do not match. It also describes how to create an NRPS by starting with an ordered pattern and then copying subsequent characters to generate new patterns without repetition until the string reaches the desired length n. Sample inputs and outputs are provided.
11_pangram.pdf
The document discusses how to check if a string is a pangram, which is a sentence containing all 26 letters of the English alphabet. It provides an example of implementing the algorithm to check for a pangram by initializing an array to track letter occurrences, iterating through the input string to mark letters in the array, and checking if all letters are marked to determine if it is a pangram.
More Related Content
Similar to 01 odd even
01_get_n_bits.pdf
This document provides an assignment to write a program to get 'n' bits from a given number. It includes examples of inputting a number and number of bits, showing the binary representation and extracting the bits. It demonstrates getting 1, 2, 3, and 4 bits from sample numbers. Pre-requisites of bitwise operators and functions are listed. The objective is to understand bitwise operations.
16_factorial.pdf
The document discusses writing a program to calculate the factorial of a given number using recursion without additional functions. It explains that recursion involves a function calling itself and describes using the static keyword to retain the value of the variable between recursive calls. The document provides examples of calculating factorials for different input numbers and describes sample execution and prerequisites for recursion and storage classes.
10_parity.pdf
This document discusses a C program to count the number of set bits in a given number and determine its parity. It explains that the program takes an integer as input, calculates its binary representation, counts the number of 1 bits, and determines if that count is even or odd to print the parity as even or odd. Examples are provided with sample outputs. Pre-requisites of bitwise operators are listed. The objective is to understand the concept of bitwise operators.
04_toggle_n_bits_from_pos.pdf
This document provides examples and instructions for writing a program to toggle a given number of bits from a specified position in a number. It explains that the program should take in an integer, the number of bits to toggle, and the bit position. It then provides sample inputs and outputs, showing the before and after binary representations when toggling bits from different positions in numbers. It also lists bitwise operators and functions as prerequisites and the objective of understanding bitwise operations.
18_negative_fibonacci.pdf
This document provides an assignment to write a program using recursion to generate negative Fibonacci numbers. It gives the input and output requirements, which are to read an integer and print the Fibonacci numbers up to that value. It provides examples of sample runs with different inputs and expected outputs. It also gives some pre-requisites of arithmetic operators and recursions and the objective of understanding recursive functions.
04 Absolute Value of Integers.pptx
This document provides an overview of absolute value and integers. It defines integers as whole numbers including positive, negative, and zero. Absolute value is defined as the distance of a number from zero on the number line. Examples are provided to illustrate finding the absolute value of positive and negative integers. Key points are that the absolute value of a number is always positive, and that the placement of signs can affect whether expressions with absolute values are positive or negative.
Python if_else_loop_Control_Flow_Statement
The document provides information on various decision making and looping constructs in Python like if, else, elif, for, while loops. It explains the syntax and usage of these statements with examples. Key decision making constructs covered include if-else, if-elif-else statements. Looping constructs covered include for loops over sequences, range function to generate sequences, while loops, break and continue keywords in loops. Nested if statements and usage of else block with for and while loops are also discussed.
Similar to 01 odd even (7)
More from Emertxe Information Technologies Pvt Ltd
10_isxdigit.pdf
The document discusses implementing a function to check if a character is a hexadecimal digit. It explains that a hexadecimal digit ranges from 0-9, A-F, a-f in the ASCII table. It provides examples of inputting different characters and checking if they are hexadecimal digits or not. The sample execution section is empty. It lists functions as the prerequisite for understanding how to create a custom function to check for hexadecimal digits.
01_student_record.pdf
The document provides an example program to implement a student record system using an array of structures. It involves reading the number of students and subjects, student names and marks for each subject, calculating averages and grades. The program displays menus to view all student details or a particular student's details based on roll number or name. It demonstrates declaring a structure for student records, reading input into an array of structures, calculating averages and grades, and printing the student records with options to search by roll number or name.
02_swap.pdf
This document discusses writing a macro called swap(t,x,y) that swaps two arguments of any data type t. It asks the user to input a data type and two values of that type, then swaps the values and displays the output. It explains how to swap two integers by using a temporary variable and applying the same concept to arguments of any type t by using macros. The objective is to understand macro preprocessing in C.
01_sizeof.pdf
This document discusses defining a macro called SIZEOF to return the size of a data type without using the sizeof operator. It explains that by taking the difference of the addresses of a variable and the variable plus one, cast to char pointers, you can get the size in bytes. An example is provided using an integer variable x, showing how taking the difference of (&x+1) and &x after casting to char pointers returns the size of an int, which is 4 bytes. Background on macros and pointers is provided. The objective is stated as understanding macro usage in preprocessing.
07_product_matrix.pdf
The document describes a C program to multiply two matrices. It explains that the program takes input of rows and columns for Matrix A and B, reads in the element values, and checks that the column of the first matrix equals the row of the second before calculating the product. An example is provided where the matrices can be multiplied, producing the output matrix, and another where they cannot due to mismatched dimensions. Requirements for the program include pointers, 2D arrays, and dynamic memory allocation.
06_sort_names.pdf
The document describes an assignment to read in an unspecified number (n) of names of up to 20 characters each, sort the names alphabetically, and print the sorted list. It provides examples of reading in 3 names ("Arunachal", "Bengaluru", "Agra"), sorting them using a custom string comparison function, and printing the sorted list ("Agra", "Arunachal", "Bengaluru"). Pre-requisites for the assignment include functions, dynamic arrays, and pointers. The objective is to understand how to use functions, arrays and pointers to complete the task.
05_fragments.pdf
This document provides instructions for an assignment to implement fragments using an array of pointers. It asks the student to write a program that reads the number of rows and columns for each row, reads the elements for each row, calculates the average for each row, sorts the rows based on average, and prints the results. It includes examples that show reading input values, storing them in an array using pointers, calculating averages, sorting rows, and sample output. The prerequisites are listed as pointers, functions, and dynamic memory allocation, and the objective is stated as understanding dynamic memory allocation and arrays of pointers.
04_magic_square.pdf
The document describes an algorithm to generate a magic square of size n×n. It takes the integer n as input from the user and outputs the n×n magic square. A magic square is an arrangement of distinct numbers in a square grid where the sum of each row, column and diagonal is equal. The algorithm uses steps like starting from the middle of the grid and moving element by element in a pattern, wrapping around when reaching the boundaries.
03_endianess.pdf
This document discusses endianness and provides an example program to convert between little endian and big endian formats. It defines endianness as the order of bytes in memory, and describes little endian as having the least significant byte at the lowest memory address and big endian as the opposite. An example shows inputting a 2-byte number in little endian format and outputting it in big endian. Pre-requisites of pointers and the objective of understanding endianness representations are also stated.
02_variance.pdf
The document provides steps to calculate variance of an array using dynamic memory allocation in C. It explains what variance is, shows an example to calculate variance of a sample array by finding the mean, deviations from mean, squaring the deviations and calculating the average of squared deviations. The key steps are: 1) Read array size and elements, 2) Calculate mean, 3) Find deviations from mean, 4) Square the deviations and store in another array, 5) Calculate average of squared deviations to get variance.
01_memory_manager.pdf
This document provides examples for an assignment to create a menu-driven program that stores and manipulates different data types (char, int, float, double) in dynamically allocated memory. It allocates 8 consecutive bytes to store the variables and uses flags to track which data types are stored. The menu allows the user to add, display, and remove elements as well as exit the program. Examples demonstrate initializing the flags, adding/removing elements, updating the flags, and displaying only elements whose flags are set. The objective is to understand dynamic memory allocation using pointers.
09_nrps.pdf
The document discusses generating non-repetitive pattern strings (NRPS) of length n using k distinct characters. It explains that an NRPS has a pattern that is not repeated consecutively. It provides steps to check if a string is an NRPS, including comparing characters and resetting a count if characters do not match. It also describes how to create an NRPS by starting with an ordered pattern and then copying subsequent characters to generate new patterns without repetition until the string reaches the desired length n. Sample inputs and outputs are provided.
11_pangram.pdf
The document discusses how to check if a string is a pangram, which is a sentence containing all 26 letters of the English alphabet. It provides an example of implementing the algorithm to check for a pangram by initializing an array to track letter occurrences, iterating through the input string to mark letters in the array, and checking if all letters are marked to determine if it is a pangram.
10_combinations.pdf
The document explains how to print all possible combinations of a given string by swapping characters. It provides an example of generating all six combinations of the string "ABC" through a step-by-step process of swapping characters. It also lists the prerequisites as strings, arrays, and pointers and the objective as understanding string manipulations.
08_squeeze.pdf
The document describes an assignment to write a program that squeezes characters from one string (s1) that match characters in a second string (s2). It provides examples of input/output and step-by-step demonstrations of the program removing matching characters from s1. It also lists prerequisites of functions, arrays, and pointers and the objective of understanding these concepts as they relate to strings.
07_strtok.pdf
The document discusses implementing the strtok() string tokenization function. It explains that strtok() breaks a string into tokens based on delimiters. The document then provides pseudocode to implement a custom strtok() function by iterating through the string, overwriting delimiter characters with null terminators to create tokens, and returning a pointer to each token. Sample input/output is provided. The objective is stated as understanding string functions, with prerequisites of strings, storage classes, and pointers.
06_reverserec.pdf
The document provides details on an assignment to write a program that recursively reverses a given string without using static variables, global variables, or loops. It includes the input, output, and examples of reversing the strings "Extreme" and "hello world". It also provides sample execution and pre-requisites of strings and recursive functions, with the objective being to understand reversing a string recursively.
05_reverseiter.pdf
The document provides code and examples for reversing a string using an iterative method in C++. It explains taking in a string as input, declaring output and input strings of the same length, and swapping the first and last characters, second and second to last, and so on through multiple iterations until the string is reversed. Examples show reversing the strings "Extreme" to "emertxE" and "hello world" to "dlrow olleh" through this iterative swap process. Pre-requisites of strings and loops are noted, with the objective stated as understanding string reversal using an iterative approach.
More from Emertxe Information Technologies Pvt Ltd (20)
Recently uploaded
Generative AI Deep Dive: Advancing from Proof of Concept to Production
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
ここ3000字までしか入らないけどタイトルの方がたくさん文字入ると思います。
DevOps and Testing slides at DASA Connect
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Uni Systems Copilot event_05062024_C.Vlachos.pdf
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
A tale of scale & speed: How the US Navy is enabling software delivery from l...
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Full-RAG: A modern architecture for hyper-personalization
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
20240605 QFM017 Machine Intelligence Reading List May 2024
Everything I found interesting about machines behaving intelligently during May 2024
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Communications Mining Series - Zero to Hero - Session 1
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
How to Get CNIC Information System with Paksim Ga.pptx
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Removing Uninteresting Bytes in Software Fuzzing
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Securing your Kubernetes cluster_ a step-by-step guide to success !
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Artificial Intelligence for XMLDevelopment
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications.
UiPath Test Automation using UiPath Test Suite series, part 5
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Epistemic Interaction - tuning interfaces to provide information for AI support
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Video Streaming: Then, Now, and in the Future
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Essentials of Automations: The Art of Triggers and Actions in FME
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Recently uploaded (20)
Generative AI Deep Dive: Advancing from Proof of Concept to Production
Generative AI Deep Dive: Advancing from Proof of Concept to Production
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
20240605 QFM017 Machine Intelligence Reading List May 2024
20240605 QFM017 Machine Intelligence Reading List May 2024
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
Communications Mining Series - Zero to Hero - Session 1
Communications Mining Series - Zero to Hero - Session 1
How to Get CNIC Information System with Paksim Ga.pptx
How to Get CNIC Information System with Paksim Ga.pptx
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications
UiPath Test Automation using UiPath Test Suite series, part 5
UiPath Test Automation using UiPath Test Suite series, part 5
Epistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI support
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
01 odd even
- 2. Assignment 1
- 3. Assignment 1
- 4. Assignment 1 WAP to check if number is odd or even and mention it’s sign too
- 5. Assignment 1 WAP to check if number is odd or even and mention it’s sign too Input:
- 6. Assignment 1 WAP to check if number is odd or even and mention it’s sign too Input: Read integer ‘num’
- 7. Assignment 1 WAP to check if number is odd or even and mention it’s sign too Input: Read integer ‘num’ Output:
- 8. Assignment 1 WAP to check if number is odd or even and mention it’s sign too Input: Read integer ‘num’ Output: Print ‘num’ is odd or even along with it’s sign
- 11. Assignment 1 Example’s: Input: num = 4 Output: 4 is positive even number
- 12. Assignment 1 Example’s: Input: num = 4 Output: 4 is positive even number Input: num = 5
- 13. Assignment 1 Example’s: Input: num = 4 Output: 4 is positive even number Input: num = 5 Output: 5 is positive odd number
- 14. Assignment 1 Example’s: Input: num = 4 Output: 4 is positive even number Input: num = 5 Output: 5 is positive odd number Input: num = -6
- 15. Assignment 1 Example’s: Input: num = 4 Output: 4 is positive even number Input: num = 5 Output: 5 is positive odd number Input: num = -6 Output: -6 is negative even number
- 16. Assignment 1 Example’s: Input: num = 4 Output: 4 is positive even number Input: num = 5 Output: 5 is positive odd number Input: num = -6 Output: -6 is negative even number Input: num = 0
- 17. Assignment 1 Example’s: Input: num = 4 Output: 4 is positive even number Input: num = 5 Output: 5 is positive odd number Input: num = -6 Output: -6 is negative even number Input: num = 0 Output: 0 is neither odd nor even
- 25. Assignment 1 Pre-requisites:- Arithmetic operators Nested if-else construct
- 26. Assignment 1 Pre-requisites:- Arithmetic operators Nested if-else construct Objective:-
- 27. Assignment 1 Pre-requisites:- Arithmetic operators Nested if-else construct Objective:- To understand the concept of nested if-else