Sindhura Repala

Sindhura Repala

28 Articles Published

Articles by Sindhura Repala

28 articles

How to add a list item in HTML?

Sindhura Repala
Sindhura Repala
Updated on 16-Mar-2026 2K+ Views

To add a list item in HTML, use the tag. It can be used inside ordered lists (), unordered lists (), and menu lists (). In an ordered list, the list items are displayed with numbers or letters. In an unordered list and menu list, the list items are displayed with bullet points. Syntax Following is the syntax for the list item tag in HTML − Content The tag must be placed inside a list container like , , or . Attributes The tag supports the following specific attributes ...

Read More

How to display a summary for a given in HTML5?

Sindhura Repala
Sindhura Repala
Updated on 16-Mar-2026 395 Views

The tag in HTML5 provides a visible heading for the element. When users click the summary heading, it toggles the visibility of the additional content inside the details element, creating an interactive collapsible section. The tag must be the first child element of the tag. If no summary is provided, the browser displays a default disclosure triangle or "Details" text. Syntax Following is the syntax for using the element − Heading text The tag supports all global attributes ...

Read More

Differentiate between int main and int main(void) function in C

Sindhura Repala
Sindhura Repala
Updated on 15-Mar-2026 16K+ Views

In C programming, there is a subtle but important difference between int main() and int main(void). Both declare the main function to return an integer, but they differ in how they handle function parameters. Syntax int main() { // Function body return 0; } int main(void) { // Function body return 0; } The int main() Function The int main() function with empty parentheses indicates that the function can accept any number of arguments. In C, when ...

Read More

What are string searching functions in C language?

Sindhura Repala
Sindhura Repala
Updated on 15-Mar-2026 2K+ Views

String searching functions in C are built-in library functions that help locate specific characters, substrings, or patterns within strings. These functions are part of the standard C library (string.h) and provide efficient ways to search and analyze string content. Syntax #include char *strchr(const char *str, int c); char *strrchr(const char *str, int c); char *strpbrk(const char *s1, const char *s2); size_t strspn(const char *s1, const char *s2); size_t strcspn(const char *s1, const char *s2); char *strtok(char *s1, const char *s2); char *strtok_r(char *s1, const char *s2, char **saveptr); String Searching Functions Overview ...

Read More

Find the largest number in a series by using pointers in C language

Sindhura Repala
Sindhura Repala
Updated on 15-Mar-2026 5K+ Views

A pointer is a variable that stores the address of another variable. Instead of holding a value directly, it holds the memory address where the value is stored. Pointers use the dereferencing operator (*) to access the value and the address operator (&) to obtain memory addresses. In this tutorial, we'll learn how to find the largest number in a series using pointers in C programming. Syntax datatype *pointer_name; pointer_name = &variable_name; Where the asterisk (*) declares a pointer and the ampersand (&) gets the address of a variable. Algorithm Here's the ...

Read More

Explain insertion of elements in linked list using C language

Sindhura Repala
Sindhura Repala
Updated on 15-Mar-2026 3K+ Views

A linked list is a linear data structure where elements (called nodes) are stored in sequence, with each node containing data and a pointer to the next node. Unlike arrays, linked list elements are stored in non-contiguous memory locations and connected through pointers. Syntax struct node { int data; struct node *next; }; void insert_front(struct node **head, int value); void insert_end(struct node **head, int value); void insert_after(struct node *head, int value, int after); void insert_before(struct node **head, int value, int before); Linked List Representation Each ...

Read More

C Program to find the given number is strong or not

Sindhura Repala
Sindhura Repala
Updated on 15-Mar-2026 44K+ Views

A strong number is a number where the sum of the factorial of its digits equals the number itself. For example, 145 is a strong number because 1! + 4! + 5! = 1 + 24 + 120 = 145. Syntax int factorial(int n); int isStrongNumber(int num); Understanding Strong Numbers Let's examine some examples to understand the concept better − 145 = 1! + 4! + 5! = 1 + 24 + 120 = 145 (Strong number) 123 = 1! + 2! + ...

Read More

Differentiate the NULL pointer with Void pointer in C language

Sindhura Repala
Sindhura Repala
Updated on 15-Mar-2026 13K+ Views

In C programming, NULL pointers and void pointers are two distinct concepts that serve different purposes. A NULL pointer represents a pointer that doesn't point to any valid memory location, while a void pointer is a generic pointer type that can point to any data type but requires type casting for dereferencing. Syntax /* NULL Pointer */ data_type *pointer_name = NULL; /* Void Pointer */ void *pointer_name; NULL Pointer A NULL pointer is a pointer that doesn't point to any valid memory location. It's used to indicate that the pointer is not currently ...

Read More

How to convert Python dictionary keys/values to lowercase?

Sindhura Repala
Sindhura Repala
Updated on 01-Sep-2025 6K+ Views

Python Dictionaries A dictionary in Python is a collection of key-value pairs. Each key is unique and maps to a specific value. For example- {"Title": "The Hobbit", "Author":"J.R.R. Tolkien", "Year": 1937} Dictionaries don't use numeric indexes and don't maintain a fixed order. We can't insert items in a specified position, as dictionaries store data based on keys, other than sequences. Where values can be strings, numbers, or float, and keys can be strings, numbers, or tuples. Lowercasing Python Dictionary Keys and Values To convert dictionary keys and values to lowercase in Python, we can loop through the dictionary and create ...

Read More

How expensive are Python dictionaries to handle?

Sindhura Repala
Sindhura Repala
Updated on 15-May-2025 301 Views

Python dictionaries are very difficult to handle data. They use a special system called hashing, which allows quick access to information. This specifies the cost of different operations: Time Complexities of Dictionary Operations Python dictionaries are usually fast because they use hashing to find and store data. The time complexity of dictionary operations in Python depends on the size of the dictionary and the operations performed. Here are some of the common dictionary operations - ...

Read More
Showing 1–10 of 28 articles
« Prev 1 2 3 Next »
Advertisements