Computer Science Of Engineering

Search This Blog

JNTUK R23 CSE SYLLABUS 2-1 & 2-2

on April 24, 2025

Get link
Facebook
X
Pinterest
Email
Other Apps

JNTUK R23 CSE SYLLABUS 2-1 & 2-2

Download

Syllabus

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Write a JAVA program using String Buffer to delete, remove character.

import java.util.Scanner; public class StringBufferExample { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); // Taking string input System.out.print("Enter a string: "); String input = scanner.nextLine(); // Creating StringBuffer object StringBuffer sb = new StringBuffer(input); // Deleting a part of the string using delete(start, end) System.out.print("Enter start index to delete: "); int start = scanner.nextInt(); System.out.print("Enter end index to delete (exclusive): "); int end = scanner.nextInt(); if (start >= 0 && end <= sb.length() && start < end) { ...

Use a stack to evaluate an infix expression and convert it to postfix in C

#include <stdio.h> #include <stdlib.h> #include <string.h> #include <ctype.h> #define MAX_SIZE 100 // Maximum stack size // Structure for the stack struct Stack { char items[MAX_SIZE]; // For infix-to-postfix (operators) int top; }; // Function to initialize the stack void initStack(struct Stack* stack) { stack->top = -1; } // Function to check if the stack is empty int isEmpty(struct Stack* stack) { return stack->top == -1; } // Function to check if the stack is full int isFull(struct Stack* stack) { return stack->top == MAX_SIZE - 1; } // Function to push an item onto the stack void push(struct Stack* stack, char item) { if (isFull(stack)) { printf("Stack overflow!\n"); exit(1); } stack->items[++stack->top] = item; } // Function to pop an item from the stack char pop(struct Stack* ...

C Program to Implement a Simple Cache Using Hashing

#include <stdio.h> #include <stdlib.h> #include <string.h> // Structure for a node in the doubly linked list (LRU order) struct CacheNode { int key; int value; struct CacheNode* prev; struct CacheNode* next; }; // Structure for a hash table entry (linked list for collision handling) struct HashNode { int key; int value; struct CacheNode* cachePtr; // Pointer to the corresponding LRU node struct HashNode* next; }; // Structure for the cache struct Cache { int capacity; // Maximum number of items int size; // Current number of items struct HashNode** hashTable; // Array of linked lists for hashing struct CacheNode* lruHead; // Most recently used struct CacheNode* lruTail; // Least recently used }; // Function to create a cache node struct CacheNode* create...

Powered by Blogger

JNTUK R23 CSE SYLLABUS 2-1 & 2-2

Comments

Post a Comment