PYQ 4-1 2026

on
https://drive.google.com/file/d/1iaTQRk-6FU8CBd5b4J6ktgP2Hhlo6fzV/view?usp=sharing

Comments

Post a Comment

Popular Posts

Image

IS LAB MANUAL

https://drive.google.com/file/d/16qn3it5LY_IWdqkObx4ZSJkWzP5HjoO-/view?usp=sharing https://drive.google.com/file/d/1C9vJ8MCVwuLx0HUC800rYgjSbztw66dz/view?usp=sharing Master Your Practical Exams with the Information Security Lab Manual! If you are a student preparing for your engineering practical exams, finding a reliable, structured study guide can be a challenge. The Information Security Lab Manual (2024-2025) from the Department of Computer Science and Information Technology at Sri Indu College of Engineering & Technology serves as a comprehensive roadmap designed to help you understand data protection, cryptography, and network defense through hands-on practice. Here is a breakdown of what this document contains, why it is an essential study tool, and how you can use it to ace your upcoming lab exams.----- What is the PDF About? This document is an official academic lab manual specifically tailored for fourth-year engineering students specializing in Comput...
Image

DS slip test 1 questions and answers

  Write about stack representation using arrays and linked lists. In computer science, a stack is a linear data structure that operates on a LIFO (Last-In-First-Out) principle. That means the last item added to the stack is the first item to be removed or retrieved. Elements are added and removed from one end of the stack known as the Top. stack can be implemented by using arrays, linked lists, structures or pointers. 2. write a program to implement queues using arrays. // C Program to implement queue using arrays #include <stdio.h> // Define the maximum size for the queue #define MAX_SIZE 100 // Define a structure for the queue struct Queue {     int queue[MAX_SIZE];     int front;     int rear; }; // Function to initialize the queue void initializeQueue(struct Queue *q) {     q->front = -1;     q->rear = -1; } // Function to check if the queue is empty int isEmpty(struct Queue *q) {     return (q->front ==...